Institut für Theoretische Informatik, Algorithmik
Suche
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Mitarbeiter
Ehemalige Mitarbeiter
PD Dr. Martin Nöllenburg

Veröffentlichungen

Buchbeiträge

  1. Scalability Considerations for Multivariate Graph Visualization.
    In: Multivariate Network Visualization, volume 8380 of Lecture Notes in Computer Science, pages 207–235. Springer, 2014.
    Joint work with TJ Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Chris Weaver, and Kai Xu.
    [ html ]
  2. Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität.
    In: Ausgezeichnete Informatikdissertationen 2009, volume D-10 of Lecture Notes in Informatics, pages 161–170. 2010.
    [ pdf ]
  3. Geographic Visualization.
    In: Human-Centered Visualization Environments, volume 4417 of Lecture Notes in Computer Science, pages 257–294. Springer, 2007.
    [ html | pdf ]

Artikel in Zeitschriften

  1. On the readability of leaders in boundary labeling.
    Journal of Information Visualization, 2018.
    Joint work with Lukas Barth, Andreas Gemsa, and Benjamin Niedermann.
  2. Euclidean Greedy Drawings of Trees.
    Discrete and Computational Geometry, 58(3):543–579, 2017.
    Joint work with Roman Prutkin.
  3. Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
    International Journal of Computational Geometry and Applications, 27(1–2):121–158, 2017.
    Special issue on selected papers from ISAAC�15.
    Joint work with Roman Prutkin and Ignaz Rutter.
  4. Consistent labeling of rotating maps.
    Journal of Computational Geometry, 7(1):308–331, 2016.
    Joint work with Andreas Gemsa and Ignaz Rutter.
  5. Evaluation of Labeling Strategies for Rotating Maps.
    ACM Journal of Experimental Algorithmics, 2016.
    Special Issue of SEA'14. To appear.
    Joint work with Andreas Gemsa and Ignaz Rutter.
  6. Extending Convex Partial Drawings of Graphs.
    Algorithmica, 2016.
    Article in press.
    Joint work with Tamara Mchedlidze and Ignaz Rutter.
    [ html ]
  7. On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.
    Journal of Computational Geometry, 7(1):47–69, 2016.
    Joint work with Roman Prutkin and Ignaz Rutter.
  8. Many-to-One Boundary Labeling with Backbones.
    Journal of Graph Algorithms and Applications, 19(3):761–778, 2015.
    Joint work with Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Ignaz Rutter, and Antonios Symvonis.
  9. Multi-Row Boundary-Labeling Algorithms for Panorama Images.
    ACM Transactions on Spatial Algorithms and Systems, July 2014.
    Accepted for publication.
    Joint work with Andreas Gemsa and Jan-Henrik Haunert.
    [ html | pdf ]
  10. On d-regular Schematization of Embedded Paths.
    Computational Geometry: Theory and Applications, 47(3A):381–406, 2014.
    Joint work with Daniel Delling, Andreas Gemsa, Thomas Pajor, and Ignaz Rutter.
    [ html | pdf ]
  11. Drawing Trees with Perfect Angular Resolution and Polynomial Area.
    Discrete and Computational Geometry, 49(2):157–182, 2013.
    Joint work with Christian A. Duncan, David Eppstein, Michael T. Goodrich, and Stephen G. Kobourov.
    [ html | pdf ]
  12. Optimal 3D Angular Resolution for Low-Degree Graphs.
    Journal of Graph Algorithms and Applications, 17(3):173–200, 2013.
    Joint work with David Eppstein, Maarten Löffler, and Elena Mumford.
    [ html | pdf ]
  13. Edge-weighted contact representations of planar graphs.
    Journal of Graph Algorithms and Applications, 17(4):441–473, 2013.
    Special issue of GD 2012.
    Joint work with Roman Prutkin and Ignaz Rutter.
    [ html | pdf ]
  14. Cover Contact Graphs.
    Journal of Computational Geometry, 3(1):102–131, 2012.
    Joint work with Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, and Alexander Wolff.
    [ html | pdf ]
  15. Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability.
    Algorithmica, 62(1–2):309–332, 2012.
    Joint work with Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff.
    [ html | pdf ]
  16. Algorithms for computing the maximum weight region decomposable into elementary shapes.
    Computer Vision and Image Understanding, 116(7):803–814, 2012.
    Joint work with Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, and Takeshi Tokuyama.
    [ html ]
  17. Lombardi Drawings of Graphs.
    Journal of Graph Algorithms and Applications, 16(1):85–108, 2012.
    Special issue of GD 2010.
    Joint work with Christian A. Duncan, David Eppstein, Michael T. Goodrich, and Stephen G. Kobourov.
    [ html | pdf ]
  18. Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.
    IEEE Transactions on Visualization and Computer Graphics, 17(5):626–641, May 2011.
    Joint work with Alexander Wolff.
    [ html | pdf ]
  19. Boundary Labeling with Octilinear Leaders.
    Algorithmica, 57(3):436–461, 2010.
    Special issue of SWAT 2008.
    Joint work with Michael Bekos, Michael Kaufmann, and Antonios Symvonis.
    [ html | pdf ]
  20. Optimizing Active Ranges for Consistent Dynamic Map Labeling.
    Computational Geometry: Theory and Applications, 43(3):312–328, 2010.
    Special issue of SoCG 2008.
    Joint work with Ken Been, Sheung-Hung Poon, and Alexander Wolff.
    [ html | pdf ]
  21. Algorithms for Multi-Criteria Boundary Labeling.
    Journal of Graph Algorithms and Applications, 13(3):289–317, 2009.
    Special issue of GD 2007.
    Joint work with Marc Benkert, Herman Haverkort, and Moritz Kroll.
    [ html | pdf ]
  22. Consistent Digital Rays.
    Discrete and Computational Geometry, 42(3):359–378, 2009.
    Special issue of SoCG 2008.
    Joint work with Jinhee Chun, Matias Korman, and Takeshi Tokuyama.
    [ html | pdf ]
  23. Morphing Polylines: A Step Towards Continuous Generalization.
    Computers, Environment and Urban Systems, 32(4):248–260, 2008.
    Special issue of GISRUK 2007.
    Joint work with Damian Merrick, Alexander Wolff, and Marc Benkert.
    [ html | pdf ]

