Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Publications (chronologically)

2024[ to top ]
  • Adjacency Graphs of Polyhedral Surfaces. Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff. Discrete & Computational Geometry. 2024.
  • Morphing Graph Drawings in the Presence of Point Obstacles. Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink. In Proc. 50th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’24), Vol. 14519 of Lecture Notes in Computer Science, H. Fernau, S. Gaspers, R. Klasing (eds.), pp. 240–254. Springer-Verlag, 2024.
  • Constrained and Ordered Level Planarity Parameterized by the Number of Levels. Vacláv Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink. In Proc. 40th Annu. Sympos. Comput. Geom. (SoCG’24), Vol. 293 of LIPIcs, W. Mulzer, J. M. Phillips (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
  • Outerplanar and Forest Storyplans. Jiří Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, and Johannes Zink. In Proc. 50th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’24), Vol. 14519 of Lecture Notes in Computer Science, H. Fernau, S. Gaspers, R. Klasing (eds.), pp. 211–225. Springer-Verlag, 2024.
  • Eliminating Crossings in Ordered Graphs. Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, and Alexander Wolff. In Proc. 19th Scand. Symp. Algorithm Theory (SWAT’24), of LIPIcs, H. Bodlaender (ed.). Schloss Dagstuhl – Leibniz-Institut für Informatik, 2024.
    To appear.
2023[ to top ]
  • Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. Jonathan Klawitter, Felix Klesen, Moritz Niederer, and Alexander Wolff. In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 96–110. Springer-Verlag, 2023.
  • Outside-Obstacle Representations with All Vertices on the Outer Face. Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, and Alexander Wolff. In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 432–440. Springer-Verlag, 2023.
  • The Computational Complexity of the ChordLink Model. Philipp Kindermann, Jan Sauer, and Alexander Wolff. Journal of Graph Algorithms & Applications, 27(9), pp. 759–767. 2023.
  • Morphing Rectangular Duals. Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, and Alexander Wolff. In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 389–403. Springer-Verlag, 2023.
  • The Complexity of Drawing Graphs on Few Lines and Few Planes. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, and Alexander Wolff. Journal of Graph Algorithms & Applications, 27(6), pp. 459–488. 2023.
  • Planar L-Drawings of Directed Graphs. Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, and Alexander Wolff. Computing in Geometry and Topology, 2(1), pp. 7:1–7:15. 2023.
  • Coloring and Recognizing Mixed Interval Graphs. Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, and Johannes Zink. In Proc. 34th Annu. Int. Symp. Algorithms Comput. (ISAAC’23), Vol. 283 of LIPIcs, S. Iwata, N. Kakimura (eds.), pp. 36:1–36:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
  • The Parametrized Complexity of the Segment Number. Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, and Alexander Wolff. In Proc. 31st Int. Symp. Graph Drawing & Network Vis. (GD’23), Vol. 14466 of Lecture Notes in Computer Science, M. Bekos, M. Chimani (eds.), pp. 97–113. Springer-Verlag, 2023.
  • A Simple Pipeline for Orthogonal Graph Drawing. Tim Hegemann and Alexander Wolff. In Proc. 31st Int. Symp. Graph Drawing & Network Vis. (GD’23), Vol. 14466 of Lecture Notes in Computer Science, M. Bekos, M. Chimani (eds.), pp. 170–186. Springer-Verlag, 2023.
  • The Complexity of Finding Tangles. Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, and Johannes Zink. In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 3–17. Springer-Verlag, 2023.
  • Parameterized Approaches to Orthogonal Compaction. Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, and Meirav Zehavi. In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 111–128. Springer-Verlag, 2023.
  • Morphing Planar Graph Drawings Through 3D. Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, and Alexander Wolff. Computing in Geometry and Topology, 2(1), pp. 5:1–5:18. 2023.
  • Coloring Mixed and Directional Interval Graphs. Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, and Johannes Zink. In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 418–431. Springer-Verlag, 2023.
  • Morphing Planar Graph Drawings Through 3D. Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, and Alexander Wolff. In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 80–95. Springer-Verlag, 2023.
2022[ to top ]
  • Algorithms for Floor Planning with Proximity Requirements. Jonathan Klawitter, Felix Klesen, and Alexander Wolff. In Proc. CAAD Future 2021, Vol. 1465 of CCIS, D. J. Gerber, A. Nahmad, B. Bogosian, E. Pantazis, C. Miltiadis (eds.), pp. 151–171. Springer-Verlag, 2022.
  • Minimum Rectilinear Polygons for Given Angle Sequences. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, and Alexander Wolff. Computational Geometry: Theory and Applications, 100(101820), pp. 1–39. 2022.
  • Simple Algorithms for Partial and Simultaneous Rectangular Duals with Given Contact Orientations. Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, and Alexander Wolff. Theoretical Computer Science, 919, pp. 66–74. 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, and Johannes Zink. In Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG’22), Vol. 13453 of Lecture Notes in Computer Science, M. Bekos, M. Kaufmann (eds.), p. 16 pages. Springer-Verlag, 2022.
  • Layered Drawing of Undirected Graphs with Generalized Port Constraints. Johannes Zink, Julian Walter, Joachim Baumeister, and Alexander Wolff. Computational Geometry: Theory and Applications, 105--106(101886), pp. 1–29. 2022.
  • Bounding and Computing Obstacle Numbers of Graphs. Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander Wolff. In Proc. 30th Europ. Symp. Algorithms (ESA’22), Vol. 244 of LIPIcs, S. Chechik, G. Navarro, E. Rotenberg, G. Herman (eds.), pp. 11:1–13. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.
  • The Computational Complexity of the ChordLink Model. Philipp Kindermann, Jan Sauer, and Alexander Wolff. In Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. Di Giacomo, F. Montecchiani (eds.), pp. 10:1–7. 2022.
