Publications

Book chapters

  1. Martin Nöllenburg. Geographic visualization. In Andreas Kerren, Achim Ebert, and Joerg Meyer, editors, Human-Centered Visualization Environments, volume 4417 of Lecture Notes in Computer Science, chapter 6, pages 257-294. Springer-Verlag, 2007.
    [ html | pdf ]
  2. Michael Baur and Marc Benkert. Network comparison. In Ulrik Brandes and Thomas Erlebach, editors, Network Analysis, volume 3418 of Lecture Notes in Computer Science Tutorial, chapter 12, pages 318-340. Springer-Verlag, 2005.

Journal articles

  1. Robert Görke, Chan-Su Shin, and Alexander Wolff. Constructing the city Voronoi diagram faster. International Journal of Computational Geometry and Applications, 18(4), 2008. To appear.
    [ pdf | abstract ]
  2. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, and Alexander Wolff. Boundary labeling: Models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications, 36(3):215-236, 2007.
    [ html | pdf | abstract ]
  3. Marc Benkert, Alexander Wolff, Florian Widmann, and Takeshi Shirabe. The minimum Manhattan network problem: Approximations and exact solutions. Computational Geometry: Theory and Applications, 35(3):188-208, 2006.
    [ html | pdf | abstract ]
  4. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman Haverkort, Naoki Katoh, and Alexander Wolff. Optimal spanners for axis-aligned rectangles. Computational Geometry: Theory and Applications, 30(1):59-77, 2005.
    [ html | pdf | abstract ]
  5. Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin, and Alexander Wolff. Facility location and the geometric minimum-diameter spanning tree. Computational Geometry: Theory and Applications, 27(1):87-106, 2004.
    [ html | pdf | abstract ]

