| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147265 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147426 | 2024-01-15 | Paper |
| A PTAS for unsplittable flow on a path | 2023-12-08 | Paper |
| Breaching the 2-approximation barrier for the forest augmentation problem | 2023-12-08 | Paper |
| Approximation Algorithms for Demand Strip Packing | 2023-11-20 | Paper |
| Fully Dynamic (Δ +1)-Coloring in O (1) Update Time | 2023-10-31 | Paper |
| A Tight (3/2+ε) Approximation for Skewed Strip Packing. | 2023-10-31 | Paper |
| Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter | 2023-10-23 | Paper |
| A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing | 2023-10-06 | Paper |
| Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back | 2023-09-20 | Paper |
| Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree | 2023-06-09 | Paper |
| $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm | 2023-04-28 | Paper |
| Improved Approximation for Two-Edge-Connectivity | 2022-09-21 | Paper |
| Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075798 | 2022-05-11 | Paper |
| A refined approximation for Euclidean \(k\)-means | 2022-04-07 | Paper |
| Approximating Geometric Knapsack via L-packings | 2022-02-22 | Paper |
| Faster Replacement Paths and Distance Sensitivity Oracles | 2021-12-16 | Paper |
| On the cycle augmentation problem: hardness and approximation algorithms | 2021-09-28 | Paper |
| Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree | 2021-01-19 | Paper |
| On the Cycle Augmentation Problem: hardness and approximation algorithms | 2020-08-24 | Paper |
| The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm | 2020-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111366 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111404 | 2020-05-27 | Paper |
| Dynamic set cover: improved algorithms and lower bounds | 2020-01-30 | Paper |
| O (log 2 k / log log k )-approximation algorithm for directed Steiner tree | 2020-01-30 | Paper |
| Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma | 2020-01-30 | Paper |
| (1 + ∊)-Approximate Incremental Matching in Constant Deterministic Amortized Time | 2019-10-15 | Paper |
| A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes | 2019-08-22 | Paper |
| Improved approximation for tree augmentation: saving by rewiring | 2019-08-22 | Paper |
| A Mazing 2+∊ Approximation for Unsplittable Flow on a Path | 2019-06-20 | Paper |
| How to Sell Hyperedges: The Hypermatching Assignment Problem | 2019-05-15 | Paper |
| Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product | 2019-05-07 | Paper |
| A Mazing 2+ε Approximation for Unsplittable Flow on a Path | 2019-03-28 | Paper |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy | 2018-11-12 | Paper |
| Distributed weighted vertex cover via maximal matchings | 2018-11-05 | Paper |
| Combinatorial bounds via measure and conquer | 2018-11-05 | Paper |
| To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack | 2018-07-16 | Paper |
| Improved Pseudo-Polynomial-Time Approximation for Strip Packing | 2018-04-19 | Paper |
| Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter | 2017-10-05 | Paper |
| On Survivable Set Connectivity | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365072 | 2017-09-29 | Paper |
| Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree | 2017-08-17 | Paper |
| On Pairwise Spanners | 2017-01-30 | Paper |
| Online network design with outliers | 2016-11-01 | Paper |
| Pricing on Paths: A PTAS for the Highway Problem | 2016-03-23 | Paper |
| Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows | 2016-02-26 | Paper |
| Improved Approximation Algorithms for Stochastic Matching | 2015-11-19 | Paper |
| Improved Purely Additive Fault-Tolerant Spanners | 2015-11-19 | Paper |
| A measure & conquer approach for the analysis of exact algorithms | 2015-11-11 | Paper |
| On Conflict-Free Multi-coloring | 2015-10-30 | Paper |
| Data structures resilient to memory faults | 2015-03-16 | Paper |
| Primal-dual based distributed algorithms for vertex cover with semi-hard capacities | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934637 | 2014-12-18 | Paper |
| An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph | 2014-12-09 | Paper |
| Resilient dictionaries | 2014-11-18 | Paper |
| Utilitarian Mechanism Design for Multiobjective Optimization | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921760 | 2014-10-13 | Paper |
| Designing reliable algorithms in unreliable memories | 2014-10-07 | Paper |
| New approaches to multi-objective optimization | 2014-08-29 | Paper |
| An improved LP-based approximation for steiner tree | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417649 | 2014-05-22 | Paper |
| Steiner Tree Approximation via Iterative Randomized Rounding | 2014-02-17 | Paper |
| Set Covering with Our Eyes Closed | 2013-09-25 | Paper |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy | 2013-09-17 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path | 2013-03-19 | Paper |
| A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees | 2012-09-25 | Paper |
| On Min-Power Steiner Tree | 2012-09-25 | Paper |
| Approximation Algorithms for Union and Intersection Covering Problems | 2012-08-31 | Paper |
| From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk | 2012-05-24 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2012-04-26 | Paper |
| Approximation Algorithms for Single and Multi-Commodity Connected Facility Location | 2011-06-24 | Paper |
| Budgeted matching and budgeted matroid intersection via the gasoline puzzle | 2011-06-17 | Paper |
| Stable routing under the Spanning Tree Protocol | 2010-12-20 | Paper |
| Connected facility location via random facility sampling and core detouring | 2010-10-07 | Paper |
| Online Network Design with Outliers | 2010-09-07 | Paper |
| Network Design via Core Detouring for Problems without a Core | 2010-09-07 | Paper |
| Approximation Schemes for Multi-Budgeted Independence Systems | 2010-09-06 | Paper |
| Measure and conquer | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579459 | 2010-08-06 | Paper |
| Low degree connectivity of ad-hoc networks via percolation | 2010-07-13 | Paper |
| Sharp Separation and Applications to Exact and Parameterized Algorithms | 2010-04-27 | Paper |
| Optimal resilient sorting and searching in the presence of memory faults | 2009-11-04 | Paper |
| Iterative Rounding for Multi-Objective Optimization Problems | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396567 | 2009-09-19 | Paper |
| Refined memorization for vertex cover | 2009-08-27 | Paper |
| Balanced cut approximation in random geometric graphs | 2009-07-10 | Paper |
| A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover | 2009-06-22 | Paper |
| Detecting directed 4-cycles still faster | 2009-04-28 | Paper |
| Optimal Resilient Sorting and Searching in the Presence of Memory Faults | 2009-03-12 | Paper |
| Solving connected dominating set faster than \(2^n\) | 2008-12-02 | Paper |
| Faster Steiner Tree Computation in Polynomial-Space | 2008-11-25 | Paper |
| Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation | 2008-09-25 | Paper |
| Optimal Resilient Dynamic Dictionaries | 2008-09-25 | Paper |
| A short proof of the VPN tree routing conjecture on ring networks | 2008-09-10 | Paper |
| Algorithms and Constraint Programming | 2008-09-09 | Paper |
| New Approaches for Virtual Private Network Design | 2008-06-19 | Paper |
| Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle | 2008-06-10 | Paper |
| Improved Approximation for Single-Sink Buy-at-Bulk | 2008-04-24 | Paper |
| Balanced Cut Approximation in Random Geometric Graphs | 2008-04-24 | Paper |
| Solving Connected Dominating Set Faster Than 2 n | 2008-04-17 | Paper |
| A note on the complexity of minimum dominating set | 2007-11-05 | Paper |
| On maximum number of minimal dominating sets in graphs | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| A linear time algorithm to list the minimal separators of chordal graphs | 2006-03-29 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| On the complexity of fixed parameter clique and dominating set | 2005-01-11 | Paper |
| Evaluation of Fault-Tolerant Multiprocessor Systems for High Assurance Applications | 2002-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814806 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777444 | 1988-01-01 | Paper |
| A Theory of Diagnosability of Digital Systems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212666 | 1974-01-01 | Paper |
