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
- 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) - [c106]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 - [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 - [i72]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) - [i71]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i70]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) - [i69]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) - 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]