Map Labeling Heuristics: Provably Good and Practically Useful. - Frank Wagner 001; Alexander Wolff 001 (SCG, 1995)

An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. - Frank Wagner 001; Alexander Wolff 001 (ESA, 1995)

The Hardness of Approximating Set Cover. - Alexander Wolff 001 (Lectures on Proof Verification and Approximation Algorithms, 1997)

A Practical Map Labeling Algorithm. - Frank Wagner 001; Alexander Wolff 001 (Comput. Geom., 1997)

Point Set Labeling with Sliding Labels. - Marc J. van Kreveld; Tycho Strijk; Alexander Wolff 001 (SCG, 1998)

A Combinatorial Framework for Map Labeling. - Frank Wagner 001; Alexander Wolff 001 (GD, 1998)

Point labeling with sliding labels. - Marc J. van Kreveld; Tycho Strijk; Alexander Wolff 001 (Comput. Geom., 1999)

Automated label placement in theory and practice. - Alexander Wolff 001 (1999)

New Algorithms for Two-Label Point Labeling. - Zhongping Qin; Alexander Wolff 001; Yin-Feng Xu; Binhai Zhu (ESA, 2000)

A Better Lower Bound for Two-Circle Point Labeling. - Alexander Wolff 001; Michael Thon; Yin-Feng Xu (ISAAC, 2000)

Labeling Subway Lines. - María Ángeles Garrido 001; Claudia Iturriaga; Alberto Márquez 001; José Ramón Portillo; Pedro Reyes; Alexander Wolff 001 (ISAAC, 2001)

Labeling Points with Weights. - Sheung-Hung Poon; Chan-Su Shin; Tycho Strijk; Alexander Wolff 001 (ISAAC, 2001)

Three Rules Suffice for Good Label Placement. - Frank Wagner 001; Alexander Wolff 001; Vikas Kapoor; Tycho Strijk (Algorithmica, 2001)

Labeling Points with Circles. - Tycho Strijk; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2001)

A Tutorial for Designing Flexible Geometric Algorithms. - Vikas Kapoor; Dietmar Kühl; Alexander Wolff 001 (Algorithmica, 2002)

Towards an evaluation of quality for names placement methods. - Steven van Dijk; Marc J. van Kreveld; Tycho Strijk; Alexander Wolff 001 (Int. J. Geogr. Inf. Sci., 2002)

A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. - Alexander Wolff 001; Michael Thon; Yin-Feng Xu (Int. J. Comput. Geom. Appl., 2002)

Algorithms for the placement of diagrams on maps. - Marc J. van Kreveld; Étienne Schramm; Alexander Wolff 001 (GIS, 2004)

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. - Marc Benkert; Alexander Wolff 001; Florian Widmann (JCDCG, 2004)

Labeling Points with Weights. - Sheung-Hung Poon; Chan-Su Shin; Tycho Strijk; Takeaki Uno; Alexander Wolff 001 (Algorithmica, 2004)

Facility location and the geometric minimum-diameter spanning tree. - Joachim Gudmundsson; Herman J. Haverkort; Sang-Min Park; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2004)

Delineating Boundaries for Imprecise Regions. - Iris Reinbacher; Marc Benkert; Marc J. van Kreveld; Joseph S. B. Mitchell; Alexander Wolff 001 (ESA, 2005)

Constructing the city Voronoi diagram faster. - Robert Görke; Alexander Wolff 001 (EuroCG, 2005)

Spanning trees with few crossings in geometric and topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (EuroCG, 2005)

Delineating boundaries for imprecise regions. - Iris Reinbacher; Marc Benkert; Marc J. van Kreveld; Alexander Wolff 001 (EuroCG, 2005)

A Mixed-Integer Program for Drawing High-Quality Metro Maps. - Martin Nöllenburg; Alexander Wolff 001 (GD, 2005)

Optimal spanners for axis-aligned rectangles. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Hazel Everett; Herman J. Haverkort; Naoki Katoh; Alexander Wolff 001 (Comput. Geom., 2005)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; Esther Moet; René van Oostrum; Alexander Wolff 001 (COCOON, 2006)

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. - Joachim Gudmundsson; Rolf Klein; Giri Narasimhan; Michiel H. M. Smid; Alexander Wolff 001 (Geometric Networks and Metric Space Embeddings, 2006)

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. - Marc Benkert; Martin Nöllenburg; Takeaki Uno; Alexander Wolff 001 (GD, 2006)

