| Publication | Date of Publication | Type |
|---|
| SSD wear leveling with optimal guarantees | 2024-05-29 | Paper |
| Lossless online rounding for online bipartite matching (despite its impossibility) | 2024-05-14 | Paper |
| General Knapsack Problems in a Dynamic Setting | 2023-11-20 | Paper |
| Invited talks | 2023-03-22 | Paper |
| Online \(k\)-taxi via double coverage and time-reverse primal-dual | 2023-03-14 | Paper |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | 2023-02-07 | Paper |
| Approximating minimum feedback sets and multi-cuts in directed graphs | 2022-08-30 | Paper |
| Tight Bounds for Online Weighted Tree Augmentation | 2022-07-21 | Paper |
| Structured Robust Submodular Maximization: Offline and Online Algorithms | 2022-06-28 | Paper |
| Tight bounds for online weighted tree augmentation | 2022-03-25 | Paper |
| An almost optimal approximation algorithm for monotone submodular multiple knapsack | 2022-01-31 | Paper |
| Online \(k\)-taxi via double coverage and time-reverse primal-dual | 2021-12-21 | Paper |
| Dynamic storage allocation with known durations | 2021-12-20 | Paper |
| Timing matters: online dynamics in broadcast games | 2020-06-18 | Paper |
| Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification | 2020-05-27 | Paper |
| k-Servers with a Smile: Online Algorithms via Projections | 2019-10-15 | Paper |
| Competitive Analysis via Regularization | 2019-06-20 | Paper |
| Non-Uniform Graph Partitioning | 2019-06-20 | Paper |
| Submodular Maximization with Cardinality Constraints | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633907 | 2019-05-06 | Paper |
| Algorithms for dynamic NFV workload | 2019-01-15 | Paper |
| On the approximability of some network design problems | 2018-11-05 | Paper |
| Throughput maximization of real-time scheduling with batching | 2018-11-05 | Paper |
| Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem | 2018-08-03 | Paper |
| A Polylogarithmic-Competitive Algorithm for the k -Server Problem | 2018-08-02 | Paper |
| O(depth)-Competitive Algorithm for Online Multi-level Aggregation | 2018-07-16 | Paper |
| Online Semidefinite Programming. | 2017-12-19 | Paper |
| A truthful mechanism for value-based scheduling in cloud computing | 2017-11-07 | Paper |
| A greedy approximation algorithm for minimum-gap scheduling | 2017-09-01 | Paper |
| Non-preemptive buffer management for latency sensitive packets | 2017-08-25 | Paper |
| Efficient recovery from power outage (extended abstract) | 2016-09-29 | Paper |
| Approximating the throughput of multiple machines under real-time scheduling | 2016-09-29 | Paper |
| Unified Algorithms for Online Learning and Competitive Analysis | 2016-05-19 | Paper |
| Equilibria in Online Games | 2016-03-23 | Paper |
| New hardness results for congestion minimization and machine scheduling | 2015-12-04 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2015-10-30 | Paper |
| A general approach to online network optimization problems | 2015-09-02 | Paper |
| Algorithmic aspects of bandwidth trading | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501246 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501312 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934592 | 2014-12-18 | Paper |
| A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching | 2014-12-02 | Paper |
| The directed circular arrangement problem | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921673 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921762 | 2014-10-13 | Paper |
| Competitive Algorithms for Restricted Caching and Matroid Caching | 2014-10-08 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2014-09-26 | Paper |
| Fair online load balancing | 2014-08-18 | Paper |
| Simplex partitioning via exponential clocks and the multiway cut problem | 2014-08-07 | Paper |
| Min-Max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| Online Node-Weighted Steiner Tree and Related Problems | 2014-07-30 | Paper |
| A Polylogarithmic-Competitive Algorithm for the k-Server Problem | 2014-07-30 | Paper |
| Min-max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| A Unified Continuous Greedy Algorithm for Submodular Maximization | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417604 | 2014-05-22 | Paper |
| A Primal-Dual Randomized Algorithm for Weighted Paging | 2014-02-17 | Paper |
| Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints | 2013-08-12 | Paper |
| A Greedy Approximation Algorithm for Minimum-Gap Scheduling | 2013-06-07 | Paper |
| Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks | 2012-11-01 | Paper |
| Randomized Competitive Algorithms for Generalized Caching | 2012-08-10 | Paper |
| The load-distance balancing problem | 2012-06-18 | Paper |
| A Truthful Mechanism for Value-Based Scheduling in Cloud Computing | 2011-10-28 | Paper |
| Improved Approximations for k-Exchange Systems | 2011-09-16 | Paper |
| Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) | 2011-08-17 | Paper |
| Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm | 2011-07-06 | Paper |
| Online Primal-Dual Algorithms for Covering and Packing | 2011-04-27 | Paper |
| Online time-constrained scheduling in linear and ring networks | 2011-01-20 | Paper |
| Metrical Task Systems and the k-Server Problem on HSTs | 2010-09-07 | Paper |
| Balanced metric labeling | 2010-08-16 | Paper |
| New hardness results for congestion minimization and machine scheduling | 2010-08-15 | Paper |
| Asymmetric k-center is log * n -hard to approximate | 2010-08-15 | Paper |
| Non-cooperative cost sharing games via subsidies | 2010-08-13 | Paper |
| Survivable Network Design with Degree or Order Constraints | 2010-07-07 | Paper |
| The Online Set Cover Problem | 2010-04-29 | Paper |
| The Design of Competitive Online Algorithms via a Primal—Dual Approach | 2009-06-30 | Paper |
| Survivable network design with degree or order constraints | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549676 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549707 | 2009-01-05 | Paper |
| Asymmetric k -center is log * n -hard to approximate | 2008-12-21 | Paper |
| An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching | 2008-09-25 | Paper |
| Cut Problems in Graphs with a Budget Constraint | 2008-09-18 | Paper |
| Non-cooperative Cost Sharing Games Via Subsidies | 2008-05-02 | Paper |
| Coping with Interference: From Maximum Coverage to Planning Cellular Networks | 2008-02-21 | Paper |
| Traffic engineering of management flows by link augmentations on confluent trees | 2008-02-18 | Paper |
| Approximating the advertisement placement problem | 2007-12-20 | Paper |
| Cut problems in graphs with a budget constraint | 2007-10-30 | Paper |
| The Hardness of Metric Labeling | 2007-10-22 | Paper |
| Covering Problems with Hard Capacities | 2007-05-03 | Paper |
| Real-time scheduling with a budget | 2007-04-26 | Paper |
| Efficient algorithms for shared backup allocation in networks with partial information | 2007-01-05 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Scheduling Split Intervals | 2006-06-01 | Paper |
| The Steiner k-Cut Problem | 2006-06-01 | Paper |
| Building edge-failure resilient networks | 2006-03-21 | Paper |
| Minimizing Service and Operation Costs of Periodic Scheduling | 2005-11-11 | Paper |
| A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem | 2005-09-16 | Paper |
| Directed Network Design with Orientation Constraints | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828978 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829009 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829010 | 2004-11-29 | Paper |
| Admission control in networks with advance reservations | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737152 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737542 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737544 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449175 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449217 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449246 | 2004-02-08 | Paper |
| Competitive on-Line switching policies | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768299 | 2003-07-29 | Paper |
| New algorithms for related machines with temporary jobs. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411289 | 2003-07-07 | Paper |
| The budgeted maximum coverage problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768268 | 2002-06-30 | Paper |
| Approximating the Throughput of Multiple Machines in Real-Time Scheduling | 2002-04-23 | Paper |
| A 2-Approximation Algorithm for the Directed Multiway Cut Problem | 2002-04-23 | Paper |
| On-Line Load Balancing in a Hierarchical Server Topology | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768280 | 2002-03-24 | Paper |
| Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952683 | 2000-10-23 | Paper |
| An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem | 2000-10-18 | Paper |
| Message Multicasting in Heterogeneous Networks | 2000-10-18 | Paper |
| Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231912 | 2000-04-26 | Paper |
| Dynamic storage allocation with known durations | 2000-01-01 | Paper |
| The Loading Time Scheduling Problem | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250158 | 1999-08-16 | Paper |
| Approximating probability distributions using small sample spaces | 1999-05-18 | Paper |
| Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference | 1998-09-20 | Paper |
| Scheduled Hot-Potato Routing | 1998-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542563 | 1998-01-01 | Paper |
| Approximating minimum feedback sets and multicuts in directed graphs | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128894 | 1997-06-01 | Paper |
| Constructions of permutation arrays for certain scheduling cost measures | 1996-12-09 | Paper |
| Tight Bounds for Dynamic Storage Allocation | 1996-08-13 | Paper |
| Flow in Planar Graphs with Multiple Sources and Sinks | 1996-04-11 | Paper |
| Approximation Algorithms for Network Design Problems on Bounded Subsets | 1996-01-01 | Paper |
| Routing strategies for fast networks | 1996-01-01 | Paper |
| The probabilistic method yields deterministic parallel algorithms | 1995-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763408 | 1995-04-11 | Paper |
| Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality | 1995-04-06 | Paper |
| The Competitiveness of On-Line Assignments | 1995-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138288 | 1994-11-29 | Paper |
| Flow in planar graphs with vertex capacities | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128936 | 1994-01-01 | Paper |
| The Lattice Structure of Flow in Planar Graphs | 1993-10-14 | Paper |
| Small-Bias Probability Spaces: Efficient Constructions and Applications | 1993-10-10 | Paper |
| The greedy algorithm is optimal for on-line edge coloring | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028881 | 1993-03-28 | Paper |
| Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality | 1993-01-01 | Paper |
| A Linear Time Approach to the Set Maxima Problem | 1992-06-28 | Paper |
| Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs | 1992-06-28 | Paper |
| An efficient parallel algorithm for computing a large independent set in a planar graph | 1991-01-01 | Paper |
| An efficient reconstruction of a graph from its line graph in parallel | 1990-01-01 | Paper |
| Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments | 1990-01-01 | Paper |
| On separating the EREW and CREW PRAM models | 1989-01-01 | Paper |
| Fast Parallel Algorithms for Chordal Graphs | 1989-01-01 | Paper |
| A fast parallel algorithm to color a graph with Δ colors | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798259 | 1988-01-01 | Paper |
| A fast parallel coloring of planar graphs with five colors | 1987-01-01 | Paper |
