Convex separable optimization is not much harder than linear optimization
Journal of the ACM (JACM)
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Short vectors of planar lattices via continued fractions
Information Processing Letters
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
0/1 optimization and 0/1 primal separation are equivalent
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Bisubmodular Function Minimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A separation algorithm for b-matching degree-sequence polyhedra
Mathematics of Operations Research
Some new results on node-capacitated packing of A-paths
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
Approximation algorithms for group prize-collecting and location-routing problems
Discrete Applied Mathematics
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
New Hardness Results for Diophantine Approximation
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A weighted Kt, t-free t-factor algorithm for bipartite graphs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A polynomial algorithm for weighted abstract flow
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A simplex algorithm for a class of leontief flow problems
Mathematical and Computer Modelling: An International Journal
European Journal of Combinatorics
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On explaining integer vectors by few homogenous segments
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |