| Publication | Date of Publication | Type |
|---|
| Reconfiguration of non-crossing spanning trees | 2024-12-19 | Paper |
| The geodesic edge center of a simple polygon | 2024-10-16 | Paper |
| Dispersion for intervals: a geometric approach | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179335 | 2023-12-16 | Paper |
| Minimum shared‐power edge cut | 2023-11-15 | Paper |
| Bounded-Angle Minimum Spanning Trees | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075904 | 2023-09-20 | Paper |
| The Visibility Center of a Simple Polygon | 2023-09-20 | Paper |
| Token Swapping on Trees | 2023-05-31 | Paper |
| Pattern matching for permutations | 2023-01-18 | Paper |
| The Complexity of Drawing a Graph in a Polygonal Region | 2022-11-14 | Paper |
| Rigid flattening of polyhedra with slits | 2022-05-24 | Paper |
| Bounded-angle minimum spanning trees | 2022-02-01 | Paper |
| Rollercoasters and Caterpillars | 2021-07-28 | Paper |
| Minimum ply covering of points with disks and squares | 2021-01-07 | Paper |
| Face flips in origami tessellations | 2020-11-12 | Paper |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 2020-10-23 | Paper |
| Shortest paths and convex hulls in 2D complexes with non-positive curvature | 2020-10-23 | Paper |
| On compatible triangulations with a minimum number of Steiner points | 2020-08-17 | Paper |
| Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs | 2020-02-24 | Paper |
| Partitioning orthogonal histograms into rectangular boxes | 2020-02-12 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
| Recognition and drawing of stick graphs | 2019-11-13 | Paper |
| Convexity-increasing morphs of planar graphs | 2019-10-25 | Paper |
| Rollercoasters: Long Sequences without Short Runs | 2019-08-29 | Paper |
| Construction and Local Routing for Angle-Monotone Graphs | 2019-05-24 | Paper |
| A proof of the orbit conjecture for flipping edge-labelled triangulations | 2019-05-21 | Paper |
| Morphing Planar Graph Drawings with a Polynomial Number of Steps | 2019-05-15 | Paper |
| Morphing Schnyder drawings of planar triangulations | 2019-04-25 | Paper |
| Flat foldings of plane graphs with prescribed angles and edge lengths | 2019-02-27 | Paper |
| Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges | 2019-02-20 | Paper |
| Recognition and drawing of stick graphs | 2019-02-15 | Paper |
| The complexity of drawing a graph in a polygonal region | 2019-02-15 | Paper |
| Convexity-increasing morphs of planar graphs | 2018-11-22 | Paper |
| Construction and local routing for angle-monotone graphs | 2018-11-22 | Paper |
| A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations | 2018-08-13 | Paper |
| Continuously Flattening Polyhedra Using Straight Skeletons | 2018-04-23 | Paper |
| Fractional coverings, greedy coverings, and rectifier networks | 2018-04-19 | Paper |
| On the planar split thickness of graphs | 2018-04-11 | Paper |
| Flipping edge-labelled triangulations | 2018-02-19 | Paper |
| Visibility graphs, dismantlability, and the cops and robbers game | 2018-02-12 | Paper |
| Star Unfolding from a Geodesic Curve | 2017-10-10 | Paper |
| Optimal Morphs of Convex Drawings | 2017-10-10 | Paper |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 2017-09-22 | Paper |
| How to Morph Planar Graph Drawings | 2017-05-30 | Paper |
| Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition | 2017-02-21 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| Star unfolding from a geodesic curve | 2016-12-20 | Paper |
| Some Counterexamples for Compatible Triangulations | 2016-12-09 | Paper |
| Reconfiguring Ordered Bases of a Matroid | 2016-12-03 | Paper |
| Pattern matching for permutations | 2016-06-09 | Paper |
| On the planar split thickness of graphs | 2016-05-03 | Paper |
| Folding a paper strip to minimize thickness | 2016-02-18 | Paper |
| Flip distance between two triangulations of a point set is NP-complete | 2016-01-29 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2016-01-07 | Paper |
| Folding a Paper Strip to Minimize Thickness | 2015-02-27 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2015-01-07 | Paper |
| Morphing Schnyder drawings of planar triangulations | 2015-01-07 | Paper |
| Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths | 2015-01-07 | Paper |
| Morphing orthogonal planar graph drawings | 2014-12-05 | Paper |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms | 2014-03-31 | Paper |
| Reprint of: Refold rigidity of convex polyhedra | 2014-01-22 | Paper |
| Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations | 2013-12-20 | Paper |
| Smart-Grid Electricity Allocation via Strip Packing with Slicing | 2013-08-12 | Paper |
| Shortest paths avoiding forbidden subpaths | 2013-08-06 | Paper |
| Refold rigidity of convex polyhedra | 2013-07-31 | Paper |
| Morphing Planar Graph Drawings with Bent Edges | 2013-06-28 | Paper |
| Testing Simultaneous Planarity when the Common Graph is 2-Connected | 2013-04-09 | Paper |
| Self-approaching Graphs | 2013-04-03 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| A Generalization of the Source Unfolding of Convex Polyhedra | 2013-01-07 | Paper |
| Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area | 2013-01-07 | Paper |
| The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs | 2012-12-04 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM | 2012-06-20 | Paper |
| Shortest Paths Avoiding Forbidden Subpaths | 2012-04-24 | Paper |
| The shape of orthogonal cycles in three dimensions | 2012-04-04 | Paper |
| Algorithms for Solving Rubik’s Cubes | 2011-09-16 | Paper |
| Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs | 2011-06-17 | Paper |
| Morphing Planar Graph Drawings with Bent Edges | 2011-04-19 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Simultaneous Interval Graphs | 2010-12-09 | Paper |
| Testing Simultaneous Planarity When the Common Graph Is 2-Connected | 2010-12-09 | Paper |
| Morphing orthogonal planar graph drawings | 2010-08-16 | Paper |
| Touring a sequence of polygons | 2010-08-16 | Paper |
| A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING | 2010-07-27 | Paper |
| Approximation algorithms for shortest descending paths in terrains | 2010-05-25 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs | 2009-10-20 | Paper |
| Morphing polyhedra with parallel faces: Counterexamples | 2009-06-18 | Paper |
| Shortest descending paths through given faces | 2009-06-18 | Paper |
| Shortest Gently Descending Paths | 2009-02-24 | Paper |
| Cauchy’s Theorem and Edge Lengths of Convex Polyhedra | 2009-02-17 | Paper |
| Equiprojective polyhedra | 2008-04-28 | Paper |
| On simultaneous planar graph embeddings | 2006-12-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Computing homotopic shortest paths efficiently | 2006-10-25 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| When can a net fold to a polyhedron? | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024789 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472317 | 2004-08-04 | Paper |
| Elastic labels around the perimeter of a map | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411377 | 2003-07-08 | Paper |
| Efficient visibility queries in simple polygons | 2003-03-10 | Paper |
| Embedding problems for paths with direction constrained edges. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766815 | 2002-07-22 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| Enumerating foldings and unfoldings between polygons and polytopes | 2002-05-14 | Paper |
| Efficient Algorithms for Petersen's Matching Theorem | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504019 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252395 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252281 | 1999-06-17 | Paper |
| A Visibility Representation for Graphs in Three Dimensions | 1998-07-05 | Paper |
| The rectangle of influence drawability problem | 1998-06-08 | Paper |
| The Floodlight Problem | 1997-07-27 | Paper |
| Visibility graphs of towers | 1997-03-18 | Paper |
| Convergents of folded continued fractions | 1996-10-10 | Paper |
| Upward Planar Drawing of Single-Source Acyclic Digraphs | 1996-08-18 | Paper |
| Dominating cliques in chordal graphs | 1994-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138287 | 1994-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138955 | 1993-10-20 | Paper |
| DISTANCE VISIBILITY GRAPHS | 1993-10-17 | Paper |
| A weighted min-max relation for intervals | 1992-06-28 | Paper |
| Short-chorded and perfect graphs | 1992-06-25 | Paper |
| A lower bound for the integer element distinctness problem | 1992-06-25 | Paper |
| Noncrossing Subgraphs in Topological Layouts | 1991-01-01 | Paper |
| Counterexample to a conjecture of Szymanski on hypercube routing | 1990-01-01 | Paper |
| The Boolean Basis Problem and How to Cover Some Polygons by Rectangles | 1990-01-01 | Paper |
| A note on odd/even cycles | 1988-01-01 | Paper |
| Doubly Lexical Orderings of Matrices | 1987-01-01 | Paper |
| Some NP-Complete Problems Similar to Graph Isomorphism | 1981-01-01 | Paper |
| Super Guarding and Dark Rays in Art Galleries | N/A | Paper |
