( 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 . 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. 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

Christina Georgiou

Andros Georgiou

 

Other publications of authors with the same name

Evacuation from a Disc in the Presence of a Faulty Robot., , , , , , and . SIROCCO, volume 10641 of Lecture Notes in Computer Science, page 158-173. Springer, (2017)Stable Marriage with General Preferences - Extended Abstract., , and . SAGT, volume 8768 of Lecture Notes in Computer Science, page 25-36. Springer, (2014)Complexity of Barrier Coverage with Relocatable Sensors in the Plane., , , , , , , , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 170-182. Springer, (2013)Social Exchange Networks with Distant Bargaining., , , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 29-40. Springer, (2013)On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities., , and . FSTTCS, volume 4 of LIPIcs, page 203-214. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Searching with Advice: Robot Fence-Jumping., , and . J. Inf. Process., (2017)Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models., , and . Discret. Math. Theor. Comput. Sci., (2019)The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs., , and . Electron. Colloquium Comput. Complex., (2010)Time-energy tradeoffs for evacuation by two robots in the wireless model., , , , , , , , and . Theor. Comput. Sci., (2021)Evacuating two robots from multiple unknown exits in a circle., , , , and . ICDCN, page 28:1-28:8. ACM, (2016)