English Intern
Lehrstuhl für Informatik I - Algorithmen und Komplexität

Veröffentlichungen (nach Typ)

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

Nach oben