( en | de | ru )

 

Disambiguation of "Langetepe, Elmar"

Author of the publication

copydeleteadd this publication to your clipboard
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.

, , , and . SCG, page 287-288. ACM, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elmar Langetepe

Suliman Ahmed Elmarabet

Erwin Elmar

Timo Langetepe

Gerd Langetepe

 

Other publications of authors with the same name

The Pledge Algorithm Reconsidered under Errors in Sensors and Motion., and . WAOA, volume 2909 of Lecture Notes in Computer Science, page 165-178. Springer, (2003)The weighted farthest color Voronoi diagram on trees and graphs., , , and . Comput. Geom., 27 (1): 13-26 (2004)A local strategy for cleaning expanding cellular domains by simple robots., , and . Theor. Comput. Sci., (2015)A Fire Fighter's Problem., , and . SoCG, volume 34 of LIPIcs, page 768-780. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Evolutionary Learning of Fire Fighting Strategies., and . Artificial Evolution, volume 10764 of Lecture Notes in Computer Science, page 162-175. Springer, (2017)Optimal Online Escape Path Against a Certificate., and . SWAT, volume 53 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Robotics.. Encyclopedia of Algorithms, (2016)Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface., , , , , and . CoRR, (2022)Searching for an Axis-Parallel Shoreline.. COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 369-384. Springer, (2010)A Fast Algorithm for Approximating the Detour of a Polygonal Chain., , , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 321-332. Springer, (2001)