| Publication | Date of Publication | Type |
|---|
| Min-\(k\)-planar drawings of graphs | 2024-10-08 | Paper |
| Min-\(k\)-planar drawings of graphs | 2024-06-21 | Paper |
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
| Rectilinear Planarity of Partial 2-Trees | 2023-12-20 | Paper |
| k-Planar Placement and Packing of Δ-Regular Caterpillars | 2023-11-16 | Paper |
| Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time | 2023-09-27 | Paper |
| Rectilinear planarity of partial 2-trees | 2023-08-16 | Paper |
| Beyond the worst-case bisection bound: Fast sorting and ranking on meshes | 2023-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874523 | 2023-02-07 | Paper |
| Optimal multi-packet routing on the torus | 2022-12-09 | Paper |
| On triangulating planar graphs under the four-connectivity constraint | 2022-12-09 | Paper |
| Shorter queues for permutation routing on meshes | 2022-08-18 | Paper |
| Area-efficient static and incremental graph drawings | 2021-12-20 | Paper |
| Solving rectilinear Steiner tree problems exactly in theory and practice | 2021-12-20 | Paper |
| Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time | 2021-12-01 | Paper |
| The QuaSEFE Problem | 2019-08-23 | Paper |
| 1-fan-bundle-planar drawings of graphs | 2019-02-20 | Paper |
| On Vertex- and Empty-Ply Proximity Drawings | 2019-02-20 | Paper |
| An Interactive Tool to Explore and Improve the Ply Number of Drawings | 2019-02-20 | Paper |
| Small universal point sets for \(k\)-outerplanar graphs | 2018-10-30 | Paper |
| The number of crossings in multigraphs with no empty lens | 2018-08-30 | Paper |
| On Optimal 2- and 3-Planar Graphs | 2018-08-13 | Paper |
| Planar bus graphs | 2018-07-25 | Paper |
| Bounded stub resolution for some maximal 1-planar graphs | 2018-06-05 | Paper |
| 1-fan-bundle-planar drawings of graphs | 2018-04-04 | Paper |
| Table cartogram | 2018-02-19 | Paper |
| Progress on Partial Edge Drawings | 2017-10-12 | Paper |
| The book thickness of 1-planar graphs is constant | 2017-10-10 | Paper |
| On the recognition of fan-planar and maximal outer-fan-planar graphs | 2017-10-10 | Paper |
| The maximum \(k\)-differential coloring problem | 2017-10-06 | Paper |
| Algorithms and Insights for RaceTrack | 2017-07-17 | Paper |
| On the Total Number of Bends for Planar Octilinear Drawings | 2017-07-13 | Paper |
| Vertex-Coloring with Defects | 2017-04-05 | Paper |
| Low Ply Drawings of Trees | 2017-02-21 | Paper |
| On the Density of Non-simple 3-Planar Graphs | 2017-02-21 | Paper |
| The Book Embedding Problem from a SAT-Solving Perspective | 2017-02-10 | Paper |
| On Embeddability of Buses in Point Sets | 2017-02-10 | Paper |
| A Universal Point Set for 2-Outerplanar Graphs | 2017-02-10 | Paper |
| Threshold-coloring and unit-cube contact representation of planar graphs | 2016-11-24 | Paper |
| On the Total Number of Bends for Planar Octilinear Drawings | 2016-05-03 | Paper |
| Vertex-Coloring with Star-Defects | 2016-05-03 | Paper |
| On Contact Graphs with Cubes and Proportional Boxes | 2016-03-10 | Paper |
| Planar Octilinear Drawings with One Bend Per Edge | 2016-01-07 | Paper |
| Many-to-One Boundary Labeling with Backbones | 2016-01-07 | Paper |
| A New Approach to Partial MUS Enumeration | 2015-11-20 | Paper |
| The book thickness of 1-planar graphs is constant | 2015-11-19 | Paper |
| Contact Graphs of Circular Arcs | 2015-10-30 | Paper |
| Fitting Planar Graphs on Planar Maps | 2015-10-29 | Paper |
| Approximating minimum Manhattan networks in higher dimensions | 2015-03-02 | Paper |
| On Bar (1,j)-Visibility Graphs | 2015-02-27 | Paper |
| The Maximum k-Differential Coloring Problem | 2015-02-20 | Paper |
| Slanted Orthogonal Drawings: Model, Algorithms and Evaluations | 2015-01-15 | Paper |
| Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs | 2015-01-15 | Paper |
| Fitting Planar Graphs on Planar Maps | 2015-01-13 | Paper |
| Planar Octilinear Drawings with One Bend Per Edge | 2015-01-07 | Paper |
| On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs | 2015-01-07 | Paper |
| A note on maximum differential coloring of planar graphs | 2014-11-24 | Paper |
| Computing cartograms with optimal complexity | 2014-08-07 | Paper |
| Universal Point Sets for Drawing Planar Graphs with Circular Arcs | 2014-06-10 | Paper |
| On the Upward Planarity of Mixed Plane Graphs | 2014-05-22 | Paper |
| Smooth Orthogonal Drawings of Planar Graphs | 2014-03-31 | Paper |
| 1-Bend Orthogonal Partial Edge Drawing | 2014-03-24 | Paper |
| Bend-optimal orthogonal graph drawing in the general position model | 2014-01-22 | Paper |
| On the area requirements of Euclidean minimum spanning trees | 2014-01-22 | Paper |
| On the Upward Planarity of Mixed Plane Graphs | 2013-12-20 | Paper |
| Slanted Orthogonal Drawings | 2013-12-20 | Paper |
| Many-to-One Boundary Labeling with Backbones | 2013-12-20 | Paper |
| Threshold-Coloring and Unit-Cube Contact Representation of Graphs | 2013-12-06 | Paper |
| Linear-time algorithms for hole-free rectilinear proportional contact graph representations | 2013-11-11 | Paper |
| Computing cartograms with optimal complexity | 2013-11-06 | Paper |
| Smooth orthogonal layouts | 2013-10-29 | Paper |
| Table Cartograms | 2013-09-17 | Paper |
| Planar Packing of Binary Trees | 2013-08-12 | Paper |
| On the Characterization of Plane Bus Graphs | 2013-06-07 | Paper |
| Approximate proximity drawings | 2013-04-29 | Paper |
| On upward point set embeddability | 2013-04-29 | Paper |
| Progress on Partial Edge Drawings | 2013-04-03 | Paper |
| Smooth Orthogonal Layouts | 2013-04-03 | Paper |
| Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area | 2013-01-07 | Paper |
| Geometric RAC Simultaneous Drawings of Graphs | 2013-01-07 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-12-07 | Paper |
| Vertex angle and crossing angle resolution of leveled tree drawings | 2012-10-23 | Paper |
| Geometric RAC Simultaneous Drawings of Graphs | 2012-09-25 | Paper |
| Optimal polygonal representation of planar graphs | 2012-04-26 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-03-09 | Paper |
| Combining Problems on RAC Drawings and Simultaneous Graph Drawings | 2012-03-09 | Paper |
| Approximate Proximity Drawings | 2012-03-09 | Paper |
| Upward Point Set Embeddability for Convex Point Sets Is in P | 2012-03-09 | Paper |
| Small Point Sets for Simply-Nested Planar Graphs | 2012-03-09 | Paper |
| On a Tree and a Path with no Geometric Simultaneous Embedding | 2012-01-12 | Paper |
| Polynomial area bounds for MST embeddings of trees | 2011-12-28 | Paper |
| Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations | 2011-12-16 | Paper |
| Approximating minimum Manhattan networks in higher dimensions | 2011-09-16 | Paper |
| On the Area Requirements of Euclidean Minimum Spanning Trees | 2011-08-12 | Paper |
| Colored simultaneous geometric embeddings and universal pointsets | 2011-06-30 | Paper |
| On the Perspectives Opened by Right Angle Crossing Drawings | 2011-04-19 | Paper |
| Straight-line rectangular drawings of clustered graphs | 2011-03-10 | Paper |
| Combining Traditional Map Labeling with Boundary Labeling | 2011-02-15 | Paper |
| Upward Point-Set Embeddability | 2011-02-15 | Paper |
| Upward Geometric Graph Embeddings into Point Sets | 2011-02-11 | Paper |
| On a Tree and a Path with No Geometric Simultaneous Embedding | 2011-02-11 | Paper |
| Improving Layered Graph Layouts with Edge Bundling | 2011-02-11 | Paper |
| Comparing trees via crossing minimization | 2010-08-18 | Paper |
| Max-tolerance graphs as intersection graphs | 2010-08-16 | Paper |
| Solving cheap graph problems on Meshes | 2010-06-17 | Paper |
| Planar packing of trees and spider trees | 2010-06-16 | Paper |
| Boundary labeling with octilinear leaders | 2010-05-19 | Paper |
| On the Perspectives Opened by Right Angle Crossing Drawings | 2010-04-27 | Paper |
| Optimal polygonal representation of planar graphs | 2010-04-27 | Paper |
| On Metro-Line Crossing Minimization | 2010-02-04 | Paper |
| Constrained Simultaneous and Near-Simultaneous Embeddings | 2010-02-04 | Paper |
| On Map Labeling with Leaders | 2009-11-12 | Paper |
| Straight-Line Rectangular Drawings of Clustered Graphs | 2009-10-20 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Modeling and Designing Real–World Networks | 2009-07-09 | Paper |
| Two trees which are self-intersecting when drawn simultaneously | 2009-04-09 | Paper |
| Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem | 2009-03-03 | Paper |
| Subdivision Drawings of Hypergraphs | 2009-03-03 | Paper |
| Efficient Labeling of Collinear Sites | 2009-01-19 | Paper |
| An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing | 2009-01-19 | Paper |
| Packing and Squeezing Subgraphs into Planar Graphs | 2008-09-17 | Paper |
| Fixed parameter algorithms for one-sided crossing minimization revisited | 2008-08-08 | Paper |
| Boundary Labeling with Octilinear Leaders | 2008-07-15 | Paper |
| Computation of Renameable Horn Backdoors | 2008-05-27 | Paper |
| A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors | 2008-05-27 | Paper |
| Multi-stack Boundary Labeling Problems | 2008-04-17 | Paper |
| Line Crossing Minimization on Metro Maps | 2008-03-25 | Paper |
| Polynomial Area Bounds for MST Embeddings of Trees | 2008-03-25 | Paper |
| Constrained Simultaneous and Near-Simultaneous Embeddings | 2008-03-25 | Paper |
| Boundary labeling: Models and efficient algorithms for rectangular maps | 2007-02-19 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| DESIGNING PARALLEL ALGORITHMS FOR HIERARCHICAL SMP CLUSTERS | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737341 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043711 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043761 | 2004-08-06 | Paper |
| An Approach for Mixed Upward Planarization | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422257 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422258 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410124 | 2003-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778569 | 2002-11-18 | Paper |
| Embedding Vertices at Points: Few Bends Suffice for Planar Graphs | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501702 | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525720 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525722 | 2001-01-24 | Paper |
| On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952592 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942649 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232783 | 1999-03-15 | Paper |
| On triangulating planar graphs under the four-connectivity constraint | 1998-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342908 | 1997-10-16 | Paper |
| Deterministic Permutation Routing on Meshes | 1997-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128930 | 1997-10-05 | Paper |
| Faster approximation algorithms for the rectilinear Steiner tree problem | 1997-07-28 | Paper |
| Randomized multipacket routing and sorting on meshes | 1997-06-30 | Paper |
| On local routing of two-terminal nets | 1995-02-07 | Paper |
| Channel routing of multiterminal nets | 1994-11-20 | Paper |
| Drawing Graphs in the Plane with High Resolution | 1994-10-10 | Paper |
| A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | 1994-05-10 | Paper |
| Routing in polygons without rectilinearly visible corners | 1993-05-16 | Paper |
| Parity conditions in homotopic knock-knee routing | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028119 | 1993-03-28 | Paper |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210199 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813339 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777475 | 1987-01-01 | Paper |
| Routing through a generalized switchbox | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707923 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688323 | 1984-01-01 | Paper |
| The Density Formula: One Lemma to Bound Them All | N/A | Paper |