Generalization of land cover maps by mixed integer programming. - Jan-Henrik Haunert; Alexander Wolff 001 (GIS, 2006)

Constructing Interference-Minimal Networks. - Marc Benkert; Joachim Gudmundsson; Herman J. Haverkort; Alexander Wolff 001 (SOFSEM, 2006)

The minimum Manhattan network problem: Approximations and exact solutions. - Marc Benkert; Alexander Wolff 001; Florian Widmann; Takeshi Shirabe (Comput. Geom., 2006)

Farthest-point queries with geometric and combinatorial constraints. - Ovidiu Daescu; Ningfang Mi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2006)

Geometrische Netzwerke und ihre Visualisierung - Alexander Wolff 001 (2006)

Moving Vertices to Make Drawings Plane. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Alexander Wolff 001 (GD, 2007)

Straightening Drawings of Clustered Hierarchical Graphs. - Sergey Bereg; Markus Völker; Alexander Wolff 001; Yuanyi Zhang (SOFSEM (1), 2007)

Boundary labeling: Models and efficient algorithms for rectangular maps. - Michael A. Bekos; Michael Kaufmann 001; Antonios Symvonis; Alexander Wolff 001 (Comput. Geom., 2007)

Configurations with few crossings in topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (Comput. Geom., 2007)

Drawing Subway Maps: A Survey. - Alexander Wolff 001 (Inform. Forsch. Entwickl., 2007)

Drawing (Complete) Binary Tanglegrams. - Kevin Buchin; Maike Buchin; Jaroslaw Byrka; Martin Nöllenburg; Yoshio Okamoto; Rodrigo I. Silveira; Alexander Wolff 001 (GD, 2008)

Untangling a Planar Graph. - Andreas Spillner 001; Alexander Wolff 001 (SOFSEM, 2008)

Delineating Boundaries for Imprecise Regions. - Iris Reinbacher; Marc Benkert; Marc J. van Kreveld; Joseph S. B. Mitchell; Jack Snoeyink; Alexander Wolff 001 (Algorithmica, 2008)

Constructing minimum-interference networks. - Marc Benkert; Joachim Gudmundsson; Herman J. Haverkort; Alexander Wolff 001 (Comput. Geom., 2008)

Decomposing a simple polygon into pseudo-triangles and convex polygons. - Stefan Gerdjikov; Alexander Wolff 001 (Comput. Geom., 2008)

Constructing the City Voronoi Diagram Faster. - Robert Görke; Chan-Su Shin; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2008)

Morphing polylines: A step towards continuous generalization. - Martin Nöllenburg; Damian Merrick; Alexander Wolff 001; Marc Benkert (Comput. Environ. Urban Syst., 2008)

Drawing Binary Tanglegrams: An Experimental Evaluation. - Martin Nöllenburg; Markus Völker; Alexander Wolff 001; Danny Holten (ALENEX, 2009)

Manhattan-Geodesic Embedding of Planar Graphs. - Bastian Katz; Marcus Krug; Ignaz Rutter; Alexander Wolff 001 (GD, 2009)

Matching points with rectangles and squares. - Sergey Bereg; Nikolaus Mutsanas; Alexander Wolff 001 (Comput. Geom., 2009)

Untangling a Planar Graph. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner 001; Alexander Wolff 001 (Discret. Comput. Geom., 2009)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; René van Oostrum; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry. - Jason Dykes; Matthias Müller-Hannemann; Alexander Wolff 001 (Schematization in Cartography, Visualization, and Computational Geometry, 2010)

Optimal and topologically safe simplification of building footprints. - Jan-Henrik Haunert; Alexander Wolff 001 (GIS, 2010)

The Traveling Salesman Problem under Squared Euclidean Distances. - Fred van Nijnatten; René Sitters; Gerhard J. Woeginger; Alexander Wolff 001; Mark de Berg (STACS, 2010)

Optimizing active ranges for consistent dynamic map labeling. - Ken Been; Martin Nöllenburg; Sheung-Hung Poon; Alexander Wolff 001 (Comput. Geom., 2010)

Area aggregation in map generalisation by mixed-integer programming. - Jan-Henrik Haunert; Alexander Wolff 001 (Int. J. Geogr. Inf. Sci., 2010)

