Alexander Wolff

According to our database1, Alexander Wolff authored at least 165 papers between 1995 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On the Maximum Crossing Number.
J. Graph Algorithms Appl., 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
CoRR, 2018

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends.
CoRR, 2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.
CoRR, 2018

Multi-Level Steiner Trees.
CoRR, 2018

Approximating the Generalized Minimum Manhattan Network Problem.
Algorithmica, 2018

Multi-Level Steiner Trees.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Using RNA-Seq Data for the Detection of a Panel of Clinically Relevant Mutations.
Proceedings of the German Medical Data Sciences: A Learning Healthcare System, 2018

Drawing Graphs on Few Circles and Few Spheres.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
Block Crossings in Storyline Visualizations.
J. Graph Algorithms Appl., 2017

Progress on Partial Edge Drawings.
J. Graph Algorithms Appl., 2017

Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling.
ISPRS Int. J. Geo-Information, 2017

Drawing Graphs on Few Circles and Few Spheres.
CoRR, 2017

Computing Storyline Visualizations with Few Block Crossings.
CoRR, 2017

Planar L-Drawings of Directed Graphs.
CoRR, 2017

Beyond Outerplanarity.
CoRR, 2017

On the Maximum Crossing Number.
CoRR, 2017

Improved Approximation Algorithms for Box Contact Representations.
Algorithmica, 2017

The Complexity of Drawing Graphs on Few Lines and Few Planes.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

On the Maximum Crossing Number.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Algorithmically-Guided User Interaction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Computing Storyline Visualizations with Few Block Crossings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Beyond Outerplanarity.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Planar L-Drawings of Directed Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing.
ACM Trans. Spatial Algorithms and Systems, 2016

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.
J. Graph Algorithms Appl., 2016

Snapping Graph Drawings to the Grid Optimally.
CoRR, 2016

Minimum Rectilinear Polygons for Given Angle Sequences.
CoRR, 2016

Block Crossings in Storyline Visualizations.
CoRR, 2016

Obstructing Visibilities with One Obstacle.
CoRR, 2016

The Complexity of Drawing Graphs on Few Lines and Few Planes.
CoRR, 2016

Drawing Graphs on Few Lines and Few Planes.
CoRR, 2016

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.
Algorithms, 2016

Multi-sided Boundary Labeling.
Algorithmica, 2016

Snapping Graph Drawings to the Grid Optimally.
Proceedings of the Graph Drawing and Network Visualization, 2016

Block Crossings in Storyline Visualizations.
Proceedings of the Graph Drawing and Network Visualization, 2016

Obstructing Visibilities with One Obstacle.
Proceedings of the Graph Drawing and Network Visualization, 2016

Drawing Graphs on Few Lines and Few Planes.
Proceedings of the Graph Drawing and Network Visualization, 2016

Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations.
Proceedings of the Geospatial Data in a Changing World, 2016

2015
Ordering Metro Lines by Block Crossings.
J. Graph Algorithms Appl., 2015

On Monotone Drawings of Trees.
CoRR, 2015

Colored Non-Crossing Euclidean Steiner Forest.
CoRR, 2015

Pixel and Voxel Representations of Graphs.
CoRR, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica, 2015

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Minimum Rectilinear Polygons for Given Angle Sequences.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Colored Non-crossing Euclidean Steiner Forest.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Pixel and Voxel Representations of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Labeling Streets Along a Route in Interactive 3D Maps Using Billboards.
Proceedings of the AGILE 2015, 2015

2014
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl., 2014

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.
CoRR, 2014

Improved Approximation Algorithms for Box Contact Representations.
CoRR, 2014

Drawing Graphs within Restricted Area.
CoRR, 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Smooth Orthogonal Drawings of Planar Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Labeling streets in interactive maps using embedded labels.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Matching labels and markers in historical maps: an algorithm with interactive postprocessing.
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Interacting with Maps, 2014

On Monotone Drawings of Trees.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Luatodonotes: Boundary Labeling for Annotations in Texts.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Drawing Graphs within Restricted Area.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Improved Approximation Algorithms for Box Contact Representations.
Proceedings of the Algorithms - ESA 2014, 2014

Point Labeling with Sliding Labels in Interactive Maps.
Proceedings of the Connecting a Digital Europe Through Location and Place, 2014

2013
Graph Drawing and Cartography.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.
IEEE Trans. Vis. Comput. Graph., 2013

Multi-Sided Boundary Labeling
CoRR, 2013

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
CoRR, 2013

Smooth Orthogonal Drawings of Planar Graphs.
CoRR, 2013

Two-Sided Boundary Labeling with Adjacent Sides.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Approximating the Generalized Minimum Manhattan Network Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Algorithms for Labeling Focus Regions.
IEEE Trans. Vis. Comput. Graph., 2012

Cover Contact Graphs.
JoCG, 2012

Augmenting the Connectivity of Planar and Geometric Graphs.
J. Graph Algorithms Appl., 2012

Putting Data on the Map (Dagstuhl Seminar 12261).
Dagstuhl Reports, 2012