2021[ to top ]
  • ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, and Alexander Wolff. Comput. Graphics Forum, 40(3), pp. 471–481. 2021.
  • Layered Drawing of Undirected Graphs with Generalized Port Constraints. Julian Walter, Johannes Zink, Joachim Baumeister, and Alexander Wolff. In Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD’20), Vol. 12590 of Lecture Notes in Computer Science, D. Auber, P. Valtr (eds.), pp. 220–234. Springer-Verlag, 2021.
  • Using the Metro-Map Metaphor for Drawing Hypergraphs. Fabian Frank, Michael Kaufmann, Stephen Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, and Alexander Wolff. In Proc. 47th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’21), Vol. 12607 of Lecture Notes in Computer Science, T. Bureš, R. Dondi, J. Gamper, G. Guerrini, T. Jurdziński, C. Pahl, F. Sikora, P. Wong (eds.), pp. 361–372. Springer-Verlag, 2021.
  • Adjacency Graphs of Polyhedral Surfaces. Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff. In Proc. 37th Annu. Sympos. Comput. Geom. (SoCG’21), Vol. 189 of LIPIcs, K. Buchin, Éric Colin de Verdière (eds.), pp. 11:1–17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021.
  • Angle Covers: Algorithms and Complexity. William Evans, Ellen Gethner, Jack Spalding-Jamieson, and Alexander Wolff. Journal of Graph Algorithms & Applications, 25(2), pp. 643–661. 2021.
  • Extending Partial Representations of Rectangular Duals with Given Contact Orientations. Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, and Alexander Wolff. In Proc. 12th International Conference on Algorithms and Complexity (CIAC’21), Vol. 12701 of Lecture Notes in Computer Science, T. Calamoneri, F. Coró (eds.), pp. 340–353. Springer-Verlag, 2021.
2020[ to top ]
  • Bundled Crossings Revisited. Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky, and Alexander Wolff. Journal of Graph Algorithms & Applications, 24(4), pp. 621–655. 2020.
  • Stick Graphs with and without Length Constraints. Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, and Johannes Zink. Journal of Graph Algorithms & Applications, 24(4), pp. 657–681. 2020.
  • Drawing Graphs with Circular Arcs and Right-Angle Crossings. Steven Chaplick, Henry Förster, Myroslav Kryven, and Alexander Wolff. In Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20), Vol. 162 of LIPIcs, S. Albers (ed.), pp. 21:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020.
  • Angle Covers: Algorithms and Complexity. William Evans, Ellen Gethner, Jack Spalding-Jamieson, and Alexander Wolff. In Proc. 14th Int. Workshop Algorithms Comput. (WALCOM’20), Vol. 12049 of Lecture Notes in Computer Science, S. Rahman, K. Sadakane, W.-K. Sung (eds.), pp. 94–106. Springer-Verlag, 2020.
  • Drawing Graphs on Few Lines and Few Planes. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, and Alexander Wolff. Journal of Computational Geometry, 11(1), pp. 433–475. 2020.
  • Finding Optimal Sequences for Area Aggregation---A* vs. Integer Linear Programming. Dongliang Peng, Alexander Wolff, and Jan-Henrik Haunert. ACM Transactions on Spatial Algorithms and Systems, 7(1). 2020.
    article 4 (40 pages)
2019[ to top ]
  • Visual Analytics for Sets over Time and Space. Sara Irina Fabrikant, Silvia Miksch, and Alexander Wolff. In Vol. 9, pp. 31–57. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019.
    Dagstuhl Seminar 19192
  • On Arrangements of Orthogonal Circles. Steven Chaplick, Henry Förster, Myroslav Kryven, and Alexander Wolff. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 216–229. Springer-Verlag, 2019.
  • Survey on Graph and Hypergraph Drawing. André Schulz and Alexander Wolff. M. Löffler; A. Lubiw; S. Schleimer; E. M. W. Chambers (eds.), pp. 87–89. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019.
  • Line and Plane Cover Numbers Revisited. Therese Biedl, Stefan Felsner, Henk Meijer, and Alexander Wolff. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 409–415. Springer-Verlag, 2019.
  • Bundled Crossings Revisited. Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky, and Alexander Wolff. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 63–77. Springer-Verlag, 2019.
  • Computing Optimal-Height Tangles Faster. Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, and Johannes Zink. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 203–215. Springer-Verlag, 2019.
  • Stick Graphs with Length Constraints. Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, and Johannes Zink. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 3–17. Springer-Verlag, 2019.
  • Drawing Graphs on Few Circles and Few Spheres. Myroslav Kryven, Alexander Ravsky, and Alexander Wolff. Journal of Graph Algorithms & Applications, 23(2), pp. 371–391. 2019.
  • Variants of the Segment Number of a Graph. Yoshio Okamoto, Alexander Ravsky, and Alexander Wolff. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 430–443. Springer-Verlag, 2019.
  • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink. Computational Geometry: Theory and Applications, 84, pp. 50–68. 2019.
    Special Issue on the 34th European Workshop on Computational Geometry
  • Representing Graphs and Hypergraphs by Touching Polygons in 3D. William Evans, Paweł Rzążewski, Noushin Saeedi, Chan-Su Shin, and Alexander Wolff. In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 18–32. Springer-Verlag, 2019.
    http://arxiv.org/abs/1908.08273
2018[ to top ]
  • Planar L-Drawings of Directed Graphs. Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, and Alexander Wolff. In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 465–478. Springer-Verlag, 2018.
  • Approximating the Generalized Minimum Manhattan Network Problem. Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, and Alexander Wolff. Algorithmica, 80(4), pp. 1170–1190. 2018.
  • 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, and Alexander Wolff. In Proc. 17th Int. Symp. Exper. Algorithms (SEA’18), Vol. 103 of LIPIcs, G. D’Angelo (ed.), pp. 15:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018.
  • Beyond Outerplanarity. Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, and Alexander Wolff. In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 546–559. Springer-Verlag, 2018.
  • On the Maximum Crossing Number. Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, and Alexander Wolff. Journal of Graph Algorithms & Applications, 22(1), pp. 67–87. 2018.
    Special issue on ``Graph Drawing Beyond Planarity''.
  • Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Evmorfia Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi Raftopoulou, and Alexander Wolff. In Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 509–523. Springer-Verlag, 2018.
  • On the Maximum Crossing Number. Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, and Alexander Wolff. In Proc. 28th Int. Workshop Combin. Algorithms (IWOCA’17), Vol. 10765 of Lecture Notes in Computer Science, L. Brankovic, J. Ryan, B. Smith (eds.), pp. 61–74. Springer-Verlag, 2018.
  • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink. In Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 137–151. Springer-Verlag, 2018.
  • On the Weak Line Cover Numbers. Oksana Firman, Alexander Ravsky, and Alexander Wolff. In Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.), pp. 63:1–5. 2018.
  • Computing Storylines with Few Block Crossings. Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, and Alexander Wolff. In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 365–378. Springer-Verlag, 2018.
  • Drawing Graphs on Few Circles and Few Spheres. Myroslav Kryven, Alexander Ravsky, and Alexander Wolff. In Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18), Vol. 10743 of Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (eds.), pp. 164–178. Springer-Verlag, 2018.
    Best presentation award for Myroslav Kryven.
  • Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and Alexander Wolff. In Proc. 29th Annu. Int. Symp. Algorithms Comput. (ISAAC’18), Vol. 123 of LIPIcs, W.-L. Hsu, D.-T. Lee, C.-S. Liao (eds.), pp. 61:1–13. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018.
