default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Wolff 0001
Person information
- affiliation: University of Würzburg, Germany
Other persons with the same name
- Alexander Wolff 0002 — University Medical Center Göttingen, Germany
- Alexander Wolff 0003 — University of Bremen, Germany
- Alexander Wolff 0004 — RPTU Kaiserslautern-Landau, Department of Electrical and Computer Engineering, Research Center OPTIMAS, Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c111]Emilio Di Giacomo
, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff:
Minimum Monotone Spanning Trees. SOFSEM (1) 2025: 225-240- [i76]Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink:
Unbent Collections of Orthogonal Drawings. CoRR abs/2502.18390 (2025) - [i75]Johann Hartleb, Marie Schmidt, Samuel Wolf, Alexander Wolff:
Visualization of Event Graphs for Train Schedules. CoRR abs/2503.01808 (2025) - 2024
- [j67]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71(4): 1429-1455 (2024) - [j66]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [c110]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. SoCG 2024: 20:1-20:16 - [c109]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c108]Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff:
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. GD 2024: 14:1-14:17 - [c107]Tim Hegemann, Alexander Wolff:
Storylines with a Protagonist. GD 2024: 26:1-26:22 - [c106]Julius Deynet, Tim Hegemann, Sebastian Kempf, Alexander Wolff:
Graph Harvester (Software Abstract). GD 2024: 58:1-58:3 - [c105]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225 - [c104]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: 240-254 - [c103]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [d2]Julius Deynet, Tim Hegemann, Sebastian Kempf, Alexander Wolff:
Graph Harvester. DROPS Artifacts, 2024
- [d1]Tim Hegemann, Alexander Wolff:
Publines. DROPS Artifacts, 2024 - [i74]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. CoRR abs/2403.13702 (2024) - [i73]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i72]Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff:
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. CoRR abs/2408.04264 (2024) - [i71]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i70]Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff:
Minimum Monotone Spanning Trees. CoRR abs/2411.14038 (2024) - [i69]Yasuaki Kobayashi, Yuto Okada, Alexander Wolff:
Recognizing 2-Layer and Outer k-Planar Graphs. CoRR abs/2412.04042 (2024) - 2023
- [j65]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): 5:1-5:18 (2023) - [j64]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): 7:1-7:15 (2023) - [j63]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): 459-488 (2023) - [j62]Philipp Kindermann, Jan Sauer, Alexander Wolff:
The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27(9): 759-767 (2023) - [c102]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [c101]Tim Hegemann, Alexander Wolff:
A Simple Pipeline for Orthogonal Graph Drawing. GD (2) 2023: 170-186 - [c100]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Mixed Interval Graphs. ISAAC 2023: 36:1-36:14 - [c99]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
The Complexity of Finding Tangles. SOFSEM 2023: 3-17 - [c98]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95 - [c97]Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff:
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. SOFSEM 2023: 96-110 - [c96]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [i68]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Directed Interval Graphs. CoRR abs/2303.07960 (2023) - [i67]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - [i66]Tim Hegemann, Alexander Wolff:
A Simple Pipeline for Orthogonal Graph Drawing. CoRR abs/2309.01671 (2023) - [i65]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. CoRR abs/2311.13523 (2023) - [i64]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 abs/2311.14516 (2023) - [i63]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR abs/2312.16213 (2023) - 2022
- [j61]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022) - [j60]Johannes Zink, Julian Walter, Joachim Baumeister, Alexander Wolff:
Layered drawing of undirected graphs with generalized port constraints. Comput. Geom. 105-106: 101886 (2022) - [j59]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: 66-74 (2022) - [c95]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [c94]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. GD 2022: 389-403 - [c93]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. GD 2022: 418-431 - [c92]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. GD 2022: 432-440 - [c91]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: 271-286 - [i62]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 abs/2202.11604 (2022) - [i61]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR abs/2202.13015 (2022) - [i60]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - [i59]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. CoRR abs/2208.14250 (2022) - [i58]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (2022) - [i57]Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022) - [i56]Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff:
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. CoRR abs/2210.06744 (2022) - 2021
- [j58]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): 471-481 (2021) - [j57]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25(2): 643-661 (2021) - [c90]Jonathan Klawitter, Felix Klesen, Alexander Wolff:
Algorithms for Floor Planning with Proximity Requirements. CAAD Futures 2021: 151-171 - [c89]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c88]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c87]Frank Loh, Dominique Bau, Johannes Zink, Alexander Wolff, Tobias Hoßfeld:
Robust Gateway Placement for Scalable LoRaWAN. WMNC 2021: 71-78 - [c86]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: 361-372 - [i55]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR abs/2102.02013 (2021) - [i54]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i53]Jonathan Klawitter, Felix Klesen, Alexander Wolff:
Algorithms for Floor Planning with Proximity Requirements. CoRR abs/2107.05036 (2021) - [i52]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. CoRR abs/2112.03040 (2021) - 2020
- [j56]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24(4): 621-655 (2020) - [j55]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): 657-681 (2020) - [j54]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): 433-475 (2020) - [j53]Dongliang Peng, Alexander Wolff, Jan-Henrik Haunert:
Finding Optimal Sequences for Area Aggregation - A⋆ vs. Integer Linear Programming. ACM Trans. Spatial Algorithms Syst. 7(1): 4:1-4:40 (2020) - [c85]Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff:
Layered Drawing of Undirected Graphs with Generalized Port Constraints. GD 2020: 220-234 - [c84]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - [c83]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. WALCOM 2020: 94-106 - [i51]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR abs/2003.04740 (2020) - [i50]Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff:
Layered Drawing of Undirected Graphs with Generalized Port Constraints. CoRR abs/2008.10583 (2020)
2010 – 2019
- 2019
- [j52]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84: 50-68 (2019) - [j51]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): 2.5:1-2.5:22 (2019) - [j50]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. J. Graph Algorithms Appl. 23(2): 371-391 (2019) - [c82]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. GD 2019: 3-17 - [c81]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD 2019: 18-32 - [c80]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. GD 2019: 63-77 - [c79]Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. GD 2019: 203-215 - [c78]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. GD 2019: 216-229 - [c77]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. GD 2019: 409-415 - [c76]Yoshio Okamoto, Alexander Ravsky, Alexander Wolff:
Variants of the Segment Number of a Graph. GD 2019: 430-443 - [i49]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. CoRR abs/1907.05257 (2019) - [i48]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. CoRR abs/1907.08121 (2019) - [i47]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. CoRR abs/1908.07647 (2019) - [i46]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR abs/1908.08273 (2019) - [i45]Yoshio Okamoto, Alexander Ravsky, Alexander Wolff:
Variants of the Segment Number of a Graph. CoRR abs/1908.08871 (2019) - [i44]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. CoRR abs/1911.02040 (2019) - [i43]Sara Irina Fabrikant, Silvia Miksch, Alexander Wolff:
Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192). Dagstuhl Reports 9(5): 31-57 (2019) - 2018
- [j49]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80(4): 1170-1190 (2018) - [j48]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22(1): 67-87 (2018) - [c75]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CALDAM 2018: 164-178 - [c74]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. GD 2018: 137-151 - [c73]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. GD 2018: 509-523 - [c72]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: 61:1-61:13 - [c71]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: 15:1-15:14 - [i42]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 abs/1804.02627 (2018) - [i41]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 abs/1806.02851 (2018) - [i40]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1806.10044 (2018) - [i39]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 abs/1808.10536 (2018) - [i38]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. CoRR abs/1812.04263 (2018) - 2017
- [j47]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): 902-920 (2017) - [j46]Jan-Henrik Haunert, Alexander Wolff:
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. ISPRS Int. J. Geo Inf. 6(11): 342 (2017) - [j45]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): 757-786 (2017) - [j44]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): 873-913 (2017) - [c70]Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff:
Computing Storyline Visualizations with Few Block Crossings. GD 2017: 365-378 - [c69]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. GD 2017: 465-478 - [c68]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. GD 2017: 546-559 - [c67]Thomas C. van Dijk, Alexander Wolff:
Algorithmically-Guided User Interaction. SIGSPATIAL/GIS 2017: 11:1-11:4 - [c66]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. IWOCA 2017: 61-74 - [c65]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: 265-276 - [i37]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. CoRR abs/1705.05176 (2017) - [i36]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. CoRR abs/1708.08723 (2017) - [i35]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 abs/1708.09107 (2017) - [i34]Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff:
Computing Storyline Visualizations with Few Block Crossings. CoRR abs/1709.01055 (2017) - [i33]Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CoRR abs/1709.06965 (2017) - 2016
- [j43]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. Algorithmica 76(1): 225-258 (2016) - [j42]Fabian Lipp, Alexander Wolff, Johannes Zink:
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms 9(3): 53 (2016) - [j41]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. J. Graph Algorithms Appl. 20(1): 133-158 (2016) - [j40]Benedikt Budig, Thomas C. van Dijk, Alexander Wolff:
Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. ACM Trans. Spatial Algorithms Syst. 2(4): 13:1-13:24 (2016) - [c64]Dongliang Peng, Alexander Wolff, Jan-Henrik Haunert:
Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. AGILE Conf. 2016: 399-415 - [c63]Andre Löffler, Thomas C. van Dijk, Alexander Wolff:
Snapping Graph Drawings to the Grid Optimally. GD 2016: 144-151 - [c62]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. GD 2016: 166-180 - [c61]Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. GD 2016: 295-308 - [c60]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. GD 2016: 382-398 - [i32]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR abs/1606.06940 (2016) - [i31]Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. CoRR abs/1607.00278 (2016) - [i30]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.01196 (2016) - [i29]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.06444 (2016) - [i28]Andre Löffler, Thomas C. van Dijk, Alexander Wolff:
Snapping Graph Drawings to the Grid Optimally. CoRR abs/1608.08844 (2016) - [i27]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. CoRR abs/1609.00321 (2016) - 2015
- [j39]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica 71(1): 36-52 (2015) - [j38]Martin Fink, Sergey Pupyrev, Alexander Wolff:
Ordering Metro Lines by Block Crossings. J. Graph Algorithms Appl. 19(1): 111-153 (2015) - [c59]Nadine Schwartges, Benjamin Morgan, Jan-Henrik Haunert, Alexander Wolff:
Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. AGILE Conf. 2015: 269-287 - [c58]Fabian Lipp, Alexander Wolff, Johannes Zink:
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. GD 2015: 52-59 - [c57]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. GD 2015: 472-486 - [c56]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c55]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG 2015: 105-119 - [c54]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. WALCOM 2015: 222-233 - [i26]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. CoRR abs/1505.01410 (2015) - [i25]Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. CoRR abs/1507.01450 (2015) - [i24]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - 2014
- [j37]Stephen K. Wismath, Alexander Wolff:
Guest Editors' Foreword. J. Graph Algorithms Appl. 18(2): 174-175 (2014) - [j36]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [c53]Nadine Schwartges, Jan-Henrik Haunert, Alexander Wolff, Dennis Zwiebler:
Point Labeling with Sliding Labels in Interactive Maps. AGILE Conf. 2014: 295-310 - [c52]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. ESA 2014: 87-99 - [c51]Philipp Kindermann, Fabian Lipp, Alexander Wolff:
Luatodonotes: Boundary Labeling for Annotations in Texts. GD 2014: 76-88 - [c50]Maximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff:
Drawing Graphs within Restricted Area. GD 2014: 367-379 - [c49]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. GD 2014: 488-500 - [c48]Benedikt Budig, Thomas C. van Dijk, Alexander Wolff:
Matching labels and markers in historical maps: an algorithm with interactive postprocessing. MapInteract@GIS 2014: 22-28 - [c47]Nadine Schwartges, Alexander Wolff, Jan-Henrik Haunert:
Labeling streets in interactive maps using embedded labels. SIGSPATIAL/GIS 2014: 517-520 - [c46]Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. LATIN 2014: 144-155 - [c45]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN 2014: 514-525 - [i23]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. CoRR abs/1403.4861 (2014) - [i22]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1408.3325 (2014) - [i21]Maximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff:
Drawing Graphs within Restricted Area. CoRR abs/1409.0499 (2014) - 2013
- [j35]Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, Alexander Wolff:
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. IEEE Trans. Vis. Comput. Graph. 19(12): 2326-2335 (2013) - [c44]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c43]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Approximating the Generalized Minimum Manhattan Network Problem. ISAAC 2013: 722-732 - [c42]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Two-Sided Boundary Labeling with Adjacent Sides. WADS 2013: 463-474 - [e3]Stephen K. Wismath, Alexander Wolff:
Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8242, Springer 2013, ISBN 978-3-319-03840-7 [contents] - [r1]Alexander Wolff:
Graph Drawing and Cartography. Handbook of Graph Drawing and Visualization 2013: 697-736 - [i20]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-Sided Boundary Labeling. CoRR abs/1305.0750 (2013) - [i19]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR abs/1311.4778 (2013) - [i18]Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. CoRR abs/1312.3538 (2013) - 2012
- [j34]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012) - [j33]Ignaz Rutter, Alexander Wolff:
Augmenting the Connectivity of Planar and Geometric Graphs. J. Graph Algorithms Appl. 16(2): 599-628 (2012) - [j32]Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. J. Comput. Geom. 3(1): 102-131 (2012) - [j31]Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff:
Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012) - [c41]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. GD 2012: 67-78 - [c40]Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff:
Drawing Metro Maps Using Bézier Curves. GD 2012: 463-474 - [c39]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. WALCOM 2012: 186-197 - [i17]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012) - [i16]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) - [i15]Stephen G. Kobourov, Alexander Wolff, Frank van Ham:
Putting Data on the Map (Dagstuhl Seminar 12261). Dagstuhl Reports 2(6): 51-76 (2012) - 2011
- [j30]Martin Nöllenburg, Alexander Wolff:
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. IEEE Trans. Vis. Comput. Graph. 17(5): 626-641 (2011) - [c38]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60 - [c37]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. GD 2011: 441-442 - [c36]Nadine Schwartges, Joachim Spoerhase, Alexander Wolff:
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. WAOA 2011: 77-88 - [i14]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011) - [i13]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. CoRR abs/1107.4970 (2011) - 2010
- [j29]Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3): 312-328 (2010) - [j28]Jan-Henrik Haunert, Alexander Wolff:
Area aggregation in map generalisation by mixed-integer programming. Int. J. Geogr. Inf. Sci. 24(12): 1871-1897 (2010) - [j27]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) - [j26]Ignaz Rutter, Alexander Wolff:
Computing large matchings fast. ACM Trans. Algorithms 7(1): 1:1-1:21 (2010) - [c35]Jan-Henrik Haunert, Alexander Wolff:
Optimal and topologically safe simplification of building footprints. GIS 2010: 192-201 - [c34]Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg:
The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250 - [e2]Jason Dykes, Matthias Müller-Hannemann, Alexander Wolff:
Schematization in Cartography, Visualization, and Computational Geometry, 14.11. - 19.11.2010. Dagstuhl Seminar Proceedings 10461, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i12]Jason Dykes, Matthias Müller-Hannemann, Alexander Wolff:
10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry. Schematization in Cartography, Visualization, and Computational Geometry 2010 - [i11]Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff:
The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010)
2000 – 2009
- 2009
- [j25]Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff:
Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009) - [j24]Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. Discret. Comput. Geom. 42(4): 542-569 (2009) - [j23]Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geom. Appl. 19(3): 267-288 (2009) - [j22]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [c33]Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten:
Drawing Binary Tanglegrams: An Experimental Evaluation. ALENEX 2009: 106-119 - [c32]Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff:
Manhattan-Geodesic Embedding of Planar Graphs. GD 2009: 207-218 - 2008
- [j21]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) - [j20]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) - [j19]Stefan Gerdjikov, Alexander Wolff:
Decomposing a simple polygon into pseudo-triangles and convex polygons. Comput. Geom. 41(1-2): 21-30 (2008) - [j18]Ignaz Rutter, Alexander Wolff:
Augmenting the Connectivity of Planar and Geometric Graphs. Electron. Notes Discret. Math. 31: 53-56 (2008) - [j17]Robert Görke, Chan-Su Shin, Alexander Wolff:
Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geom. Appl. 18(4): 275-294 (2008) - [j16]Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert:
Morphing polylines: A step towards continuous generalization. Comput. Environ. Urban Syst. 32(4): 248-260 (2008) - [c31]Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
Optimizing active ranges for consistent dynamic map labeling. SCG 2008: 10-19 - [c30]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams. GD 2008: 324-335 - [c29]Ignaz Rutter, Alexander Wolff:
Computing large matchings fast. SODA 2008: 183-192 - [c28]Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. SOFSEM 2008: 473-484 - [c27]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - [i10]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) - [i9]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008) - [i8]Martin Nöllenburg, Danny Holten, Markus Völker, Alexander Wolff:
Drawing Binary Tanglegrams: An Experimental Evaluation. CoRR abs/0806.0928 (2008) - 2007
- [j15]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007) - [j14]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with few crossings in topological graphs. Comput. Geom. 37(2): 104-114 (2007) - [j13]Alexander Wolff:
Drawing Subway Maps: A Survey. Inform. Forsch. Entwickl. 22(1): 23-44 (2007) - [c26]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c25]Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff:
Moving Vertices to Make Drawings Plane. GD 2007: 101-112 - [c24]Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. GD 2007: 171-182 - [c23]Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang:
Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187 - [e1]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i7]Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. CoRR abs/0709.0170 (2007) - [i6]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [b2]Alexander Wolff:
Geometrische Netzwerke und ihre Visualisierung. Karlsruhe University, Germany, 2006 - [j12]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006) - [j11]Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe:
The minimum Manhattan network problem: Approximations and exact solutions. Comput. Geom. 35(3): 188-208 (2006) - [c22]Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175 - [c21]Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD 2006: 270-281 - [c20]Jan-Henrik Haunert, Alexander Wolff:
Generalization of land cover maps by mixed integer programming. GIS 2006: 75-82 - [c19]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 - [c18]Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff:
Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186 - [i5]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006 - 2005
- [j10]Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff:
Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) - [c17]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 - [c16]Martin Nöllenburg, Alexander Wolff:
A Mixed-Integer Program for Drawing High-Quality Metro Maps. GD 2005: 321-333 - [c15]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Configurations with Few Crossings in Topological Graphs. ISAAC 2005: 604-613 - [i4]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff:
Delineating boundaries for imprecise regions. EuroCG 2005: 127-130 - [i3]Robert Görke, Alexander Wolff:
Constructing the city Voronoi diagram faster. EuroCG 2005: 155-158 - [i2]Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff:
Spanning trees with few crossings in geometric and topological graphs. EuroCG 2005: 195-198 - [i1]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing interference-minimal networks. EuroCG 2005: 203-206 - 2004
- [j9]Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff:
Labeling Points with Weights. Algorithmica 38(2): 341-362 (2004) - [j8]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004) - [c14]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. GD 2004: 49-59 - [c13]Marc J. van Kreveld, Étienne Schramm, Alexander Wolff:
Algorithms for the placement of diagrams on maps. GIS 2004: 222-231 - [c12]Marc Benkert, Alexander Wolff, Florian Widmann:
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. JCDCG 2004: 16-28 - [c11]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75 - 2002
- [j7]Vikas Kapoor, Dietmar Kühl, Alexander Wolff:
A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica 33(1): 52-70 (2002) - [j6]Steven van Dijk, Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Towards an evaluation of quality for names placement methods. Int. J. Geogr. Inf. Sci. 16(7): 641-661 (2002) - [j5]Alexander Wolff, Michael Thon, Yin-Feng Xu:
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Int. J. Comput. Geom. Appl. 12(4): 269-282 (2002) - [c10]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160 - 2001
- [j4]Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk:
Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001) - [j3]Tycho Strijk, Alexander Wolff:
Labeling Points with Circles. Int. J. Comput. Geom. Appl. 11(2): 181-195 (2001) - [c9]Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff:
Labeling Points with Weights. ISAAC 2001: 610-622 - [c8]María Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff:
Labeling Subway Lines. ISAAC 2001: 649-659 - 2000
- [c7]Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu:
New Algorithms for Two-Label Point Labeling. ESA 2000: 368-379 - [c6]Alexander Wolff, Michael Thon, Yin-Feng Xu:
A Better Lower Bound for Two-Circle Point Labeling. ISAAC 2000: 422-431
1990 – 1999
- 1999
- [b1]Alexander Wolff:
Automated label placement in theory and practice. Free University of Berlin, Dahlem, Germany, 1999, pp. 1-147 - [j2]Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Point labeling with sliding labels. Comput. Geom. 13(1): 21-47 (1999) - 1998
- [c5]Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Point Set Labeling with Sliding Labels. SCG 1998: 337-346 - [c4]Frank Wagner, Alexander Wolff:
A Combinatorial Framework for Map Labeling. GD 1998: 316-331 - 1997
- [j1]Frank Wagner, Alexander Wolff:
A Practical Map Labeling Algorithm. Comput. Geom. 7: 387-404 (1997) - [c3]Alexander Wolff:
The Hardness of Approximating Set Cover. Lectures on Proof Verification and Approximation Algorithms 1997: 249-262 - 1995
- [c2]Frank Wagner, Alexander Wolff:
Map Labeling Heuristics: Provably Good and Practically Useful. SCG 1995: 109-118 - [c1]Frank Wagner, Alexander Wolff:
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
