| Publication | Date of Publication | Type |
|---|
| RAC-Drawability is ∃ℝ-complete and Related Results | 2023-12-20 | Paper |
| The Complexity of Angular Resolution | 2023-09-20 | Paper |
| Hanani-Tutte for radial planarity. II | 2023-02-17 | Paper |
| Hanani--Tutte and Hierarchical Partial Planarity | 2022-12-02 | Paper |
| RAC-drawability is \(\exists \mathbb{R} \)-complete | 2022-07-01 | Paper |
| The Degenerate Crossing Number and Higher-Genus Embeddings | 2022-06-28 | Paper |
| Spiraling and Folding: The Topological View | 2022-06-15 | Paper |
| A new algorithm for embedding plane graphs at fixed vertex locations | 2022-04-04 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| RAC-drawability is $\exists\mathbb{R}$-complete | 2021-07-24 | Paper |
| Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs | 2021-07-02 | Paper |
| A Note on the Maximum Rectilinear Crossing Number of Spiders | 2021-04-14 | Paper |
| On the Complexity of Some Geometric Problems With Fixed Parameters | 2021-03-29 | Paper |
| Complexity of Geometric k-Planarity for Fixed k | 2021-01-19 | Paper |
| Strong Hanani-Tutte for the Torus | 2020-09-01 | Paper |
| Link crossing number is NP-hard | 2020-08-27 | Paper |
| Practical Experience with Hanani-Tutte for Testing c-Planarity | 2019-09-12 | Paper |
| The complexity of tensor rank | 2018-07-23 | Paper |
| Crossing Numbers of Graphs | 2017-11-10 | Paper |
| Hanani-Tutte for Radial Planarity | 2017-04-05 | Paper |
| Fixed points, Nash equilibria, and the existential theory of the reals | 2017-03-31 | Paper |
| Hanani-Tutte for Radial Planarity II | 2017-02-21 | Paper |
| The Degenerate Crossing Number and Higher-Genus Embeddings | 2017-02-10 | Paper |
| Hanani-Tutte for Radial Planarity | 2017-02-10 | Paper |
| Multi-sided boundary labeling | 2016-11-01 | Paper |
| Graph Ramsey theory and the polynomial hierarchy | 2016-09-29 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2016-01-07 | Paper |
| Hanani-Tutte and Related Results | 2015-06-24 | Paper |
| Decidability of string graphs | 2015-02-27 | Paper |
| Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph | 2015-01-07 | Paper |
| A Crossing Lemma for the Pair-Crossing Number | 2015-01-07 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2015-01-07 | Paper |
| Block Additivity of ℤ2-Embeddings | 2013-12-20 | Paper |
| Realizability of Graphs and Linkages | 2013-09-25 | Paper |
| Hanani–Tutte, Monotone Drawings, and Level-Planarity | 2013-09-25 | Paper |
| Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants | 2013-08-13 | Paper |
| Two-Sided Boundary Labeling with Adjacent Sides | 2013-08-12 | Paper |
| The graph crossing number and its variants: a survey | 2013-06-07 | Paper |
| Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants | 2013-04-03 | Paper |
| On the Induced Matching Problem | 2013-03-19 | Paper |
| Adjacent Crossings Do Matter | 2012-12-07 | Paper |
| Adjacent Crossings Do Matter | 2012-03-09 | Paper |
| On the induced matching problem | 2012-01-11 | Paper |
| Hanani-Tutte and Monotone Drawings | 2011-12-16 | Paper |
| Crossing numbers of graphs with rotation systems | 2011-06-30 | Paper |
| Spiraling and folding: the word view | 2011-06-30 | Paper |
| Removing Independently Even Crossings | 2011-04-15 | Paper |
| Strong Hanani–Tutte on the Projective Plane | 2010-08-27 | Paper |
| Recognizing string graphs in NP | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576669 | 2010-07-30 | Paper |
| Removing Independently Even Crossings | 2010-04-27 | Paper |
| Complexity of Some Geometric and Topological Problems | 2010-04-27 | Paper |
| Removing even crossings on surfaces | 2009-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619952 | 2009-04-14 | Paper |
| The complexity of nonrepetitive coloring | 2009-03-04 | Paper |
| Removing Even Crossings on Surfaces | 2008-06-05 | Paper |
| Folding and Spiralling: The Word View | 2008-06-05 | Paper |
| Odd crossing number and crossing number are not the same | 2008-04-16 | Paper |
| Crossing Number of Graphs with Rotation Systems | 2008-03-25 | Paper |
| Crossing Numbers and Parameterized Complexity | 2008-03-25 | Paper |
| Removing even crossings | 2007-06-08 | Paper |
| Train tracks and confluent drawings | 2007-05-10 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Solvability of Graph Inequalities | 2006-06-01 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466045 | 2005-08-23 | Paper |
| Decidability of string graphs | 2004-11-22 | Paper |
| Recognizing string graphs in NP | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808657 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418681 | 2003-08-11 | Paper |
| Graph Ramsey theory and the polynomial hierarchy | 2002-06-03 | Paper |
| Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete | 2000-10-17 | Paper |
| Bounded Immunity and Btt-Reductions | 1999-09-21 | Paper |
| A guided tour of minimal indices and shortest descriptions | 1998-08-10 | Paper |