Trimming of Graphs, with Application to Point Labeling. - Thomas Erlebach; Torben Hagerup; Klaus Jansen; Moritz Minzlaff; Alexander Wolff 001 (Theory Comput. Syst., 2010)

Computing large matchings fast. - Ignaz Rutter; Alexander Wolff 001 (ACM Trans. Algorithms, 2010)

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. - Martin Fink 001; Jan-Henrik Haunert; Tamara Mchedlidze; Joachim Spoerhase; Alexander Wolff 001 (GD, 2011)

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. - Nadine Schwartges; Joachim Spoerhase; Alexander Wolff 001 (WAOA, 2011)

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. - Martin Nöllenburg; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2011)

Drawing Metro Maps Using Bézier Curves. - Martin Fink 001; Herman J. Haverkort; Martin Nöllenburg; Maxwell J. Roberts; Julian Schuhmann; Alexander Wolff 001 (GD, 2012)

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. - Kevin Buchin; Maike Buchin; Jaroslaw Byrka; Martin Nöllenburg; Yoshio Okamoto; Rodrigo I. Silveira; Alexander Wolff 001 (Algorithmica, 2012)

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (CoRR, 2012)

Putting Data on the Map (Dagstuhl Seminar 12261). - Stephen G. Kobourov; Alexander Wolff 001; Frank van Ham (Dagstuhl Reports, 2012)

Augmenting the Connectivity of Planar and Geometric Graphs. - Ignaz Rutter; Alexander Wolff 001 (J. Graph Algorithms Appl., 2012)

Cover Contact Graphs. - Nieves Atienza; Natalia de Castro; Carmen Cortés; María Ángeles Garrido 001; Clara I. Grima; Carlos G. Hernández; Alberto Márquez 001; Auxiliadora Moreno-González; Martin Nöllenburg; José Ramón Portillo; Pedro Reyes; Jesus Valenzuela; et al. (J. Comput. Geom., 2012)

Algorithms for Labeling Focus Regions. - Martin Fink 001; Jan-Henrik Haunert; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2012)

Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (CCCG, 2013)

Two-Sided Boundary Labeling with Adjacent Sides. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (WADS, 2013)

Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. - Martin Fink 001; Jan-Henrik Haunert; Joachim Spoerhase; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2013)

Graph Drawing and Cartography. - Alexander Wolff 001 (Handbook of Graph Drawing and Visualization, 2013)

Point Labeling with Sliding Labels in Interactive Maps. - Nadine Schwartges; Jan-Henrik Haunert; Alexander Wolff 001; Dennis Zwiebler (AGILE Conf., 2014)

Drawing Graphs within Restricted Area. - Maximilian Aulbach; Martin Fink 001; Julian Schuhmann; Alexander Wolff 001 (GD, 2014)

Luatodonotes: Boundary Labeling for Annotations in Texts. - Philipp Kindermann; Fabian Lipp; Alexander Wolff 001 (GD, 2014)

On Monotone Drawings of Trees. - Philipp Kindermann; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (GD, 2014)

Labeling streets in interactive maps using embedded labels. - Nadine Schwartges; Alexander Wolff 001; Jan-Henrik Haunert (SIGSPATIAL/GIS, 2014)

Smooth Orthogonal Drawings of Planar Graphs. - Muhammad Jawaherul Alam; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Alexander Wolff 001 (LATIN, 2014)

Semantic Word Cloud Representations: Hardness and Approximation Algorithms. - Lukas Barth; Sara Irina Fabrikant; Stephen G. Kobourov; Anna Lubiw; Martin Nöllenburg; Yoshio Okamoto; Sergey Pupyrev; Claudio Squarcella; Torsten Ueckerdt; Alexander Wolff 001 (LATIN, 2014)

Universal Point Sets for Drawing Planar Graphs with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Guest Editors' Foreword. - Stephen K. Wismath; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. - Nadine Schwartges; Benjamin Morgan; Jan-Henrik Haunert; Alexander Wolff 001 (AGILE Conf., 2015)

Pixel and Voxel Representations of Graphs. - Md. Jawaherul Alam; Thomas Bläsius; Ignaz Rutter; Torsten Ueckerdt; Alexander Wolff 001 (GD, 2015)

Colored Non-crossing Euclidean Steiner Forest. - Sergey Bereg; Krzysztof Fleszar 001; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2015)

