| Publication | Date of Publication | Type |
|---|
| On connectivity in random graph models with limited dependencies | 2025-01-14 | Paper |
| Deep cliques in point sets | 2024-10-25 | Paper |
| On connectivity in random graph models with limited dependencies | 2024-09-02 | Paper |
| Convex hulls of random order types | 2024-07-04 | Paper |
| Gram's equation — A probabilistic proof | 2024-01-29 | Paper |
| Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). | 2023-11-02 | Paper |
| Convex Hulls of Random Order Types | 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 | 2022-12-08 | Paper |
| A combinatorial bound for linear programming and related problems | 2022-08-18 | Paper |
| Polynomial graph-colorings | 2022-08-16 | Paper |
| Space filling curves and their use in the design of geometric data structures | 2022-08-16 | Paper |
| Lower bounds for searching robots, some faulty | 2021-09-06 | Paper |
| Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips) | 2021-02-02 | Paper |
| From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices | 2020-10-23 | Paper |
| Solving and sampling with many solutions: satisfiability and other hard problems | 2020-05-27 | Paper |
| Solving and sampling with many solutions | 2020-04-01 | Paper |
| Connectivity of Triangulation Flip Graphs in the Plane | 2020-03-30 | Paper |
| An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm | 2020-02-12 | Paper |
| Lower bounds for searching robots, some faulty | 2019-09-19 | Paper |
| Point-line incidences in space | 2018-11-23 | Paper |
| Algorithms for center and Tverberg points | 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 | 2018-07-13 | Paper |
| Crossing-free perfect matchings in wheel point sets | 2018-02-26 | Paper |
| ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\) | 2018-02-26 | Paper |
| Linear programming — Randomization and abstract frameworks | 2017-11-16 | Paper |
| Order on order types | 2017-10-10 | Paper |
| Random sampling in geometric optimization | 2017-09-29 | Paper |
| Origin-embracing distributions or a continuous analogue of the upper bound theorem | 2017-09-29 | Paper |
| Balanced lines, halving triangles, and the generalized lower bound theorem | 2017-09-29 | Paper |
| Algorithms for center and Tverberg points | 2017-09-29 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| Jiří Matoušek, March 10, 1963 -- March 9, 2015 | 2015-07-20 | Paper |
| Improved bounds on weak ε-nets for convex sets | 2015-05-07 | Paper |
| One line and \(n\) points | 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 | 2014-08-07 | Paper |
| On the number of upward planar orientations of maximal planar graphs | 2014-07-07 | Paper |
| On degrees in random triangulations of point sets | 2014-04-03 | Paper |
| Counting plane graphs: flippability and its applications | 2013-09-25 | Paper |
| On the number of crossing-free partitions | 2013-08-22 | Paper |
| Number of crossing-free geometric graphs vs. Triangulations | 2013-06-28 | Paper |
| Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique | 2013-04-15 | Paper |
| On the number of upward planar orientations of maximal planar graphs | 2013-03-21 | Paper |
| Counting plane graphs: flippability and its applications | 2011-08-12 | Paper |
| On degrees in random triangulations of point sets | 2011-07-07 | Paper |
| Counting plane graphs with exponential speed-up | 2011-05-27 | Paper |
| On the number of crossing-free matchings, (cycles, and partitions) | 2010-08-16 | Paper |
| The Lovász Local Lemma and Satisfiability | 2009-11-12 | Paper |
| Random triangulations of planar points sets | 2009-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601549 | 2009-02-10 | Paper |
| Fast greedy triangulation algorithms. | 2008-04-25 | Paper |
| The Number of Crossing Free Configurations on Finite Point Sets in the Plane | 2008-04-17 | Paper |
| Online Conflict‐Free Coloring for Intervals | 2007-10-22 | Paper |
| The Number of Triangulations on Planar Point Sets | 2007-08-28 | Paper |
| On the Number of Crossing‐Free Matchings, Cycles, and Partitions | 2007-06-26 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692728 | 2005-09-28 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657586 | 2005-03-14 | Paper |
| Point–Line Incidences in Space | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4814092 | 2004-09-07 | Paper |
| Algorithmic complexity of protein identification: Combinatorics of weighted strings | 2004-02-14 | Paper |
| One line and n points | 2004-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4438776 | 2003-12-10 | Paper |
| A continuous analogue of the upper bound theorem | 2003-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411344 | 2003-07-08 | Paper |
| In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions | 2003-03-17 | Paper |
| Crossing-free segments and triangles in point configurations | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542175 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766664 | 2002-07-22 | Paper |
| A simple sampling lemma: Analysis and applications in geometric optimization | 2002-05-14 | Paper |
| Enumerating triangulation paths | 2002-01-14 | Paper |
| Entering and leaving \(j\)-facets | 2001-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499280 | 2001-03-05 | Paper |
| A class of point-sets with few \(k\)-sets | 2000-09-04 | Paper |
| Surface reconstruction between simple polygons via angle criteria | 2000-08-14 | Paper |
| The discrete 2-center problem | 1999-04-19 | Paper |
| Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions | 1999-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395137 | 1998-10-11 | Paper |
| Halving point sets | 1998-08-05 | Paper |
| Space-filling curves and their use in the design of geometric data structures | 1998-07-22 | Paper |
| Approximation of convex figures by pairs of rectangles | 1998-06-08 | Paper |
| The rank of sparse random matrices over finite fields | 1997-12-15 | Paper |
| Cutting dense point sets in half | 1997-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718230 | 1997-04-13 | Paper |
| A subexponential bound for linear programming | 1997-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886049 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763393 | 1995-04-11 | Paper |
| Improved bounds on weak \(\varepsilon\)-nets for convex sets | 1995-04-03 | Paper |
| Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements | 1994-12-01 | Paper |
| Drawing Graphs in the Plane with High Resolution | 1994-10-10 | Paper |
| Discrepancy and approximations for bounded VC-dimension | 1994-09-11 | Paper |
| Fat Triangles Determine Linearly Many Holes | 1994-04-27 | Paper |
| Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 1993-11-01 | Paper |
| Shortest paths for line segments | 1993-10-13 | Paper |
| Weaving patterns of lines and line segments in space | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035741 | 1993-05-18 | Paper |
| Quasi-optimal upper bounds for simplex range searching and new zone theorems | 1993-01-17 | Paper |
| Simultaneous inner and outer approximation of shapes | 1993-01-17 | Paper |
| Polynomial graph-colorings | 1992-06-28 | Paper |
| Good splitters for counting points in triangles | 1992-06-28 | Paper |
| Euclidean minimum spanning trees and bichromatic closest pairs | 1992-06-25 | Paper |
| Ranking intervals under visibility constraints∗ | 1990-01-01 | Paper |
| Combinatorial complexity bounds for arrangements of curves and spheres | 1990-01-01 | Paper |
| Boundary graph grammars with dynamic edge relabeling | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355263 | 1990-01-01 | Paper |
| Implicitly representing arrangements of lines or segments | 1989-01-01 | Paper |
| Quasi-optimal range searching in spaces of finite VC-dimension | 1989-01-01 | Paper |
| Testing the necklace condition for shortest tours and optimal factors in the plane | 1989-01-01 | Paper |
| Congruence, similarity, and symmetries of geometric objects | 1988-01-01 | Paper |
| Visibility graphs and obstacle-avoiding shortest paths | 1988-01-01 | Paper |
| \(\epsilon\)-nets and simplex range queries | 1987-01-01 | Paper |
| String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing | 1987-01-01 | Paper |
| Combinatorial properties of boundary NLC graph languages | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785991 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776619 | 1987-01-01 | Paper |
| Halfplanar range search in linear space and \(O(n^{0.695})\) query time | 1986-01-01 | Paper |
| More on k-sets of finite sets in the plane | 1986-01-01 | Paper |
| Boundary NLC graph grammars—Basic definitions, normal forms, and complexity | 1986-01-01 | Paper |
| On the maximal number of edges of many faces in an arrangement | 1986-01-01 | Paper |
| The bounded degree problem for NLC grammars is decidable | 1986-01-01 | Paper |
| Constructing Belts in Two-Dimensional Arrangements with Applications | 1986-01-01 | Paper |
| Graph theoretic closure properties of the family of boundary NLC graph languages | 1986-01-01 | Paper |
| Trace languages defined by regular string languages | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714483 | 1986-01-01 | Paper |
| Denseness, maximality, and decidability of grammatical families | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3697698 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322153 | 1985-01-01 | Paper |
| Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time | 1985-01-01 | Paper |
| Complexity and decidability for chain code picture languages | 1985-01-01 | Paper |
| On the number of line separations of a finite set in the plane | 1985-01-01 | Paper |
| Recurrent words and simultaneous growth in T0L systems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692891 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347320 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707422 | 1984-01-01 | Paper |
| Symmetric graphs and interpretations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221428 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673567 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309090 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673129 | 1983-01-01 | Paper |
| Stabbing line segments | 1982-01-01 | Paper |
| Color-families are dense | 1982-01-01 | Paper |
| Using string languages to describe picture languages | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3925890 | 1981-01-01 | Paper |
| On the complexity of the general coloring problem | 1981-01-01 | Paper |
