( en | de | ru )

 

Disambiguation of "Georgiou, Konstantinos"

Author of the publication

copydeleteadd this publication to your clipboard
The Beachcombers' Problem: Walking and Searching with Mobile Robots.

, , , , and . SIROCCO, volume 8576 of Lecture Notes in Computer Science, page 23-36. Springer, (2014)

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.

Evangelos Georgiou

Yiannis Georgiou

Loukas Georgiou

Andros Georgiou

Christina Georgiou

 

Other publications of authors with the same name

Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection., , and . ACM Trans. Algorithms, 13 (1): 2:1-2:27 (2016)A versatile system for asynchronous iterations: From multithreaded simulations to Grid experiments., , and . PARCO, volume 19 of Advances in Parallel Computing, page 238-245. IOS Press, (2009)Search-and-Fetch with 2 Robots on a Disk - Wireless and Face-to-Face Communication Models., , and . ICORES, page 15-26. SciTePress, (2017)Symmetric Rendezvous with Advice: How to Rendezvous in a Disk., , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 121-133. Springer, (2018)Classifying the Main Technology Clusters and Assignees of Home Automation Networks Using Patent Classifications., , , and . Comput., 12 (10): 211 (September 2023)Data-Oriented Software Development: The Industrial Landscape through Patent Analysis., , , , and . Inf., 14 (1): 4 (January 2023)Optimal Sherali-Adams Gaps from Pairwise Independence., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 125-139. Springer, (2009)God Save the Queen., , , , , , , and . FUN, volume 100 of LIPIcs, page 16:1-16:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lower Bounds for Shoreline Searching With 2 or More Robots., , , and . OPODIS, volume 153 of LIPIcs, page 26:1-26:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract)., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 194-205. Springer, (2014)