Marc Benkert

Computer Science · Physical Sciences

12h-index625citations26works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(15), Data Management and Algorithms(12), Geographic Information Systems Studies(7), Advanced Graph Theory Research(3), Data Visualization and Analytics(3)

Publications26 total

Delineating Boundaries for Imprecise Regions
UNC Libraries·2021Open Access
Approximate one-to-one point pattern matching
Journal of Discrete Algorithms·2012· 5 cited
FINDING POPULAR PLACES
International Journal of Computational Geometry & Applications·2010· 32 cited
A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
International Journal of Computational Geometry & Applications·2009· 10 cited
Algorithms for Multi-Criteria Boundary Labeling
Journal of Graph Algorithms and Applications·2009· 34 citedOpen Access
Morphing polylines: A step towards continuous generalization
Computers Environment and Urban Systems·2008· 64 cited
Algorithms for Multi-criteria One-Sided Boundary Labeling
Lecture notes in computer science·2008· 17 citedOpen Access
Finding Popular Places
Lecture notes in computer science·2007· 5 cited
Reporting flock patterns
Computational Geometry·2007· 189 cited
Delineating Boundaries for Imprecise Regions
Algorithmica·2007· 21 cited
Constructing minimum-interference networks
Computational Geometry·2007· 22 citedOpen Access
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
Lecture notes in computer science·2007· 26 citedOpen Access
Construction and Analysis of Geometric Networks
Repository KITopen (Karlsruhe Institute of Technology)·2007Open Access
Improved Algorithms for Length-Minimal One-Sided Boundary Labeling
European Workshop on Computational Geometry·2007· 3 cited
A polynomial-time approximation algorithm for a geometric dispersion problem
Repository KITopen (Karlsruhe Institute of Technology)·2006· 1 citedOpen Access
Constructing Interference-Minimal Networks
Lecture notes in computer science·2006· 2 cited
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
Lecture notes in computer science·2006· 1 cited
Scale-Dependent Definitions of Gradient and Aspect and their Computation
2006· 4 cited
Reporting Flock Patterns
Lecture notes in computer science·2006· 42 citedOpen Access
The minimum Manhattan network problem: Approximations and exact solutions
Computational Geometry·2005· 38 cited
page 1 of 2Next →

Frequent Co-authors

Alexander Wolff(13), Joachim Gudmundsson(10), Thomas Wolle(5), Martin Nöllenburg(5), Iris Reinbacher(5), Marc van Kreveld(5), Herman Haverkort(4), Florian Widmann(3), Joseph S. B. Mitchell(3), Christian Knauer(3), René van Oostrum(3), Florian Hübner(2), Damian Merrick(2), Moritz Kroll(2), Bojan Djordjevic(2), Jack Snoeyink(2), Esther Moet(2), Michael Baur(1), Ulrik Brandes(1), Sabine Cornelsen(1)