| Publication | Date of Publication | Type |
|---|
| Unique sink orientations of cubes | 2026-05-08 | Paper |
| Clustering under perturbation stability in near-linear time | 2026-03-23 | Paper |
| On connectivity in random graph models with limited dependencies | 2025-01-14 | Paper |
Deep cliques in point sets
Discrete & Computational Geometry | 2024-10-25 | Paper |
On connectivity in random graph models with limited dependencies
Random Structures & Algorithms | 2024-09-02 | Paper |
Convex hulls of random order types
Journal of the ACM | 2024-07-04 | Paper |
Gram's equation — A probabilistic proof
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Convex Hulls of Random Order Types
(available as arXiv preprint) | 2023-11-02 | Paper |
| Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). | 2023-11-02 | Paper |
| On Connectivity in Random Graph Models with Limited Dependencies | 2023-05-04 | Paper |
Connectivity of triangulation flip graphs in the plane
Discrete & Computational Geometry | 2022-12-08 | Paper |
A combinatorial bound for linear programming and related problems
STACS 92 | 2022-08-18 | Paper |
Polynomial graph-colorings
STACS 89 | 2022-08-16 | Paper |
Space filling curves and their use in the design of geometric data structures
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Lower bounds for searching robots, some faulty
Distributed Computing | 2021-09-06 | Paper |
Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Discrete & Computational Geometry | 2020-10-23 | Paper |
From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Discrete & Computational Geometry | 2020-10-23 | Paper |
Solving and sampling with many solutions: satisfiability and other hard problems
(available as arXiv preprint) | 2020-05-27 | Paper |
Solving and sampling with many solutions
Algorithmica | 2020-04-01 | Paper |
Connectivity of Triangulation Flip Graphs in the Plane
(available as arXiv preprint) | 2020-03-30 | Paper |
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm
(available as arXiv preprint) | 2020-02-12 | Paper |
Lower bounds for searching robots, some faulty
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Algorithms for center and Tverberg points
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices | 2018-08-13 | Paper |
Order on order types
Discrete & Computational Geometry | 2018-07-13 | Paper |
ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Crossing-free perfect matchings in wheel point sets
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Linear programming — Randomization and abstract frameworks
STACS 96 | 2017-11-16 | Paper |
| Order on order types | 2017-10-10 | Paper |
Origin-embracing distributions or a continuous analogue of the upper bound theorem
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Random sampling in geometric optimization
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Balanced lines, halving triangles, and the generalized lower bound theorem
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Algorithms for center and Tverberg points
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
Jiří Matoušek, March 10, 1963 -- March 9, 2015
Discrete & Computational Geometry | 2015-07-20 | Paper |
Improved bounds on weak ε-nets for convex sets
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
One line and \(n\) points
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
| Online conflict-free coloring for intervals | 2014-10-13 | Paper |
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On the number of upward planar orientations of maximal planar graphs
Theoretical Computer Science | 2014-07-07 | Paper |
On degrees in random triangulations of point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Counting plane graphs: flippability and its applications
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
On the number of crossing-free partitions
Computational Geometry | 2013-08-22 | Paper |
Number of crossing-free geometric graphs vs. Triangulations
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Journal of Combinatorial Theory. Series A | 2013-04-15 | Paper |
On the number of upward planar orientations of maximal planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
Counting plane graphs: flippability and its applications
Lecture Notes in Computer Science | 2011-08-12 | Paper |
On degrees in random triangulations of point sets
Journal of Combinatorial Theory. Series A | 2011-07-07 | Paper |
Counting plane graphs with exponential speed-up
Lecture Notes in Computer Science | 2011-05-27 | Paper |
On the number of crossing-free matchings, (cycles, and partitions)
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The Lovász Local Lemma and Satisfiability
Lecture Notes in Computer Science | 2009-11-12 | Paper |
| Random triangulations of planar points sets | 2009-05-22 | Paper |
| scientific article; zbMATH DE number 5506218 (Why is no real title available?) | 2009-02-10 | Paper |
Fast greedy triangulation algorithms.
Computational Geometry | 2008-04-25 | Paper |
The Number of Crossing Free Configurations on Finite Point Sets in the Plane
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
The Number of Triangulations on Planar Point Sets
Graph Drawing | 2007-08-28 | Paper |
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
SIAM Journal on Computing | 2007-06-26 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2209744 (Why is no real title available?) | 2005-09-28 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2145237 (Why is no real title available?) | 2005-03-14 | Paper |
Point–Line Incidences in Space
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2097774 (Why is no real title available?) | 2004-09-07 | Paper |
Algorithmic complexity of protein identification: Combinatorics of weighted strings
Discrete Applied Mathematics | 2004-02-14 | Paper |
One line and n points
Random Structures & Algorithms | 2004-02-03 | Paper |
| scientific article; zbMATH DE number 2016073 (Why is no real title available?) | 2003-12-10 | Paper |
A continuous analogue of the upper bound theorem
Discrete & Computational Geometry | 2003-07-22 | Paper |
| scientific article; zbMATH DE number 1947380 (Why is no real title available?) | 2003-07-08 | Paper |
In between k-sets, j-facets, and i-faces: (i,j)-partitions
Discrete & Computational Geometry | 2003-03-17 | Paper |
Crossing-free segments and triangles in point configurations
Discrete Applied Mathematics | 2003-02-06 | Paper |
| scientific article; zbMATH DE number 1775049 (Why is no real title available?) | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1696517 (Why is no real title available?) | 2002-07-22 | Paper |
A simple sampling lemma: Analysis and applications in geometric optimization
Discrete & Computational Geometry | 2002-05-14 | Paper |
Enumerating triangulation paths
Computational Geometry | 2002-01-14 | Paper |
Entering and leaving \(j\)-facets
Discrete & Computational Geometry | 2001-10-10 | Paper |
| scientific article; zbMATH DE number 1497850 (Why is no real title available?) | 2001-03-05 | Paper |
A class of point-sets with few k-sets
Computational Geometry | 2000-09-04 | Paper |
Surface reconstruction between simple polygons via angle criteria
Journal of Symbolic Computation | 2000-08-14 | Paper |
The discrete 2-center problem
Discrete & Computational Geometry | 1999-04-19 | Paper |
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
Journal of Algorithms | 1999-01-17 | Paper |
| scientific article; zbMATH DE number 1163564 (Why is no real title available?) | 1998-10-11 | Paper |
Halving point sets
Documenta Mathematica | 1998-08-05 | Paper |
Halving point sets
Documenta Mathematica | 1998-08-05 | Paper |
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science | 1998-07-22 | Paper |
Approximation of convex figures by pairs of rectangles
Computational Geometry | 1998-06-08 | Paper |
| The rank of sparse random matrices over finite fields | 1997-12-15 | Paper |
Cutting dense point sets in half
Discrete & Computational Geometry | 1997-05-19 | Paper |
| scientific article; zbMATH DE number 953283 (Why is no real title available?) | 1997-04-13 | Paper |
A subexponential bound for linear programming
Algorithmica | 1997-02-18 | Paper |
| scientific article; zbMATH DE number 910875 (Why is no real title available?) | 1996-08-22 | Paper |
| scientific article; zbMATH DE number 742952 (Why is no real title available?) | 1995-04-11 | Paper |
Improved bounds on weak \(\varepsilon\)-nets for convex sets
Discrete & Computational Geometry | 1995-04-03 | Paper |
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
Discrete & Computational Geometry | 1994-12-01 | Paper |
Drawing Graphs in the Plane with High Resolution
SIAM Journal on Computing | 1994-10-10 | Paper |
Discrepancy and approximations for bounded VC-dimension
Combinatorica | 1994-09-11 | Paper |
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing | 1994-04-27 | Paper |
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
Computational Geometry | 1993-11-01 | Paper |
