| Publication | Date of Publication | Type |
|---|
| Monochromatic spanning trees and matchings in ordered complete graphs | 2024-02-23 | Paper |
| Disjointness graphs of short polygonal chains | 2024-01-29 | Paper |
| Helly-type theorems for the ordering of the vertices of a hypergraph | 2023-12-19 | Paper |
| 1-planar unit distance graphs | 2023-10-02 | Paper |
| Saturated 2-plane drawings with few edges | 2023-09-13 | Paper |
| Monochromatic infinite sets in Minkowski planes | 2023-08-17 | Paper |
| Entanglement and extreme spin squeezing of unpolarized states | 2023-05-12 | Paper |
| Disjointness graphs of segments in the space | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881918 | 2023-03-13 | Paper |
| Peeling Sequences | 2022-11-10 | Paper |
| Crossing lemma for the odd-crossing number | 2022-10-06 | Paper |
| Quantum Wasserstein distance based on an optimization over separable states | 2022-09-20 | Paper |
| Scaling in income inequalities and its dynamical origin | 2022-08-18 | Paper |
| Crossings between non-homotopic edges | 2022-06-10 | Paper |
| Improvement on the crossing number of crossing-critical graphs | 2022-03-21 | Paper |
| Wealth distribution in modern societies: collected data and a master equation approach | 2022-03-01 | Paper |
| Crossings Between Non-homotopic Edges | 2021-12-01 | Paper |
| Improvement on the Crossing Number of Crossing-Critical Graphs | 2021-12-01 | Paper |
| A slightly better bound on the crossing number in terms of the pair-crossing number | 2021-05-29 | Paper |
| On the hollow enclosed by convex sets | 2021-03-16 | Paper |
| Detecting metrologically useful entanglement in the vicinity of Dicke states | 2021-02-19 | Paper |
| Permutationally invariant state reconstruction | 2020-12-02 | Paper |
| A crossing lemma for multigraphs | 2020-08-18 | Paper |
| Petruska's question on planar convex sets | 2020-07-08 | Paper |
| Crossings between non-homotopic edges | 2020-06-26 | Paper |
| A crossing lemma for multigraphs | 2020-06-16 | Paper |
| Improvement on the crossing number of crossing-critical graphs | 2020-03-03 | Paper |
| Many touchings force many crossings | 2019-07-17 | Paper |
| Entanglement between two spatially separated atomic modes | 2019-07-03 | Paper |
| An algorithm to find maximum area polygons circumscribed about a convex polygon | 2019-02-20 | Paper |
| Many Touchings Force Many Crossings | 2019-02-20 | Paper |
| The number of crossings in multigraphs with no empty lens | 2018-08-30 | Paper |
| Disjointness graphs of segments | 2018-08-13 | Paper |
| Block partitions: an extended view | 2018-07-23 | Paper |
| Improvements on the density of maximal 1‐planar graphs | 2018-07-13 | Paper |
| Note on \(k\)-planar crossing numbers | 2018-02-19 | Paper |
| Monotone paths in line arrangement | 2017-09-29 | Paper |
| Improving the crossing lemma by finding more crossings in sparse graphs | 2017-09-29 | Paper |
| Point sets with many k -sets | 2017-09-29 | Paper |
| Separation with restricted families of sets | 2016-08-18 | Paper |
| Erdős-Szekeres theorem for lines | 2015-10-14 | Paper |
| Survey on Decomposition of Multiple Coverings | 2015-06-24 | Paper |
| Saturated simple and \(k\)-simple topological graphs | 2015-05-12 | Paper |
| Quantum metrology from a quantum information science perspective | 2014-11-11 | Paper |
| A note on coloring line arrangements | 2014-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395566 | 2014-02-17 | Paper |
| Monochromatic empty triangles in two-colored point sets | 2013-11-29 | Paper |
| A Better Bound for the Pair-Crossing Number | 2013-09-25 | Paper |
| Separating families of convex sets | 2013-09-03 | Paper |
| Improvement on the decay of crossing numbers | 2013-06-26 | Paper |
| Monotone crossing number | 2013-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906940 | 2013-02-28 | Paper |
| Tangled Thrackles | 2013-01-07 | Paper |
| Simulating continuous quantum systems by mean field fluctuations | 2012-11-09 | Paper |
| Erdős-Szekeres theorem for point sets with forbidden subconfigurations | 2012-09-19 | Paper |
| Drawing Hamiltonian cycles with no large angles | 2012-06-12 | Paper |
| Monotone Crossing Number | 2012-03-09 | Paper |
| Entanglement witnesses in spin models | 2011-12-04 | Paper |
| Graph unique-maximum and conflict-free colorings | 2011-08-23 | Paper |
| Disjoint edges in topological graphs | 2011-06-27 | Paper |
| QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB | 2010-10-25 | Paper |
| Towards the Albertson conjecture | 2010-06-16 | Paper |
| Graph Unique-Maximum and Conflict-Free Colorings | 2010-05-28 | Paper |
| Drawing Hamiltonian Cycles with No Large Angles | 2010-04-27 | Paper |
| Convex polygons are cover-decomposable | 2010-04-12 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Cubic graphs have bounded slope parameter | 2010-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656724 | 2010-01-13 | Paper |
| Indecomposable Coverings | 2009-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3392556 | 2009-08-17 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Degenerate crossing numbers | 2009-04-27 | Paper |
| Cubic Graphs Have Bounded Slope Parameter | 2009-03-03 | Paper |
| Towards an implementation of the 3D visibility skeleton | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601546 | 2009-02-10 | Paper |
| Decomposition of multiple coverings into many parts | 2008-11-19 | Paper |
| Long alternating paths in bicolored point sets | 2008-09-04 | Paper |
| Note on the pair-crossing number and the odd-crossing number | 2008-08-19 | Paper |
| Crossing Stars in Topological Graphs | 2008-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514528 | 2008-07-21 | Paper |
| Drawing cubic graphs with at most five slopes | 2008-04-28 | Paper |
| The shortest distance among points in general position. | 2008-04-25 | Paper |
| Improvement on the Decay of Crossing Numbers | 2008-03-25 | Paper |
| Crossing Stars in Topological Graphs | 2008-03-18 | Paper |
| Multiple coverings of the plane with triangles | 2007-12-19 | Paper |
| Indecomposable Coverings | 2007-08-28 | Paper |
| Drawing Cubic Graphs with at Most Five Slopes | 2007-08-28 | Paper |
| How many ways can one draw a graph? | 2007-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424898 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5490276 | 2007-01-26 | Paper |
| Improving the crossing lemma by finding more crossings in sparse graphs | 2006-12-06 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE | 2006-10-16 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5474627 | 2006-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290279 | 2006-04-28 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Topological graphs with no large grids | 2005-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692720 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692722 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657589 | 2005-03-14 | Paper |
| Geometric graphs with no self-intersecting path of length three | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043722 | 2004-08-06 | Paper |
| Towards an implementation of the 3D visibility skeleton | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472322 | 2004-08-04 | Paper |
| Unavoidable configurations in complete topological graphs | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427885 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422289 | 2003-09-03 | Paper |
| Monotone paths in line arrangements | 2003-04-28 | Paper |
| Crossing numbers of random graphs | 2003-03-19 | Paper |
| Recognizing string graphs is decidable | 2003-03-17 | Paper |
| A modular version of the Erdős– Szekeres theorem | 2003-02-18 | Paper |
| Which crossing number is it anyway? | 2002-12-10 | Paper |
| Modeling nematohydrodynamics in liquid crystal devices | 2002-09-12 | Paper |
| Domain motion in confined liquid crystals | 2002-08-21 | Paper |
| Ramsey-type results for unions of comparability graphs | 2002-07-29 | Paper |
| Point sets with many \(k\)-sets | 2002-07-10 | Paper |
| Convex sets in the plane with three of every four meeting | 2002-02-13 | Paper |
| New bounds on crossing numbers | 2001-06-28 | Paper |
| Finding convex sets in convex positions | 2001-06-13 | Paper |
| An Erdős-Szekeres type problem in the plane | 2001-06-12 | Paper |
| Erdős-Szekeres-type theorems for segments and noncrossing convex sets | 2001-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484691 | 2001-03-15 | Paper |
| Note on geometric graphs | 2000-12-11 | Paper |
| Geometric graphs with few disjoint edges | 2000-06-27 | Paper |
| CNNUM stereo architecture and 3D template design techniques | 1999-06-20 | Paper |
| Ramsey-type results for geometric graphs. II | 1999-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225308 | 1999-01-18 | Paper |
| A generalisation of the Erdős-Szekeres theorem to disjoint convex sets | 1998-12-15 | Paper |
| Note on the Erdős-Szekeres theorem | 1998-12-15 | Paper |
| Graphs drawn with few crossings per edge | 1998-11-24 | Paper |
| Note on an art gallery problem | 1998-10-01 | Paper |
| Ramsey-type results for geometric graphs. I | 1998-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352331 | 1998-03-02 | Paper |
| A ramsey-type bound for rectangles | 1997-04-07 | Paper |
| A Ramsey-type problem on right-angled triangles in space | 1996-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885186 | 1996-07-15 | Paper |
| Note on a Ramsey-type problem in geometry | 1994-12-01 | Paper |
| Two trees are better than one | 0001-01-03 | Paper |
| Progressions in Euclidean Ramsey theory | 0001-01-03 | Paper |
