| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5874534 | 2023-02-07 | Paper |
| Algorithms for covering multiple submodular constraints and applications | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075746 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009492 | 2021-08-04 | Paper |
| Fault-tolerant covering problems in metric spaces | 2021-03-26 | Paper |
| Improved approximation bounds for the minimum constraint removal problem | 2020-10-23 | Paper |
| Fault tolerant clustering with outliers | 2020-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115774 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115815 | 2020-08-18 | Paper |
| Capacitated covering problems in geometric spaces | 2020-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743480 | 2019-05-10 | Paper |
| Projective clustering in high dimensions using core-sets | 2018-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580079 | 2018-08-13 | Paper |
| Approximate Clustering via Metric Partitioning | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132847 | 2018-01-30 | Paper |
| Improved approximation algorithms for geometric set cover | 2017-10-20 | Paper |
| Epsilon nets and union complexity | 2017-10-20 | Paper |
| Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation | 2017-10-05 | Paper |
| A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$} | 2017-09-29 | Paper |
| High-dimensional shape fitting in linear time | 2017-09-29 | Paper |
| A near-linear constant-factor approximation for euclidean bipartite matching? | 2017-09-29 | Paper |
| Practical methods for shape fitting and kinetic data structures using core sets | 2017-09-29 | Paper |
| An experimental study of different approaches to solve the market equilibrium problem | 2017-06-15 | Paper |
| A constant-factor approximation for multi-covering with disks | 2017-03-30 | Paper |
| On isolating points using unit disks | 2017-03-30 | Paper |
| Guarding terrains via local search | 2017-03-09 | Paper |
| Epsilon-approximations and epsilon-nets | 2017-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957523 | 2017-01-26 | Paper |
| Linear approximation of simple objects | 2016-05-26 | Paper |
| On the Approximability of Orthogonal Order Preserving Layout Adjustment | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501283 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501309 | 2015-08-03 | Paper |
| Diverse near neighbor problem | 2015-02-17 | Paper |
| A constant-factor approximation for multi-covering with disks | 2015-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934635 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921655 | 2014-10-13 | Paper |
| Computing Regions Decomposable into m Stars | 2014-10-08 | Paper |
| A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) | 2014-09-26 | Paper |
| Max-coloring and online coloring with bandwidths on interval graphs | 2014-09-09 | Paper |
| Weighted geometric set cover via quasi-uniform sampling | 2014-08-13 | Paper |
| Decomposing Coverings and the Planar Sensor Cover Problem | 2014-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414566 | 2014-05-06 | Paper |
| The planar \(k\)-means problem is NP-hard | 2012-08-08 | Paper |
| On Clustering to Minimize the Sum of Radii | 2012-05-30 | Paper |
| Efficient subspace approximation algorithms | 2012-03-02 | Paper |
| On Isolating Points Using Disks | 2011-09-16 | Paper |
| Optimally decomposing coverings with translates of a convex polygon | 2011-08-23 | Paper |
| Approximating extent measures of points | 2011-02-01 | Paper |
| Market equilibrium via the excess demand function | 2010-08-16 | Paper |
| Leontief economies encode nonzero sum two-player games | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579384 | 2010-08-06 | Paper |
| On metric clustering to minimize the sum of radii | 2010-05-19 | Paper |
| An Approximation Scheme for Terrain Guarding | 2009-10-28 | Paper |
| Approximation Algorithms for Domatic Partitions of Unit Disk Graphs | 2009-10-28 | Paper |
| Practical methods for shape fitting and kinetic data structures using coresets | 2009-03-24 | Paper |
| Computing Equilibrium Prices in Exchange Economies with Tax Distortions | 2009-03-12 | Paper |
| The Planar k-Means Problem is NP-Hard | 2009-02-24 | Paper |
| Sampling-based dimension reduction for subspace approximation | 2009-01-05 | Paper |
| The complexity of equilibria: Hardness results for economies via a correspondence with games | 2008-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524715 | 2008-09-12 | Paper |
| On Metric Clustering to Minimize the Sum of Radii | 2008-07-15 | Paper |
| Improved approximation algorithms for geometric set cover | 2007-02-14 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290249 | 2006-04-28 | Paper |
| Approximation algorithms for a \(k\)-line center | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| High-dimensional shape fitting in linear time | 2005-02-11 | Paper |
| Facility location on a polyhedral surface | 2004-07-07 | Paper |
| A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411345 | 2003-07-08 | Paper |
| A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\) | 2003-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768379 | 2002-03-24 | Paper |
| Approximating Shortest Paths on a Nonconvex Polyhedron | 2001-03-19 | Paper |
| Efficient algorithms for approximating polygonal chains | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252363 | 2000-01-11 | Paper |
| Approximating shortest paths on a convex polytope in three dimensions | 1998-02-17 | Paper |