2017[ to top ]
  • Improved Approximation Algorithms for Box Contact Representations. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen Kobourov, Sergey Pupyrev, Joachim Spoerhase, and Alexander Wolff. Algorithmica, 77(3), pp. 902–920. 2017.
  • Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. Jan-Henrik Haunert and Alexander Wolff. International Journal of Geo-Information, 6(11), p. article 342, 20 pages. 2017.
  • The Complexity of Drawing Graphs on Few Lines and Few Planes. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, and Alexander Wolff. In Proc. Algorithms Data Struct. Symp. (WADS’17), Vol. 10389 of Lecture Notes in Computer Science, F. Ellen, A. Kolokolova, J.-R. Sack (eds.), pp. 265–276. Springer-Verlag, 2017.
  • Progress on Partial Edge Drawings. Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Alexander Wolff. Journal of Graph Algorithms & Applications, 21(4), pp. 757–786. 2017.
  • Block Crossings in Storyline Visualizations. Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, and Alexander Wolff. Journal of Graph Algorithms & Applications, 21(5), pp. 873–913. 2017.
    Conference version received \textbf{best paper award (track A) at GD'16.
  • Algorithmically-Guided User Interaction. Thomas C. van Dijk and Alexander Wolff. In Proc. 25th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’17), E. Hoel, S. D. Newsam, S. Ravada, R. Tamassia, G. Trajcevski (eds.), pp. 11:1–4. 2017.
  • Using the A* Algorithm to Find Optimal Sequences for Area Aggregation. Dongliang Peng, Alexander Wolff, and Jan-Henrik Haunert. In Proc. 28th Int. Cartogr. Conf. (ICC’17) -- Advances in Cartogr. & GIScience, of Lect. Notes Geoinform. Cartogr., M. P. Peterson (ed.), pp. 389–404. Springer-Verlag, 2017.
2016[ to top ]
  • Beyond Maximum Independent Set: An Extended Model for Point-Feature Label Placement. Jan-Henrik Haunert and Alexander Wolff. In Proc. ISPRS (Commission II, WG II/2), Vol. XLI-B2, pp. 109–114. 2016.
  • Räumliche Analyse durch kombinatorische Optimierung. Jan-Henrik Haunert and Alexander Wolff. In Handbuch der Geodäsie (6 Bände), W. Freeden, R. Rummel (eds.), pp. 1–39. Springer Berlin Heidelberg, 2016.
  • Drawing Graphs on Few Lines and Few Planes. Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, and Alexander Wolff. In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 166–180. Springer-Verlag, 2016.
  • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, and Alexander Wolff. Journal of Graph Algorithms & Applications, 20(1), pp. 133–158. 2016.
  • Snapping Graph Drawings to the Grid Optimally. Andre Löffler, Thomas C. van Dijk, and Alexander Wolff. In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 144–151. Springer-Verlag, 2016.
  • Block Crossings in Storyline Visualizations. Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, and Alexander Wolff. In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 382–398. Springer-Verlag, 2016.
    Received best-paper award at GD 2016
  • Multi-Sided Boundary Labeling. Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, and Alexander Wolff. Algorithmica, 76(1), pp. 225–258. 2016.
  • Minimum Rectilinear Polygons for Given Angle Sequences. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, and Alexander Wolff. In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’16), Vol. 9943 of Lecture Notes in Computer Science, J. Akiyama, H. Ito, T. Sakai (eds.), pp. 105–119. Springer-Verlag, 2016.
  • Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. Dongliang Peng, Alexander Wolff, and Jan-Henrik Haunert. In Proc. 19th AGILE Conference on Geographic Information Science – Geospatial Data in a Changing World, of Lect. Notes Geoinf. Cartogr., T. Sarjakoski, M. Y. Santos, L. T. Sarjakoski (eds.), pp. 399–415. Springer-Verlag, 2016.
  • Obstructing Visibilities with One Obstacle. Steven Chaplick, Fabian Lipp, Ji-won Park, and Alexander Wolff. In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 295–308. Springer-Verlag, 2016.
  • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Fabian Lipp, Alexander Wolff, and Johannes Zink. Algorithms, 9(3), p. article 53, 17 pages. 2016.
  • Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. Benedikt Budig, Thomas C. van Dijk, and Alexander Wolff. ACM Transactions on Spatial Algorithms and Systems, 2(4), pp. 13:1–24. 2016.
2015[ to top ]
  • Ordering Metro Lines by Block Crossings. Martin Fink, Sergey Pupyrev, and Alexander Wolff. Journal of Graph Algorithms & Applications, 19(1), pp. 111–153. 2015.
  • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Fabian Lipp, ALexander Wolff, and Johannes Zink. In Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Vol. 9411 of Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.), pp. 52–59. Springer-Verlag, 2015.
  • Colored Non-Crossing Euclidean Steiner Forest. Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, and Alexander Wolff. In Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC’15), Vol. 9472 of Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.), pp. 429–441. Springer-Verlag, 2015.
  • Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. Nadine Schwartges, Benjamin Morgan, Jan-Henrik Haunert, and Alexander Wolff. In Proc. 18th AGILE Conf. Geogr. Inform. Sci. (AGILE’15), of Lecture Notes in Geoinformation and Cartography, F. Bacao, M. Y. Santos, M. Painho (eds.), pp. 269–287. Springer-Verlag, 2015.
  • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, and Alexander Wolff. In Proc. 9th Int. Workshop Algorithms Comput. (WALCOM’15), Vol. 8973 of Lecture Notes in Computer Science, M. S. Rahman, E. Tomita (eds.), pp. 222–233. Springer-Verlag, 2015.
  • Approximating Minimum Manhattan Networks in Higher Dimensions. Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, and Alexander Wolff. Algorithmica, 71(1), pp. 36–52. 2015.
  • Pixel and Voxel Representations of Graphs. Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, and Alexander Wolff. In Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Vol. 9411 of Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.), pp. 472–486. Springer-Verlag, 2015.
  • Solving Optimization Problems on Orthogonal Ray Graphs. Steven Chaplick, Philipp Kindermann, Fabian Lipp, and Alexander Wolff. In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15), p. 2 pp. 2015.
    Abstract
