Marc Benkert

According to our database, Marc Benkert authored at least 19 papers between 2001 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Approximate one-to-one point pattern matching.

Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle

J. Discrete Algorithms, 2012

2010

Finding Popular Places.

Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle

Int. J. Comput. Geom. Appl., 2010

2009

Algorithms for Multi-Criteria Boundary Labeling.

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg

J. Graph Algorithms Appl., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.

Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff

Int. J. Comput. Geom. Appl., 2009

2008

Morphing polylines: A step towards continuous generalization.

Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert

Comput. Environ. Urban Syst., 2008

Reporting flock patterns.

Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle

Comput. Geom., 2008

Constructing minimum-interference networks.

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff

Comput. Geom., 2008

Delineating Boundaries for Imprecise Regions.

Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff

Algorithmica, 2008

2007

Construction and Analysis of Geometric Networks

Marc Benkert

PhD thesis, 2007

Algorithms for Multi-criteria One-Sided Boundary Labeling.

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

The minimum Manhattan network problem: Approximations and exact solutions.

Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe

Comput. Geom., 2006

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.

Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff

Proceedings of the Graph Drawing, 14th International Symposium, 2006

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.

Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Delineating boundaries for imprecise regions.

Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Constructing interference-minimal networks.

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Delineating Boundaries for Imprecise Regions.

Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff

Proceedings of the Algorithms, 2005

2004

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation.

Marc Benkert, Alexander Wolff, Florian Widmann

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Network Comparison.

Michael Baur, Marc Benkert

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

2001

Visone.

Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner

Proceedings of the Graph Drawing, 9th International Symposium, 2001