| Clustersets: Optimizing Planar Clusters In Categorical Point Data | 0 | 0.34 | 2021 |
| Adjacency Graphs of Polyhedral Surfaces | 0 | 0.34 | 2021 |
| Finding Optimal Sequences for Area Aggregation—A⋆ vs. Integer Linear Programming | 0 | 0.34 | 2020 |
| Computing Optimal Tangles Faster. | 0 | 0.34 | 2019 |
| Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. | 0 | 0.34 | 2018 |
| Approximating the Generalized Minimum Manhattan Network Problem. | 0 | 0.34 | 2018 |
| Multi-level Steiner Trees. | 0 | 0.34 | 2018 |
| Orthogonal And Smooth Orthogonal Layouts Of 1-Planar Graphs With Low Edge Complexity | 1 | 0.34 | 2018 |
| Beyond Outerplanarity. | 0 | 0.34 | 2017 |
| Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. | 0 | 0.34 | 2015 |
| Colored Non-Crossing Euclidean Steiner Forest. | 2 | 0.46 | 2015 |
| Improved Approximation Algorithms for Box Contact Representations. | 0 | 0.34 | 2014 |
| On Monotone Drawings Of Trees | 9 | 0.71 | 2014 |
| Labeling streets in interactive maps using embedded labels | 2 | 0.39 | 2014 |
| Point Labeling with Sliding Labels in Interactive Maps. | 4 | 0.42 | 2014 |
| Simultaneous Drawing Of Planar Graphs With Right-Angle Crossings And Few Bends | 5 | 0.42 | 2014 |
| Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation | 13 | 0.70 | 2013 |
| Ordering Metro Lines by Block Crossings | 4 | 0.46 | 2013 |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms. | 5 | 0.44 | 2013 |
| Algorithms for Labeling Focus Regions | 19 | 0.78 | 2012 |
| Polylogarithmic Approximation for Generalized Minimum Manhattan Networks | 0 | 0.34 | 2012 |
| Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs | 2 | 0.37 | 2011 |
| Approximating Minimum Manhattan Networks in Higher Dimensions | 2 | 0.41 | 2011 |
| Optimal and topologically safe simplification of building footprints | 7 | 0.49 | 2010 |
| Area aggregation in map generalisation by mixed-integer programming | 12 | 0.90 | 2010 |
| Manhattan-Geodesic embedding of planar graphs | 17 | 1.00 | 2009 |
| Matching points with rectangles and squares | 5 | 0.54 | 2009 |
| Constructing The City Voronoi Diagram Faster | 6 | 0.53 | 2008 |
| Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability | 10 | 0.61 | 2008 |
| Optimizing Active Ranges For Consistent Dynamic Map Labeling | 0 | 0.34 | 2008 |
| Morphing polylines: A step towards continuous generalization | 18 | 1.20 | 2008 |
| Drawing Binary Tanglegrams: An Experimental Evaluation | 13 | 0.81 | 2008 |
| Drawing (Complete) Binary Tanglegrams | 6 | 0.53 | 2008 |
| Decomposing a simple polygon into pseudo-triangles and convex polygons | 0 | 0.34 | 2008 |
| Moving vertices to make drawings plane | 7 | 0.81 | 2007 |
| Constructing Optimal Highways | 6 | 0.55 | 2007 |
| Minimizing intra-edge crossings in wiring diagrams and public transportation maps | 12 | 0.85 | 2006 |
| Farthest-point queries with geometric and combinatorial constraints | 10 | 0.74 | 2006 |
| Generalization of land cover maps by mixed integer programming | 4 | 0.55 | 2006 |
| Facility location and the geometric minimum-diameter spanning tree. | 0 | 0.34 | 2004 |
| Algorithms for the placement of diagrams on maps | 4 | 0.46 | 2004 |
| Labeling Points with Weights | 5 | 0.57 | 2001 |
| Labeling Subway Lines | 12 | 0.87 | 2001 |