Approximating Minimum Manhattan Networks in Higher Dimensions. - Aparna Das; Emden R. Gansner; Michael Kaufmann 001; Stephen G. Kobourov; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2015)

Ordering Metro Lines by Block Crossings. - Martin Fink 001; Sergey Pupyrev; Alexander Wolff 001 (J. Graph Algorithms Appl., 2015)

Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. - Dongliang Peng 002; Alexander Wolff 001; Jan-Henrik Haunert (AGILE Conf., 2016)

Obstructing Visibilities with One Obstacle. - Steven Chaplick; Fabian Lipp; Ji-won Park; Alexander Wolff 001 (GD, 2016)

Snapping Graph Drawings to the Grid Optimally. - Andre Löffler; Thomas C. van Dijk; Alexander Wolff 001 (GD, 2016)

Multi-sided Boundary Labeling. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (Algorithmica, 2016)

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. - Fabian Lipp; Alexander Wolff 001; Johannes Zink 001 (Algorithms, 2016)

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. - Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff 001 (J. Graph Algorithms Appl., 2016)

Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. - Benedikt Budig; Thomas C. van Dijk; Alexander Wolff 001 (ACM Trans. Spatial Algorithms Syst., 2016)

Beyond Outerplanarity. - Steven Chaplick; Myroslav Kryven; Giuseppe Liotta; Andre Löffler; Alexander Wolff 001 (GD, 2017)

Computing Storyline Visualizations with Few Block Crossings. - Thomas C. van Dijk; Fabian Lipp; Peter Markfelder; Alexander Wolff 001 (GD, 2017)

Algorithmically-Guided User Interaction. - Thomas C. van Dijk; Alexander Wolff 001 (SIGSPATIAL/GIS, 2017)

Improved Approximation Algorithms for Box Contact Representations. - Michael A. Bekos; Thomas C. van Dijk; Martin Fink 001; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2017)

Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. - Jan-Henrik Haunert; Alexander Wolff 001 (ISPRS Int. J. Geo Inf., 2017)

Progress on Partial Edge Drawings. - Till Bruckdorfer; Sabine Cornelsen; Carsten Gutwenger; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Alexander Wolff 001 (J. Graph Algorithms Appl., 2017)

Block Crossings in Storyline Visualizations. - Thomas C. van Dijk; Martin Fink 001; Norbert Fischer; Fabian Lipp; Peter Markfelder; Alexander Ravsky; Subhash Suri; Alexander Wolff 001 (J. Graph Algorithms Appl., 2017)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. - Evmorfia N. Argyriou; Sabine Cornelsen; Henry Förster; Michael Kaufmann 001; Martin Nöllenburg; Yoshio Okamoto; Chrysanthi N. Raftopoulou; Alexander Wolff 001 (GD, 2018)

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. - Timothy M. Chan; Thomas C. van Dijk; Krzysztof Fleszar 001; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2018)

Approximating the Generalized Minimum Manhattan Network Problem. - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (Algorithmica, 2018)

On the Maximum Crossing Number. - Markus Chimani; Stefan Felsner; Stephen G. Kobourov; Torsten Ueckerdt; Pavel Valtr 001; Alexander Wolff 001 (J. Graph Algorithms Appl., 2018)

Line and Plane Cover Numbers Revisited. - Therese Biedl; Stefan Felsner; Henk Meijer; Alexander Wolff 001 (GD, 2019)

On Arrangements of Orthogonal Circles. - Steven Chaplick; Henry Förster; Myroslav Kryven; Alexander Wolff 001 (GD, 2019)

Stick Graphs with Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (GD, 2019)

Representing Graphs and Hypergraphs by Touching Polygons in 3D. - William S. Evans; Pawel Rzazewski; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (GD, 2019)

Computing Height-Optimal Tangles Faster. - Oksana Firman; Philipp Kindermann; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (GD, 2019)

Variants of the Segment Number of a Graph. - Yoshio Okamoto; Alexander Ravsky; Alexander Wolff 001 (GD, 2019)

Compact drawings of 1-planar graphs with right-angle crossings and few bends. - Steven Chaplick; Fabian Lipp; Alexander Wolff 001; Johannes Zink 001 (Comput. Geom., 2019)

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192). - Sara Irina Fabrikant; Silvia Miksch; Alexander Wolff 001 (Dagstuhl Reports, 2019)

