| Publication | Date of Publication | Type |
|---|
| Online load balancing of temporary tasks | 2023-01-18 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2016-09-29 | Paper |
| An improved lower bound for load balancing of tasks with unknown duration | 2016-05-26 | Paper |
| Approximate majorization and fair online load balancing | 2015-09-02 | Paper |
| On-line load balancing with applications to machine scheduling and virtual circuit routing | 2015-05-07 | Paper |
| Excluded minors, network decomposition, and multicommodity flow | 2015-05-07 | Paper |
| Improved bounds on the max-flow min-cut ratio for multicommodity flows | 2015-05-07 | Paper |
| Combining fairness with throughput | 2014-09-26 | Paper |
| Cost-Distance: Two Metric Network Design | 2009-08-20 | Paper |
| An online throughput-competitive algorithm for multicast routing and admission control | 2005-05-04 | Paper |
| A \(k\)-median algorithm with running time independent of data size | 2005-01-19 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768323 | 2002-07-22 | Paper |
| Combining fairness with throughput: Online routing with multiple objectives | 2002-05-14 | Paper |
| Competitive routing of virtual circuits with unknown duration | 2002-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768320 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768355 | 2002-03-24 | Paper |
| A sublinear parallel algorithm for stable matching | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250170 | 2000-02-17 | Paper |
| Time-Lapse Snapshots | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234047 | 1999-10-18 | Paper |
| Routing and Admission Control in General Topology Networks with Poisson Arrivals | 1998-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840370 | 1998-08-10 | Paper |
| On-line routing of virtual circuits with applications to load balancing and machine scheduling | 1998-02-17 | Paper |
| Local management of a global resource in a communication network | 1998-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128907 | 1997-08-03 | Paper |
| Approximation Algorithms for Steiner and Directed Multicuts | 1997-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128880 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128891 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128926 | 1997-04-23 | Paper |
| On-Line Load Balancing of Temporary Tasks | 1997-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875194 | 1996-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886083 | 1996-07-28 | Paper |
| Improved bounds on the max-flow min-cut ratio for multicommodity flows | 1996-03-11 | Paper |
| Fast Approximation Algorithms for Fractional Packing and Covering Problems | 1995-09-17 | Paper |
| Fast approximation algorithms for multicommodity flow problems | 1995-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138913 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138915 | 1994-09-19 | Paper |
| Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts | 1994-08-14 | Paper |
| Polynomial dual network simplex algorithms | 1993-12-06 | Paper |
| Approximating matchings in parallel | 1993-09-16 | Paper |
| Sublinear-Time Parallel Algorithms for Matching and Related Problems | 1993-05-16 | Paper |
| Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems | 1992-06-28 | Paper |
| Using separation algorithms in fixed dimension | 1992-06-28 | Paper |
| Combinatorial Algorithms for the Generalized Circulation Problem | 1991-01-01 | Paper |
| Parallel Symmetry-Breaking in Sparse Graphs | 1988-01-01 | Paper |
| Parallel \((\Delta +1)\)-coloring of constant-degree graphs | 1987-01-01 | Paper |
