default search action
Elmar Langetepe
Person information
- affiliation: University of Bonn, Institute of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i19]Maximilian Brock, Martin Brückmann, Elmar Langetepe, Raphael Wude:
Simple Grid Polygon Online Exploration Revisited. CoRR abs/2407.17208 (2024) - 2022
- [j25]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack
, Barbara Schwarzwald
A new model and algorithms in firefighting theory. Discret. Appl. Math. 319: 296-309 (2022) - [j24]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-error triangulations for sea surface reconstruction. J. Comput. Geom. 14(2): 108-171 (2022) - [c29]Anna Arutyunova, Anne Driemel
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - [i18]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - [i17]Annika Bonerath, Anne Driemel, Jan-Henrik Haunert
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface. CoRR abs/2209.00913 (2022) - 2021
- [j23]David Kübel, Elmar Langetepe:
On the approximation of shortest escape paths. Comput. Geom. 93: 101709 (2021) - [j22]Sang-Sub Kim
Geometric firefighting in the half-plane. Comput. Geom. 95: 101728 (2021) - 2020
- [j21]Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
How to play hot and cold. Comput. Geom. 87: 101596 (2020) - [c28]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack
A New Model in Firefighting Theory. CALDAM 2020: 371-383
2010 – 2019
- 2019
- [j20]Rolf Klein, Elmar Langetepe, Barbara Schwarzwald
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30(2): 231-246 (2019) - [c27]Herman J. Haverkort, David Kübel, Elmar Langetepe:
Shortest-Path-Preserving Rounding. IWOCA 2019: 265-277 - [c26]Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald
Geometric Firefighting in the Half-Plane. WADS 2019: 481-494 - [i16]Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
Geometric Firefighting in the Half-plane. CoRR abs/1905.02067 (2019) - [i15]Herman J. Haverkort, David Kübel, Elmar Langetepe:
Shortest-Path-Preserving Rounding. CoRR abs/1905.08621 (2019) - [i14]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CoRR abs/1911.10341 (2019) - 2017
- [c25]Martin Kretschmer, Elmar Langetepe:
Evolutionary Learning of Fire Fighting Strategies. Artificial Evolution 2017: 162-175 - [c24]Elmar Langetepe, Bengt J. Nilsson, Eli Packer:
Discrete Surveillance Tours in Polygonal Domains. CCCG 2017: 162-167 - [c23]Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald
How to Play Hot and Cold on a Line. WADS 2017: 449-460 - [i13]Martin Kretschmer, Elmar Langetepe:
Evolutionary learning of fire fighting strategies. CoRR abs/1705.01721 (2017) - [i12]Elmar Langetepe, Simone Lehmann:
Exact VC-dimension for $L_1$-visibility of points in simple polygons. CoRR abs/1705.01723 (2017) - 2016
- [j19]Rolf Klein, Elmar Langetepe:
Computational Geometry Column 63. SIGACT News 47(2): 34-39 (2016) - [c22]Elmar Langetepe, David Kübel:
Optimal Online Escape Path Against a Certificate. SWAT 2016: 19:1-19:14 - [r1]Elmar Langetepe:
Robotics. Encyclopedia of Algorithms 2016: 1853-1858 - [i11]Elmar Langetepe, David Kübel:
Optimal online escape path against a certificate. CoRR abs/1604.05972 (2016) - 2015
- [j18]Elmar Langetepe, Andreas Lenerz, Bernd Brüggemann:
Strategic Deployment in Graphs. Informatica (Slovenia) 39(3) (2015) - [j17]Rolf Klein, David Kriesel, Elmar Langetepe:
A local strategy for cleaning expanding cellular domains by simple robots. Theor. Comput. Sci. 605: 80-94 (2015) - [c21]Rolf Klein, Elmar Langetepe, Christos Levcopoulos
A Fire Fighter's Problem. SoCG 2015: 768-780 - [i10]Rolf Klein, David Kriesel, Elmar Langetepe:
A local strategy for cleaning expanding cellular domains by simple robots. CoRR abs/1502.03985 (2015) - 2014
- [i9]Elmar Langetepe, Andreas Lenerz, Bernd Brüggemann:
Strategic deployment in graphs. CoRR abs/1412.0538 (2014) - [i8]Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. CoRR abs/1412.6065 (2014) - 2012
- [j16]Elmar Langetepe:
Optimizing two-sequence functionals in competitive analysis. Comput. Sci. Res. Dev. 27(3): 207-216 (2012) - [j15]Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geom. Appl. 22(1): 45-60 (2012) - [j14]Elmar Langetepe:
Searching for an axis-parallel shoreline. Theor. Comput. Sci. 447: 85-99 (2012) - [c20]Bernd Brüggemann, Elmar Langetepe, Andreas Lenerz, Dirk Schulz:
From a Multi-robot Global Plan to Single-robot Actions. ICINCO (2) 2012: 419-422 - 2011
- [c19]Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe:
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains. SCG 2011: 287-288 - 2010
- [j13]Tom Kamphans, Elmar Langetepe:
Leaving an Unknown Maze Using an Error-Prone Compass. Int. J. Comput. Geom. Appl. 20(3): 307-325 (2010) - [j12]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16(5): 676-685 (2010) - [c18]Elmar Langetepe:
Searching for an Axis-Parallel Shoreline. COCOA (1) 2010: 369-384 - [c17]Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. ISAAC (2) 2010: 121-131 - [c16]Elmar Langetepe:
On the Optimality of Spiral Search. SODA 2010: 1-12 - [i7]Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Grid Polygons Online. CoRR abs/1012.5240 (2010) - [i6]Daniel Herrmann, Tom Kamphans, Elmar Langetepe:
Exploring Simple Triangular and Hexagonal Grid Polygons Online. CoRR abs/1012.5253 (2010) - [i5]Tom Kamphans, Elmar Langetepe:
Optimal competitive online ray search with an error-prone robot. CoRR abs/1012.5259 (2010)
2000 – 2009
- 2009
- [j11]Rolf Klein, Elmar Langetepe, Zahra Nilforoushan:
Abstract Voronoi diagrams revisited. Comput. Geom. 42(9): 885-902 (2009) - [c15]Tom Kamphans, Elmar Langetepe:
Inspecting a Set of Strips Optimally. WADS 2009: 423-434 - 2008
- [j10]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. SIAM J. Comput. 38(3): 881-898 (2008) - 2007
- [c14]Bernd Brüggemann, Tom Kamphans, Elmar Langetepe:
Escaping from a Labyrinth with One-way Roads for Limited Robots. EMCR 2007 - 2006
- [b1]Elmar Langetepe, Gabriel Zachmann:
Geometric data structures for computer graphics. A K Peters 2006, ISBN 978-1-56881-235-9, pp. I-XIII, 1-339 - [i4]Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006 - 2005
- [c13]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Simple Grid Polygons. COCOON 2005: 524-533 - [c12]Thomas Kamphans, Elmar Langetepe:
Optimal Competitive Online Ray Search with an Error-Prone Robot. WEA 2005: 593-596 - [i3]Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive online searching for a ray in the plane. EuroCG 2005: 107-110 - [i2]Tom Kamphans, Elmar Langetepe:
On optimizing multi-sequence functionals for competitive analysis. EuroCG 2005: 111-114 - 2004
- [j9]Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán
The weighted farthest color Voronoi diagram on trees and graphs. Comput. Geom. 27(1): 13-26 (2004) - [j8]Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas:
A fast algorithm for approximating the detour of a polygonal chain. Comput. Geom. 27(2): 123-134 (2004) - [j7]Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau:
An Optimal Competitive Strategy for Walking in Streets. SIAM J. Comput. 33(2): 462-486 (2004) - [c11]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346 - 2003
- [j6]Manuel Abellanas, Ferran Hurtado, Vera Sacristán
Voronoi Diagram for services neighboring a highway. Inf. Process. Lett. 86(5): 283-288 (2003) - [c10]Thomas Kamphans, Elmar Langetepe:
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion. WAOA 2003: 165-178 - 2002
- [c9]Gabriel Zachmann, Elmar Langetepe:
Geometric Data Structures for Computer Graphics. Eurographics (Tutorials) 2002 - 2001
- [j5]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized self-approaching curves. Discret. Appl. Math. 109(1-2): 3-24 (2001) - [c8]Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
Smallest Color-Spanning Objects. ESA 2001: 278-289 - [c7]Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain. ESA 2001: 321-332 - 2000
- [c6]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks. Sensor Based Intelligent Robots 2000: 245-258 - [i1]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring an Unknown Cellular Environment. EuroCG 2000: 140-143
1990 – 1999
- 1999
- [j4]Christoph A. Hipke, Christian Icking, Rolf Klein, Elmar Langetepe:
How to Find a Point on a Line Within a Fixed Distance. Discret. Appl. Math. 93(1): 67-73 (1999) - [c5]Christian Icking, Rolf Klein, Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets. STACS 1999: 110-120 - 1998
- [c4]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized Self-Approaching Curves. ISAAC 1998: 317-326 - 1997
- [j3]Grigoris Antoniou, Elmar Langetepe:
A Correct Logic Programming Computation of Default Logic Extensions. J. Autom. Reason. 18(1): 25-46 (1997) - 1994
- [j2]Grigoris Antoniou
New Proofs in Default Logic Theory. Ann. Math. Artif. Intell. 12(3-4): 215-229 (1994) - [j1]Grigoris Antoniou
Applying SLD-resolution to a class of non-Horn logic programs. Bull. IGPL 2(2): 229-241 (1994) - [c3]Grigoris Antoniou, Elmar Langetepe:
Soundness and Completeness of a Logic Programming Approach to Default Logic. AAAI 1994: 934-939 - 1993
- [c2]Grigoris Antoniou, Elmar Langetepe:
A Process Model for Default Logic and Its Realization in Logic Programming. EPIA 1993: 213-225 - [c1]Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider:
Computing Extensions of Default Logic - Preliminary Report. LPAR 1993: 19-27
Coauthor Index
aka: Thomas Kamphans
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-11-15 19:35 CET 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: