default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Benkert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j9]Marc Benkert, Joachim Gudmundsson
, Damian Merrick, Thomas Wolle:
Approximate one-to-one point pattern matching. J. Discrete Algorithms 15: 1-15 (2012)- 2010
- [j8]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. Int. J. Comput. Geom. Appl. 20(1): 19-42 (2010)
2000 – 2009
- 2009
- [j7]Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geom. Appl. 19(3): 267-288 (2009) - [j6]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. 13(3): 289-317 (2009) - 2008
- [j5]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) - [j4]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) - [j3]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008) - [j2]Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert:
Morphing polylines: A step towards continuous generalization. Comput. Environ. Urban Syst. 32(4): 248-260 (2008) - 2007
- [b1]Marc Benkert:
Construction and Analysis of Geometric Networks. Karlsruhe University, Germany, 2007 - [c10]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-criteria One-Sided Boundary Labeling. GD 2007: 243-254 - [c9]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. ISAAC 2007: 776-787 - 2006
- [j1]Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe:
The minimum Manhattan network problem: Approximations and exact solutions. Comput. Geom. 35(3): 188-208 (2006) - [c8]Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175 - [c7]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting Flock Patterns. ESA 2006: 660-671 - [c6]Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD 2006: 270-281 - [c5]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 - 2005
- [c4]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 - [i2]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff:
Delineating boundaries for imprecise regions. EuroCG 2005: 127-130 - [i1]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing interference-minimal networks. EuroCG 2005: 203-206 - 2004
- [c3]Michael Baur, Marc Benkert:
Network Comparison. Network Analysis 2004: 318-340 - [c2]Marc Benkert, Alexander Wolff, Florian Widmann:
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. JCDCG 2004: 16-28 - 2001
- [c1]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner:
Visone. GD 2001: 463-464
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