Artikel in Tagungsbänden

  1. Radial Contour Labeling with Straight Leaders.
    In: Proceedings of IEEE Pacific Visualization Symposium (PacificVis'17). IEEE Computer Society, 2017.
    To appear.
    Joint work with Benjamin Niedermann and Ignaz Rutter.
  2. Radial Contour Labeling with Straight Leaders.
    In: Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG'17), 2017.
    Preprint.
    Joint work with Benjamin Niedermann and Ignaz Rutter.
    [ html ]
  3. Temporal Map Labeling: A New Unified Framework with Experiments.
    In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'16), 2016.
    Joint work with Lukas Barth, Benjamin Niedermann, and Darren Strash.
  4. An Algorithmic Framework for Labeling Road Maps.
    In: Proceedings of the 9th International Conference on Geographic Information Science (GIScience'16), volume 9927 of Lecture Notes in Computer Science, pages 308–322. Springer, 2016.
    Joint work with Benjamin Niedermann.
  5. Software Visualization via Hierarchic Micro/Macro Layouts.
    In: Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP '16) – Volume 2: IVAPP, pages 155–162, 2016.
    Joint work with Ignaz Rutter and Alfred Schuhmacher.
  6. Towards Realistic Pedestrian Route Planning.
    In: Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'15), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, September 2015.
    Joint work with Simeon Danailov Andreev, Julian Dibbelt, Thomas Pajor, and Dorothea Wagner.
    [ pdf ]
  7. On the Readability of Boundary Labeling .
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
    Joint work with Lukas Barth, Andreas Gemsa, and Benjamin Niedermann.
  8. Label Placement in Road Maps.
    In: Proceedings of the 9th Conference on Algorithms and Complexity (CIAC'15), volume 9079 of Lecture Notes in Computer Science, pages 221–234. Springer, 2015.
    Full version available at http://arxiv.org/abs/1501.07188.
    Joint work with Andreas Gemsa and Benjamin Niedermann.
    [ html | pdf ]
  9. Recognizing Weighted Disk Contact Graphs.
    In: Proceedings of the 31st European Workshop on Computational Geometry (EuroCG'15), pages 113–116, 2015.
    Joint work with Boris Klemz and Roman Prutkin.
    [ pdf ]
  10. Recognizing Weighted Disk Contact Graphs.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
    To appear.
    Joint work with Boris Klemz and Roman Prutkin.
  11. On Minimizing Crossings in Storyline Visualizations.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
    To appear.
    Joint work with Irina Kostitsyna, Valentin Polishchuk, André Schulz, and Darren Strash.
  12. Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science, pages 231–244. Springer, 2015.
    Joint work with Jonathan Klawitter and Torsten Ueckerdt.
    [ html ]
  13. Operating Power Grids with few Flow Control Buses.
    In: Proceedings of the 6th ACM e-Energy International Conference on Future Energy Systems, pages 289–294. ACM Press, 2015.
    Full version available at http://arxiv.org/abs/1505.05747.
    Joint work with Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Ignaz Rutter, Peter Sanders, Dorothea Wagner, and Franziska Wegner.
    [ html ]
  14. Mixed Map Labeling.
    In: Proceedings of the 9th Conference on Algorithms and Complexity (CIAC'15), volume 9079 of Lecture Notes in Computer Science, pages 339–351. Springer, 2015.
    Full version available at http://arxiv.org/abs/1501.06813.
    Joint work with Maarten Löffler and Frank Staals.
    [ html | pdf ]
  15. Towards Realistic Flow Control in Power Grid Operation.
    In: Proceedings of the 4th D-A-CH Conference on Energy Informatics, volume 9424 of Lecture Notes in Computer Science, pages 192–199. Springer, 2015.
    Joint work with Tamara Mchedlidze, Ignaz Rutter, Dorothea Wagner, and Franziska Wegner.
    [ html ]
  16. Drawing Large Graphs by Multilevel Maxent-Stress Optimization.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
    To appear. Full version available at http://arxiv.org/abs/1506.04383.
    Joint work with Henning Meyerhenke and Christian Schulz.
  17. Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
    In: Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15), Lecture Notes in Computer Science, pages 637–649. Springer, 2015.
    Joint work with Roman Prutkin and Ignaz Rutter.
    [ html ]
  18. Label Placement in Road Maps.
    In: Proceedings of the 30th European Workshop on Computational Geometry (EuroCG'14), March 2014.
    Preprint.
    Joint work with Andreas Gemsa and Benjamin Niedermann.
    [ pdf ]
  19. Simultaneous Embeddability of Two Partitions.
    In: Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), volume 8871 of Lecture Notes in Computer Science, pages 64–75. Springer, 2014.
    Full version available at http://arxiv.org/abs/1408.6019.
    Joint work with Jan Christoph Athenstädt and Tanja Hartmann.
    [ html | pdf ]
  20. Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
    In: Proceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN'14), volume 8392 of Lecture Notes in Computer Science, pages 514–525. Springer, 2014.
    Full version available at http://arxiv.org/abs/1311.4778.
    Joint work with Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, and Alexander Wolff.
    [ html | pdf ]
  21. PIGRA – A Tool for Pixelated Graph Representations.
    In: Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), volume 8871 of Lecture Notes in Computer Science, pages 513–514. Springer, 2014.
    Poster abstract.
    Joint work with Thomas Bläsius, Fabian Klute, and Benjamin Niedermann.
    [ pdf ]
  22. Evaluation of Labeling Strategies for Rotating Maps.
    In: Proceedings of the 13th International Symposium on Experimental Algorithms (SEA'14), volume 8504 of Lecture Notes in Computer Science, pages 235–246. Springer, 2014.
    Full version available at http://arxiv.org/abs/1404.1849.
    Joint work with Andreas Gemsa and Ignaz Rutter.
    [ html | pdf ]
  23. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.
    In: Proceedings of the 14th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'14), volume 8503 of Lecture Notes in Computer Science, pages 265–276. Springer, 2014.
    Joint work with Boris Klemz and Tamara Mchedlidze.
    [ html | pdf ]
  24. On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs .
    In: Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), volume 8871 of Lecture Notes in Computer Science, pages 476–487. Springer, 2014.
    Full version available at http://arxiv.org/abs/1409.0315.
    Joint work with Roman Prutkin and Ignaz Rutter.
    [ html | pdf ]
  25. Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 553–554. Springer, 2013.
    Poster abstract.
    Joint work with Jan Christoph Athenstädt, Robert Görke, and Marcus Krug.
    [ html | pdf ]
  26. Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings.
    In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 460–471. Springer, 2013.
    Full version available at http://arxiv.org/abs/1308.6778.
    Joint work with Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Roman Prutkin, and Ignaz Rutter.
    [ html | pdf ]
  27. Many-to-One Boundary Labeling with Backbones.
    In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 244–255. Springer, 2013.
    Full version available at http://arxiv.org/abs/1308.6801.
    Joint work with Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Ignaz Rutter, and Antonios Symvonis.
    [ html | pdf ]
  28. Progress on Partial Edge Drawings.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 67–78. Springer, 2013.
    Full version available at http://arxiv.org/abs/2109.0830.
    Joint work with Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, and Alexander Wolff.
    [ html | pdf ]
  29. Strict Confluent Drawing.
    In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 352–363. Springer, 2013.
    Full version available at http://arxiv.org/abs/1308.6824.
    Joint work with David Eppstein, Danny Holten, Maarten Löffler, Bettina Speckmann, and Kevin Verbeek.
    [ html | pdf ]
  30. Drawing Metro Maps using Bézier Curves.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 463–474. Springer, 2013.
    Joint work with Martin Fink, Herman Haverkort, Maxwell Roberts, Julian Schuhmann, and Alexander Wolff.
    [ html | pdf ]
  31. Trajectory-Based Dynamic Map Labeling.
    In: Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13), 2013.
    Joint work with Andreas Gemsa and Benjamin Niedermann.
  32. Trajectory-Based Dynamic Map Labeling.
    In: Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC'13), volume 8283 of Lecture Notes in Computer Science, pages 413–423. Springer, 2013.
    Full version available at http://arxiv.org/abs/1309.3963.
    Joint work with Andreas Gemsa and Benjamin Niedermann.
    [ html | pdf ]
  33. Circular-Arc Cartograms.
    In: Proceedings of IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8. IEEE Computer Society, 2013.
    Full version available at http://arxiv.org/abs/1112.4626.
    Joint work with Jan-Hinrich Kämper and Stephen G. Kobourov.
    [ html | pdf ]
  34. Planar Lombardi Drawings of Outerpaths.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 561–562. Springer, 2013.
    Poster abstract.
    Joint work with Maarten Löffler.
    [ html | pdf ]
  35. Drawing Planar Graphs with a Prescribed Cycle.
    In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 316–327. Springer, 2013.
    Full version available at http://arxiv.org/abs/1308.3370.
    Joint work with Tamara Mchedlidze and Ignaz Rutter.
    [ html | pdf ]
  36. Euclidean Greedy Drawings of Trees.
    In: Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13), volume 8125 of Lecture Notes in Computer Science, pages 767–778. Springer, 2013.
    Full version available at http://arxiv.org/abs/1306.5224.
    Joint work with Roman Prutkin.
    [ html | pdf ]
  37. Edge-weighted Contact Representations of Planar Graphs.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 224–235. Springer, 2013.
    Joint work with Roman Prutkin and Ignaz Rutter.
    [ html | pdf ]
  38. On The Usability of Lombardi Graph Drawings.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 451–462. Springer, 2013.
    Joint work with Helen C. Purchase, John Hamer, and Stephen G. Kobourov.
    [ html | pdf ]
  39. Adjacency-Preserving Spatial Treemaps.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of Lecture Notes in Computer Science, pages 159–170. Springer, 2011.
    Full version available at http://arxiv.org/abs/1105.0398.
    Joint work with Kevin Buchin, David Eppstein, Maarten Löffler, and Rodrigo I. Silveira.
    [ html | pdf ]
  40. Drawing Trees with Perfect Angular Resolution and Polynomial Area.
    In: Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of Lecture Notes in Computer Science, pages 183–194. Springer, 2011.
    Full version available at http://arxiv.org/abs/1009.0581.
    Joint work with Christian A. Duncan, David Eppstein, Michael T. Goodrich, and Stephen G. Kobourov.
    [ html | pdf ]
  41. Lombardi Drawings of Graphs.
    In: Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of Lecture Notes in Computer Science, pages 195–207. Springer, 2011.
    Full version available at http://arxiv.org/abs/1009.0579.
    Joint work with Christian A. Duncan, David Eppstein, Michael T. Goodrich, and Stephen G. Kobourov.
    [ html | pdf ]
  42. Optimal 3D Angular Resolution for Low-Degree Graphs.
    In: Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of Lecture Notes in Computer Science, pages 208–219. Springer, 2011.
    Full version available at http://arxiv.org/abs/1009.0045.
    Joint work with David Eppstein, Maarten Löffler, and Elena Mumford.
    [ html | pdf ]
  43. Boundary-Labeling Algorithms for Panorama Images.
    In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 289–298. ACM Press, 2011.
    Joint work with Andreas Gemsa and Jan-Henrik Haunert.
    [ html | pdf ]
  44. Automatic Generation of Route Sketches.
    In: Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of Lecture Notes in Computer Science, pages 391–392. Springer, 2011.
    Poster abstract.
    Joint work with Andreas Gemsa, Thomas Pajor, and Ignaz Rutter.
    [ html | pdf ]
  45. On d-regular Schematization of Embedded Paths.
    In: Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of Lecture Notes in Computer Science, pages 260–271. Springer, January 2011.
    Joint work with Andreas Gemsa, Thomas Pajor, and Ignaz Rutter.
    [ html | pdf ]
  46. Consistent Labeling of Rotating Maps.
    In: Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11), pages 171–174, 2011.
    Joint work with Andreas Gemsa and Ignaz Rutter.
    [ pdf ]
  47. Consistent Labeling of Rotating Maps.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of Lecture Notes in Computer Science, pages 451–462. Springer, 2011.
    Full version available at http://arxiv.org/abs/1104.5634.
    Joint work with Andreas Gemsa and Ignaz Rutter.
    [ html | pdf ]
  48. Sliding Labels for Dynamic Point Labeling.
    In: Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11), pages 205–210. University of Toronto Press, 2011.
    Joint work with Andreas Gemsa and Ignaz Rutter.
    [ pdf ]
  49. Connecting Two Trees with Optimal Routing Cost.
    In: Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11), pages 43–47. University of Toronto Press, 2011.
    Joint work with Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Ignaz Rutter, and Dorothea Wagner.
    [ html | pdf ]
  50. Dynamic One-Sided Boundary Labeling.
    In: Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 310–319. ACM Press, November 2010.
    Joint work with Valentin Polishchuk and Mikko Sysikaski.
    [ html | pdf ]
  51. Path Schematization for Route Sketches.
    In: Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10), volume 6139 of Lecture Notes in Computer Science, pages 285–296. Springer, June 2010.
    Joint work with Daniel Delling, Andreas Gemsa, and Thomas Pajor.
    [ html | pdf ]
  52. Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling .
    In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10), pages 203–206. University of Manitoba, 2010.
    Joint work with Maarten Löffler.
    [ html | pdf ]
  53. An Improved Algorithm for the Metro-Line Crossing Minimization Problem.
    In: Proceedings of the 17th International Symposium on Graph Drawing (GD'09), volume 5849 of Lecture Notes in Computer Science, pages 381–392. Springer, 2010.
    [ html | pdf ]
  54. Drawing Binary Tanglegrams: An Experimental Evaluation.
    In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09), pages 106–119. SIAM, April 2009.
    Joint work with Markus Völker, Alexander Wolff, and Danny Holten.
    [ html | pdf ]
  55. Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability.
    In: Proceedings of the 16th International Symposium on Graph Drawing (GD'08), volume 5417 of Lecture Notes in Computer Science, pages 324–335. Springer, 2009.
    Joint work with Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff.
    [ html | pdf ]
  56. Cover Contact Graphs.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of Lecture Notes in Computer Science, pages 171–182. Springer, January 2008.
    Joint work with Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, and Alexander Wolff.
    [ html | pdf ]
  57. Algorithms for Multi-Criteria One-Sided Boundary Labeling.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of Lecture Notes in Computer Science, pages 243–254. Springer, January 2008.
    Joint work with Marc Benkert, Herman Haverkort, and Moritz Kroll.
    [ html | pdf ]
  58. Boundary Labeling with Octilinear Leaders.
    In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), volume 5124 of Lecture Notes in Computer Science, pages 234–245. Springer, 2008.
    Joint work with Michael Bekos, Michael Kaufmann, and Antonios Symvonis.
    [ html | pdf ]
  59. Optimizing Active Ranges for Consistent Dynamic Map Labeling.
    In: Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08), pages 10–19. ACM Press, 2008.
    Joint work with Ken Been, Sheung-Hung Poon, and Alexander Wolff.
    [ html | pdf ]
  60. Optimizing Active Ranges for Consistent Dynamic Map Labeling.
    In: Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08), pages 55–58, 2008.
    Joint work with Ken Been, Sheung-Hung Poon, and Alexander Wolff.
    [ pdf ]
  61. Consistent Digital Rays.
    In: Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08), pages 355–364. ACM Press, 2008.
    Joint work with Jinhee Chun, Matias Korman, and Takeshi Tokuyama.
    [ html | pdf ]
  62. Consistent Digital Rays.
    In: Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08), pages 169–172, 2008.
    Joint work with Jinhee Chun, Matias Korman, and Takeshi Tokuyama.
    [ pdf ]
  63. Improved Algorithms for Length-Minimal One-Sided Boundary Labeling.
    In: Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07), pages 190–193, 2007.
    Joint work with Marc Benkert.
    [ pdf ]
  64. Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps.
    In: Proceedings of the 14th International Symposium on Graph Drawing (GD'06), volume 4372 of Lecture Notes in Computer Science, pages 270–281. Springer, January 2007.
    Joint work with Marc Benkert, Takeaki Uno, and Alexander Wolff.
    [ html | pdf ]
  65. Morphing Polygonal Lines: A Step Towards Continuous Generalization.
    In: Proceedings of the 15th Annual Geographic Information Sciences Research Conference UK, pages 390–399, 2007.
    Joint work with Damian Merrick, Alexander Wolff, and Marc Benkert.
    [ pdf ]
  66. Morphing Polygonal Lines: A Step Towards Continuous Generalization.
    In: Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07), pages 6–9, 2007.
    Joint work with Damian Merrick, Alexander Wolff, and Marc Benkert.
    [ pdf ]
  67. A Mixed-Integer Program for Drawing High-Quality Metro Maps.
    In: Proceedings of the 13th International Symposium on Graph Drawing (GD'05), volume 3843 of Lecture Notes in Computer Science, pages 321–333. Springer, January 2006.
    Joint work with Alexander Wolff.
    [ html | pdf ]
  68. Validation in the Cluster Analysis of Gene Expression Data.
    In: Proceedings of the 14th Workshop Fuzzy-Systeme und Computational Intelligence, pages 13–32. Universitätsverlag Karlsruhe, 2004.
    Joint work with Jens Jäkel.
    [ pdf ]

Dissertation

  1. Network Visualization: Algorithms, Applications, and Complexity.
    PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH), February 2009.
    [ html | pdf ]

