Elmar Langetepe

According to our database, Elmar Langetepe authored at least 59 papers between 1993 and 2024.

Collaborative distances:

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

2024

NP-hardness and a PTAS for the Euclidean Steiner Line Problem.

Simon Bartlmae, Paul J. Jünger, Elmar Langetepe

CoRR, 2024

Simple Grid Polygon Online Exploration Revisited.

Maximilian Brock, Martin Brückmann, Elmar Langetepe, Raphael Wude

CoRR, 2024

2022

Minimum-error triangulations for sea surface reconstruction.

Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin

J. Comput. Geom., 2022

A new model and algorithms in firefighting theory.

Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald

Discret. Appl. Math., 2022

Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface.

Annika Bonerath, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Elmar Langetepe, Benjamin Niedermann

CoRR, 2022

2021

On the approximation of shortest escape paths.

David Kübel, Elmar Langetepe

Comput. Geom., 2021

Geometric firefighting in the half-plane.

Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald

Comput. Geom., 2021

2020

How to play hot and cold.

Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald

Comput. Geom., 2020

A New Model in Firefighting Theory.

Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

On a Fire Fighter's Problem.

Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas

Int. J. Found. Comput. Sci., 2019

Shortest-Path-Preserving Rounding.

Herman J. Haverkort, David Kübel, Elmar Langetepe

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2017

Exact VC-dimension for $L_1$-visibility of points in simple polygons.

Elmar Langetepe, Simone Lehmann

CoRR, 2017

How to Play Hot and Cold on a Line.

Herman J. Haverkort, David Kübel, Elmar Langetepe, Barbara Schwarzwald

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Discrete Surveillance Tours in Polygonal Domains.

Elmar Langetepe, Bengt J. Nilsson, Eli Packer

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Evolutionary Learning of Fire Fighting Strategies.

Martin Kretschmer, Elmar Langetepe

Proceedings of the Artificial Evolution, 2017

2016

Robotics.

Elmar Langetepe

Encyclopedia of Algorithms, 2016

Computational Geometry Column 63.

Rolf Klein, Elmar Langetepe

SIGACT News, 2016

Optimal Online Escape Path Against a Certificate.

Elmar Langetepe, David Kübel

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

A local strategy for cleaning expanding cellular domains by simple robots.

Rolf Klein, David Kriesel, Elmar Langetepe

Theor. Comput. Sci., 2015

Strategic Deployment in Graphs.

Elmar Langetepe, Andreas Lenerz, Bernd Brüggemann

Informatica (Slovenia), 2015

A Fire Fighter's Problem.

Rolf Klein, Elmar Langetepe, Christos Levcopoulos

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2012

Searching for an axis-parallel shoreline.

Elmar Langetepe

Theor. Comput. Sci., 2012

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.

Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu

Int. J. Comput. Geom. Appl., 2012

Optimizing two-sequence functionals in competitive analysis.

Elmar Langetepe

Comput. Sci. Res. Dev., 2012

From a Multi-robot Global Plan to Single-robot Actions.

Bernd Brüggemann, Elmar Langetepe, Andreas Lenerz, Dirk Schulz

Proceedings of the ICINCO 2012 - Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics, Volume 2, Rome, Italy, 28, 2012

2011

Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.

Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

The Tourist in the Shopping Arcade.

Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

J. Univers. Comput. Sci., 2010

Leaving an Unknown Maze Using an Error-Prone Compass.

Tom Kamphans, Elmar Langetepe

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

Exploring Simple Triangular and Hexagonal Grid Polygons Online

Daniel Herrmann, Tom Kamphans, Elmar Langetepe

CoRR, 2010

Exploring Grid Polygons Online

Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe

CoRR, 2010

On the Optimality of Spiral Search.

Elmar Langetepe

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the <i>L</i>₁ Plane.

Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Abstract Voronoi diagrams revisited.

Rolf Klein, Elmar Langetepe, Zahra Nilforoushan

Comput. Geom., 2009

Inspecting a Set of Strips Optimally.

Tom Kamphans, Elmar Langetepe

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008

Competitive Online Approximation of the Optimal Search Ratio.

Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

SIAM J. Comput., 2008

2007

Escaping from a Labyrinth with One-way Roads for Limited Robots.

Bernd Brüggemann, Tom Kamphans, Elmar Langetepe

Proceedings of the 3rd European Conference on Mobile Robots, 2007

2006

Geometric data structures for computer graphics.

Elmar Langetepe, Gabriel Zachmann

A K Peters, ISBN: 978-1-56881-235-9, 2006

2005

Optimal Competitive Online Ray Search with an Error-Prone Robot.

Thomas Kamphans, Elmar Langetepe

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

On optimizing multi-sequence functionals for competitive analysis.

Tom Kamphans, Elmar Langetepe

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

Competitive online searching for a ray in the plane.

Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen

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

Exploring Simple Grid Polygons.

Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

An Optimal Competitive Strategy for Walking in Streets.

Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau

SIAM J. Comput., 2004

The weighted farthest color Voronoi diagram on trees and graphs.

Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán

Comput. Geom., 2004

A fast algorithm for approximating the detour of a polygonal chain.

Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas

Comput. Geom., 2004

2003

Voronoi Diagram for services neighboring a highway.

Manuel Abellanas, Ferran Hurtado, Vera Sacristán, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop

Inf. Process. Lett., 2003

The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.

Thomas Kamphans, Elmar Langetepe

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002

Geometric Data Structures for Computer Graphics.

Gabriel Zachmann, Elmar Langetepe

Proceedings of the 23rd Annual Conference of the European Association for Computer Graphics, 2002

2001

Generalized self-approaching curves.

Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote

Discret. Appl. Math., 2001

Smallest Color-Spanning Objects.

Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán

Proceedings of the Algorithms, 2001

2000

Exploring an Unknown Cellular Environment.

Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe

EuroCG, 2000

On the Competitive Complexity of Navigation Tasks.

Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe

Proceedings of the Sensor Based Intelligent Robots, 2000

1999

How to Find a Point on a Line Within a Fixed Distance.

Christoph A. Hipke, Christian Icking, Rolf Klein, Elmar Langetepe

Discret. Appl. Math., 1999

An Optimal Competitive Strategy for Walking in Streets.

Christian Icking, Rolf Klein, Elmar Langetepe

Proceedings of the STACS 99, 1999

1997

A Correct Logic Programming Computation of Default Logic Extensions.

Grigoris Antoniou, Elmar Langetepe

J. Autom. Reason., 1997

1994

Applying SLD-resolution to a class of non-Horn logic programs.

Grigoris Antoniou, Elmar Langetepe

Bull. IGPL, 1994

New Proofs in Default Logic Theory.

Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider

Ann. Math. Artif. Intell., 1994

Soundness and Completeness of a Logic Programming Approach to Default Logic.

Grigoris Antoniou, Elmar Langetepe

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

Computing Extensions of Default Logic - Preliminary Report.

Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider

Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

A Process Model for Default Logic and Its Realization in Logic Programming.

Grigoris Antoniou, Elmar Langetepe

Proceedings of the Progress in Artificial Intelligence, 1993