A new polynomial-time algorithm for linear programming
Combinatorica
A strongly polynomial minimum cost circulation algorithm
Combinatorica
Linear programming in O(n × 3d2) time
Information Processing Letters
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Theory of linear and integer programming
Theory of linear and integer programming
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Polynomial algorithms for linear programming over the algebraic numbers
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM (JACM)
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ε-Approximation minimization of convex functions in fixed dimension
Operations Research Letters
| Hi-index | 0.00 |