2014[ to top ]
  • On Monotone Drawings of Trees. Philipp Kindermann, André Schulz, Joachim Spoerhase, and Alexander Wolff. In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 488–500. Springer-Verlag, 2014.
  • Universal Point Sets for Drawing Planar Graphs with Circular Arcs. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Silvain Lazard, Tamara Mchedlidze, Monique Teillaud, and Alexander Wolff. Journal of Graph Algorithms & Applications, 18(3), pp. 313–324. 2014.
  • Concentric Metro Maps. Martin Fink, Magnus Lechner, and Alexander Wolff. In Proc. Schematic Mapping Workshop (SMW’14). Wivenhoe Park, 2014.
    Poster
  • Semantic Word Cloud Representations: Hardness and Approximation Algorithms. Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, and Alexander Wolff. In Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Vol. 8392 of Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.), pp. 514–525. Springer-Verlag, 2014.
  • Guest Editors’ Foreword (Special Issue of Selected Papers from the 21st Int. Symp. Graph Drawing). Stephen Wismath and Alexander Wolff. Journal of Graph Algorithms & Applications, 18(2), pp. 174–175. 2014.
  • Labeling Streets in Interactive Maps using Embedded Labels. Nadine Schwartges, Alexander Wolff, and Jan-Henrik Haunert. In Proc. 22nd ACM SIGSPATIAL Int. Conf. Advances Geogr. Inform. Syst. (ACM-GIS’14), Y. Huang, M. Schneider, M. Gertz, J. Krumm, J. Sankaranarayanan (eds.), pp. 517–520. 2014.
  • Watch Your Data Structures. Dongliang Peng and Alexander Wolff. In Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’14), p. 10 pages. Glasgow, 2014.
  • Point Labeling with Sliding Labels in Interactive Maps. Nadine Schwartges, Jan-Henrik Haunert, Alexander Wolff, and Dennis Zwiebler. In Proc. 17th AGILE Conf. Geogr. Inform. Sci. (AGILE’14), of Lecture Notes in Geoinformation and Cartography, J. Huerta, S. Schade, C. Granell (eds.), pp. 295–310. Springer-Verlag, 2014.
  • Improved Approximation Algorithms for Box Contact Representations. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen Kobourov, Sergey Pupyrev, Joachim Spoerhase, and Alexander Wolff. In Proc. 22nd Annu. Europ. Symp. Algorithms (ESA’14), Vol. 8737 of Lecture Notes in Computer Science, A. Schulz, D. Wagner (eds.), pp. 87–99. Springer-Verlag, 2014.
  • Drawing Graphs within Restricted Area. Maximilian Aulbach, Martin Fink, Julian Schuhmann, and Alexander Wolff. In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 367–379. Springer-Verlag, 2014.
  • Smooth Orthogonal Drawings of Planar Graphs. Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, and Alexander Wolff. In Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Vol. 8392 of Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.), pp. 144–155. Springer-Verlag, 2014.
  • Luatodonotes: Boundary Labeling for Annotations in Texts. Philipp Kindermann, Fabian Lipp, and Alexander Wolff. In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 76–88. Springer-Verlag, 2014.
2013[ to top ]
  • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, and Alexander Wolff. IEEE Transactions on Visualization and Computer Graphics, 19(12), pp. 2326–2335. 2013.
  • Drawing Metro Maps using Bézier Curves. Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, and Alexander Wolff. In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Vol. 7704 of Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.), pp. 463–474. Springer-Verlag, 2013.
  • Two-Sided Boundary Labeling with Adjacent Sides. Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, and Alexander Wolff. In Proc. 13th Int. Algorithms Data Struct. Symp. (WADS’13), Vol. 8037 of Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (eds.), pp. 463–474. Springer-Verlag, 2013.
  • Proceedings of the 21st International Symposium on Graph Drawing (GD’13). Stephen Wismath and Alexander Wolff. In Vol. 8242 of Lecture Notes in Computer Science. Springer-Verlag, 2013.
  • Graph Drawing and Cartography. Alexander Wolff. In Handbook of Graph Drawing and Visualization, R. Tamassia (ed.), pp. 697–736. CRC Press, Boca Raton, FL, 2013.
  • Optimizing Active Ranges for Point Selection in Dynamic Maps. Nadine Schwartges, Dennis Allerkamp, Jan-Henrik Haunert, and Alexander Wolff. In Proc. 16th ICA Generalisation Workshop (ICAGW’13). 2013.
    10 pages.
  • Approximating the Generalized Minimum Manhattan Network Problem. Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, and Alexander Wolff. In Proc. 24th Annu. Int. Symp. Algorithms Comput. (ISAAC’13), Vol. 8283 of Lecture Notes in Computer Science, L. Cai, S.-W. Cheng, T.-W. Lam (eds.), pp. 722–732. Springer-Verlag, 2013.
  • Morphing Polylines Based on Least Squares Adjustment. Dongliang Peng, Jan-Henrik Haunert, and Alexander Wolff. In Proc. 16th ICA Generalisation Workshop (ICAGW’13). 2013.
    10 pages.
  • Universal Point Sets for Planar Graph Drawings with Circular Arcs. Patrizio Angelini, David Eppstein, Michael Kaufmann Fabrizio Frati, Silvain Lazard, Monique Teillaud Tamara Mchedlidze, and Alexander Wolff. In Proc. 25th Canadian Conf. Comput. Geom. (CCCG’13), pp. 117–122. Waterloo, ON, Canada, 2013.
  • Progress on Partial Edge Drawings. Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Alexander Wolff. In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Vol. 7704 of Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.), pp. 67–78. Springer-Verlag, 2013.
