| Publication | Date of Publication | Type |
|---|
| Geometric stabbing via threshold rounding and factor revealing LPs | 2024-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187793 | 2024-01-15 | Paper |
| On the geometric priority set cover problem | 2023-06-26 | Paper |
| Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. | 2023-02-07 | Paper |
| On the geometric set multicover problem | 2022-08-25 | Paper |
| Planar Support for Non-piercing Regions and Applications | 2021-08-04 | Paper |
| On a problem of Danzer | 2021-08-04 | Paper |
| Constructing planar support for non-piercing regions | 2020-10-23 | Paper |
| On a Problem of Danzer | 2020-04-06 | Paper |
| Point Line Cover: The Easy Kernel is Essentially Tight | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633936 | 2019-05-06 | Paper |
| A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs | 2019-03-26 | Paper |
| Point Line Cover | 2018-11-05 | Paper |
| Packing and covering with non-piercing regions | 2018-10-30 | Paper |
| Practical and efficient algorithms for the geometric hitting set problem | 2018-04-04 | Paper |
| Packing and Covering with Non-Piercing Regions | 2018-03-02 | Paper |
| Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness | 2018-01-12 | Paper |
| PTAS for geometric hitting set problems via local search | 2017-10-20 | Paper |
| Limits of local search: quality and efficiency | 2017-05-11 | Paper |
| \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets | 2017-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965518 | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954994 | 2017-01-24 | Paper |
| Tighter estimates for \(\epsilon\)-nets for disks | 2016-04-12 | Paper |
| An optimal generalization of the colorful Carathéodory theorem | 2016-01-21 | Paper |
| k-Centerpoints Conjectures for Pointsets in ℝd | 2015-12-30 | Paper |
| Geometric Hitting Sets for Disks: Theory and Practice | 2015-11-19 | Paper |
| Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces | 2015-11-18 | Paper |
| Counting triangulations and other crossing-free structures via onion layers | 2015-06-26 | Paper |
| Counting triangulations and other crossing-free structures approximately | 2015-04-27 | Paper |
| On totally positive matrices and geometric incidences | 2014-10-07 | Paper |
| Counting crossing-free structures | 2014-08-07 | Paper |
| A theorem of Bárány revisited and extended | 2014-08-07 | Paper |
| Improving the first selection lemma in R 3 | 2014-04-03 | Paper |
| A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations | 2013-12-11 | Paper |
| On the complexity of the highway problem | 2012-11-27 | Paper |
| Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors | 2012-08-13 | Paper |
| Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane | 2011-09-16 | Paper |
| Improved results on geometric hitting set problems | 2010-11-08 | Paper |
| Hitting simplices with points in \(\mathbb R^{3}\) | 2010-11-08 | Paper |
| Centerpoints and Tverberg's technique | 2010-07-28 | Paper |
| Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension | 2010-07-28 | Paper |
| Faster algorithms for computing Hong's bound on absolute positiveness | 2010-05-21 | Paper |
| On Profit-Maximizing Pricing for the Highway and Tollbooth Problems | 2009-12-01 | Paper |
| An optimal extension of the centerpoint theorem | 2009-07-27 | Paper |
| On Computing the Centroid of the Vertices of an Arrangement and Related Problems | 2009-02-17 | Paper |
| New existence proofs ε-nets | 2009-02-12 | Paper |
| An optimal generalization of the centerpoint theorem, and its extensions | 2009-02-12 | Paper |
| Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension | 2009-02-12 | Paper |
| Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension | 2008-03-26 | Paper |
