( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A local strategy for cleaning expanding cellular domains by simple robots.

, , и . Theor. Comput. Sci., (2015)

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.

Elmar Langetepe

Suliman Ahmed Elmarabet

Erwin Elmar

Gerd Langetepe

Timo Langetepe

 

Другие публикации лиц с тем же именем

The weighted farthest color Voronoi diagram on trees and graphs., , , и . Comput. Geom., 27 (1): 13-26 (2004)The Pledge Algorithm Reconsidered under Errors in Sensors and Motion., и . WAOA, том 2909 из Lecture Notes in Computer Science, стр. 165-178. Springer, (2003)A local strategy for cleaning expanding cellular domains by simple robots., , и . Theor. Comput. Sci., (2015)Evolutionary Learning of Fire Fighting Strategies., и . Artificial Evolution, том 10764 из Lecture Notes in Computer Science, стр. 162-175. Springer, (2017)A Fire Fighter's Problem., , и . SoCG, том 34 из LIPIcs, стр. 768-780. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)How to Play Hot and Cold on a Line., , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 449-460. Springer, (2017)Competitive Online Approximation of the Optimal Search Ratio., , , , и . SIAM J. Comput., 38 (3): 881-898 (2008)Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains., , , и . SCG, стр. 287-288. ACM, (2011)Geometric Firefighting in the Half-Plane., , , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 481-494. Springer, (2019)A Fast Algorithm for Approximating the Detour of a Polygonal Chain., , , и . ESA, том 2161 из Lecture Notes in Computer Science, стр. 321-332. Springer, (2001)