Elmar Langetepe

According to our database1, Elmar Langetepe authored at least 53 papers between 1993 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


How to play hot and cold.
Comput. Geom., 2020

A New Model in Firefighting Theory.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

On a Fire Fighter's Problem.
Int. J. Found. Comput. Sci., 2019

Geometric Firefighting in the Half-Plane.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Shortest-Path-Preserving Rounding.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

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

How to Play Hot and Cold on a Line.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Discrete Surveillance Tours in Polygonal Domains.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Evolutionary Learning of Fire Fighting Strategies.
Proceedings of the Artificial Evolution, 2017

Encyclopedia of Algorithms, 2016

Computational Geometry Column 63.
SIGACT News, 2016

Optimal Online Escape Path Against a Certificate.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A local strategy for cleaning expanding cellular domains by simple robots.
Theor. Comput. Sci., 2015

Strategic Deployment in Graphs.
Informatica (Slovenia), 2015

A Fire Fighter's Problem.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Searching for an axis-parallel shoreline.
Theor. Comput. Sci., 2012

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geom. Appl., 2012

Optimizing two-sequence functionals in competitive analysis.
Comput. Sci. Res. Dev., 2012

From a Multi-robot Global Plan to Single-robot Actions.
Proceedings of the ICINCO 2012 - Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics, Volume 2, Rome, Italy, 28, 2012

Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The Tourist in the Shopping Arcade.
J. UCS, 2010

Leaving an Unknown Maze Using an Error-Prone Compass.
Int. J. Comput. Geom. Appl., 2010

Exploring Simple Triangular and Hexagonal Grid Polygons Online
CoRR, 2010

Exploring Grid Polygons Online
CoRR, 2010

On the Optimality of Spiral Search.
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><sub>1</sub> Plane.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Abstract Voronoi diagrams revisited.
Comput. Geom., 2009

Inspecting a Set of Strips Optimally.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput., 2008

Escaping from a Labyrinth with One-way Roads for Limited Robots.
Proceedings of the 3rd European Conference on Mobile Robots, 2007

Competitive Online Searching for a Ray in the Plane.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Geometric data structures for computer graphics.
A K Peters, ISBN: 978-1-56881-235-9, 2006

Optimal Competitive Online Ray Search with an Error-Prone Robot.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

On optimizing multi-sequence functionals for competitive analysis.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Exploring Simple Grid Polygons.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput., 2004

The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom., 2004

A fast algorithm for approximating the detour of a polygonal chain.
Comput. Geom., 2004

Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett., 2003

The Pledge Algorithm Reconsidered under Errors in Sensors and Motion.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Geometric Data Structures for Computer Graphics.
Proceedings of the 23rd Annual Conference of the European Association for Computer Graphics, 2002

Generalized self-approaching curves.
Discret. Appl. Math., 2001

Smallest Color-Spanning Objects.
Proceedings of the Algorithms, 2001

Exploring an Unknown Cellular Environment.
EuroCG, 2000

On the Competitive Complexity of Navigation Tasks.
Proceedings of the Sensor Based Intelligent Robots, 2000

How to Find a Point on a Line Within a Fixed Distance.
Discret. Appl. Math., 1999

An Optimal Competitive Strategy for Walking in Streets.
Proceedings of the STACS 99, 1999

A Correct Logic Programming Computation of Default Logic Extensions.
J. Autom. Reasoning, 1997

Applying SLD-resolution to a class of non-Horn logic programs.
Bull. IGPL, 1994

New Proofs in Default Logic Theory.
Ann. Math. Artif. Intell., 1994

Soundness and Completeness of a Logic Programming Approach to Default Logic.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

Computing Extensions of Default Logic - Preliminary Report.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

A Process Model for Default Logic and Its Realization in Logic Programming.
Proceedings of the Progress in Artificial Intelligence, 1993