Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An algorithm for integrated pin assignment and buffer planning
Proceedings of the 39th annual Design Automation Conference
An algorithm for simultaneous pin assignment and routing
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Wire type assignment for FPGA routing
FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs
Computational Optimization and Applications
A Min-Cost Flow Based Detailed Router for FPGAs
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
An algorithm for integrated pin assignment and buffer planning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
A double scaling algorithm for the constrained maximum flow problem
Computers and Operations Research
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
Executability of scenarios in Petri nets
Theoretical Computer Science
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Minimal-cost network flow problems with variable lower bounds on arc flows
Computers and Operations Research
Finding paths with minimum shared edges
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
Transition-optimal Token Distribution
Fundamenta Informaticae
Finding paths with minimum shared edges
Journal of Combinatorial Optimization
| Hi-index | 0.00 |