Abschlussarbeiten

  1. Automated Drawing of Metro Maps.
    Master's thesis, Universität Karlsruhe, August 2005.
    [ pdf ]

Technische Berichte

  1. Operating Power Grids with Few Flow Control Buses.
    Technical Report 1505.05747, ArXiv e-prints, 2015.
    Joint work with Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Ignaz Rutter, Peter Sanders, Dorothea Wagner, and Franziska Wegner.
    [ html | pdf ]
  2. Simultaneous Embeddability of Two Partitions.
    Technical Report arXiv:1408.6019, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2014.
    Full version of conference paper at GD'14.
    Joint work with Jan Christoph Athenstädt and Tanja Hartmann.
    [ html ]
  3. A Survey on Automated Metro Map Layout Methods.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2014.
    Contribution to the Schematic Mapping Workshop, University of Essex, April 2014.
    [ html | pdf ]
  4. Path Schematization for Route Sketches.
    Technical Report 2010-02, Faculty of Informatics, Karlsruhe Institute of Technology, 2010.
    Joint work with Daniel Delling, Andreas Gemsa, and Thomas Pajor.
    [ html | pdf ]
  5. On d-regular Schematization of Embedded Paths.
    Technical Report 2010-21, Faculty of Informatics, Karlsruhe Institute of Technology, 2010.
    Joint work with Andreas Gemsa, Thomas Pajor, and Ignaz Rutter.
    [ html | pdf ]
  6. Automated Drawing of Metro Maps.
    Technical Report 2005-25, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2005.
    [ html | pdf ]