2012[ to top ]
  • Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff. Algorithmica, 62(1--2), pp. 309–332. 2012.
  • Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. Nadine Schwartges, Joachim Spoerhase, and Alexander Wolff. In Proc. 9th Workshop Approx. Online Algorithms (WAOA’11), Vol. 7164 of Lecture Notes in Computer Science, R. Solis-Oba, G. Persiano (eds.), pp. 77–88. Springer-Verlag, 2012.
  • Cover Contact Graphs. Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, and Alexander Wolff. Journal of Computational Geometry, 3(1). 2012.
  • Augmenting the Connectivity of Planar and Geometric Graphs. Ignaz Rutter and Alexander Wolff. Journal of Graph Algorithms & Applications, 16(2), pp. 599–628. 2012.
  • Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, and Alexander Wolff. In Proc. Workshop Algorithms Comput. (WALCOM’12), Vol. 7157 of Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (eds.), pp. 186–197. Springer-Verlag, 2012.
  • Algorithms for Labeling Focus Regions. Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, and Alexander Wolff. IEEE Transactions on Visualization and Computer Graphics, 18(12), pp. 2583–2592. 2012.
  • Putting Data on the Map. Stephen Kobourov, Alexander Wolff, and Frank van Ham. In Vol. 2 of Dagstuhl Reports, pp. 51–76. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012.
    Dagstuhl Seminar 12261
2011[ to top ]
  • Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. Martin Nöllenburg and Alexander Wolff. IEEE Transactions on Visualization and Computer Graphics, 17(5), pp. 626–641. 2011.
  • Approximating Minimum Manhattan Networks in Higher Dimensions. Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, and Alexander Wolff. In Proc. 19th Annu. Europ. Symp. on Algorithms (ESA’11), Vol. 6942 of Lecture Notes in Computer Science, C. Demetrescu, M. M. Halldórsson (eds.), pp. 49–60. Springer-Verlag, 2011.
  • Schematization in Cartography, Visualization, and Computational Geometry. Jason Dykes, Matthias Müller-Hannemann, and Alexander Wolff. In Vol. 10461 of Dagstuhl Seminar Proceedings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2011.
2010[ to top ]
  • Trimming of Graphs, with Application to Point Labeling. Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff. Theory of Computing Systems, 47(3), pp. 613–636. 2010.
  • Optimal and Topologically Safe Simplification of Building Footprints. Jan-Henrik Haunert and Alexander Wolff. In Proc. 18th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’10), pp. 192–201. 2010.
  • The Traveling Salesman Problem Under Squared Euclidean Distances. Marc de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, and Alexander Wolff. In Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’10), J.-Y. Marion, T. Schwentick (eds.), pp. 239–250. Nancy, 2010.
  • Optimizing Active Ranges for Consistent Dynamic Map Labeling. Ken Been, Martin Nöllenburg, Sheung-Hung Poon, and Alexander Wolff. Computational Geometry: Theory and Applications, 43(3), pp. 312–328. 2010.
  • Area aggregation in map generalisation by mixed-integer programming. Jan-Henrik Haunert and Alexander Wolff. International Journal of Geographical Information Science, 24(12), pp. 1871–1897. 2010.
  • How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians. Mark de Berg, Dirk Gerrits, Amirali Khosravi, Ignaz Rutter, Constantinos Tsirogiannis, and Alexander Wolff. In Proc. 26th European Workshop Comput. Geom. (EuroCG’10), pp. 73–76. Dortmund, 2010.
  • Manhattan-Geodesic Embedding of Planar Graphs. Bastian Katz, Marcus Krug, Ignaz Rutter, and Alexander Wolff. In Proc. 17th Int. Sympos. Graph Drawing (GD’09), Vol. 5849 of Lecture Notes in Computer Science, D. Eppstein, E. R. Gansner (eds.), pp. 207–218. Springer-Verlag, 2010.
  • Computing Large Matchings Fast. Ignaz Rutter and Alexander Wolff. ACM Transactions on Algorithms, 7(1), p. article 1, 21 pages. 2010.
2009[ to top ]
  • Drawing Binary Tanglegrams: An Experimental Evaluation. Martin Nöllenburg, Markus Völker, Alexander Wolff, and Danny Holten. In Proc. 11th Workshop Algorithm Engineering and Experiments (ALENEX’09), pp. 106–119. 2009.
  • Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff. In Proc. 16th Int. Sympos. Graph Drawing (GD’08), Vol. 5417 of Lecture Notes in Computer Science, I. G. Tollis, M. Patrignani (eds.), pp. 324–335. Springer-Verlag, 2009.
  • Constructability of Trip-lets. Jeroen Keiren, Freek van Walderveen, and Alexander Wolff. In Proc. 25th European Workshop on Computational Geometry (EuroCG’09), S. Langerman (ed.). 2009.
  • Constructing Optimal Highways. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, and Alexander Wolff. International Journal of Foundations of Computer Science, 20(1), pp. 3–23. 2009.
  • Matching Points with Rectangles and Squares. Sergey Bereg, Nikolaus Mutsanas, and Alexander Wolff. Computational Geometry: Theory and Applications, 42(2), pp. 93–108. 2009.
  • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, and Alexander Wolff. International Journal of Computational Geometry and Applications, 19(3), pp. 267–288. 2009.
  • Untangling a Planar Graph. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, and Alexander Wolff. Discrete & Computational Geometry, 42(4), pp. 542–569. 2009.
