| Publication | Date of Publication | Type |
|---|
| Cost-distance: two metric network design | 2026-05-08 | Paper |
| Designing networks incrementally | 2026-05-08 | Paper |
| Approximating a finite metric by a small number of tree metrics | 2025-10-29 | Paper |
Online load balancing of temporary tasks
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Scheduling data transfers in a network and the set scheduling problem
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
An improved lower bound for load balancing of tasks with unknown duration
Information Processing Letters | 2016-05-26 | Paper |
Approximate majorization and fair online load balancing
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On-line load balancing with applications to machine scheduling and virtual circuit routing
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Excluded minors, network decomposition, and multicommodity flow
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Combining fairness with throughput: online routing with multiple objectives
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing | 2009-08-20 | Paper |
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms | 2005-05-04 | Paper |
A \(k\)-median algorithm with running time independent of data size
Machine Learning | 2005-01-19 | Paper |
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms | 2004-03-14 | Paper |
| Approximate majorization and fair online load balancing | 2002-07-22 | Paper |
Combining fairness with throughput: Online routing with multiple objectives
Journal of Computer and System Sciences | 2002-05-14 | Paper |
Competitive routing of virtual circuits with unknown duration
Journal of Computer and System Sciences | 2002-04-28 | Paper |
| Web caching using access statistics | 2002-03-24 | Paper |
| Distributed admission control, scheduling, and routing with stale information | 2002-03-24 | Paper |
A sublinear parallel algorithm for stable matching
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1303546 (Why is no real title available?) | 2000-02-17 | Paper |
Time-Lapse Snapshots
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1263177 (Why is no real title available?) | 1999-10-18 | Paper |
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Journal of Algorithms | 1998-10-21 | Paper |
| scientific article; zbMATH DE number 1187163 (Why is no real title available?) | 1998-08-10 | Paper |
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM | 1998-02-17 | Paper |
Local management of a global resource in a communication network
Journal of the ACM | 1998-01-19 | Paper |
| scientific article; zbMATH DE number 1003278 (Why is no real title available?) | 1997-08-03 | Paper |
Approximation Algorithms for Steiner and Directed Multicuts
Journal of Algorithms | 1997-07-06 | Paper |
| scientific article; zbMATH DE number 1003253 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 1003263 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 1003296 (Why is no real title available?) | 1997-04-23 | Paper |
On-Line Load Balancing of Temporary Tasks
Journal of Algorithms | 1997-03-18 | Paper |
| scientific article; zbMATH DE number 871923 (Why is no real title available?) | 1996-09-16 | Paper |
| scientific article; zbMATH DE number 910907 (Why is no real title available?) | 1996-07-28 | Paper |
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Combinatorica | 1996-03-11 | Paper |
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Mathematics of Operations Research | 1995-09-17 | Paper |
Fast approximation algorithms for multicommodity flow problems
Journal of Computer and System Sciences | 1995-07-05 | Paper |
| scientific article; zbMATH DE number 432783 (Why is no real title available?) | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 432784 (Why is no real title available?) | 1994-09-19 | Paper |
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
SIAM Journal on Computing | 1994-08-14 | Paper |
Polynomial dual network simplex algorithms
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
Approximating matchings in parallel
Information Processing Letters | 1993-09-16 | Paper |
Sublinear-Time Parallel Algorithms for Matching and Related Problems
Journal of Algorithms | 1993-05-16 | Paper |
Using separation algorithms in fixed dimension
Journal of Algorithms | 1992-06-28 | Paper |
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
SIAM Journal on Computing | 1992-06-28 | Paper |
Combinatorial Algorithms for the Generalized Circulation Problem
Mathematics of Operations Research | 1991-01-01 | Paper |
Parallel Symmetry-Breaking in Sparse Graphs
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Parallel \((\Delta +1)\)-coloring of constant-degree graphs
Information Processing Letters | 1987-01-01 | Paper |