Multi-level Steiner Trees. - Abu Reyan Ahmed; Patrizio Angelini; Faryad Darabi Sahneh; Alon Efrat; David Glickenstein; Martin Gronemann; Niklas Heinsohn; Stephen G. Kobourov; Richard Spence; Joseph Watkins; Alexander Wolff 001 (ACM J. Exp. Algorithmics, 2019)

Drawing Graphs on Few Circles and Few Spheres. - Myroslav Kryven; Alexander Ravsky; Alexander Wolff 001 (J. Graph Algorithms Appl., 2019)

Drawing Graphs with Circular Arcs and Right-Angle Crossings. - Steven Chaplick; Henry Förster; Myroslav Kryven; Alexander Wolff 001 (SWAT, 2020)

Bundled Crossings Revisited. - Steven Chaplick; Thomas C. van Dijk; Myroslav Kryven; Ji-won Park; Alexander Ravsky; Alexander Wolff 001 (J. Graph Algorithms Appl., 2020)

Recognizing Stick Graphs with and without Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (J. Graph Algorithms Appl., 2020)

Drawing graphs on few lines and few planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (J. Comput. Geom., 2020)

Finding Optimal Sequences for Area Aggregation - A⋆ vs. Integer Linear Programming. - Dongliang Peng 002; Alexander Wolff 001; Jan-Henrik Haunert (ACM Trans. Spatial Algorithms Syst., 2020)

Algorithms for Floor Planning with Proximity Requirements. - Jonathan Klawitter; Felix Klesen; Alexander Wolff 001 (CAAD Futures, 2021)

Extending Partial Representations of Rectangular Duals with Given Contact Orientations. - Steven Chaplick; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (CIAC, 2021)

Robust Gateway Placement for Scalable LoRaWAN. - Frank Loh; Dominique Bau; Johannes Zink 001; Alexander Wolff 001; Tobias Hoßfeld (WMNC, 2021)

Using the Metro-Map Metaphor for Drawing Hypergraphs. - Fabian Frank; Michael Kaufmann 001; Stephen G. Kobourov; Tamara Mchedlidze; Sergey Pupyrev; Torsten Ueckerdt; Alexander Wolff 001 (SOFSEM, 2021)

ClusterSets: Optimizing Planar Clusters in Categorical Point Data. - Jakob Geiger; Sabine Cornelsen; Jan-Henrik Haunert; Philipp Kindermann; Tamara Mchedlidze; Martin Nöllenburg; Yoshio Okamoto; Alexander Wolff 001 (Comput. Graph. Forum, 2021)

Angle Covers: Algorithms and Complexity. - William S. Evans; Ellen Gethner; Jack Spalding-Jamieson; Alexander Wolff 001 (J. Graph Algorithms Appl., 2021)

Morphing Rectangular Duals. - Steven Chaplick; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (GD, 2022)

Outside-Obstacle Representations with All Vertices on the Outer Face. - Oksana Firman; Philipp Kindermann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Alexander Wolff 001 (GD, 2022)

Coloring Mixed and Directional Interval Graphs. - Grzegorz Gutowski; Florian Mittelstädt; Ignaz Rutter; Joachim Spoerhase; Alexander Wolff 001; Johannes Zink 001 (GD, 2022)

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. - Ina Goeßmann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Stephen G. Kobourov; Myroslav Kryven; Alexander Wolff 001; Johannes Zink 001 (WG, 2022)

Minimum rectilinear polygons for given angle sequences. - William S. Evans; Krzysztof Fleszar 001; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2022)

Layered drawing of undirected graphs with generalized port constraints. - Johannes Zink 001; Julian Walter; Joachim Baumeister; Alexander Wolff 001 (Comput. Geom., 2022)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. - Steven Chaplick; Stefan Felsner; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (Theor. Comput. Sci., 2022)

The Parametrized Complexity of the Segment Number. - Sabine Cornelsen; Giordano Da Lozzo; Luca Grilli 001; Siddharth Gupta 002; Jan Kratochvíl; Alexander Wolff 001 (GD (2), 2023)

A Simple Pipeline for Orthogonal Graph Drawing. - Tim Hegemann; Alexander Wolff 001 (GD (2), 2023)

Coloring and Recognizing Mixed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (ISAAC, 2023)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. - Jonathan Klawitter; Felix Klesen; Moritz Niederer; Alexander Wolff 001 (SOFSEM, 2023)

Morphing Planar Graph Drawings Through 3D. - Kevin Buchin; William S. Evans; Fabrizio Frati; Irina Kostitsyna; Maarten Löffler; Tim Ophelders; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

Planar L-Drawings of Directed Graphs. - Steven Chaplick; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Martin Nöllenburg; Maurizio Patrignani; Ioannis G. Tollis; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

Coloring and Recognizing Directed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

The Complexity of Drawing Graphs on Few Lines and Few Planes. - Steven Chaplick; Krzysztof Fleszar 001; Fabian Lipp; Alexander Ravsky; Oleg Verbitsky 001; Alexander Wolff 001 (J. Graph Algorithms Appl., 2023)

The Computational Complexity of the ChordLink Model. - Philipp Kindermann; Jan Sauer; Alexander Wolff 001 (J. Graph Algorithms Appl., 2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels. - Václav Blazej; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SoCG, 2024)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

Graph Harvester (Software Abstract). - Julius Deynet; Tim Hegemann; Sebastian Kempf; Alexander Wolff 001 (GD, 2024)

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. - Oksana Firman; Grzegorz Gutowski; Myroslav Kryven; Yuto Okada; Alexander Wolff 001 (GD, 2024)

Storylines with a Protagonist. - Tim Hegemann; Alexander Wolff 001 (GD, 2024)

Outerplanar and Forest Storyplans. - Jirí Fiala 001; Oksana Firman; Giuseppe Liotta; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Morphing Graph Drawings in the Presence of Point Obstacles. - Oksana Firman; Tim Hegemann; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Eliminating Crossings in Ordered Graphs. - Akanksha Agrawal 001; Sergio Cabello; Michael Kaufmann 001; Saket Saurabh 001; Roohani Sharma; Yushi Uno; Alexander Wolff 001 (SWAT, 2024)

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. - Oksana Firman; Grzegorz Gutowski; Myroslav Kryven; Yuto Okada; Alexander Wolff 001 (CoRR, 2024)

Recognizing 2-Layer and Outer k-Planar Graphs. - Yasuaki Kobayashi; Yuto Okada; Alexander Wolff 001 (CoRR, 2024)

Bounding and Computing Obstacle Numbers of Graphs. - Martin Balko; Steven Chaplick; Robert Ganian; Siddharth Gupta 002; Michael Hoffmann 001; Pavel Valtr 001; Alexander Wolff 001 (SIAM J. Discret. Math., 2024)

Adjacency Graphs of Polyhedral Surfaces. - Elena Arseneva; Linda Kleist; Boris Klemz; Maarten Löffler; André Schulz 001; Birgit Vogtenhuber; Alexander Wolff 001 (Discret. Comput. Geom., 2024)

Graph Harvester. - Julius Deynet; Tim Hegemann; Sebastian Kempf; Alexander Wolff 001 (DROPS Artifacts, 2024)

Publines. - Tim Hegemann; Alexander Wolff 001 (DROPS Artifacts, 2024)

Recognizing 2-Layer and Outer k-Planar Graphs. - Yasuaki Kobayashi; Yuto Okada; Alexander Wolff 001 (SoCG, 2025)

Minimum Monotone Spanning Trees. - Emilio Di Giacomo; Walter Didimo; Eleni Katsanou; Lena Schlipf; Antonios Symvonis; Alexander Wolff 001 (SOFSEM (1), 2025)

Unbent Collections of Orthogonal Drawings. - Todor Antic; Giuseppe Liotta; Tomás Masarík; Giacomo Ortali; Matthias Pfretzschner; Peter Stumpf; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2025)

Visualization of Event Graphs for Train Schedules. - Johann Hartleb; Marie Schmidt; Samuel Wolf; Alexander Wolff 001 (CoRR, 2025)

StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data. - Markus Wallinger; Annika Bonerath; Wouter Meulemans; Martin Nöllenburg; Stephen G. Kobourov; Alexander Wolff 001 (CoRR, 2025)

The Parameterized Complexity of Computing the Linear Vertex Arboricity. - Alexander Erhardt; Alexander Wolff 001 (CoRR, 2025)

Parameterized approaches to orthogonal compaction. - Walter Didimo; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Alexander Wolff 001; Meirav Zehavi (J. Comput. Syst. Sci., 2026)