| Publication | Date of Publication | Type |
|---|
| Online paging with heterogeneous cache slots | 2025-01-24 | Paper |
| Efficient algorithms and hardness results for the weighted \(k\)-server problem | 2025-01-14 | Paper |
| Beyond the quadratic time barrier for network unreliability | 2024-11-28 | Paper |
| Poly-logarithmic competitiveness for the \(k\)-taxi problem | 2024-11-28 | Paper |
| A general framework for learning-augmented online allocation | 2024-11-14 | Paper |
| Online paging with heterogeneous cache slots | 2024-10-08 | Paper |
| Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows | 2024-08-27 | Paper |
| Online graph algorithms with predictions | 2024-07-19 | Paper |
| Augmenting edge connectivity via isolating cuts | 2024-07-19 | Paper |
| Near-linear time approximations for cut problems via fair cuts | 2024-05-14 | Paper |
| Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147322 | 2024-01-15 | Paper |
| Edge connectivity augmentation in near-linear time | 2023-12-08 | Paper |
| Vertex connectivity in poly-logarithmic max-flows | 2023-11-14 | Paper |
| Approximate Gomory–Hu tree is faster than n – 1 max-flows | 2023-11-14 | Paper |
| Online Algorithms for Weighted Paging with Predictions | 2023-10-31 | Paper |
| Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions | 2023-10-23 | Paper |
| Robust Algorithms for TSP and Steiner Tree | 2023-10-23 | Paper |
| Universal Algorithms for Clustering Problems | 2023-10-23 | Paper |
| Caching with time windows and delays | 2022-07-22 | Paper |
| Retracting Graphs to Cycles | 2022-07-21 | Paper |
| Online service with delay | 2022-02-16 | Paper |
| Symmetric interdiction for matching problems | 2021-07-28 | Paper |
| Caching with time windows | 2021-01-19 | Paper |
| Timing matters: online dynamics in broadcast games | 2020-06-18 | Paper |
| Profit sharing and efficiency in utility games | 2020-05-27 | Paper |
| Dynamic set cover: improved algorithms and lower bounds | 2020-01-30 | Paper |
| Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions | 2019-10-15 | Paper |
| Elastic Caching | 2019-10-15 | Paper |
| Multi-unit supply-monotone auctions with Bayesian valuations | 2019-10-15 | Paper |
| A general framework for graph sparsification | 2019-09-02 | Paper |
| Online load balancing on related machines | 2019-08-22 | Paper |
| Online Mixed Packing and Covering | 2019-05-15 | Paper |
| A near-linear time algorithm for constructing a cactus representation of minimum cuts | 2019-05-06 | Paper |
| Tight bounds for online vector scheduling | 2019-02-08 | Paper |
| Faster algorithms for the geometric transportation problem | 2018-08-13 | Paper |
| Online Buy-at-Bulk Network Design | 2018-08-03 | Paper |
| Random contractions and sampling for hypergraph and hedge connectivity | 2018-07-16 | Paper |
| Randomized algorithms for online vector load balancing | 2018-03-15 | Paper |
| Survivable network design problems in wireless networks | 2017-09-29 | Paper |
| Online and dynamic algorithms for set cover | 2017-08-17 | Paper |
| Online service with delay | 2017-08-17 | Paper |
| Online Node-weighted Steiner Forest and Extensions via Disk Paintings | 2017-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969609 | 2017-03-22 | Paper |
| On the price of stability of undirected multicast games | 2017-02-10 | Paper |
| Efficient algorithms for computing all low \(s\)-\(t\) edge connectivities and related problems | 2014-12-18 | Paper |
| Online node-weighted Steiner tree and related problems | 2014-07-30 | Paper |
| Near-optimal online algorithms for prize-collecting Steiner problems | 2014-07-01 | Paper |
| Precedence-constrained scheduling of malleable jobs with preemption | 2014-07-01 | Paper |
| A general framework for graph sparsification | 2014-06-05 | Paper |
| The semi-stochastic ski-rental problem | 2012-08-31 | Paper |
| Maximum bipartite flow in networks with adaptive channel width | 2011-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579486 | 2010-08-06 | Paper |
| Maximum Bipartite Flow in Networks with Adaptive Channel Width | 2009-07-14 | Paper |
| An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs | 2009-01-05 | Paper |
