| Publication | Date of Publication | Type |
|---|
| Positive links with arrangements of pseudocircles as shadows | 2023-12-21 | Paper |
| Drawings of complete graphs in the projective plane | 2023-10-04 | Paper |
| Regular projections of the link L6n1 | 2023-03-10 | Paper |
| Convex drawings of the complete graph: topology meets geometry | 2022-07-15 | Paper |
| Rotation systems and simple drawings in surfaces | 2022-07-01 | Paper |
| Embeddability of arrangements of pseudocircles and graphs on surfaces | 2020-09-01 | Paper |
| Toroidal grid minors and stretch in embedded graphs | 2020-01-15 | Paper |
| The knots that lie above all shadows | 2019-11-06 | Paper |
| The unavoidable rotation systems | 2019-10-28 | Paper |
| Closing in on Hill's Conjecture | 2019-08-29 | Paper |
| The unavoidable arrangements of pseudocircles | 2019-06-26 | Paper |
| When can a link be obtained from another using crossing exchanges and smoothings? | 2019-05-23 | Paper |
| Well-quasi-order of plane minors and an application to link diagrams | 2019-05-06 | Paper |
| On the Number of Unknot Diagrams | 2019-02-06 | Paper |
| Levi's Lemma, pseudolinear drawings of , and empty triangles | 2018-04-27 | Paper |
| Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves. Gioan's Theorem | 2017-11-29 | Paper |
| On the Pseudolinear Crossing Number | 2017-04-21 | Paper |
| Large Area Convex Holes in Random Point Sets | 2016-09-22 | Paper |
| Characterizing 2-crossing-critical graphs | 2016-02-11 | Paper |
| On the Decay of Crossing Numbers of Sparse Graphs | 2016-02-01 | Paper |
| On Hardness of the Joint Crossing Number | 2016-01-11 | Paper |
| Book Embeddings of Regular Graphs | 2015-06-08 | Paper |
| Embedding a Graph‐Like Continuum in Some Surface | 2015-05-22 | Paper |
| Shellable drawings and the cylindrical crossing number of \(K_n\) | 2015-02-03 | Paper |
| The optimal drawings of \(K_{5,n}\) | 2014-10-23 | Paper |
| The 2-page crossing number of K n | 2014-08-07 | Paper |
| Book drawings of complete bipartite graphs | 2014-03-27 | Paper |
| The Erd\H{o}s-S\'os Conjecture for Geometric Graphs | 2014-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857359 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857403 | 2013-11-01 | Paper |
| Improved Lower Bounds on Book Crossing Numbers of Complete Graphs | 2013-09-26 | Paper |
| The Rectilinear Crossing Number of K n : Closing in (or Are We?) | 2013-09-25 | Paper |
| The 2-page crossing number of \(K_{n}\) | 2013-08-05 | Paper |
| Stars and Bonds in Crossing-Critical Graphs | 2013-06-28 | Paper |
| Making a graph crossing-critical by multiplying its edges | 2013-06-07 | Paper |
| Large convex holes in random point sets | 2013-04-29 | Paper |
| Zarankiewicz's conjecture is finite for each fixed \(m\) | 2013-04-17 | Paper |
| Convexifying Monotone Polygons while Maintaining Internal Visibility | 2013-01-07 | Paper |
| On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) | 2012-08-13 | Paper |
| Visibility-preserving convexifications using single-vertex moves | 2012-05-04 | Paper |
| Nested cycles in large triangulations and crossing-critical graphs | 2012-03-19 | Paper |
| Stars and bonds in crossing-critical graphs | 2011-01-19 | Paper |
| The number of generalized balanced lines | 2010-11-08 | Paper |
| 3-symmetric and 3-decomposable geometric drawings of \(K_n\) | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656225 | 2010-01-13 | Paper |
| Balanced lines in two-coloured point sets | 2009-05-20 | Paper |
| The crossing number of a projective graph is quadratic in the face-width | 2009-04-07 | Paper |
| An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) | 2008-12-08 | Paper |
| ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS | 2008-12-01 | Paper |
| The crossing number of a projective graph is quadratic in the face–width | 2008-06-05 | Paper |
| The maximum number of halving lines and the rectilinear crossing number of for | 2008-06-05 | Paper |
| A central approach to bound the number of crossings in a generalized configuration | 2008-06-05 | Paper |
| Approximating the Crossing Number of Toroidal Graphs | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442375 | 2008-02-22 | Paper |
| Simple Euclidean arrangements with no \((\geq 5)\)-gons | 2008-01-04 | Paper |
| On 3-decomposable geometric drawings of $K_n$ | 2007-12-27 | Paper |
| On the Crossing Number of Almost Planar Graphs | 2007-08-28 | Paper |
| Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position | 2007-02-07 | Paper |
| Nearly light cycles in embedded graphs and crossing-critical graphs | 2007-02-07 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| On the length of longest alternating paths for multicoloured point sets in convex position | 2006-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485345 | 2006-08-29 | Paper |
| \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) | 2006-08-11 | Paper |
| Improved Bounds for the Crossing Numbers of Km,n and Kn | 2006-06-01 | Paper |
| Two maps with large representativity on one surface | 2005-12-08 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| On the crossing numbers of loop networks and generalized Petersen graphs | 2005-12-06 | Paper |
| On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets | 2005-11-24 | Paper |
| Master-slave synchronization of affine cellular automaton pairs | 2005-10-18 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:3156923 The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)] | 2005-01-12 | Paper |
| An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments | 2004-12-13 | Paper |
| Embedding grids in surfaces | 2004-10-04 | Paper |
| Infinite families of crossing-critical graphs with given average degree | 2003-09-25 | Paper |
| Optimal meshes of curves in the Klein bottle | 2003-08-25 | Paper |
| Small meshes of curves and their role in the analysis of optimal meshes | 2003-04-09 | Paper |
| On a crossing number result of Richter and Thomassen | 2002-12-10 | Paper |
| Drawings of \(C_m\times C_n\) with one disjoint family. II | 2002-12-10 | Paper |
| The crossing number of \(P(N,3)\) | 2002-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712593 | 2002-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712518 | 2001-11-09 | Paper |
| A cryptosystem based on cellular automata | 2001-08-14 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4521491 A lower bound for the crossing number ofCm � Cn] | 2001-04-20 | Paper |
| Internal symmetries of cellular automata via their polynomial representation | 2000-11-12 | Paper |
| Synchronization of cellular automaton pairs | 2000-11-12 | Paper |
| The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m | 2000-09-26 | Paper |
| Drawings of \(C_m\times C_n\) with one disjoint family | 1999-12-20 | Paper |
| On the intersections of systems of curves | 1999-11-21 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4242968 On the crossing number ofcm �cn] | 1999-10-17 | Paper |
