| The Weighted Barycenter Drawing Recognition Problem | 0 | 0.34 | 2018 |
| Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs | 0 | 0.34 | 2014 |
| Preface to GD'05 special issue | 0 | 0.34 | 2009 |
| Efficiently drawing a significant spanning tree of a directed graph | 2 | 0.38 | 2007 |
| Fixed-Parameter tractable algorithms for testing upward planarity | 15 | 0.76 | 2005 |
| Building blocks of upward planar digraphs | 4 | 0.48 | 2004 |
