A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Instant recognition of polynominal time solvability, half integrality and 2-approximations
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Discrete Applied Mathematics
Introduction to the Maximum Solution Problem
Complexity of Constraints
Approximating integer programs with positive right-hand sides
Information Processing Letters
Solving MINONES-2-SAT as fast as VERTEX COVER
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Optimization over integers with robustness in cost and few constraints
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
Operations Research Letters
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
Approximability of the vertex cover problem in power-law graphs
Theoretical Computer Science
| Hi-index | 0.00 |