| Publication | Date of Publication | Type |
|---|
| An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. | 2023-11-02 | Paper |
| The Generalized Combinatorial Lason-Alon-Zippel-Schwartz Nullstellensatz Lemma | 2023-05-18 | Paper |
| PL Morse theory in low dimensions | 2023-02-17 | Paper |
| An almost optimal bound on the number of intersections of two simple polygons | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091017 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091157 | 2022-07-21 | Paper |
| Towards a Geometric Understanding of the 4-Dimensional Point Groups | 2022-05-10 | Paper |
| Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs | 2022-03-22 | Paper |
| Optimal strategies in fractional games: vertex cover and domination | 2021-05-09 | Paper |
| Every collinear set in a planar graph is free | 2021-04-29 | Paper |
| Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles | 2021-04-01 | Paper |
| Characterization of the response maps of alternating-current networks | 2020-12-09 | Paper |
| Random polytopes and the wet part for arbitrary probability distributions | 2020-11-11 | Paper |
| Geometric multicut: shortest fences for separating groups of objects in the plane | 2020-10-23 | Paper |
| The geometric dilation of three points | 2020-01-31 | Paper |
| PL Morse theory in low dimensions | 2019-12-10 | Paper |
| A new metric between polygons, and how to compute it | 2019-12-04 | Paper |
| Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity | 2019-12-02 | Paper |
| Packing plane spanning graphs with short edges in complete geometric graphs | 2019-10-25 | Paper |
| Every collinear set in a planar graph is free | 2019-10-15 | Paper |
| The Maximum Number of Minimal Dominating Sets in a Tree | 2019-10-15 | Paper |
| Windrose Planarity | 2019-03-28 | Paper |
| The Number of Convex Polyominoes with Given Height and Width | 2019-03-04 | Paper |
| Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity | 2019-02-20 | Paper |
| Convex equipartitions of colored point sets | 2019-01-29 | Paper |
| The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases | 2019-01-11 | Paper |
| A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs | 2019-01-10 | Paper |
| Loopless Gray code enumeration and the Tower of Bucharest | 2018-11-23 | Paper |
| Pseudotriangulations, polytopes, and how to expand linkages | 2018-11-23 | Paper |
| Windrose Planarity: Embedding Graphs with Direction-Constrained Edges | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636491 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606338 | 2018-03-02 | Paper |
| Optimal triangulation of saddle surfaces | 2018-02-28 | Paper |
| Point sets with many non-crossing perfect matchings | 2018-02-19 | Paper |
| Congruence Testing of Point Sets in 4-Space. | 2018-01-30 | Paper |
| Saturated simple and 2-simple topological graphs with few edges | 2018-01-12 | Paper |
| Matching convex shapes with respect to the symmetric difference | 2017-12-05 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
| Planar minimally rigid graphs and pseudo-triangulations | 2017-09-29 | Paper |
| The complexity of (un)folding | 2017-09-29 | Paper |
| Incremental constructions con BRIO | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365066 | 2017-09-29 | Paper |
| Search for the end of a path in the d-dimensional grid and in other graphs | 2017-09-14 | Paper |
| Loopless Gray Code Enumeration and the Tower of Bucharest. | 2017-07-17 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:2970420 Quasi-Parallel Segments and Characterization of Unique Bichromatic
Matchings] | 2017-03-30 | Paper |
| Recursively-Regular Subdivisions and Applications | 2017-03-30 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968076 | 2017-03-09 | Paper |
| Saturated Simple and 2-simple Topological Graphs with Few Edges | 2016-10-21 | Paper |
| Congruence Testing of Point Sets in Three and Four Dimensions | 2016-05-25 | Paper |
| λ > 4 | 2015-11-19 | Paper |
| Finitely many smooth \(d\)-polytopes with \(n\) lattice points | 2015-06-26 | Paper |
| The infimum of the volumes of convex polytopes of any given facet areas is 0 | 2015-05-07 | Paper |
| Triangulations with Circular Arcs | 2015-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934587 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934673 | 2014-12-18 | Paper |
| Advantage in the discrete Voronoi game | 2014-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921734 | 2014-10-13 | Paper |
| Geometric clustering | 2014-09-09 | Paper |
| Add isotropic Gaussian kernels at own risk | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5404254 | 2014-03-24 | Paper |
| Flip graphs of bounded degree triangulations | 2014-02-14 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| Reprint of: Optimally solving a transportation problem using Voronoi diagrams | 2014-01-22 | Paper |
| There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems | 2013-11-04 | Paper |
| Formulae and Growth Rates of High-Dimensional Polycubes | 2013-10-10 | Paper |
| Flip Graphs of Bounded-Degree Triangulations | 2013-10-10 | Paper |
| Topological Hypergraphs | 2013-09-25 | Paper |
| Monotone Paths in Planar Convex Subdivisions and Polytopes | 2013-09-13 | Paper |
| Fixed-parameter tractability and lower bounds for stabbing problems | 2013-08-22 | Paper |
| Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions | 2013-08-05 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| Optimally solving a transportation problem using Voronoi diagrams | 2013-07-31 | Paper |
| Optimally solving a transportation problem using Voronoi diagrams | 2012-09-25 | Paper |
| Monotone Paths in Planar Convex Subdivisions | 2012-09-25 | Paper |
| Pointed drawings of planar graphs | 2012-09-21 | Paper |
| Realizing Planar Graphs as Convex Polytopes | 2012-03-09 | Paper |
| Triangulations with Circular Arcs | 2012-03-09 | Paper |
| Proper n-Cell Polycubes in n − 3 Dimensions | 2011-08-17 | Paper |
| Formulae and growth rates of high-dimensional polycubes | 2011-07-22 | Paper |
| Obnoxious Centers in Graphs | 2011-07-18 | Paper |
| On Constrained Minimum Pseudotriangulations | 2011-03-18 | Paper |
| Small grid embeddings of 3-polytopes | 2011-03-10 | Paper |
| Lines pinning lines | 2011-03-10 | Paper |
| Finding the Most Relevant Fragments in Networks | 2011-02-16 | Paper |
| Acyclic Orientation of Drawings | 2011-02-16 | Paper |
| Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? | 2011-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059230 | 2010-12-08 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579411 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576720 | 2010-07-30 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension | 2010-01-14 | Paper |
| Resolving Loads with Positive Interior Stresses | 2009-10-20 | Paper |
| On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs | 2009-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395954 | 2009-09-15 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Wooden geometric puzzles: Design and hardness proofs | 2009-08-06 | Paper |
| Bounds on the quality of the PCA bounding boxes | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619929 | 2009-04-14 | Paper |
| Embedding 3-polytopes on a small grid | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602870 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602884 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601515 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| Planar Embeddings of Graphs with Specified Edge Lengths | 2009-01-19 | Paper |
| Minimum-weight triangulation is NP-hard | 2008-12-21 | Paper |
| Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs | 2008-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514529 | 2008-07-21 | Paper |
| Three-clustering of points in the plane. | 2008-04-25 | Paper |
| There are not too many magic configurations | 2008-04-16 | Paper |
| Matching point sets with respect to the earth mover's distance | 2007-12-03 | Paper |
| Wooden Geometric Puzzles: Design and Hardness Proofs | 2007-11-15 | Paper |
| Acyclic Orientation of Drawings | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292193 | 2007-06-19 | Paper |
| Computational Topology | 2007-06-19 | Paper |
| Computing the Fréchet distance between piecewise smooth curves | 2007-06-04 | Paper |
| On the geometric dilation of closed curves, graphs, and point sets | 2007-03-12 | Paper |
| Strictly convex drawings of planar graphs | 2007-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415007 | 2007-01-12 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Threshold arrangements and the knapsack problem | 2006-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692723 | 2005-09-28 | Paper |
| Planar minimally rigid graphs and pseudo-triangulations | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657574 | 2005-03-14 | Paper |
| Non-crossing frameworks with non-crossing reciprocals | 2005-02-23 | Paper |
| Simple and optimal output-sensitive construction of contour trees using monotone paths | 2005-01-31 | Paper |
| Covering with ellipses | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828967 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471348 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471367 | 2004-07-28 | Paper |
| Matching planar maps | 2004-03-14 | Paper |
| Straightening polygonal arcs and convexifying polygonal cycles | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797605 | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787197 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542181 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537737 | 2002-06-20 | Paper |
| Triangles of extremal area or perimeter in a finite planar point set | 2002-04-01 | Paper |
| The Obnoxious Center Problem on a Tree | 2001-11-11 | Paper |
| Constant-level greedy triangulations approximate the MWT well | 2001-11-06 | Paper |
| Generalized self-approaching curves | 2001-04-04 | Paper |
| Upper bounds on the maximal number of facets of 0/1-polytopes | 2000-12-13 | Paper |
| A central limit theorem for convex chains in the square | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506430 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937095 | 2000-02-03 | Paper |
| A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269395 | 1999-10-31 | Paper |
| The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263471 | 1999-01-01 | Paper |
| Time complexity and linear-time approximation of the ancient two-machine flow shop | 1998-11-01 | Paper |
| Finding a shortest vector in a two-dimensional lattice modulo m | 1998-07-23 | Paper |
| A Visibility Representation for Graphs in Three Dimensions | 1998-07-05 | Paper |
| Approximation of convex figures by pairs of rectangles | 1998-06-08 | Paper |
| Matching convex shapes with respect to the symmetric difference | 1998-05-24 | Paper |
| Matching Shapes with a Reference Point | 1998-03-16 | Paper |
| Binary trees having a given number of nodes with 0, 1, and 2 children | 1998-03-12 | Paper |
| Counting convex polygons in planar point sets | 1997-02-27 | Paper |
| Triangulations intersect nicely | 1997-02-18 | Paper |
| Quasi-Monte-Carlo methods and the dispersion of point sequences | 1997-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4896594 | 1996-12-12 | Paper |
| Webs, iteration groups, and equivalent changes in probabilities | 1996-12-03 | Paper |
| On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes | 1996-09-18 | Paper |
| Vehicle routing in an automated warehouse: Analysis and optimization | 1996-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327360 | 1995-04-05 | Paper |
| Sequences with subword complexity \(2n\) | 1995-01-22 | Paper |
| Curves with increasing chords | 1994-12-12 | Paper |
| On the union of fat wedges and separating a collection of segments by a line | 1994-11-29 | Paper |
| The convex-hull-and-line traveling salesman problem: A solvable case | 1994-09-05 | Paper |
| A heuristic for decomposing traffic matrices in TDMA satellite communication | 1994-04-13 | Paper |
| Shortest paths for line segments | 1993-10-13 | Paper |
| Simultaneous inner and outer approximation of shapes | 1993-01-17 | Paper |
| Minimum-link paths among obstacles in the plane | 1993-01-17 | Paper |
| The convergence rate of the sandwich algorithm for approximating convex functions | 1993-01-11 | Paper |
| Counting convex \(k\)-gons in planar point sets | 1992-09-26 | Paper |
| Finding minimum area \(k\)-gons | 1992-06-28 | Paper |
| Sandwich approximation of univariate convex functions with an application to separable convex programming | 1992-06-28 | Paper |
| The n-line traveling salesman problem | 1992-06-28 | Paper |
| Computing the minimum Hausdorff distance between two point sets on a line under translation | 1992-06-26 | Paper |
| Counting \(k\)-subsets and convex \(k\)-gons in the plane | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359784 | 1991-01-01 | Paper |
| Geometric clusterings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355263 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477977 | 1990-01-01 | Paper |
| Computing the geodesic center of a simple polygon | 1989-01-01 | Paper |
| Testing the necklace condition for shortest tours and optimal factors in the plane | 1989-01-01 | Paper |
| Approximation of convex curves with application to the bicriterial minimum cost flow problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3487112 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776619 | 1987-01-01 | Paper |
| Minimizing the density of terminal assignments in layout design | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780430 | 1986-01-01 | Paper |
| A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion) | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336710 | 1985-01-01 | Paper |
