| Publication | Date of Publication | Type |
|---|
| How to draw a planar clustered graph | 2023-12-12 | Paper |
| Shape-faithful graph drawings | 2023-08-16 | Paper |
| Planarity for clustered graphs | 2023-05-08 | Paper |
| Nearest neighbour graph realizability is NP-hard | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091031 | 2022-07-21 | Paper |
| New Quality Metrics for Dynamic Graph Drawing | 2021-12-01 | Paper |
| A quality metric for visualization of clusters in graphs | 2020-10-26 | Paper |
| Multi-level graph drawing using infomap clustering | 2020-10-26 | Paper |
| Polyline drawings with topological constraints | 2020-01-29 | Paper |
| Gap-Planar Graphs | 2019-02-20 | Paper |
| Turning cliques into paths to achieve planarity | 2019-02-15 | Paper |
| The weighted barycenter drawing recognition problem | 2019-02-15 | Paper |
| Gap-planar graphs | 2018-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643873 | 2018-05-29 | Paper |
| Simultaneous Orthogonal Planarity | 2017-02-21 | Paper |
| Straight-Line Drawability of a Planar Graph Plus an Edge | 2015-10-30 | Paper |
| A linear-time algorithm for testing outer-1-planarity | 2015-09-02 | Paper |
| 2-layer right angle crossing drawings | 2014-12-02 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system | 2014-01-13 | Paper |
| A Linear-Time Algorithm for Testing Outer-1-Planarity | 2013-12-20 | Paper |
| EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING | 2013-06-24 | Paper |
| Right angle crossing graphs and 1-planarity | 2013-04-25 | Paper |
| Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time | 2013-04-03 | Paper |
| Fáry’s Theorem for 1-Planar Graphs | 2012-09-25 | Paper |
| Bounds on the crossing resolution of complete geometric graphs | 2012-03-19 | Paper |
| A characterization of complete bipartite RAC graphs | 2012-03-19 | Paper |
| Kozo Sugiyama 1945 - 2011 | 2012-03-09 | Paper |
| Right Angle Crossing Graphs and 1-Planarity | 2012-03-09 | Paper |
| 2-Layer Right Angle Crossing Drawings | 2012-01-13 | Paper |
| Drawing graphs with right angle crossings | 2011-10-10 | Paper |
| On Rectilinear Drawing of Graphs | 2010-04-27 | Paper |
| Drawing Graphs with Right Angle Crossings | 2009-10-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Some Constrained Notions of Planarity | 2009-01-29 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs | 2006-10-04 | Paper |
| Straight-line drawing algorithms for hierarchical graphs and clustered graphs | 2006-06-14 | Paper |
| Drawing planar graphs symmetrically. III: Oneconnected planar graphs | 2006-06-14 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Drawing planar graphs symmetrically. II: Biconnected planar graphs | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154375 | 2004-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828954 | 2004-11-29 | Paper |
| Linkless symmetric drawings of series parallel digraphs | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043717 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472303 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472308 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472325 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472328 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472499 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471659 | 2004-07-30 | Paper |
| An edge-splitting algorithm in planar graphs | 2003-08-28 | Paper |
| Skewness of graphs with small cutsets | 2003-08-18 | Paper |
| Drawing trees symmetrically in three dimensions | 2003-08-17 | Paper |
| Graph Drawing in Motion | 2003-06-23 | Paper |
| Towards area requirements for drawing hierarchically planar graphs | 2003-05-14 | Paper |
| Width-restricted layering of acyclic digraphs with consideration of dummy nodes | 2002-07-14 | Paper |
| Removing edge-node intersections in drawings of graphs | 2002-07-14 | Paper |
| Drawing series parallel digraphs symmetrically | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513002 | 2001-02-18 | Paper |
| Navigating Clustered Graphs Using Force-Directed Methods | 2000-12-14 | Paper |
| Drawing Clustered Graphs on an Orthogonal Grid | 2000-09-19 | Paper |
| Spring algorithms and symmetry | 2000-08-21 | Paper |
| Three-dimensional orthogonal graph drawing algorithms | 2000-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389393 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249532 | 1999-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840350 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364590 | 1998-02-23 | Paper |
| Three-dimensional graph drawing | 1997-06-30 | 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 |
| AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH | 1996-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862896 | 1996-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858141 | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853751 | 1995-11-01 | Paper |
| Algorithms for drawing graphs: An annotated bibliography | 1994-11-30 | Paper |
| Drawing graphs in two layers | 1994-08-29 | Paper |
| A fast and effective heuristic for the feedback arc set problem | 1994-05-19 | Paper |
| Edge crossings in drawings of bipartite graphs | 1994-05-05 | Paper |
| The complexity of computing minimum separating polygons | 1994-02-17 | Paper |
| TWO TREE DRAWING CONVENTIONS | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985344 | 1992-06-27 | Paper |
| Fixed edge-length graph drawing is NP-hard | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814808 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734774 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782807 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692887 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3764154 | 1985-01-01 | Paper |
| An algorithm for generating subsets of fixed size with a strong minimal change property | 1984-01-01 | Paper |
| Some Hamilton Paths and a Minimal Change Algorithm | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220621 | 1984-01-01 | Paper |
| A lower-bound for the number of productions required for a certain class of languages | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665259 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322119 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750667 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325055 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919725 | 1981-01-01 | Paper |
| On optimal trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3924230 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956960 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3931406 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048846 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048853 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192080 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119216 | 1977-01-01 | Paper |
| On circulant codes with prescribed distances | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145725 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145726 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4096963 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111578 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119215 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121912 | 1976-01-01 | Paper |
