| Publication | Date of Publication | Type |
|---|
| A competitive algorithm for throughput maximization on identical machines | 2024-08-20 | Paper |
| Scheduling with speed predictions | 2024-07-19 | Paper |
| A randomized algorithm for online metric b-matching | 2024-06-17 | Paper |
| Cluster before you hallucinate: node-capacitated network design and energy efficient routing | 2024-06-05 | Paper |
| Matching Drivers to Riders: A Two-Stage Robust Approach | 2023-11-20 | Paper |
| Incremental Edge Orientation in Forests | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5871911 | 2023-01-25 | Paper |
| Scheduling jobs that arrive over time | 2022-12-16 | Paper |
| Improved length bounds for the shortest superstring problem | 2022-12-16 | Paper |
| Task scheduling in networks | 2022-12-09 | Paper |
| Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity | 2022-11-30 | Paper |
| A competitive algorithm for throughput maximization on identical machines | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091162 | 2022-07-21 | Paper |
| Approximate Matchings in Massive Graphs via Local Structure (Invited Talk) | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090369 | 2022-07-18 | Paper |
| Distributed algorithms for matching in hypergraphs | 2022-03-22 | Paper |
| Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms | 2021-07-28 | Paper |
| Parallel approximate undirected shortest paths via low hop emulators | 2021-01-19 | Paper |
| A general framework for handling commitment in online throughput maximization | 2020-08-28 | Paper |
| Minimizing maximum flow time on related machines via dynamic posted pricing | 2020-05-27 | Paper |
| The online set aggregation problem | 2020-02-12 | Paper |
| A general framework for handling commitment in online throughput maximization | 2020-02-06 | Paper |
| Hallucination helps: energy efficient virtual circuit routing | 2020-01-21 | Paper |
| Scheduling when you do not know the number of machines | 2019-12-02 | Paper |
| Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs | 2019-10-15 | Paper |
| Using Markov chains to design algorithms for bounded-space on-line bin cover | 2019-09-11 | Paper |
| Solving Maximum Flow Problems on Real World Bipartite Graphs | 2019-09-11 | Paper |
| Fast algorithms for knapsack via convolution and prediction | 2019-08-22 | Paper |
| Maintaining assignments online: matching, scheduling, and flows | 2019-06-20 | Paper |
| Hallucination helps: energy efficient virtual circuit routing | 2019-06-20 | Paper |
| Finding real-valued single-source shortest paths in \(o(n^3)\) expected time | 2019-01-11 | Paper |
| Faster fully dynamic matchings with small approximation ratios | 2018-07-16 | Paper |
| Resource cost aware scheduling | 2018-05-22 | Paper |
| Advance Service Reservations with Heterogeneous Customers | 2018-05-15 | Paper |
| Simultaneously load balancing for every \(p\)-norm, with reassignments | 2018-05-03 | Paper |
| Scheduling when you don't know the number of machines | 2018-03-15 | Paper |
| A fast distributed stateless algorithm for \(\alpha\)-fair packing problems | 2017-12-19 | Paper |
| A 2-competitive algorithm for online convex optimization with switching costs | 2017-08-31 | Paper |
| Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis | 2017-07-07 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2016-09-29 | Paper |
| Fast First-Order Algorithms for Packing–Covering Semidefinite Programs | 2015-12-03 | Paper |
| Fully dynamic matching in bipartite graphs | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501810 | 2015-08-14 | Paper |
| Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing | 2015-06-26 | Paper |
| An Õ(n2) algorithm for minimum cuts | 2015-05-07 | Paper |
| Grouped distributed queues, distributed queue, proportional share multiprocessor scheduling | 2015-03-10 | Paper |
| Speed scaling for weighted flow time | 2014-12-18 | Paper |
| Better online buffer management | 2014-12-18 | Paper |
| Online scheduling of packets with agreeable deadlines | 2014-12-05 | Paper |
| On distributing symmetric streaming computations | 2014-11-18 | Paper |
| An optimal online algorithm for packet scheduling with agreeable deadlines | 2014-10-13 | Paper |
| LP decoding achieves capacity | 2014-10-13 | Paper |
| Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints | 2014-05-15 | Paper |
| Solving maximum flow problems on real-world bipartite graphs | 2014-04-01 | Paper |
| Introduction to algorithms. | 2013-12-12 | Paper |
| Multicast routing for energy minimization using speed scaling | 2013-04-19 | Paper |
| The Complexity of Scheduling for p-Norms of Flow and Stretch | 2013-03-19 | Paper |
| Approximating semidefinite packing programs | 2011-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3066732 | 2011-01-12 | Paper |
| How to schedule when you have to buy your energy | 2010-09-10 | Paper |
| Speed scaling for weighted flow time | 2010-09-06 | Paper |
| Online stochastic packing applied to display ad allocation | 2010-09-06 | Paper |
| Divide-and-conquer approximation algorithm for vertex cover | 2010-08-27 | Paper |
| Feasible and accurate algorithms for covering semidefinite programs | 2010-06-22 | Paper |
| Introduction to algorithms. | 2009-12-11 | Paper |
| Bounded-space online bin cover | 2009-12-02 | Paper |
| An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions | 2009-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619797 | 2009-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619846 | 2009-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619798 | 2009-04-09 | Paper |
| LP Decoding Corrects a Constant Fraction of Errors | 2008-12-21 | Paper |
| Vertex Cover Approximations on Random Graphs | 2008-01-02 | Paper |
| Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring | 2007-08-30 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829007 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818873 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046476 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736013 | 2004-08-09 | Paper |
| Approximating disjoint-path problems using packing integer programs | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801192 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537759 | 2002-06-20 | Paper |
| Approximation algorithms for single-source unsplittable flow | 2002-04-23 | Paper |
| Optimal time-critical scheduling via resource augmentation | 2002-03-07 | Paper |
| Introduction to algorithms | 2001-10-14 | Paper |
| Approximation techniques for average completion time scheduling | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526977 | 2001-02-28 | Paper |
| A \(2_3^2\) superstring approximation algorithm | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263722 | 1999-09-22 | Paper |
| Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time | 1999-08-23 | Paper |
| Minimizing average completion time in the presence of release dates | 1999-06-03 | Paper |
| Improved bounds on relaxations of a parallel machine scheduling problem | 1999-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840354 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252370 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840370 | 1998-08-10 | Paper |
| Task Scheduling in Networks | 1998-02-09 | Paper |
| A new approach to the minimum cut problem | 1998-01-22 | Paper |
| On the existence of schedules that are near-optimal for both makespan and total weighted completion time | 1998-01-12 | Paper |
| Improved Algorithms for Bipartite Network Flow | 1996-07-04 | Paper |
| Fast approximation algorithms for multicommodity flow problems | 1995-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283452 | 1994-09-26 | Paper |
| Improved Approximation Algorithms for Shop Scheduling Problems | 1994-08-14 | Paper |
| Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts | 1994-08-14 | Paper |
| Parallel algorithms for the assignment and minimum-cost flow problems | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138949 | 1993-10-20 | Paper |
| A parallel algorithm for approximating the minimum cycle cover | 1993-04-01 | Paper |
| Approximating the minimum-cost maximum flow is P-complete | 1993-01-16 | Paper |
| A parallel algorithm for eliminating cycles in undirected graphs | 1990-01-01 | Paper |
