| Publication | Date of Publication | Type |
|---|
| The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs | 2024-12-03 | Paper |
| On the reconfiguration of chains | 2024-01-29 | Paper |
| Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs | 2023-11-16 | Paper |
| The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs | 2023-08-10 | Paper |
| 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids | 2023-07-03 | Paper |
| Combinatorial properties and recognition of unit square visibility graphs | 2023-05-12 | Paper |
| Nearest neighbour graph realizability is NP-hard | 2022-08-16 | Paper |
| 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids | 2022-07-13 | Paper |
| Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111244 | 2020-05-26 | Paper |
| Reconfiguring Hamiltonian cycles in L-shaped grid graphs | 2020-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560223 | 2018-12-10 | Paper |
| Kinetic \(k\)-semi-Yao graph and its applications | 2018-11-19 | Paper |
| Visibility representations of boxes in 2.5 dimensions | 2018-10-31 | Paper |
| On the planar split thickness of graphs | 2018-04-11 | Paper |
| Connecting a set of circles with minimum sum of radii | 2018-02-19 | Paper |
| Bend complexity and Hamiltonian cycles in grid graphs | 2017-10-23 | Paper |
| Connectivity graphs of uncertainty regions | 2017-10-09 | Paper |
| The complexity of (un)folding | 2017-09-29 | Paper |
| The number of lines tangent to arbitrary convex polyhedra in 3D | 2017-09-29 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| Visibility representations of boxes in 2.5 dimensions | 2017-02-21 | Paper |
| Monotone Simultaneous Embeddings of Paths in d Dimensions | 2017-02-21 | Paper |
| Constrained Light Deployment for Reducing Energy Consumption in Buildings | 2017-02-01 | Paper |
| On the planar split thickness of graphs | 2016-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3467152 | 2016-01-26 | Paper |
| Kinetic Reverse k-Nearest Neighbor Problem | 2015-09-15 | Paper |
| A simple, faster method for kinetic proximity problems | 2015-05-12 | Paper |
| Kinetic data structures for all nearest neighbors and closest pair in the plane | 2015-02-17 | Paper |
| Computing upward topological book embeddings of upward planar digraphs | 2015-02-13 | Paper |
| Acyclic Coloring with Few Division Vertices | 2014-08-19 | Paper |
| Acyclic coloring with few division vertices | 2014-08-13 | Paper |
| A note on minimum-segment drawings of planar graphs | 2013-07-09 | Paper |
| On Representing Graphs by Touching Cuboids | 2013-04-03 | Paper |
| Kinetic and Stationary Point-Set Embeddability for Plane Graphs | 2013-04-03 | Paper |
| Acyclic colorings of graph subdivisions revisited | 2013-01-18 | Paper |
| On Three-Dimensional Graph Drawing and Embedding | 2012-06-08 | Paper |
| The shape of orthogonal cycles in three dimensions | 2012-04-04 | Paper |
| Embedding Plane 3-Trees in ℝ2 and ℝ3 | 2012-03-09 | Paper |
| Acyclic Colorings of Graph Subdivisions | 2012-01-13 | Paper |
| Connecting a set of circles with minimum sum of radii | 2011-08-12 | Paper |
| A SUCCINCT 3D VISIBILITY SKELETON | 2011-03-25 | Paper |
| Connectivity graphs of uncertainty regions | 2010-12-09 | Paper |
| Milling a Graph with Turn Costs: A Parameterized Complexity Perspective | 2010-11-16 | Paper |
| On the Computation of 3D Visibility Skeletons | 2010-07-20 | Paper |
| Intractability in graph drawing and geometry: FPT approaches | 2009-12-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Embeddability Problems for Upward Planar Digraphs | 2009-03-03 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | 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 |
| The strength of weak proximity | 2006-10-31 | Paper |
| A fixed-parameter approach to 2-layer planarization | 2006-08-11 | Paper |
| Experiments with the Fixed-Parameter Approach for Two-Layer Planarization | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Transversals to line segments in three-dimensional space | 2005-11-10 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657574 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4472317 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474069 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422268 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418634 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
| Embedding problems for paths with direction constrained edges. | 2003-01-21 | Paper |
| Curvature-Constrained Shortest Paths in a Convex Polygon | 2003-01-05 | Paper |
| On validating planar worlds | 2002-07-22 | Paper |
| Locked and unlocked polygonal chains in three dimensions | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766815 | 2002-07-22 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| Three-dimensional orthogonal graph drawing algorithms | 2000-07-11 | Paper |
| The largest \(k\)-ball in a \(d\)-dimensional box | 1998-12-21 | Paper |
| A Visibility Representation for Graphs in Three Dimensions | 1998-07-05 | Paper |
| The rectangle of influence drawability problem | 1998-06-08 | Paper |
| Localizing a Robot with Minimum Travel | 1998-05-10 | Paper |
| Universal 3-dimensional visibility representations for graphs | 1998-04-13 | Paper |
| Simultaneous dominance representation of multiple posets | 1997-08-05 | Paper |
| The logic engine and the realization problem for nearest neighbor graphs | 1997-02-27 | Paper |
| The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings | 1997-02-27 | Paper |
| The realization problem for Euclidean minimum spanning trees is NP-hard | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886076 | 1996-11-04 | Paper |
| Folding rulers inside triangles | 1996-09-22 | Paper |
| Reconfiguring closed polygonal chains in Euclidean \(d\)-space | 1995-03-20 | Paper |
| Drawing graphs in two layers | 1994-08-29 | Paper |
| Grid intersection graphs and boxicity | 1993-10-24 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| On the Movement of Robot Arms in 2-Dimensional Bounded Regions | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716332 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3733669 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686753 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184933 | 1984-01-01 | Paper |
| Movement Problems for 2-Dimensional Linkages | 1984-01-01 | Paper |
| Edge-colored complete graphs with alternating cycles | 1983-01-01 | Paper |
| A classification of certain graphs with minimal imperfection properties | 1982-01-01 | Paper |
| An algorithm for finding clique cut-sets | 1981-01-01 | Paper |
| Collineations of projective planes of order 10. Part I | 1979-01-01 | Paper |
| Collineations of projective planes of order 10, part II | 1979-01-01 | Paper |
| A note on a generalized regularity condition | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105687 | 1976-01-01 | Paper |
