| Publication | Date of Publication | Type |
|---|
| Apportionment with parity constraints | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147391 | 2024-01-15 | Paper |
| Probabilistic Analysis of Euclidean Capacitated Vehicle Routing | 2024-01-15 | Paper |
| Approximating maximum integral multiflows on bounded genus graphs | 2023-12-21 | Paper |
| A PTAS for Capacitated Vehicle Routing on Trees | 2023-10-23 | Paper |
| Iterated tour partitioning for Euclidean capacitated vehicle routing | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075963 | 2023-10-17 | Paper |
| Correlation clustering and two-edge-connected augmentation for planar graphs | 2023-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075963 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875486 | 2023-02-03 | Paper |
| Skyline Computation with Noisy Comparisons | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091070 | 2022-07-21 | Paper |
| Two-sided matching markets with strongly correlated preferences | 2022-05-20 | Paper |
| Mixed preferential attachment model: homophily and minorities in social networks | 2022-05-19 | Paper |
| An Approximation Algorithm for Fully Planar Edge-Disjoint Paths | 2021-04-28 | Paper |
| Instance-Optimality in the Noisy Value-and Comparison-Model | 2021-02-02 | Paper |
| How to aggregate Top-lists: Approximation algorithms via scores and average ranks | 2021-02-02 | Paper |
| Dynamic clustering to minimize the sum of radii | 2020-10-21 | Paper |
| Recognizing Well-Parenthesized Expressions in the Streaming Model | 2020-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111691 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111737 | 2020-05-27 | Paper |
| Hierarchical Clustering | 2020-02-11 | Paper |
| First Come First Served for Online Slot Allocation and Huffman Coding | 2019-06-20 | Paper |
| Approximating k-center in planar graphs | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743426 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743427 | 2019-05-10 | Paper |
| Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics | 2019-05-07 | Paper |
| Graph Reconstruction and Verification | 2019-03-28 | Paper |
| A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest | 2018-10-30 | Paper |
| Semidefinite and linear programming integrality gaps for scheduling identical machines | 2018-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176576 | 2018-07-23 | Paper |
| Distance in the Forest Fire Model How far are you from Eve? | 2018-07-16 | Paper |
| Optimization of Bootstrapping in Circuits | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607904 | 2018-03-15 | Paper |
| Carpooling in Social Networks | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368697 | 2017-10-10 | Paper |
| Approximating connectivity domination in weighted bounded-genus graphs | 2017-09-29 | Paper |
| Homophily and the Glass Ceiling Effect in Social Networks | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955023 | 2017-01-24 | Paper |
| Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines | 2016-08-10 | Paper |
| Energy-Efficient Algorithms for Non-preemptive Speed-Scaling | 2015-11-20 | Paper |
| Near-Linear Query Complexity for Graph Inference | 2015-10-27 | Paper |
| A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing | 2015-09-03 | Paper |
| Sherali-adams relaxations of the matching polytope | 2015-02-04 | Paper |
| An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs | 2014-11-18 | Paper |
| Recognizing well-parenthesized expressions in the streaming model | 2014-08-13 | Paper |
| Facility Location in Evolving Metrics | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417633 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417661 | 2014-05-22 | Paper |
| The Min Mean-Weight Cycle in a Random Network | 2014-02-24 | Paper |
| Graph Reconstruction via Distance Oracles | 2013-08-06 | Paper |
| Online constrained optimization with recourse | 2013-03-20 | Paper |
| Maximum Matching in Semi-streaming with Few Passes | 2012-11-02 | Paper |
| Lower bounds for randomized algorithms for online chain partitioning | 2012-10-23 | Paper |
| Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme | 2012-09-12 | Paper |
| On the number of indecomposable permutations with a given number of cycles | 2012-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113781 | 2012-01-23 | Paper |
| Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack | 2011-06-24 | Paper |
| The Train Delivery Problem - Vehicle Routing Meets Bin Packing | 2011-02-15 | Paper |
| Online Ranking for Tournament Graphs | 2011-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579443 | 2010-08-06 | Paper |
| Distortion lower bounds for line embeddings | 2010-06-09 | Paper |
| Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon | 2009-02-17 | Paper |
| Improved Approximation Algorithms for Budgeted Allocations | 2008-08-28 | Paper |
| Some problems in computational geometry | 1987-01-01 | Paper |