2008[ to top ]
  • Augmenting the Connectivity of Planar and Geometric Graphs. Ignaz Rutter and Alexander Wolff. In Proc. Int. Conf. Topological Geom. Graph Theory (TGGT’08), Vol. 31 of Electronic Notes in Discrete Mathematics, pp. 53–56. Paris, 2008.
  • Computing Large Matchings Fast. Ignaz Rutter and Alexander Wolff. In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA’08), pp. 183–192. 2008.
  • Morphing Polylines: A Step Towards Continuous Generalization. Martin Nöllenburg, Damian Merrick, Alexander Wolff, and Marc Benkert. Computers, Environment and Urban Systems, 32(4), pp. 248–260. 2008.
  • Delineating Boundaries for Imprecise Regions. Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S.B. Mitchell, Jack Snoeyink, and Alexander Wolff. Algorithmica, 50(3), pp. 386–414. 2008.
  • Trimming of Graphs, with Application to Point Labeling. Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff. In Proc. 25th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’08), Vol. 1 of LIPIcs, S. Albers, P. Weil (eds.), pp. 265–276. Bordeaux, 2008.
  • Constructing the City Voronoi Diagram Faster. Robert Görke, Chan-Su Shin, and Alexander Wolff. International Journal of Computational Geometry and Applications, 18(4), pp. 275–294. 2008.
  • Optimizing Active Ranges for Consistent Dynamic Map Labeling. Ken Been, Martin Nöllenburg, Sheung-Hung Poon, and Alexander Wolff. In Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG’08), pp. 10–19. 2008.
  • Untangling a Planar Graph. Andreas Spillner and Alexander Wolff. In Proc. 34th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’08), Vol. 4910 of Lecture Notes in Computer Science, V. Geffert, J. Karhumäki, A. Bertoni, B. Preneel, P. Návrat, M. Bieliková (eds.), pp. 473–484. Springer-Verlag, 2008.
  • Decomposing a Simple Polygon into Pseudo-Triangles and Convex Polygons. Stefan Gerdjikov and Alexander Wolff. Computational Geometry: Theory and Applications, 41(1--2), pp. 21–30. 2008.
  • Constructing Interference-Minimal Networks. Marc Benkert, Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff. Computational Geometry: Theory and Applications, 40(3), pp. 179–194. 2008.
  • Cover Contact Graphs. Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, and Alexander Wolff. In Proc. 15th Int. Sympos. Graph Drawing (GD’07), Vol. 4875 of Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (eds.), pp. 171–182. Springer-Verlag, 2008.
  • Moving Vertices to Make Drawings Plane. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, and Alexander Wolff. In Proc. 15th Int. Sympos. Graph Drawing (GD’07), Vol. 4875 of Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (eds.), pp. 101–112. Springer-Verlag, 2008.
  • Optimal Simplification of Building Ground Plans. Jan-Henrik Haunert and Alexander Wolff. In Proc. 21st Congress Int. Society Photogrammetry Remote Sensing (ISPRS’08), Technical Commision II/3, Vol. XXXVII, Part B2 of Int. Archives of Photogrammetry, Remote Sensing and Spatial Informat. Sci., pp. 373–378. Beijing, 2008.
2007[ to top ]
  • Morphing Polygonal Lines: A Step Towards Continuous Generalization. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. In Proc. 23rd European Workshop on Computational Geometry (EWCG’07), O. Aichholzer, T. Hackl (eds.), pp. 6–9. Graz, 2007.
  • Morphing Polygonal Lines: A Step Towards Continuous Generalization. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. In Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’07), pp. 390–399. Maynooth, Ireland, 2007.
  • Constructing Optimal Highways. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, and Alexander Wolff. In Proc. 13th Conf. Computing: The Australasian Theory Sympos. (CATS’07), Vol. 65 of Conferences in Research and Practice in Information Technology, B. Jay, J. Gudmundsson (eds.), pp. 7–14. Australian Computer Society, 2007.
  • Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. Marc Benkert, Martin Nöllenburg, Takeaki Uno, and Alexander Wolff. In Proc. 14th Int. Sympos. Graph Drawing (GD’06), Vol. 4372 of Lecture Notes in Computer Science, M. Kaufmann, D. Wagner (eds.), pp. 270–281. Springer-Verlag, 2007.
  • Geometric Networks and Metric Space Embeddings. Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel Smid, and Alexander Wolff. In Vol. 06481 of Dagstuhl Seminar Proceedings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2007.
  • Straightening Drawings of Clustered Hierarchical Graphs. Sergey Bereg, Markus Völker, Alexander Wolff, and Yuanyi Zhang. In Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’07), Vol. 4362 of Lecture Notes in Computer Science, J. van Leeuwen, G. F. Italiano, W. van der Hoek, C. Meinel, H. Sack, F. Plášil (eds.), pp. 177–186. Springer-Verlag, 2007.
  • Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, and Alexander Wolff. Computational Geometry: Theory and Applications, 36(3), pp. 215–236. 2007.
  • Drawing Subway Maps: A Survey. Alexander Wolff. Informatik – Forschung & Entwicklung, 22(1), pp. 23–44. 2007.
  • Configurations with Few Crossings in Topological Graphs. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. Computational Geometry: Theory and Applications, 37(2), pp. 104–114. 2007.
2006[ to top ]
  • A Mixed-Integer Program for Drawing High-Quality Metro Maps. Martin Nöllenburg and Alexander Wolff. In Proc. 13th Int. Sympos. Graph Drawing (GD’05), Vol. 3843 of Lecture Notes in Computer Science, P. Healy, N. S. Nikolov (eds.), pp. 321–333. Springer-Verlag, 2006.
  • Farthest-Point Queries with Geometric and Combinatorial Constraints. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, and Alexander Wolff. Computational Geometry: Theory and Applications, 33(3), pp. 174–185. 2006.
  • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff. In Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON’06), Vol. 4112 of Lecture Notes in Computer Science, D. Z. Chen, D.-T. Lee (eds.), pp. 166–175. Springer-Verlag, 2006.
  • Constructing Interference-Minimal Networks. Marc Benkert, Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff. In Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Vol. 3831 of Lecture Notes in Computer Science, J. Wiedermann, J. Stuller, G. Tel, J. Pokorný, M. Bieliková (eds.), pp. 166–175. Springer-Verlag, 2006.
  • Matching Points with Rectangles and Squares. Sergey Bereg, Nikolaus Mutsanas, and Alexander Wolff. In Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Vol. 3831 of Lecture Notes in Computer Science, J. Wiedermann, J. Stuller, G. Tel, J. Pokorný, M. Bieliková (eds.), pp. 177–186. Springer-Verlag, 2006.
  • A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels. Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff. In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 137–140. Delphi, 2006.
  • Pseudo-Convex Decomposition of Simple Polygons. Stefan Gerdjikov and Alexander Wolff. In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 13–16. Delphi, 2006.
  • Generalization of Land Cover Maps by Mixed Integer Programming. Jan-Henrik Haunert and Alexander Wolff. In Proc. 14th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’06), pp. 75–82. 2006.
  • The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Marc Benkert, Alexander Wolff, Florian Widmann, and Takeshi Shirabe. Computational Geometry: Theory and Applications, 35(3), pp. 188–208. 2006.
  • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff. In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 141–144. Delphi, 2006.
  • Routing by Landmarks. Urs-Jakob Rüetschi, David Caduff, Sabine Timpf, Frank Schulz, and Alexander Wolff. In Proc. 6th Swiss Transport Research Conf. (STRC’06). Ascona, 2006.
    CD-ROM
  • Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs. Magnús M. Halldórsson, Alexander Wolff, and Takeshi Tokuyama. In Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA’06), pp. 31–38. Venezia, 2006.
