| Publication | Date of Publication | Type |
|---|
| Multi-priority graph sparsification | 2023-12-22 | Paper |
| Computing β-Stretch Paths in Drawings of Graphs. | 2023-11-02 | Paper |
| Spherical graph drawing by multi-dimensional scaling | 2023-08-16 | Paper |
| The Rique-number of graphs | 2023-08-16 | Paper |
| An FPT algorithm for bipartite vertex splitting | 2023-08-16 | Paper |
| Visualizing evolving trees | 2023-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159905 | 2023-06-23 | Paper |
| The segment number: algorithms and universal lower bounds for some classes of planar graphs | 2023-05-05 | Paper |
| Approximation algorithms for priority Steiner tree problems | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874465 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875617 | 2023-02-03 | Paper |
| Weighted additive spanners | 2022-12-21 | Paper |
| Polygons with Prescribed Angles in 2D and 3D | 2022-11-14 | Paper |
| Visualizing JIT compiler graphs | 2022-07-01 | Paper |
| Packing Trees into 1-planar Graphs | 2022-06-28 | Paper |
| On additive spanners in weighted graphs with local error | 2022-06-08 | Paper |
| The Turing Test for Graph Drawing Algorithms | 2021-12-01 | Paper |
| Graph Drawing via Gradient Descent, $$(GD)^2$$ | 2021-12-01 | Paper |
| Polygons with Prescribed Angles in 2D and 3D | 2021-12-01 | Paper |
| Graph spanners: a tutorial review | 2021-05-19 | Paper |
| Multi-level Steiner Trees | 2021-04-21 | Paper |
| On Area-Universal Quadrangulations | 2021-03-29 | Paper |
| Multi-Level Steiner Trees. | 2020-12-16 | Paper |
| Computing stable Demers cartograms | 2020-10-26 | Paper |
| Stress-Plus-X (SPX) graph layout | 2020-10-26 | Paper |
| Symmetry detection and classification in drawings of graphs | 2020-10-26 | Paper |
| Packing trees into 1-planar graphs | 2020-07-22 | Paper |
| Weighted Additive Spanners | 2020-02-15 | Paper |
| Online facility assignment | 2020-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207877 | 2020-01-13 | Paper |
| Recognition and drawing of stick graphs | 2019-11-13 | Paper |
| Packing Trees into 1-planar Graphs | 2019-11-05 | Paper |
| The QuaSEFE Problem | 2019-08-23 | Paper |
| Combinatorial and Geometric Properties of Planar Laman Graphs | 2019-05-15 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2019-02-27 | Paper |
| On Vertex- and Empty-Ply Proximity Drawings | 2019-02-20 | Paper |
| Lombardi Drawings of Knots and Links | 2019-02-20 | Paper |
| Revisited Experimental Comparison of Node-Link and Matrix Representations | 2019-02-20 | Paper |
| Drawing Dynamic Graphs Without Timeslices | 2019-02-20 | Paper |
| Recognition and drawing of stick graphs | 2019-02-15 | Paper |
| Turning cliques into paths to achieve planarity | 2019-02-15 | Paper |
| Perception of symmetries in drawings of graphs | 2019-02-15 | Paper |
| Same stats, different graphs (graph statistics and why we need graph drawings) | 2019-02-15 | Paper |
| An Experimental Study on the Ply Number of Straight-line Drawings | 2019-02-14 | Paper |
| Orthogonal layout with optimal face complexity | 2018-11-01 | Paper |
| Online facility assignment | 2018-06-15 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
| Approximating the generalized minimum Manhattan network problem | 2018-05-23 | Paper |
| On the planar split thickness of graphs | 2018-04-11 | Paper |
| Table cartogram | 2018-02-19 | Paper |
| On the Maximum Crossing Number | 2018-01-12 | Paper |
| The maximum \(k\)-differential coloring problem | 2017-10-06 | Paper |
| The geometric thickness of low degree graphs | 2017-09-29 | Paper |
| An annotated bibliography on 1-planarity | 2017-09-28 | Paper |
| An Experimental Study on the Ply Number of Straight-Line Drawings | 2017-05-05 | Paper |
| Improved approximation algorithms for box contact representations | 2017-04-12 | Paper |
| Vertex-Coloring with Defects | 2017-04-05 | Paper |
| Low Ply Drawings of Trees | 2017-02-21 | Paper |
| On Embeddability of Buses in Point Sets | 2017-02-10 | Paper |
| Threshold-coloring and unit-cube contact representation of planar graphs | 2016-11-24 | Paper |
| Weak Unit Disk and Interval Representation of Graphs | 2016-10-21 | Paper |
| On the planar split thickness of graphs | 2016-05-03 | Paper |
| On Contact Graphs with Cubes and Proportional Boxes | 2016-03-10 | Paper |
| Orthogonal Layout with Optimal Face Complexity | 2016-03-10 | Paper |
| MapSets: Visualizing Embedded and Clustered Graphs | 2016-01-07 | Paper |
| Contact Graphs of Circular Arcs | 2015-10-30 | Paper |
| Contact Representations of Graphs in 3D | 2015-10-30 | Paper |
| Fitting Planar Graphs on Planar Maps | 2015-10-29 | Paper |
| Optimal constrained graph exploration | 2015-09-02 | Paper |
| Monotone drawings of graphs with fixed embedding | 2015-05-26 | Paper |
| Approximating minimum Manhattan networks in higher dimensions | 2015-03-02 | Paper |
| The Maximum k-Differential Coloring Problem | 2015-02-20 | Paper |
| Fitting Planar Graphs on Planar Maps | 2015-01-13 | Paper |
| MapSets: Visualizing Embedded and Clustered Graphs | 2015-01-07 | Paper |
| Balanced Circle Packings for Planar Graphs | 2015-01-07 | Paper |
| Are Crossings Important for Drawing Large Graphs? | 2015-01-07 | Paper |
| A note on maximum differential coloring of planar graphs | 2014-11-24 | Paper |
| Improved Approximation Algorithms for Box Contact Representations | 2014-10-08 | Paper |
| Computing cartograms with optimal complexity | 2014-08-07 | Paper |
| Smooth Orthogonal Drawings of Planar Graphs | 2014-03-31 | Paper |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms | 2014-03-31 | Paper |
| Embedding, Clustering and Coloring for Dynamic Maps | 2014-01-22 | Paper |
| Approximating the Generalized Minimum Manhattan Network Problem | 2014-01-14 | Paper |
| Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs | 2013-12-20 | Paper |
| Threshold-Coloring and Unit-Cube Contact Representation of Graphs | 2013-12-06 | Paper |
| Equilateral L-Contact Graphs | 2013-12-06 | Paper |
| Computing cartograms with optimal complexity | 2013-11-06 | Paper |
| Smooth Orthogonal Layouts | 2013-10-29 | Paper |
| Table Cartograms | 2013-09-17 | Paper |
| On the Usability of Lombardi Graph Drawings | 2013-04-03 | Paper |
| Smooth Orthogonal Layouts | 2013-04-03 | Paper |
| On Representing Graphs by Touching Cuboids | 2013-04-03 | Paper |
| Touching Triangle Representations for 3-Connected Planar Graphs | 2013-04-03 | Paper |
| Proportional Contact Representations of 4-Connected Planar Graphs | 2013-04-03 | Paper |
| Planar Preprocessing for Spring Embedders | 2013-04-03 | Paper |
| Drawing trees with perfect angular resolution and polynomial area | 2013-03-20 | Paper |
| On Maximum Differential Coloring of Planar Graphs | 2013-02-28 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-12-07 | Paper |
| Optimal polygonal representation of planar graphs | 2012-04-26 | Paper |
| Proportional Contact Representations of Planar Graphs | 2012-03-09 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2012-03-09 | Paper |
| Force-Directed Lombardi-Style Graph Drawing | 2012-03-09 | Paper |
| Monotone Drawings of Graphs with Fixed Embedding | 2012-03-09 | Paper |
| Lombardi Drawings of Graphs | 2012-01-12 | 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 |
| Colored simultaneous geometric embeddings and universal pointsets | 2011-06-30 | Paper |
| Planar Drawings of Higher-Genus Graphs | 2011-04-19 | Paper |
| Lombardi Drawings of Graphs | 2011-02-11 | Paper |
| On Graphs Supported by Line Sets | 2011-02-11 | Paper |
| Drawing Trees with Perfect Angular Resolution and Polynomial Area | 2011-02-11 | Paper |
| On Touching Triangle Graphs | 2011-02-11 | Paper |
| On Maximum Differential Graph Coloring | 2011-02-11 | Paper |
| Planar Drawings of Higher-Genus Graphs | 2010-04-27 | Paper |
| Optimal polygonal representation of planar graphs | 2010-04-27 | Paper |
| On the Characterization of Level Planar Trees by Minimal Patterns | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Constrained Simultaneous and Near-Simultaneous Embeddings | 2010-02-04 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Upward straight-line embeddings of directed graphs into point sets | 2009-11-16 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Characterization of unlabeled level planar trees | 2009-07-27 | Paper |
| Graph Simultaneous Embedding Tool, GraphSET | 2009-03-03 | Paper |
| Upward Straight-Line Embeddings of Directed Graphs into Point Sets | 2009-01-20 | Paper |
| Simultaneous Embedding of Planar Graphs with Few Bends | 2009-01-19 | Paper |
| Fixed-Location Circular Arc Drawing of Planar Graphs | 2009-01-19 | Paper |
| Morphing Planar Graphs in Spherical Space | 2009-01-19 | Paper |
| Simultaneous graph embedding with bends and circular arcs | 2008-11-19 | Paper |
| Characterization of Unlabeled Level Planar Graphs | 2008-03-25 | Paper |
| Minimum Level Nonplanar Patterns for Trees | 2008-03-25 | Paper |
| Constrained Simultaneous and Near-Simultaneous Embeddings | 2008-03-25 | Paper |
| Graph Drawing Contest Report | 2008-03-25 | Paper |
| Characterization of Unlabeled Level Planar Trees | 2007-08-28 | Paper |
| Simultaneous Graph Embedding with Bends and Circular Arcs | 2007-08-28 | Paper |
| Morphing Planar Graphs in Spherical Space | 2007-08-28 | Paper |
| Graph-Drawing Contest Report | 2007-08-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 |
| DRAWING WITH FAT EDGES | 2006-10-16 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Simultaneous embedding of a planar graph and its dual on the grid | 2005-06-14 | Paper |
| Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution | 2005-05-25 | Paper |
| A multi-dimensional approach to force-directed layouts of large graphs | 2004-10-13 | Paper |
| Tight bounds on maximal and maximum matchings | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043714 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043745 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472309 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472310 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474098 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427878 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411377 | 2003-07-08 | Paper |
| GRIP: Graph Drawing with Intelligent Placement | 2003-06-23 | Paper |
| Planarity-preserving clustering and embedding for large planar graphs | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768385 | 2002-09-11 | Paper |
| Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees | 2001-10-07 | Paper |
| Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs | 2001-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501704 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252301 | 2000-04-13 | Paper |
