Minimum cost interprocedural register allocation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithms for large-scale flat placement
DAC '97 Proceedings of the 34th annual Design Automation Conference
Retiming for DSM with area-delay trade-offs and delay constraints
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On dual minimum cost flow algorithms (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Algorithms for detailed placement of standard cells
Proceedings of the conference on Design, automation and test in Europe
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs
Computational Optimization and Applications
Problems of synthesis of connected networks with respect to isomorphic subgraphs
Cybernetics and Systems Analysis
Faster and better global placement by a new transportation algorithm
Proceedings of the 42nd annual Design Automation Conference
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
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
New theoretical results on quadratic placement
Integration, the VLSI Journal
Finding total unimodularity in optimization problems solved by linear programs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Chain programming over difference constraints
Nordic Journal of Computing
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
Computers and Operations Research
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quincy: fair scheduling for distributed computing clusters
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
On coordination among multiple auctions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Proceedings of the forty-second ACM symposium on Theory of computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes
Journal of Mathematical Modelling and Algorithms
An improved approximation algorithm for resource allocation
ACM Transactions on Algorithms (TALG)
Matching point sets with respect to the earth mover’s distance
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation algorithms for computing the earth mover's distance under transformations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm
Operations Research Letters
From stars to comets: Improved local search for universal facility location
Operations Research Letters
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
A greedy algorithm for multicut and integral multiflow in rooted trees
Operations Research Letters
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
Multiindex transportation problems with 2-embedded structure
Automation and Remote Control
International Journal of Computer Vision
VLSI legalization with minimum perturbation by iterative augmentation
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Capacity-Constrained network-voronoi diagram: a summary of results
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |