A new polynomial-time algorithm for linear programming
Combinatorica
Note on Weintraub's minimum-cost circulation algorithm
SIAM Journal on Computing
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Combinatorial algorithms for the generalized circulation problem
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming: Series A and B
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Improved Algorithms for Linear Inequalities with Two Variables per Inequality
SIAM Journal on Computing
New algorithms for generalized network flows
Mathematical Programming: Series A and B
A faster combinatorial algorithm for the generalized circulation problem
Mathematics of Operations Research
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Mathematics of Operations Research
Faster Algorithms for the Generalized Network Flow Problem
Mathematics of Operations Research
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An oracle-polynomial time augmentation algorithm for integer programming
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster approximation algorithms for generalized flow
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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)
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
Mathematics of Operations Research
Efficient algorithms for certain satisfiability and linear programming problems
Efficient algorithms for certain satisfiability and linear programming problems
Generalized maximum flow algorithms
Generalized maximum flow algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
On policy iteration as a Newton's method and polynomial policy iteration algorithms
Eighteenth national conference on Artificial intelligence
Improving time bounds on maximum generalised flow computations by contracting the network
Theoretical Computer Science - Special issue on automata, languages and programming
A self-adjusting clock tree architecture to cope with temperature variations
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Minimal-cost network flow problems with variable lower bounds on arc flows
Computers and Operations Research
Loop refinement using octagons and satisfiability
SSV'10 Proceedings of the 5th international conference on Systems software verification
SACTA: a self-adjusting clock tree architecture for adapting to thermal-induced delay variation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |