Alexander Wolff

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 126

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

SOFSEM

Free University of Berlin, Dahlem, Germany (PHD)

Education History

Free University of Berlin, Dahlem, Germany

PHD

Publications

Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
Morphing Graph Drawings in the Presence of Point Obstacles. SOFSEM (2024)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. SOFSEM (2024)
Tim Hegemann, Alexander Wolff
A Simple Pipeline for Orthogonal Graph Drawing. CoRR (2023)
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
The Parametrized Complexity of the Segment Number. GD (2) (2023)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. CoRR (2023)
Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. SOFSEM (2023)
Tim Hegemann, Alexander Wolff
A Simple Pipeline for Orthogonal Graph Drawing. GD (2) (2023)
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2 (1) (2023)
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
Coloring and Recognizing Mixed Interval Graphs. ISAAC (2023)
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
The Parametrized Complexity of the Segment Number. CoRR (2023)
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
Morphing Planar Graph Drawings Through 3D. SOFSEM (2023)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. SOFSEM (2023)
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
Coloring and Recognizing Directed Interval Graphs. CoRR (2023)
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
The Complexity of Finding Tangles. SOFSEM (2023)
Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
Morphing Graph Drawings in the Presence of Point Obstacles. CoRR (2023)
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR (2023)
Philipp Kindermann, Jan Sauer, Alexander Wolff
The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27 (9) (2023)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27 (6) (2023)
Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2 (1) (2023)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs. ESA (2022)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100 (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. GD (2022)
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
Morphing Planar Graph Drawings Through 3D. CoRR (2022)
Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
Outside-Obstacle Representations with All Vertices on the Outer Face. GD (2022)
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Coloring Mixed and Directional Interval Graphs. GD (2022)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. CoRR (2022)
Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR (2022)
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Coloring Mixed and Directional Interval Graphs. CoRR (2022)
Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. CoRR (2022)
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. CoRR (2022)
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. WG (2022)
Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919 (2022)
Johannes Zink, Julian Walter, Joachim Baumeister, Alexander Wolff
Layered drawing of undirected graphs with generalized port constraints. Comput. Geom. (2022)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and computing obstacle numbers of graphs. CoRR (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC (2021)
Jonathan Klawitter, Felix Klesen, Alexander Wolff
Algorithms for Floor Planning with Proximity Requirements. CAAD Futures (2021)
Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum 40 (3) (2021)
William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25 (2) (2021)
Jonathan Klawitter, Felix Klesen, Alexander Wolff
Algorithms for Floor Planning with Proximity Requirements. CoRR (2021)
Frank Loh, Dominique Bau, Johannes Zink, Alexander Wolff, Tobias Hoßfeld
Robust Gateway Placement for Scalable LoRaWAN. WMNC (2021)
Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM (2021)
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
Adjacency Graphs of Polyhedral Surfaces. SoCG (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. CoRR (2021)
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
Adjacency Graphs of Polyhedral Surfaces. CoRR (2021)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Recognizing Stick Graphs with and without Length Constraints. J. Graph Algorithms Appl. 24 (4) (2020)
Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
The Complexity of Finding Tangles. CoRR (2020)
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24 (4) (2020)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR (2020)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT (2020)
William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
Angle Covers: Algorithms and Complexity. WALCOM (2020)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Drawing graphs on few lines and few planes. J. Comput. Geom. 11 (1) (2020)
Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff
Layered Drawing of Undirected Graphs with Generalized Port Constraints. Graph Drawing (2020)
Dongliang Peng, Alexander Wolff, Jan-Henrik Haunert
vs. Integer Linear Programming. ACM Trans. Spatial Algorithms Syst. 7 (1) (2020)
Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff
Layered Drawing of Undirected Graphs with Generalized Port Constraints. CoRR (2020)
Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
Variants of the Segment Number of a Graph. CoRR (2019)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
On Arrangements of Orthogonal Circles. Graph Drawing (2019)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. Graph Drawing (2019)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR (2019)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. CoRR (2019)
Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
Variants of the Segment Number of a Graph. Graph Drawing (2019)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Stick Graphs with Length Constraints. Graph Drawing (2019)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. Graph Drawing (2019)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
On Arrangements of Orthogonal Circles. CoRR (2019)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Stick Graphs with Length Constraints. CoRR (2019)
Sara Irina Fabrikant, Silvia Miksch, Alexander Wolff
Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192). Dagstuhl Reports 9 (5) (2019)
William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
Angle Covers: Algorithms and Complexity. CoRR (2019)
Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
Computing Height-Optimal Tangles Faster. Graph Drawing (2019)
Myroslav Kryven, Alexander Ravsky, Alexander Wolff
Drawing Graphs on Few Circles and Few Spheres. J. Graph Algorithms Appl. 23 (2) (2019)
Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink
Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84 (2019)
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff
Bundled Crossings Revisited. Graph Drawing (2019)
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
Multi-level Steiner Trees. ACM J. Exp. Algorithmics 24 (1) (2019)
Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
Computing Optimal Tangles Faster. CoRR (2019)
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
Multi-Level Steiner Trees. CoRR (2018)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22 (1) (2018)
Myroslav Kryven, Alexander Ravsky, Alexander Wolff
Drawing Graphs on Few Circles and Few Spheres. CALDAM (2018)
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff
Bundled Crossings Revisited. CoRR (2018)
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Graph Drawing (2018)
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC (2018)
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR (2018)
Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR (2018)
Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Graph Drawing (2018)
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
Multi-Level Steiner Trees. SEA (2018)
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR (2018)
Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80 (4) (2018)
Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff
Computing Storyline Visualizations with Few Block Crossings. CoRR (2017)
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff
Beyond Outerplanarity. Graph Drawing (2017)
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff
Beyond Outerplanarity. CoRR (2017)
Thomas C. van Dijk, Alexander Wolff
Algorithmically-Guided User Interaction. SIGSPATIAL/GIS (2017)
Myroslav Kryven, Alexander Ravsky, Alexander Wolff
Drawing Graphs on Few Circles and Few Spheres. CoRR (2017)
Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
Improved Approximation Algorithms for Box Contact Representations. Algorithmica 77 (3) (2017)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. CoRR (2017)
Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
Planar L-Drawings of Directed Graphs. Graph Drawing (2017)
Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
Planar L-Drawings of Directed Graphs. CoRR (2017)
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS (2017)
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21 (4) (2017)
Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff
Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. 21 (5) (2017)
Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff
Computing Storyline Visualizations with Few Block Crossings. Graph Drawing (2017)
Jan-Henrik Haunert, Alexander Wolff
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. ISPRS Int. J. Geo Inf. 6 (11) (2017)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. IWOCA (2017)

Alexander Wolff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexander Wolff