A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
Convex separable optimization is not much harder than linear optimization
Journal of the ACM (JACM)
Improved algorithms for linear inequalities with two variables per inequality
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Polynomial algorithms for linear programming over the algebraic numbers
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs
IEEE Transactions on Computers
An accelerated interior point method whose running time depends only on A (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth 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
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the algorithmic inversion of the discrete Radon transform
Theoretical Computer Science
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Inverse optimization in high-speed networks
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
QoS for data relaying in hierarchical wireless sensor networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Packing directed cycles efficiently
Discrete Applied Mathematics
INFORMS Journal on Computing
Linear Programming Relaxations and Belief Propagation -- An Empirical Study
The Journal of Machine Learning Research
A rounding algorithm for approximating minimum Manhattan networks
Theoretical Computer Science
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal of Scheduling
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Integer version of the multipath flow network synthesis problem
Discrete Applied Mathematics
The maximum multiflow problems with bounded fractionality
Proceedings of the forty-second ACM symposium on Theory of computing
Optimal homologous cycles, total unimodularity, and linear programming
Proceedings of the forty-second ACM symposium on Theory of computing
Some new cooperative coverage facility location games
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines
Fundamenta Informaticae
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
2-Player nash and nonsymmetric bargaining games: algorithms and structural properties
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Rationality and Strongly Polynomial Solvability of Eisenberg-Gale Markets with Two Agents
SIAM Journal on Discrete Mathematics
A new algorithm for linear and integer feasibility in horn constraints
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
SIAM Journal on Computing
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On bilevel machine scheduling problems
OR Spectrum
A rounding algorithm for approximating minimum manhattan networks
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Discrete Applied Mathematics
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Bipartite graph structures for efficient balancing of heterogeneous loads
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Optimization with binet matrices
Operations Research Letters
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
Bilevel time minimizing transportation problem
Discrete Optimization
The one-machine just-in-time scheduling problem with preemption
Discrete Optimization
Operations Research Letters
Optimization with additional variables and constraints
Operations Research Letters
A dual version of tardos's algorithm for linear programming
Operations Research Letters
A fully polynomial time projective method
Operations Research Letters
Geometric complexity theory III: on deciding nonvanishing of a Littlewood---Richardson coefficient
Journal of Algebraic Combinatorics: An International Journal
Multiflows in symmetric digraphs
Discrete Applied Mathematics
On the linear ranking problem for integer linear-constraint loops
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.01 |