2005[ to top ]
  • Constructing Interference-Minimal Networks. Marc Benkert, Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff. In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 203–206. Eindhoven, 2005.
  • Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, and Alexander Wolff. In Proc. 12th Int. Sympos. Graph Drawing (GD’04), Vol. 3383 of Lecture Notes in Computer Science, J. Pach (ed.), pp. 49–59. Springer-Verlag, 2005.
  • Delineating Boundaries for Imprecise Regions. Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S.B. Mitchell, and Alexander Wolff. In Proc. 13th Annu. Europ. Symp. on Algorithms (ESA’05), Vol. 3669 of Lecture Notes in Computer Science, G. S. Brodal, S. Leonardi (eds.), pp. 143–154. Springer-Verlag, 2005.
  • The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. Marc Benkert, Florian Widmann, and Alexander Wolff. In Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Vol. 3742 of Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (eds.), pp. 16–28. Springer-Verlag, 2005.
  • Farthest-Point Queries with Geometric and Combinatorial Constraints. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, and Alexander Wolff. In Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Vol. 3742 of Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (eds.), pp. 62–75. Springer-Verlag, 2005.
  • Constructing the City Voronoi Diagram Faster. Robert Görke and Alexander Wolff. In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 155–158. Eindhoven, 2005.
  • Optimal Spanners for Axis-Aligned Rectangles. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman Haverkort, Naoki Katoh, and Alexander Wolff. Computational Geometry: Theory and Applications, 30(1), pp. 59–77. 2005.
  • Delineating Boundaries for Imprecise Regions. Iris Reinbacher, Marc Benkert, Marc van Kreveld, and Alexander Wolff. In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 127–130. Eindhoven, 2005.
  • Geometrische Netzwerke und ihre Visualisierung. Alexander Wolff. 2005, June.
  • Constructing the City Voronoi Diagram Faster. Robert Görke and Alexander Wolff. In Proc. 2nd Int. Symp. on Voronoi Diagrams in Science and Engineering (VD’05), pp. 162–172. Seoul, 2005.
  • Spanning Trees with Few Crossings in Geometric and Topological Graphs. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 195–198. Eindhoven, 2005.
  • Configurations with Few Crossings in Topological Graphs. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. In Proc. 16th Annu. Int. Symp. Algorithms Comput. (ISAAC’05), Vol. 3827 of Lecture Notes in Computer Science, X. Deng, D.-Z. Du (eds.), pp. 604–613. Springer-Verlag, 2005.
2004[ to top ]
  • Web-Based Delineation of Imprecise Regions. Avi Arampatzis, Marc van Kreveld, Iris Reinbacher, Christopher B. Jones, Subodh Vaid, Paul Clough, Hideo Joho, Mark Sanderson, Marc Benkert, and Alexander Wolff. In Proc. Workshop on Geographic Information Retrieval at SIGIR’04. Sheffield, 2004.
  • The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Alexander Wolff, Marc Benkert, and Takeshi Shirabe. In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 209–212. Sevilla, 2004.
  • Algorithms for the Placement of Diagrams on Maps. Marc van Kreveld, Étienne Schramm, and Alexander Wolff. In Proc. 12th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’04), D. Pfoder, I. F. Cruz, M. Ronthaler (eds.), pp. 222–231. 2004.
  • Optimal Spanners for Axis-Aligned Rectangles. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman Haverkort, Naoki Katoh, and Alexander Wolff. In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 97–100. Sevilla, 2004.
  • Facility Location and the Geometric Minimum-Diameter Spanning Tree. Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin, and Alexander Wolff. Computational Geometry: Theory and Applications, 27(1), pp. 87–106. 2004.
  • The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. Marc Benkert, Florian Widmann, and Alexander Wolff. In Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), pp. 85–86. Tokyo, 2004.
  • Farthest-Point Queries with Geometric and Combinatorial Constraints. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, and Alexander Wolff. In Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), pp. 110–111. Tokyo, 2004.
  • Farthest-Point Queries with Geometric and Combinatorial Constraints. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, and Alexander Wolff. In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 45–48. Sevilla, 2004.
2003[ to top ]
  • Labeling Points with Weights. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, and Alexander Wolff. Algorithmica, 38(2), pp. 341–362. 2003.
2002[ to top ]
  • Towards an Evaluation of Quality for Names Placement Methods. Steven van Dijk, Marc van Kreveld, Tycho Strijk, and Alexander Wolff. International Journal of Geographical Information Science, 16(7), pp. 641–661. 2002.
  • A Tutorial for Designing Flexible Geometric Algorithms. Vikas Kapoor, Dietmar Kühl, and Alexander Wolff. Algorithmica, 33(1), pp. 52–70. 2002.
  • Facility Location and the Geometric Minimum-Diameter Spanning Tree. Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin, and Alexander Wolff. In Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX’02), Vol. 2462 of Lecture Notes in Computer Science, K. Jansen, S. Leonardi, V. Vazirani (eds.), pp. 146–160. Springer-Verlag, 2002.
  • Approximating the Geometric Minimum-Diameter Spanning Tree. Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin, and Alexander Wolff. In Proc. 18th European Workshop on Computational Geometry (EWCG’02), pp. 41–45. War-szawa, 2002.
  • A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Alexander Wolff, Michael Thon, and Yinfeng Xu. International Journal of Computational Geometry and Applications, 12(4), pp. 269–281. 2002.
2001[ to top ]
  • Labeling Subway Lines. Mari Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramon Portillo, Pedro Reyes, and Alexander Wolff. In Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Vol. 2223 of Lecture Notes in Computer Science, P. Eades, T. Takaoka (eds.), pp. 649–659. Springer-Verlag, 2001.
  • Etiquetado de puntos alineados. Mari Ángeles Garrido, Alberto Márquez, Claudia Iturriaga, José Ramon Portillo, Pedro Reyes, and Alexander Wolff. In Proc. IX Encuentros de Geometría Computacional (EGC’01), pp. 285–294. Girona, 2001.
  • Labeling Points with Weights. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, and Alexander Wolff. In Proc. 17th European Workshop on Computational Geometry (EWCG’01), pp. 97–100. Berlin, 2001.
  • Labeling Points with Circles. Tycho Strijk and Alexander Wolff. International Journal of Computational Geometry and Applications, 11(2), pp. 181–195. 2001.
  • Three Rules Suffice for Good Label Placement. Frank Wagner, Alexander Wolff, Vikas Kapoor, and Tycho Strijk. Algorithmica, 30(2), pp. 334–349. 2001.
  • Labeling Points with Weights. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, and Alexander Wolff. In Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Vol. 2223 of Lecture Notes in Computer Science, P. Eades, T. Takaoka (eds.), pp. 610–622. Springer-Verlag, 2001.
2000[ to top ]
  • New Algorithms for Two-Label Point Labeling. Zhongping Qin, Alexander Wolff, Yinfeng Xu, and Binhai Zhu. In Proc. 8th Annu. Europ. Symp. on Algorithms (ESA’00), Vol. 1879 of Lecture Notes in Computer Science, M. Paterson (ed.), pp. 368–379. Springer-Verlag, 2000.
  • A Better Lower Bound for Two-Circle Point Labeling. Alexander Wolff, Michael Thon, and Yinfeng Xu. In Proc. 11th Annu. Int. Symp. Algorithms Comput. (ISAAC’00), Vol. 1969 of Lecture Notes in Computer Science, D. Lee, S.-H. Teng (eds.), pp. 422–431. Springer-Verlag, 2000.
  • A Simple and Efficient Algorithm for High-Quality Line Labeling. Alexander Wolff, Lars Knipping, Marc van Kreveld, Tycho Strijk, and Pankaj K. Agarwal. In Innovations in GIS VII: GeoComputation, P. M. Atkinson, D. J. Martin (eds.), pp. 147–159. Taylor & Francis, 2000.
1999[ to top ]
  • A Simple and Efficient Algorithm for High-Quality Line Labeling. Pankaj K. Agarwal, Lars Knipping, Marc van Kreveld, Tycho Strijk, and Alexander Wolff. In Proc. 15th European Workshop on Computational Geometry (EWCG’99), pp. 93–96. Sophia-Antipolis, 1999.
  • A Combinatorial Framework for Map Labeling. Frank Wagner and Alexander Wolff. In Proc. 6th Int. Sympos. Graph Drawing (GD’98), Vol. 1547 of Lecture Notes in Computer Science, S. H. Whitesides (ed.), pp. 316–331. Springer-Verlag, 1999.
  • Point Labeling with Sliding Labels. Marc van Kreveld, Tycho Strijk, and Alexander Wolff. Computational Geometry: Theory and Applications, 13(1), pp. 21–47. 1999.
  • Towards an Evaluation of Quality for Label Placement Methods. Steven van Dijk, Marc van Kreveld, Tycho Strijk, and Alexander Wolff. In Proc. 19th Int. Cartographic Conf. (ICA’99), pp. 905–913. Int. Cartographic Association, Ottawa, 1999.
  • A Simple and Efficient Algorithm for High-Quality Line Labeling. Alexander Wolff, Lars Knipping, Marc van Kreveld, Tycho Strijk, and Pankaj K. Agarwal. In Proc. 7th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’99), D. Martin, F. Wu (eds.), pp. 146–150. Southampton, 1999.
  • Automated Label Placement in Theory and Practice. Technical Report (PhD dissertation), . Alexander Wolff. PhD dissertation. Fachbereich Mathematik und Informatik, Freie Universität Berlin, 1999, May.
1998[ to top ]
  • MakeIt! -- Generating and Maintaining Makefiles Automatically. Sven Schönherr and Alexander Wolff. In Proc. Workshop on Algorithms and Experiments (ALEX’98), R. Battini, A. A. Bertossi (eds.), pp. 165–174. Trento, 1998.
  • Point Set Labeling with Sliding Labels. Marc van Kreveld, Tycho Strijk, and Alexander Wolff. In Proc. 14th Annu. ACM Sympos. Comput. Geom. (SoCG’98), pp. 337–346. 1998.
  • The Hardness of Approximating Set Cover. Alexander Wolff. In Lectures on Proof Verification and Approximation Algorithms, Vol. 1367, E. W. Mayr, H. J. Prömel, A. Steger (eds.), pp. 249–262. Springer-Verlag, 1998.
1997[ to top ]
  • A Practical Map Labeling Algorithm. Frank Wagner and Alexander Wolff. Computational Geometry: Theory and Applications, 7(5--6), pp. 387–404. 1997.
1996[ to top ]
  • The Map-Labeling Bibliography. Alexander Wolff and Tycho Strijk. 1996.
1995[ to top ]
  • Map Labeling. Technical Report (Master thesis), . Alexander Wolff. Master thesis. Fachbereich Mathematik und Informatik, Freie Universität Berlin, 1995, May.
  • Fast and Reliable Map Labeling. Frank Wagner and Alexander Wolff. In Proc. 9th Int. Symp. Computer Science for Environment Protection (CSEP’95), H. K. und Werner Pillmann (ed.), pp. 667–675. Metropolis, 1995.
  • Map Labeling Heuristics: Provably Good and Practically Useful. Frank Wagner and Alexander Wolff. In Proc. 11th Annu. ACM Sympos. Comput. Geom. (SoCG’95), pp. 109–118. 1995.
  • An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. Frank Wagner and Alexander Wolff. In Proc. 3rd Annu. Europ. Symp. on Algorithms (ESA’95), Vol. 979 of Lecture Notes in Computer Science, P. Spirakis (ed.), pp. 420–433. Springer-Verlag, 1995.

To top