| Publication | Date of Publication | Type |
|---|
| The parametrized complexity of the segment number | 2024-10-14 | Paper |
| A simple pipeline for orthogonal graph drawing | 2024-10-14 | Paper |
| Bounding and computing obstacle numbers of graphs | 2024-05-22 | Paper |
| Adjacency graphs of polyhedral surfaces | 2024-05-21 | Paper |
| The Computational Complexity of the ChordLink Model | 2023-12-20 | Paper |
| Morphing planar graph drawings through 3D | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179343 | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059185 | 2023-11-02 | Paper |
| The Complexity of Drawing Graphs on Few Lines and Few Planes | 2023-09-20 | Paper |
| Morphing rectangular duals | 2023-08-16 | Paper |
| Outside-obstacle representations with all vertices on the outer face | 2023-08-16 | Paper |
| Coloring mixed and directional interval graphs | 2023-08-16 | Paper |
| Morphing planar graph drawings through 3D | 2023-08-14 | Paper |
| The complexity of finding tangles | 2023-08-14 | Paper |
| Visualizing multispecies coalescent trees: drawing gene trees inside species trees | 2023-08-14 | Paper |
| Parameterized approaches to orthogonal compaction | 2023-08-14 | Paper |
| An efficient and effective approximation algorithm for the Map Labeling Problem | 2023-05-08 | Paper |
| The segment number: algorithms and universal lower bounds for some classes of planar graphs | 2023-05-05 | Paper |
| Extending partial representations of rectangular duals with given contact orientations | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091054 | 2022-07-21 | Paper |
| Layered drawing of undirected graphs with generalized port constraints | 2022-06-13 | Paper |
| Simple algorithms for partial and simultaneous rectangular duals with given contact orientations | 2022-05-10 | Paper |
| Minimum rectilinear polygons for given angle sequences | 2021-12-15 | Paper |
| Layered Drawing of Undirected Graphs with Generalized Port Constraints | 2021-12-01 | Paper |
| Multi-level Steiner Trees | 2021-04-21 | Paper |
| Bundled Crossings Revisited | 2020-12-18 | Paper |
| Recognizing Stick Graphs with and without Length Constraints | 2020-12-18 | Paper |
| Multi-Level Steiner Trees. | 2020-12-16 | Paper |
| Drawing graphs on few lines and few planes | 2020-11-12 | Paper |
| Variants of the segment number of a graph | 2020-10-26 | Paper |
| On arrangements of orthogonal circles | 2020-10-26 | Paper |
| Stick graphs with length constraints | 2020-10-26 | Paper |
| Representing graphs and hypergraphs by touching polygons in 3D | 2020-10-26 | Paper |
| Bundled crossings revisited | 2020-10-26 | Paper |
| Computing height-optimal tangles faster | 2020-10-26 | Paper |
| Line and plane cover numbers revisited | 2020-10-26 | Paper |
| Angle covers: algorithms and complexity | 2020-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5212398 | 2020-01-28 | Paper |
| Compact drawings of 1-planar graphs with right-angle crossings and few bends | 2019-10-25 | Paper |
| Drawing Binary Tanglegrams: An Experimental Evaluation | 2019-09-11 | Paper |
| Drawing Graphs on Few Circles and Few Spheres | 2019-07-12 | Paper |
| Faster force-directed graph drawing with the well-separated pair decomposition | 2019-03-26 | Paper |
| Planar L-Drawings of Directed Graphs | 2019-02-20 | Paper |
| Computing Storyline Visualizations with Few Block Crossings | 2019-02-20 | Paper |
| Beyond Outerplanarity | 2019-02-20 | Paper |
| Compact drawings of 1-planar graphs with right-angle crossings and few bends | 2019-02-15 | Paper |
| The hardness of approximating set cover | 2018-07-03 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
| Drawing graphs on few circles and few spheres | 2018-06-05 | Paper |
| Approximating the generalized minimum Manhattan network problem | 2018-05-23 | Paper |
| On the Maximum Crossing Number | 2018-01-12 | Paper |
| Block Crossings in Storyline Visualizations | 2017-10-12 | Paper |
| Progress on Partial Edge Drawings | 2017-10-12 | Paper |
| The complexity of drawing graphs on few lines and few planes | 2017-09-22 | Paper |
| Improved approximation algorithms for box contact representations | 2017-04-12 | Paper |
| Cover contact graphs | 2017-03-09 | Paper |
| Snapping Graph Drawings to the Grid Optimally | 2017-02-21 | Paper |
| Block Crossings in Storyline Visualizations | 2017-02-21 | Paper |
| Obstructing Visibilities with One Obstacle | 2017-02-21 | Paper |
| Drawing Graphs on Few Lines and Few Planes | 2017-02-21 | Paper |
| Pixel and Voxel Representations of Graphs | 2017-02-10 | Paper |
| Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition | 2017-02-10 | Paper |
| Minimum Rectilinear Polygons for Given Angle Sequences | 2017-02-01 | Paper |
| Multi-sided boundary labeling | 2016-11-01 | Paper |
| Simultaneous drawing of planar graphs with right-angle crossings and few bends | 2016-03-03 | Paper |
| Colored Non-crossing Euclidean Steiner Forest | 2016-01-11 | Paper |
| Ordering Metro Lines by Block Crossings | 2015-03-04 | Paper |
| Approximating minimum Manhattan networks in higher dimensions | 2015-03-02 | Paper |
| Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends | 2015-02-27 | Paper |
| On Monotone Drawings of Trees | 2015-01-07 | Paper |
| Drawing Graphs within Restricted Area | 2015-01-07 | Paper |
| Improved Approximation Algorithms for Box Contact Representations | 2014-10-08 | Paper |
| Computing large matchings fast | 2014-09-09 | Paper |
| Universal Point Sets for Drawing Planar Graphs with Circular Arcs | 2014-06-10 | Paper |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms | 2014-03-31 | Paper |
| Smooth Orthogonal Drawings of Planar Graphs | 2014-03-31 | Paper |
| Approximating the Generalized Minimum Manhattan Network Problem | 2014-01-14 | Paper |
| Two-Sided Boundary Labeling with Adjacent Sides | 2013-08-12 | Paper |
| Augmenting the Connectivity of Planar and Geometric Graphs | 2013-06-28 | Paper |
| Progress on Partial Edge Drawings | 2013-04-03 | Paper |
| Drawing Metro Maps Using Bézier Curves | 2013-04-03 | Paper |
| Trimming of Graphs, with Application to Point Labeling | 2013-03-19 | Paper |
| Augmenting the Connectivity of Planar and Geometric Graphs | 2012-12-04 | Paper |
| Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs | 2012-07-16 | Paper |
| Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles | 2012-06-08 | Paper |
| Drawing (complete) binary tanglegrams | 2012-04-26 | Paper |
| Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles | 2012-03-09 | Paper |
| The Traveling Salesman Problem under squared Euclidean distances | 2012-01-23 | Paper |
| Approximating minimum Manhattan networks in higher dimensions | 2011-09-16 | Paper |
| Trimming of graphs, with application to point labeling | 2010-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579370 | 2010-08-06 | Paper |
| Manhattan-Geodesic Embedding of Planar Graphs | 2010-04-27 | Paper |
| Untangling a planar graph | 2009-12-14 | Paper |
| Optimizing active ranges for consistent dynamic map labeling | 2009-11-16 | Paper |
| A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM | 2009-07-20 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| Drawing (Complete) Binary Tanglegrams | 2009-03-03 | Paper |
| Optimizing active ranges for consistent dynamic map labeling | 2009-02-12 | Paper |
| Matching points with rectangles and squares | 2008-11-19 | Paper |
| CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER | 2008-09-29 | Paper |
| Decomposing a simple polygon into pseudo-triangles and convex polygons | 2008-07-29 | Paper |
| Constructing minimum-interference networks | 2008-06-18 | Paper |
| A practical map labeling algorithm. | 2008-04-25 | Paper |
| Delineating boundaries for imprecise regions | 2008-04-03 | Paper |
| Cover Contact Graphs | 2008-03-25 | Paper |
| Moving Vertices to Make Drawings Plane | 2008-03-25 | Paper |
| Farthest-Point Queries with Geometric and Combinatorial Constraints | 2008-03-18 | Paper |
| The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation | 2008-03-18 | Paper |
| Straightening Drawings of Clustered Hierarchical Graphs | 2008-03-07 | Paper |
| Untangling a Planar Graph | 2008-03-07 | Paper |
| A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem | 2007-09-10 | Paper |
| Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps | 2007-08-28 | Paper |
| Configurations with few crossings in topological graphs | 2007-04-18 | Paper |
| Boundary labeling: Models and efficient algorithms for rectangular maps | 2007-02-19 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| The minimum Manhattan network problem: Approximations and exact solutions | 2006-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Farthest-point queries with geometric and combinatorial constraints | 2006-04-28 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| LABELING POINTS WITH CIRCLES | 2005-06-10 | Paper |
| Optimal spanners for axis-aligned rectangles | 2005-02-09 | Paper |
| Labeling points with weights | 2004-12-02 | Paper |
| A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474126 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474130 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472516 | 2004-08-04 | Paper |
| Facility location and the geometric minimum-diameter spanning tree. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411284 | 2003-07-07 | Paper |
| Three rules suffice for good label placement | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753953 | 2001-12-18 | Paper |
| Point labeling with sliding labels | 2000-02-09 | Paper |
| Bounding and computing obstacle numbers of graphs | N/A | Paper |
