| Colored Anchored Visibility Representations in 2D and 3D space | 0 | 0.34 | 2020 |
| Packing Trees Into 1-Planar Graphs | 0 | 0.34 | 2020 |
| On the Planar Split Thickness of Graphs | 0 | 0.34 | 2018 |
| New Results on Edge Partitions of 1-plane Graphs. | 3 | 0.37 | 2018 |
| Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. | 0 | 0.34 | 2018 |
| Monotone Simultaneous Embeddings of Paths in R^d. | 0 | 0.34 | 2016 |
| Ortho-Polygon Visibility Representations of Embedded Graphs. | 7 | 0.46 | 2016 |
| Visibility representations of boxes in 2.5 dimensions | 1 | 0.35 | 2016 |
| Alternating Paths and Cycles of Minimum Length. | 0 | 0.34 | 2016 |
| Monotone Simultaneous Embeddings Of Paths In D Dimensions | 0 | 0.34 | 2016 |
| Planar and Quasi-Planar Simultaneous Geometric Embedding. | 1 | 0.34 | 2015 |
| Point Set Embedding in 3D. | 0 | 0.34 | 2015 |
| Planar And Quasi Planar Simultaneous Geometric Embedding | 2 | 0.40 | 2014 |
| Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. | 11 | 0.55 | 2014 |
| Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers | 43 | 2.63 | 2013 |
| Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs | 4 | 0.39 | 2013 |
| On point-sets that support planar graphs | 3 | 0.40 | 2013 |
| Guest Editors' Foreword. | 0 | 0.34 | 2013 |
| Point-Set Embedding in Three Dimensions. | 1 | 0.43 | 2012 |
| Universal Sets of Points for One-bend Drawings of Planar Graphs with Vertices | 17 | 0.75 | 2010 |
| Matched drawability of graph pairs and of graph triples | 3 | 0.42 | 2010 |
| Volume requirements of 3D upward drawings | 6 | 0.46 | 2009 |
| Point-set embeddings of trees with given partial drawings | 8 | 0.56 | 2009 |
| A note on alpha-drawable k-trees | 0 | 0.34 | 2008 |
| Maintaining Visibility Information Of Planar Point Sets With A Moving Viewpoint | 2 | 0.41 | 2007 |
| k-colored point-set embeddability of outerplanar graphs | 6 | 0.61 | 2006 |
| Book Embeddability of Series–Parallel Digraphs | 15 | 0.85 | 2006 |
| Drawing Kn in three dimensions with one bend per edge | 3 | 0.49 | 2005 |
| Curve-constrained drawings of planar graphs | 31 | 1.75 | 2005 |
| Properties Of Arrangement Graphs | 1 | 0.40 | 2003 |
| Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions | 74 | 2.97 | 2003 |
| Drawing series-parallel graphs on a box | 14 | 0.77 | 2002 |
| Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs | 5 | 0.50 | 2002 |
| Point And Line Segment Reconstruction From Visibility Information | 7 | 0.60 | 2000 |
| Visibility Stabs And Depth-First Spiralling On Line Segments In Output Sensitive Time | 4 | 0.45 | 2000 |
| Fully Dynamic 3-Dimensional Orthogonal Graph Drawing | 10 | 0.69 | 1999 |
| Bounds for Orthogonal 3-D Graph Drawing | 14 | 0.80 | 1999 |
| Orthogonal 3-D Graph Drawing | 4 | 0.47 | 1997 |
| Orthogonal Polygon Reconstruction | 2 | 0.48 | 1996 |
| Determining bar-representability for ordered weighted graphs | 4 | 0.44 | 1996 |
| Reconstruction of Parallel Line Segments From Endpoint Visibility Information | 1 | 0.44 | 1994 |
| Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract) | 6 | 0.71 | 1989 |
| Characterizing bar line-of-sight graphs | 74 | 6.88 | 1985 |
