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
Marc Benkert
Veröffentlichungen

Veröffentlichungen

Buchbeiträge

  1. 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.
    Joint work with Michael Baur.

Artikel in Zeitschriften

  1. A polynomial-time approximation algorithm for a geometric dispersion problem.
    Computational Geometry: Theory and Applications, 2007.
    to appear.
    Joint work with Joachim Gudmundsson, Christian Knauer, René van Oostrum, and Alexander Wolff.
    [ pdf ]
  2. Constructing interference-minimal networks.
    Computational Geometry: Theory and Applications, 2007.
    to appear.
    Joint work with Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff.
    [ pdf ]
  3. Delineating boundaries for imprecise regions.
    Algorithmica, 2007.
    to appear.
    Joint work with Iris Reinbacher, Marc van Kreveld, Joseph S.B. Mitchell, Jack Snoeyink, and Alexander Wolff.
    [ pdf | abstract ]
  4. The minimum Manhattan network problem: Approximations and exact solutions.
    Computational Geometry: Theory and Applications, 35(3):188-208, 2006.
    Joint work with Alexander Wolff, Florian Widmann, and Takeshi Shirabe.
    [ html | pdf | abstract ]

Artikel in Tagungsbänden

  1. Improved algorithms for length-minimal one-sided boundary labeling.
    In: Proc. 23rd European Workshop on Computational Geometry (EWCG'07), 19-21 March 2007.
    To appear.
    Joint work with Martin Nöllenburg.
  2. Minimizing intra-edge crossings in wiring diagrams and public transport maps.
    In: Michael Kaufmann and Dorothea Wagner, editors, Proc. 14th Int. Symposium on Graph Drawing (GD'06), Lecture Notes in Computer Science. Springer-Verlag, 2007.
    To appear.
    Joint work with Martin Nöllenburg, Takeaki Uno, and Alexander Wolff.
    [ pdf ]
  3. Morphing polygonal lines: A step towards continuous generalization.
    In: Proc.23rd European Workshop on Computational Geometry (EWCG'07), 2007.
    To appear.
    Joint work with Damian Merrick, Martin Nöllenburg, and Alexander Wolff.
  4. 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.
    Joint work with Joachim Gudmundsson, Florian Hübner, and Thomas Wolle.
    [ pdf ]
  5. 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.
    Joint work with Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff.
    [ html | pdf ]
  6. A polynomial-time approximation algorithm for a geometric dispersion problem.
    In: Proc. 22st European Workshop on Computational Geometry (EWCG'06), 27-29 March 2006.
    Joint work with Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff.
    [ pdf ]
  7. Constructing interference-minimal networks.
    In: Jiří Wiedermann, Julius Stuller, Gerard Tel, Jaroslav Pokorny, and Mária Bieliková, editors, Proc. 32nd Int. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM'06), volume 3831 of Lecture Notes in Computer Science, pages 166-176. Springer-Verlag, 2006.
    Joint work with Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff.
    [ html | pdf ]
  8. 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.
    Joint work with Iris Reinbacher and Marc van Kreveld.
  9. Constructing interference-minimal networks.
    In: Proc. 21st European Workshop on Computational Geometry (EWCG'05), pages 203-206, Eindhoven, 9-11 March 2005.
    Joint work with Joachim Gudmundsson, Herman Haverkort, and Alexander Wolff.
    [ pdf ]
  10. 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.
    Joint work with Florian Widmann and Alexander Wolff.
    [ html | pdf ]
  11. Delineating boundaries for imprecise regions.
    In: Proc. 21st European Workshop on Computational Geometry (EWCG'05), pages 127-130, Eindhoven, 9-11 March 2005.
    Joint work with Iris Reinbacher, Marc van Kreveld, and Alexander Wolff.
    [ pdf ]
  12. 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, 3-6 October 2005.
    Joint work with Iris Reinbacher, Marc van Kreveld, Joseph S.B. Mitchell, and Alexander Wolff.
    [ html | pdf ]
  13. The minimum Manhattan network problem: A fast factor-3 approximation.
    In: Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04), pages 85-86, 8-11 October 2004.
    Joint work with Florian Widmann and Alexander Wolff.
    [ pdf ]
  14. The minimum Manhattan network problem: Approximations and exact solutions.
    In: Proc. 20th European Workshop on Computational Geometry (EWCG'04), pages 209-212, Sevilla, 24-26 March 2004.
    Joint work with Alexander Wolff and Takeshi Shirabe.
    [ pdf ]
  15. visone - software for visual social network analysis.
    In: Proceedings of the 9th International Symposium on Graph Drawing (GD'01), volume 2265 of Lecture Notes in Computer Science, pages 463-464, 2002.
    Joint work with Michael Baur, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, and Dorothea Wagner.
    [ html | abstract ]

Dissertation

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

Diplomarbeit

  1. Über den kleinsten Primitivrest mod p.
    Master's thesis, Universität Konstanz, 2002.
    [ ps ]

Technische Berichte

  1. Reporting flock patterns.
    Technical Report 2006-14, Fakultät für Informatik, Universität Karlsruhe, 2006.
    Joint work with Joachim Gudmundsson, Florian Hübner, and Thomas Wolle.
    [ html ]
  2. A polynomial-time approximation algorithm for a geometric dispersion problem.
    Technical Report 2006-8, Fakultät für Informatik, Universität Karlsruhe, 2006.
    Joint work with Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, and Alexander Wolff.
    [ html ]
  3. The minimum Manhattan network problem: A fast factor-3 approximation.
    Technical Report 2004-16, Fakultät für Informatik, Universität Karlsruhe, 2004.
    Joint work with Florian Widmann and Alexander Wolff.
    [ html ]