Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Combinatorial Optimization
2407 directly classified papers
Papers per year
2002: 1
2004: 1
2005: 2
2006: 9
2007: 6
2008: 5
2009: 16
2010: 20
2011: 19
2012: 19
2013: 53
2014: 48
2015: 67
2016: 61
2017: 137
2018: 174
2019: 220
2020: 270
2021: 264
2022: 259
2023: 295
2024: 230
2025: 149
2026: 82
Papers
Bayesian Optimization of Combinatorial Structures
ICML 2018
Improving Event Coreference Resolution by Modeling Correlations between Event Coreference Chains and Document Topic Structures
ACL 2018
Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars
ACL 2018
Improved large-scale graph learning through ridge spectral sparsification
ICML 2018
Hierarchical Clustering with Structural Constraints
ICML 2018
Efficient and Correct Test Scheduling for Ensembles of Network Policies
NSDI 2018
ResQ: Enabling SLOs in Network Function Virtualization
NSDI 2018
ASAP: Fast, Approximate Graph Pattern Mining at Scale
OSDI 2018
Constrained Interacting Submodular Groupings
ICML 2018
Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit
ICML 2018
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints
ICML 2018
Compiling Combinatorial Prediction Games
ICML 2018
The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference
ICML 2018
Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings
ICML 2018
WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models
ICML 2018
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy
ICML 2018
Parameterized Algorithms for the Matrix Completion Problem
ICML 2018
The Weighted Kendall and High-order Kernels for Permutations
ICML 2018
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
ICML 2018
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
ICML 2018
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
NAACL 2018
Incremental Computation of Infix Probabilities for Probabilistic Finite Automata
EMNLP 2018
(Probably) Concave Graph Matching
NIPS 2018
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
NIPS 2018
Online Learning of Combinatorial Objects via Extended Formulation
ALT 2018
<
1
…
76
77
78
…
97
>