| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147513 | 2024-01-15 | Paper |
| Matchings in 1‐planar graphs with large minimum degree | 2023-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075904 | 2023-09-20 | Paper |
| Visibility representations of toroidal and Klein-bottle graphs | 2023-08-16 | Paper |
| Large Matchings in Maximal 1-planar graphs | 2023-01-03 | Paper |
| Finding large matchings in 1-planar graphs of minimum degree 3 | 2022-12-21 | Paper |
| On computing the vertex connectivity of 1-plane graphs | 2022-12-13 | Paper |
| Optimal orthogonal drawings of triconnected plane graphs | 2022-12-09 | Paper |
| On triangulating planar graphs under the four-connectivity constraint | 2022-12-09 | Paper |
| Drawing Halin-graphs with small height | 2022-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091172 | 2022-07-21 | Paper |
| Optimal-area visibility representations of outer-1-plane graphs | 2022-07-01 | Paper |
| Drawing outer-1-planar graphs revisited | 2022-06-28 | Paper |
| All subgraphs of a wheel are 5-coupled-choosable | 2022-03-22 | Paper |
| Area-efficient static and incremental graph drawings | 2021-12-20 | Paper |
| Horton-Strahler number, rooted pathwidth and upward drawings of trees | 2021-12-14 | Paper |
| Computing the vertex connectivity of a locally maximal 1-plane graph in linear time | 2021-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5014068 | 2021-12-04 | Paper |
| Rollercoasters and Caterpillars | 2021-07-28 | Paper |
| Quasiperiodic bobbin lace patterns | 2021-06-15 | Paper |
| Generalized LR-drawings of trees | 2021-05-14 | Paper |
| On orthogonally guarding orthogonal polygons with bounded treewidth | 2021-03-26 | Paper |
| All Subgraphs of a Wheel are 5-Coupled-Choosable | 2021-02-04 | Paper |
| Minimum ply covering of points with disks and squares | 2021-01-07 | Paper |
| A note on 1-planar graphs with minimum degree 7 | 2020-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136229 | 2020-11-25 | Paper |
| Line and plane cover numbers revisited | 2020-10-26 | Paper |
| Homotopy height, grid-major height and graph-drawing height | 2020-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116474 | 2020-08-25 | Paper |
| Crossing number for graphs with bounded pathwidth | 2020-04-09 | Paper |
| Packing boundary-anchored rectangles and squares | 2020-03-23 | 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 |
| Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) | 2020-01-22 | Paper |
| Segment representations with small resolution | 2019-11-21 | Paper |
| Are highly connected 1-planar graphs Hamiltonian? | 2019-11-05 | Paper |
| Rollercoasters: Long Sequences without Short Runs | 2019-08-29 | Paper |
| Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs | 2019-02-20 | Paper |
| EPG-representations with Small Grid-Size | 2019-02-20 | Paper |
| Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges | 2019-02-20 | Paper |
| On Upward Drawings of Trees on a Given Grid | 2019-02-20 | Paper |
| Finding big matchings in planar graphs quickly | 2019-02-20 | Paper |
| Grid-Obstacle Representations with Connections to Staircase Guarding | 2019-02-20 | Paper |
| Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation | 2019-01-11 | Paper |
| Finding Tutte paths in linear time | 2018-12-11 | Paper |
| Embedding-preserving rectangle visibility representations of nonplanar graphs | 2018-10-30 | Paper |
| Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) | 2018-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636499 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132853 | 2018-01-30 | Paper |
| Non-aligned Drawings of Planar Graphs | 2017-10-12 | Paper |
| 1-String B_2-VPG Representation of Planar Graphs | 2017-10-10 | Paper |
| A 2-approximation for the height of maximal outerplanar graph drawings | 2017-09-22 | Paper |
| Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs | 2017-09-22 | Paper |
| Planar Matchings for Weighted Straight Skeletons | 2017-05-19 | Paper |
| Ideal Drawings of Rooted Trees With Approximately Optimal Width | 2017-05-16 | Paper |
| On Guarding Orthogonal Polygons with Sliding Cameras | 2017-05-05 | Paper |
| Order-Preserving 1-String Representations of Planar Graphs | 2017-04-04 | Paper |
| $1$-string $B_2$-VPG representation of planar graphs | 2017-03-30 | Paper |
| Non-aligned Drawings of Planar Graphs | 2017-02-21 | Paper |
| Small-Area Orthogonal Drawings of 3-Connected Graphs | 2017-02-10 | Paper |
| Representing Directed Trees as Straight Skeletons | 2017-02-10 | Paper |
| Triangulating Planar Graphs While Keeping the Pathwidth Small | 2016-10-21 | Paper |
| The (3,1)-ordering for 4-connected planar triangulations | 2016-07-05 | Paper |
| Relating bends and size in orthogonal graph drawings | 2016-06-09 | Paper |
| Planar Matchings for Weighted Straight Skeletons | 2015-09-11 | Paper |
| Reprint of: Weighted straight skeletons in the plane | 2015-04-27 | Paper |
| Weighted straight skeletons in the plane | 2015-03-06 | Paper |
| Height-Preserving Transformations of Planar Graph Drawings | 2015-01-07 | Paper |
| A simple algorithm for computing positively weighted straight skeletons of monotone polygons | 2014-12-09 | Paper |
| Morphing orthogonal planar graph drawings | 2014-12-05 | Paper |
| On triangulating \(k\)-outerplanar graphs | 2014-12-05 | Paper |
| Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs | 2014-09-02 | Paper |
| THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS | 2014-08-11 | Paper |
| Computing cartograms with optimal complexity | 2014-08-07 | Paper |
| The point-set embeddability problem for plane graphs | 2014-08-07 | Paper |
| On Area-Optimal Planar Graph Drawings | 2014-07-01 | Paper |
| Guarding polyominoes | 2014-03-24 | Paper |
| Orthogonal cartograms with at most 12 corners per face | 2014-01-22 | Paper |
| Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings | 2013-12-20 | Paper |
| Computing cartograms with optimal complexity | 2013-11-06 | Paper |
| A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs | 2013-09-13 | Paper |
| Smart-Grid Electricity Allocation via Strip Packing with Slicing | 2013-08-12 | Paper |
| Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs | 2013-04-03 | Paper |
| A note on improving the performance of approximation algorithms for radiation therapy | 2013-03-28 | Paper |
| Drawing planar 3-trees with given face areas | 2013-01-25 | Paper |
| Faster optimal algorithms for segment minimization with small maximal value | 2013-01-18 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-12-07 | Paper |
| The art gallery theorem for polyominoes | 2012-10-15 | Paper |
| Drawing Planar Graphs on Points Inside a Polygon | 2012-09-25 | Paper |
| STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA | 2012-06-20 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-03-09 | Paper |
| Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames | 2012-03-09 | Paper |
| Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations | 2011-12-16 | Paper |
| Faster Optimal Algorithms for Segment Minimization with Small Maximal Value | 2011-08-12 | Paper |
| Orthogonal Cartograms with Few Corners Per Face | 2011-08-12 | Paper |
| Efficient view point selection for silhouettes of convex polyhedra | 2011-08-02 | Paper |
| Reconstructing orthogonal polyhedra from putative vertex sets | 2011-08-02 | Paper |
| Reconstructing polygons from scanner data | 2011-07-27 | Paper |
| RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS | 2011-05-11 | Paper |
| Finding Hidden Independent Sets in Interval Graphs | 2011-03-18 | Paper |
| Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs | 2011-03-10 | Paper |
| Sorting with networks of data structures | 2010-11-05 | Paper |
| Reconstructing \(hv\)-convex multi-coloured polyominoes | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575465 | 2010-07-27 | Paper |
| Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs | 2010-04-27 | Paper |
| Drawing Planar 3-Trees with Given Face-Areas | 2010-04-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Reconstructing Polygons from Scanner Data | 2009-12-17 | Paper |
| Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0 | 2009-10-29 | Paper |
| Edge-Intersection Graphs of k-Bend Paths in Grids | 2009-07-23 | Paper |
| Morphing polyhedra with parallel faces: Counterexamples | 2009-06-18 | Paper |
| On the complexity of crossings in permutations | 2009-04-09 | Paper |
| Drawing \(K_{2,n}\): A lower bound | 2009-03-23 | Paper |
| Cauchy’s Theorem and Edge Lengths of Convex Polyhedra | 2009-02-17 | Paper |
| Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections | 2008-04-24 | Paper |
| Partitions of Graphs into Trees | 2007-08-28 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Three-dimensional orthogonal graph drawing with optimal volume | 2006-06-14 | Paper |
| Polygons needing many flipturns | 2006-03-21 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| A note on 3D orthogonal graph drawing | 2005-08-17 | Paper |
| When can a net fold to a polyhedron? | 2005-08-05 | Paper |
| Bounded-degree independent sets in planar graphs | 2005-06-14 | Paper |
| Balanced vertex-orderings of graphs | 2005-05-04 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| Finding hidden independent sets in interval graphs | 2004-10-27 | Paper |
| Tight bounds on maximal and maximum matchings | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043732 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043792 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472318 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474098 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427862 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422262 | 2003-09-03 | Paper |
| Palindrome recognition using a multidimensional tape. | 2003-08-17 | Paper |
| Curvature-Constrained Shortest Paths in a Convex Polygon | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536356 | 2002-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536355 | 2002-10-08 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768405 | 2002-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407717 | 2002-01-01 | Paper |
| The DFS-heuristic for orthogonal graph drawing | 2001-09-27 | Paper |
| 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved | 2001-07-10 | Paper |
| THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING | 2001-04-17 | Paper |
| Efficient Algorithms for Petersen's Matching Theorem | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511242 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501714 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252281 | 1999-06-17 | Paper |
| New Lower Bounds For Orthogonal Drawings | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232783 | 1999-03-15 | Paper |
| On triangulating planar graphs under the four-connectivity constraint | 1998-10-11 | Paper |
| A better heuristic for orthogonal graph drawings | 1998-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393372 | 1998-06-08 | Paper |