Progress on Partial Edge Drawings
CoRR, 2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
CoRR, 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Drawing Metro Maps Using Bézier Curves.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Progress on Partial Edge Drawings.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.
IEEE Trans. Vis. Comput. Graph., 2011

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
CoRR, 2011

Approximating Minimum Manhattan Networks in Higher Dimensions
CoRR, 2011

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Approximating Minimum Manhattan Networks in Higher Dimensions.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Computing large matchings fast.
ACM Trans. Algorithms, 2010

Trimming of Graphs, with Application to Point Labeling.
Theory Comput. Syst., 2010

Area aggregation in map generalisation by mixed-integer programming.
International Journal of Geographical Information Science, 2010

The Traveling Salesman Problem Under Squared Euclidean Distances
CoRR, 2010

Optimizing active ranges for consistent dynamic map labeling.
Comput. Geom., 2010

The Traveling Salesman Problem under Squared Euclidean Distances.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Optimal and topologically safe simplification of building footprints.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry.
Proceedings of the Schematization in Cartography, Visualization, and Computational Geometry, 14.11., 2010

2009
Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Int. J. Comput. Geometry Appl., 2009

Untangling a Planar Graph.
Discrete & Computational Geometry, 2009

Matching points with rectangles and squares.
Comput. Geom., 2009

Manhattan-Geodesic Embedding of Planar Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Drawing Binary Tanglegrams: An Experimental Evaluation.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Morphing polylines: A step towards continuous generalization.
Computers, Environment and Urban Systems, 2008

Constructing the City Voronoi Diagram Faster.
Int. J. Comput. Geometry Appl., 2008

Augmenting the Connectivity of Planar and Geometric Graphs.
Electronic Notes in Discrete Mathematics, 2008

Drawing Binary Tanglegrams: An Experimental Evaluation
CoRR, 2008

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
CoRR, 2008

Trimming of Graphs, with Application to Point Labeling
CoRR, 2008

Decomposing a simple polygon into pseudo-triangles and convex polygons.
Comput. Geom., 2008

Constructing minimum-interference networks.
Comput. Geom., 2008

Delineating Boundaries for Imprecise Regions.
Algorithmica, 2008

Trimming of Graphs, with Application to Point Labeling.
Proceedings of the STACS 2008, 2008

Untangling a Planar Graph.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Computing large matchings fast.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Drawing (Complete) Binary Tanglegrams.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Optimizing active ranges for consistent dynamic map labeling.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Drawing Subway Maps: A Survey.
Inform., Forsch. Entwickl., 2007

Constructing Optimal Highways
CoRR, 2007

Untangling a Planar Graph
CoRR, 2007

Configurations with few crossings in topological graphs.
Comput. Geom., 2007

Boundary labeling: Models and efficient algorithms for rectangular maps.
Comput. Geom., 2007

Straightening Drawings of Clustered Hierarchical Graphs.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Moving Vertices to Make Drawings Plane.
Proceedings of the Graph Drawing, 15th International Symposium, 2007


Constructing Optimal Highways.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
Farthest-point queries with geometric and combinatorial constraints.
Comput. Geom., 2006

The minimum Manhattan network problem: Approximations and exact solutions.
Comput. Geom., 2006

Matching Points with Rectangles and Squares.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Constructing Interference-Minimal Networks.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Generalization of land cover maps by mixed integer programming.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Optimal spanners for axis-aligned rectangles.
Comput. Geom., 2005

Configurations with Few Crossings in Topological Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A Mixed-Integer Program for Drawing High-Quality Metro Maps.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Delineating boundaries for imprecise regions.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Spanning trees with few crossings in geometric and topological graphs.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Constructing the city Voronoi diagram faster.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Constructing interference-minimal networks.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Delineating Boundaries for Imprecise Regions.
Proceedings of the Algorithms, 2005

2004
Facility location and the geometric minimum-diameter spanning tree.
Comput. Geom., 2004

Labeling Points with Weights.
Algorithmica, 2004

Farthest-Point Queries with Geometric and Combinatorial Constraints.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Algorithms for the placement of diagrams on maps.
Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2002
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling.
Int. J. Comput. Geometry Appl., 2002

Towards an evaluation of quality for names placement methods.
International Journal of Geographical Information Science, 2002

A Tutorial for Designing Flexible Geometric Algorithms.
Algorithmica, 2002

Facility Location and the Geometric Minimum-Diameter Spanning Tree.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Labeling Points with Circles.
Int. J. Comput. Geometry Appl., 2001

Three Rules Suffice for Good Label Placement.
Algorithmica, 2001

Labeling Points with Weights.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Labeling Subway Lines.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
A Better Lower Bound for Two-Circle Point Labeling.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

New Algorithms for Two-Label Point Labeling.
Proceedings of the Algorithms, 2000

1999
Automated label placement in theory and practice.
PhD thesis, 1999

Point labeling with sliding labels.
Comput. Geom., 1999

1998
A Combinatorial Framework for Map Labeling.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Point Set Labeling with Sliding Labels.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
A Practical Map Labeling Algorithm.
Comput. Geom., 1997

The Hardness of Approximating Set Cover.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1995
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem.
Proceedings of the Algorithms, 1995

Map Labeling Heuristics: Provably Good and Practically Useful.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995


  Loading...