| Publication | Date of Publication | Type |
|---|
| Distributed Approximation on Power Graphs | 2021-03-15 | Paper |
| Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks | 2018-08-07 | Paper |
| 1.5-approximation algorithm for the 2-convex recoloring problem | 2018-06-27 | Paper |
| A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds | 2018-05-17 | Paper |
| Distributed Approximation of Maximum Independent Set and Maximum Matching | 2017-10-11 | Paper |
| A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds | 2017-09-29 | Paper |
| A constant factor approximation algorithm for the storage allocation problem | 2017-05-02 | Paper |
| 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem | 2016-04-04 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2015-10-30 | Paper |
| Bandwidth allocation in cellular networks with multiple interferences | 2015-09-01 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2014-09-26 | Paper |
| A note on multicovering with disks | 2013-01-25 | Paper |
| Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs | 2012-11-01 | Paper |
| Minimum vertex cover in rectangle graphs | 2011-07-20 | Paper |
| Approximation of Partial Capacitated Vertex Cover | 2011-07-18 | Paper |
| An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications | 2011-03-15 | Paper |
| Minimum Vertex Cover in Rectangle Graphs | 2010-09-06 | Paper |
| Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications | 2010-05-11 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Resource allocation in bounded degree trees | 2009-06-16 | Paper |
| A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping | 2009-01-19 | Paper |
| Approximation of Partial Capacitated Vertex Cover | 2008-09-25 | Paper |
| Improved approximation algorithm for convex recoloring of trees | 2008-06-06 | Paper |
| Exploiting locality: Approximating sorting buffers | 2008-05-29 | Paper |
| Resource Allocation in Bounded Degree Trees | 2008-03-11 | Paper |
| Using fractional primal-dual to schedule split intervals with demands | 2007-02-20 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique | 2006-06-01 | Paper |
| Scheduling Split Intervals | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374247 | 2006-03-09 | Paper |
| On approximating a geometric prize-collecting traveling salesman problem with time windows | 2005-05-04 | Paper |
| Approximating the dense set-cover problem | 2005-02-23 | Paper |
| Local ratio with negative weights. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829009 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780780 | 2002-11-21 | Paper |
| Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property | 2002-08-14 | Paper |
| Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems | 2002-01-07 | Paper |
| Using homogeneous weights for approximating the partial cover problem | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252274 | 2001-12-12 | Paper |
| Efficient algorithms for integer programs with two variables per constraint. | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488089 | 2000-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938772 | 2000-06-05 | Paper |
| One for the price of two: a unified approach for approximating covering problems | 2000-05-09 | Paper |
| Partitioning a sequence into few monotone subsequences | 1998-11-08 | Paper |
| Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400844 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128894 | 1997-06-01 | Paper |
| A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES | 1996-10-21 | Paper |
| TRIANGULATING DISJOINT JORDAN CHAINS | 1995-04-06 | Paper |
| Privacy, additional information and communication | 1994-10-26 | Paper |
| Multiple Communication in Multihop Radio Networks | 1993-10-10 | Paper |
| Rotating-table games and derivatives of words | 1993-05-16 | Paper |
| On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization | 1993-01-16 | Paper |
| Connections between two cycles --- a new design of dense processor interconnection networks | 1993-01-16 | Paper |
| Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection | 1991-01-01 | Paper |
| Fault tolerant distributed majority commitment | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753476 | 1987-01-01 | Paper |
| On approximation problems related to the independent set and vertex cover problems | 1984-01-01 | Paper |
| Complexity of finding k-path-free dominating sets in graphs | 1982-01-01 | Paper |
