| On Orthogonally Guarding Orthogonal Polygons With Bounded Treewidth | 0 | 0.34 | 2021 |
| Layered Fan-Planar Graph Drawings. | 0 | 0.34 | 2020 |
| Maximum Matchings And Minimum Blocking Sets In Theta(6)-Graphs | 0 | 0.34 | 2019 |
| Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation | 0 | 0.34 | 2019 |
| Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs | 2 | 0.38 | 2018 |
| Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). | 0 | 0.34 | 2018 |
| Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs. | 1 | 0.39 | 2017 |
| On Guarding Orthogonal Polygons With Sliding Cameras | 7 | 0.52 | 2017 |
| Order-preserving 1-string representations of planar graphs. | 0 | 0.34 | 2017 |
| A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. | 0 | 0.34 | 2017 |
| Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs. | 0 | 0.34 | 2016 |
| Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). | 1 | 0.36 | 2016 |
| Sliding k-Transmitters: Hardness and Approximation. | 2 | 0.37 | 2016 |
| Realizing Farthest-Point Voronoi Diagrams. | 0 | 0.34 | 2016 |
| 1-string B2-VPG representation of planar graphs. | 0 | 0.34 | 2016 |
| Non-Aligned Drawings Of Planar Graphs | 0 | 0.34 | 2016 |
| 1-String B_2-VPG Representation of Planar Graphs. | 0 | 0.34 | 2015 |
| A simple algorithm for computing positively weighted straight skeletons of monotone polygons. | 2 | 0.37 | 2015 |
| Optimum-width upward order-preserving poly-line drawings of trees. | 0 | 0.34 | 2015 |
| Representing Directed Trees as Straight Skeletons | 0 | 0.34 | 2015 |
| $1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. | 2 | 0.44 | 2015 |
| Reprint of: Weighted straight skeletons in the plane. | 0 | 0.34 | 2015 |
| Turning Orthogonally Convex Polyhedra into Orthoballs. | 1 | 0.37 | 2014 |
| Orthogonal cartograms with at most 12 corners per face | 1 | 0.38 | 2014 |
| Planar Matchings for Weighted Straight Skeletons | 1 | 0.39 | 2014 |
| Straightening out planar poly-line drawings. | 0 | 0.34 | 2014 |
| Linear-time algorithms for hole-free rectilinear proportional contact graph representations | 7 | 0.48 | 2013 |
| Drawing planar 3-trees with given face areas | 3 | 0.42 | 2013 |
| Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input | 2 | 0.40 | 2013 |
| Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. | 9 | 0.62 | 2013 |
| Morphing orthogonal planar graph drawings | 1 | 0.37 | 2013 |
| Dihedral angles and orthogonal polyhedra. | 0 | 0.34 | 2013 |
| Computing cartograms with optimal complexity | 12 | 0.62 | 2013 |
| On triangulating k-outerplanar graphs. | 3 | 0.41 | 2013 |
| Drawing planar graphs on points inside a polygon | 1 | 0.37 | 2012 |
| A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. | 2 | 0.39 | 2012 |
| The vulcan game of kal-toh: finding or making triconnected planar subgraphs | 0 | 0.34 | 2012 |
| The point-set embeddability problem for plane graphs | 7 | 0.47 | 2012 |
| Open rectangle-of-influence drawings of non-triangulated planar graphs | 1 | 0.35 | 2012 |
| Planar open rectangle-of-influence drawings with non-aligned frames | 3 | 0.41 | 2011 |
| Faster optimal algorithms for segment minimization with small maximal value | 3 | 0.42 | 2011 |
| A note on improving the performance of approximation algorithms for radiation therapy | 3 | 0.40 | 2011 |
| Efficient view point selection for silhouettes of convex polyhedra | 3 | 0.52 | 2011 |
| Reconstructing orthogonal polyhedra from putative vertex sets | 8 | 0.73 | 2011 |
| Reconstructing Convex Polygons And Convex Polyhedra From Edge And Face Counts In Orthogonal Projections | 1 | 0.36 | 2011 |
| Reconstructing polygons from scanner data | 10 | 0.84 | 2011 |
| Stoker'S Theorem For Orthogonal Polyhedra | 2 | 0.54 | 2011 |
| Drawing some planar graphs with integer edge-lengths. | 2 | 0.54 | 2011 |
| Sorting with networks of data structures | 0 | 0.34 | 2010 |
| Reconstructing hv-convex multi-coloured polyominoes | 0 | 0.34 | 2010 |
