| Publication | Date of Publication | Type |
|---|
Geometric stabbing via threshold rounding and factor revealing LPs
Discrete \& Computational Geometry | 2024-04-02 | Paper |
scientific article; zbMATH DE number 7788585 (Why is no real title available?)
| 2024-01-15 | Paper |
On the geometric priority set cover problem
Computational Geometry | 2023-06-26 | Paper |
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.
| 2023-02-07 | Paper |
On the geometric set multicover problem
Discrete \& Computational Geometry | 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
Discrete \& Computational Geometry | 2020-10-23 | Paper |
On a problem of Danzer
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Point line cover: the easy kernel is essentially tight
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
scientific article; zbMATH DE number 7051292 (Why is no real title available?)
| 2019-05-06 | Paper |
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
Theoretical Computer Science | 2019-03-26 | Paper |
Point line cover: the easy kernel is essentially tight
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Packing and covering with non-piercing regions
Discrete \& Computational Geometry | 2018-10-30 | Paper |
Practical and efficient algorithms for the geometric hitting set problem
Discrete Applied Mathematics | 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
Journal of Symbolic Computation | 2018-01-12 | Paper |
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Limits of local search: quality and efficiency
Discrete \& Computational Geometry | 2017-05-11 | Paper |
\(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
Discrete \& Computational Geometry | 2017-05-11 | Paper |
Near-optimal generalisations of a theorem of Macbeath
| 2017-03-03 | Paper |
Improved local search for geometric hitting set
| 2017-01-24 | Paper |
Tighter estimates for \(\epsilon\)-nets for disks
Computational Geometry | 2016-04-12 | Paper |
An optimal generalization of the colorful Carathéodory theorem
Discrete Mathematics | 2016-01-21 | Paper |
\(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
International Journal of Computational Geometry & Applications | 2015-12-30 | Paper |
Geometric hitting sets for disks: theory and practice
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
SIAM Journal on Computing | 2015-11-18 | Paper |
Counting triangulations and other crossing-free structures via onion layers
Discrete \& Computational Geometry | 2015-06-26 | Paper |
Counting triangulations and other crossing-free structures approximately
Computational Geometry | 2015-04-27 | Paper |
On totally positive matrices and geometric incidences
Journal of Combinatorial Theory. Series A | 2014-10-07 | Paper |
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
A theorem of Bárány revisited and extended
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Improving the first selection lemma in \(\mathbb{R}^3\)
Proceedings of the twenty-sixth annual symposium on Computational geometry | 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
Theoretical Computer Science | 2012-11-27 | Paper |
Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
Discrete \& Computational Geometry | 2012-08-13 | Paper |
Ray-shooting depth: computing statistical data depth of point sets in the plane
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Improved results on geometric hitting set problems
Discrete \& Computational Geometry | 2010-11-08 | Paper |
Hitting simplices with points in \(\mathbb R^{3}\)
Discrete \& Computational Geometry | 2010-11-08 | Paper |
Centerpoints and Tverberg's technique
Computational Geometry | 2010-07-28 | Paper |
Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension
Computational Geometry | 2010-07-28 | Paper |
Faster algorithms for computing Hong's bound on absolute positiveness
Journal of Symbolic Computation | 2010-05-21 | Paper |
On profit-maximizing pricing for the highway and tollbooth problems
Algorithmic Game Theory | 2009-12-01 | Paper |
An optimal extension of the centerpoint theorem
Computational Geometry | 2009-07-27 | Paper |
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
New existence proofs ε-nets
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
An optimal generalization of the centerpoint theorem, and its extensions
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
Computational Geometry | 2008-03-26 | Paper |
