| Publication | Date of Publication | Type |
|---|
| Graph product structure for non-minor-closed classes | 2023-08-10 | Paper |
| Separating layered treewidth and row treewidth | 2023-05-30 | Paper |
| Clustered 3-colouring graphs of bounded degree | 2023-03-31 | Paper |
| Dual circumference and collinear sets | 2023-01-23 | Paper |
| Adjacency Labelling for Planar Graphs (and Beyond) | 2022-12-08 | Paper |
| Geodesic obstacle representation of graphs | 2022-11-16 | Paper |
| \(2\times n\) grids have unbounded anagram-free chromatic number | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088959 | 2022-07-18 | Paper |
| Stack-number is not bounded by queue-number | 2022-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075735 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002693 | 2021-07-28 | Paper |
| Every collinear set in a planar graph is free | 2021-04-29 | Paper |
| Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers | 2021-04-19 | Paper |
| Local routing in WSPD-based spanners | 2021-03-17 | Paper |
| Two Results on Layered Pathwidth and Linear Layouts | 2021-01-19 | Paper |
| Face flips in origami tessellations | 2020-11-12 | Paper |
| Planar Graphs Have Bounded Queue-Number | 2020-11-11 | Paper |
| Minor-Closed Graph Classes with Bounded Layered Pathwidth | 2020-10-28 | Paper |
| Planar graphs have bounded nonrepetitive chromatic number | 2020-10-20 | Paper |
| Notes on growing a tree in a graph | 2019-11-07 | Paper |
| Every collinear set in a planar graph is free | 2019-10-15 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | Paper |
| Pole Dancing: 3D Morphs for Tree Drawings | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633858 | 2019-05-06 | Paper |
| Track layouts, layered path decompositions, and leveled planarity | 2019-04-25 | Paper |
| More Turán-type theorems for triangles in convex point sets | 2019-03-05 | Paper |
| Drawing planar graphs with many collinear vertices | 2019-02-27 | Paper |
| Thickness and Antithickness of Graphs | 2019-02-27 | Paper |
| EPG-representations with Small Grid-Size | 2019-02-20 | Paper |
| Pole dancing: 3D morphs for tree drawings | 2019-02-15 | Paper |
| Corrigendum: Orthogonal Tree Decompositions of Graphs | 2018-12-19 | Paper |
| Anagram-free chromatic number is not pathwidth-bounded | 2018-11-22 | Paper |
| Orthogonal Tree Decompositions of Graphs | 2018-04-11 | Paper |
| Stack and Queue Layouts via Layered Separators | 2018-01-12 | Paper |
| New bounds for facial nonrepetitive colouring | 2017-10-11 | Paper |
| Compatible Connectivity-Augmentation of Planar Disconnected Graphs | 2017-10-05 | Paper |
| The number of lines tangent to arbitrary convex polyhedra in 3D | 2017-09-29 | Paper |
| Layered separators in minor-closed graph classes with applications | 2017-09-29 | Paper |
| Local routing in spanners based on WSPDs | 2017-09-22 | Paper |
| Structure of Graphs with Locally Restricted Crossings | 2017-05-24 | Paper |
| Nonrepetitive colouring via entropy compression | 2017-04-25 | Paper |
| The Utility of Untangling | 2017-04-05 | Paper |
| Drawing Planar Graphs with Many Collinear Vertices | 2017-02-21 | Paper |
| Track Layout Is Hard | 2017-02-21 | Paper |
| Stack and Queue Layouts via Layered Separators | 2017-02-21 | Paper |
| The Utility of Untangling | 2017-02-10 | Paper |
| Genus, Treewidth, and Local Crossing Number | 2017-02-10 | Paper |
| Layouts of Expander Graphs | 2016-02-01 | Paper |
| Compatible connectivity augmentation of planar disconnected graphs | 2015-12-02 | Paper |
| Empty Pentagons in Point Sets with Collinearities | 2015-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941395 | 2015-08-28 | Paper |
| On obstacle numbers | 2015-08-27 | Paper |
| Average stretch factor: how low does it go? | 2015-04-16 | Paper |
| Robust Geometric Spanners | 2015-02-17 | Paper |
| Graph layouts via layered separators | 2014-11-21 | Paper |
| Entropy, triangulation, and point location in planar subdivisions | 2014-09-09 | Paper |
| Crossings in grid drawings | 2014-09-04 | Paper |
| Notes on large angle crossing graphs | 2014-05-06 | Paper |
| A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph | 2014-04-10 | Paper |
| On the book thickness of $k$-trees | 2014-03-25 | Paper |
| Triangulating and guarding realistic polygons | 2014-01-22 | Paper |
| Robust Geometric Spanners | 2013-11-14 | Paper |
| A Polynomial Bound for Untangling Geometric Planar Graphs | 2013-06-28 | Paper |
| GHOST CHIMNEYS | 2013-06-24 | Paper |
| PROXIMITY GRAPHS: E, δ, Δ, χ AND ω | 2013-06-24 | Paper |
| Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours | 2013-06-07 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| A center transversal theorem for hyperplanes and applications to graph drawing | 2013-03-18 | Paper |
| Meshes Preserving Minimum Feature Size | 2013-01-07 | Paper |
| An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains | 2013-01-04 | Paper |
| Fast local searches and updates in bounded universes | 2012-12-04 | Paper |
| On point-sets that support planar graphs | 2012-10-12 | Paper |
| An affine invariant \(k\)-nearest neighbor regression estimate | 2012-09-26 | Paper |
| Memoryless routing in convex subdivisions: random walks are optimal | 2012-05-18 | Paper |
| Biased range trees | 2012-04-26 | Paper |
| Layered working-set trees | 2012-04-26 | Paper |
| On Point-Sets That Support Planar Graphs | 2012-03-09 | Paper |
| Every large point set contains many collinear points or an empty pentagon | 2012-01-24 | Paper |
| On the maximum number of cliques in a graph embedded in a surface | 2011-11-29 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| On Graphs Supported by Line Sets | 2011-02-11 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| A note on the perimeter of fat objects | 2010-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579416 | 2010-08-06 | Paper |
| An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times | 2010-06-22 | Paper |
| Layered Working-Set Trees | 2010-04-27 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| A polynomial bound for untangling geometric planar graphs | 2009-12-14 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Distinct distances in graph drawings | 2009-04-07 | Paper |
| Improved upper bounds on the crossing number | 2009-02-12 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Fixed parameter algorithms for one-sided crossing minimization revisited | 2008-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387656 | 2008-05-27 | Paper |
| MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT | 2008-05-14 | Paper |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 2008-04-22 | Paper |
| Graph drawings with few slopes | 2007-10-12 | Paper |
| Drawings of planar graphs with few slopes and segments | 2007-10-12 | Paper |
| Graph treewidth and geometric thickness parameters | 2007-06-21 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Upward three-dimensional grid drawings of graphs | 2006-09-14 | Paper |
| A fixed-parameter approach to 2-layer planarization | 2006-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480768 | 2006-08-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Layout of Graphs with Bounded Tree-Width | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667610 | 2005-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667621 | 2005-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657578 | 2005-03-14 | Paper |
| A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043700 | 2004-08-06 | Paper |
| The Expected Number of 3D Visibility Events Is Linear | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422261 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422268 | 2003-09-03 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768382 | 2002-07-22 | Paper |