Conference articles

  1. 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. Cover contact graphs. In S.-H. Hong and T. Nishizeki, editors, Proc. 15th Int. Symp. Graph Drawing (GD '07), volume 4875 of Lecture Notes in Computer Science, pages 171-182. Springer-Verlag, 2008.
    [ html | pdf ]
  2. Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, and Antonios Symvonis. Boundary labeling with octilinear leaders. In Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), 2008. To appear.
  3. Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama. Consistent digital rays. In Proc. 24th Annual Symposium on Computational Geometry (SoCG'08), pages 355-364. ACM, 2008.
    [ pdf ]
  4. Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama. Consistent digital rays. In Proc. 24th European Workshop on Computational Geometry (EuroCG'08), pages 169-172, 2008.
    [ pdf ]
  5. Ignaz Rutter and Alexander Wolff. Computing large matchings fast. In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA'08), pages 183-192, 2008.
    [ pdf ]
  6. Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg. Algorithms for multi-criteria one-sided boundary labeling. In Proc. 15th Int. Symp. Graph Drawing (GD '07), 2007. To appear.
  7. Marc Benkert and Martin Nöllenburg. Improved algorithms for length-minimal one-sided boundary labeling. In Proc. 23rd European Workshop on Computational Geometry (EWCG'07), pages 190-193, Graz, Austria, 2007.
    [ pdf ]
  8. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. Morphing polygonal lines: A step towards continuous generalization. In Adam Winstanley, editor, Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'07), pages 390-399, Maynooth, Ireland, 2007.
    [ pdf ]
  9. Marc Benkert, Martin Nöllenburg, Takeaki Uno, and Alexander Wolff. Minimizing intra-edge crossings in wiring diagrams and public transport maps. In Michael Kaufmann and Dorothea Wagner, editors, Proc. 14th Internat. Sympos. Graph Drawing (GD'06), volume 4372 of Lecture Notes in Computer Science, pages 270-281. Springer-Verlag, 2007.
    [ pdf ]
  10. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. Morphing polygonal lines: A step towards continuous generalization. In Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'07), pages 390-399, Maynooth, Ireland, 2007.
    [ html | pdf ]
  11. Marc Benkert, Joachim Gudmundsson, Florian Hübner, and Thomas Wolle. Reporting flock patterns. In Yossi Azar and Thomas Erlebach, editors, Proc. 14th Annu. Europ. Symp. on Algorithms (ESA'06), volume 4168 of Lecture Notes in Computer Science, pages 660-671. Springer-Verlag, 2006.
    [ pdf ]
  12. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff. A polynomial-time approximation algorithm for a geometric dispersion problem. In Danny Z. Chen and Der-Tsai Lee, editors, Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON'06), volume 4112 of Lecture Notes in Computer Science, pages 166-175. Springer-Verlag, 2006.
    [ html | pdf ]
  13. Iris Reinbacher, Marc van Kreveld, and Marc Benkert. Scale dependent definitions of gradient and aspect and their computation. In Andreas Riedl, Wolfgang Kainz, and Gregory A. Elmes, editors, Proc. 12th Intern. Symp. Spatial Data Handling (SDH'06), pages 863-879, 2006.
  14. Marc Benkert, Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff. Constructing interference-minimal networks. In Jiří Wiedermann, Julius Stuller, Gerard Tel, Jaroslav Pokorny, and Mária Bieliková, editors, Proc. 32nd Internat. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'06), volume 3831 of Lecture Notes in Computer Science, pages 166-175. Springer-Verlag, 2006.
    [ html | pdf ]
  15. Martin Nöllenburg and Alexander Wolff. A mixed-integer program for drawing high-quality metro maps. In Patrick Healy and Nikola S. Nikolov, editors, Proc. 13th Internat. Sympos. Graph Drawing (GD'05), volume 3843 of Lecture Notes in Computer Science, pages 321-333. Springer-Verlag, 2006.
    [ html | pdf ]
  16. Marc Benkert, Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff. Constructing interference-minimal networks. In Proc. 21st European Workshop on Computational Geometry (EWCG'05), pages 203-206, Eindhoven, 2005.
    [ pdf ]
  17. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, and Alexander Wolff. Boundary labeling: Models and efficient algorithms for rectangular maps. In János Pach, editor, Proc. 12th Internat. Sympos. Graph Drawing (GD'04), volume 3383 of Lecture Notes in Computer Science, pages 49-59. Springer-Verlag, 2005.
    [ html | pdf | abstract ]
  18. Marc Benkert, Florian Widmann, and Alexander Wolff. The minimum Manhattan network problem: A fast factor-3 approximation. In Jin Akiyama, Mikio Kano, and Xuehou Tan, editors, Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04), volume 3742 of Lecture Notes in Computer Science, pages 16-28. Springer-Verlag, 2005.
    [ html | pdf ]
  19. Robert Görke and Alexander Wolff. Constructing the city Voronoi diagram faster. In Proc. 2nd Internat. Symp. on Voronoi Diagrams in Science and Engineering (VD'05), pages 162-172, Seoul, 2005.
    [ pdf ]
  20. Robert Görke and Alexander Wolff. Constructing the city Voronoi diagram faster. In Proc. 21st European Workshop on Computational Geometry (EWCG'05), pages 155-158, Eindhoven, 2005.
    [ pdf ]
  21. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. Configurations with few crossings in topological graphs. In Xiaotie Deng and Ding-Zhu Du, editors, Proc. 16th Annu. Internat. Symp. Algorithms Comput. (ISAAC'05), volume 3827 of Lecture Notes in Computer Science, pages 604-613. Springer-Verlag, 2005.
    [ html | pdf | abstract ]
  22. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. Spanning trees with few crossings in geometric and topological graphs. In Proc. 21st European Workshop on Computational Geometry (EWCG'05), pages 195-198, Eindhoven, 2005.
    [ pdf ]
  23. Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S.B. Mitchell, and Alexander Wolff. Delineating boundaries for imprecise regions. In Gerth Stølting Brodal and Stefano Leonardi, editors, Proc. 13th Annu. Europ. Symp. on Algorithms (ESA'05), volume 3669 of Lecture Notes in Computer Science, pages 143-154. Springer-Verlag, 2005.
    [ html | pdf ]
  24. Alexander Wolff, Marc Benkert, and Takeshi Shirabe. The minimum Manhattan network problem: Approximations and exact solutions. In Proc. 20th European Workshop on Computational Geometry (EWCG'04), pages 209-212, Sevilla, 2004.
    [ pdf ]

Habilitation

  1. Alexander Wolff. Geometrische Netzwerke und ihre Visualisierung. Habilitationsschrift (kumulativ), Fakultät für Informatik, Universität Karlsruhe, June 2005.
    [ pdf ]

Dissertation

  1. Marc Benkert. Construction and analysis of geometric networks. PhD thesis, Universität Karlsruhe, 2007.
    [ pdf ]

Master's Thesis

  1. Ignaz Rutter. Schnelle Berechnung von großen Matchings. Master's thesis, Fakultät für Informatik, Universität Karlsruhe, April 2007.
    [ pdf ]
  2. Martin Nöllenburg. Automated drawing of metro maps. Master's thesis, Fakultät für Informatik, Universität Karlsruhe, August 2005.
    [ pdf ]
  3. Nikolaus Mutsanas. Zuordnung von Punkten mittels geometrischer Objekte. Master's thesis, Fakultät für Informatik, Universität Karlsruhe, July 2005.
    [ pdf ]
  4. Robert Görke. Ein schneller Konstruktionsalgorithmus für eine Quickest-Path-Map bezüglich der City-Metrik. Master's thesis, Fakultät für Informatik, Universität Karlsruhe, September 2004.
    [ pdf ]

Technical reports

  1. Marc Benkert, Joachim Gudmundsson, Florian Hübner, and Thomas Wolle. Reporting flock patterns. Technical Report 2006-14, Fakultät für Informatik, Universität Karlsruhe, 2006. Available at “http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=/ira/2006/14”.
    [ html ]
  2. Christian Knauer, Étienne Schramm, Andreas Spillner, and Alexander Wolff. Configurations with few crossings in topological graphs. Technical Report 2005-24, Fakultät für Informatik, Universität Karlsruhe, September 2005. Available at “http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004122”.
    [ html | pdf ]
  3. Martin Nöllenburg. Automated drawing of metro maps. Technical Report 2005-25, Fakultät für Informatik, Universität Karlsruhe, 2005.
    [ html | pdf ]
  4. Marc Benkert, Florian Widmann, and Alexander Wolff. The minimum Manhattan network problem: A fast factor-3 approximation. Technical Report 2004-16, Fakultät für Informatik, Universität Karlsruhe, 2004. Available at “http://digbib.ubka.uni-karlsruhe.de/volltexte/1000003164”.
    [ html | pdf ]