| 2008 |
|---|
| 16 | EE | George Karakostas,
Euripides Markou:
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.
LATIN 2008: 350-361 |
| 15 | EE | Ralf Klasing,
Euripides Markou,
Tomasz Radzik,
Fabiano Sarracco:
Approximation bounds for Black Hole Search problems.
Networks 52(4): 216-226 (2008) |
| 14 | EE | Ralf Klasing,
Euripides Markou,
Andrzej Pelc:
Gathering asynchronous oblivious mobile robots in a ring.
Theor. Comput. Sci. 390(1): 27-39 (2008) |
| 2007 |
|---|
| 13 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Searching for a Black Hole in Synchronous Tree Networks.
Combinatorics, Probability & Computing 16(4): 595-619 (2007) |
| 12 | EE | Christodoulos Fragoudakis,
Euripides Markou,
Stathis Zachos:
Maximizing the guarded boundary of an Art Gallery is APX-complete.
Comput. Geom. 38(3): 170-180 (2007) |
| 11 | EE | Ralf Klasing,
Euripides Markou,
Tomasz Radzik,
Fabiano Sarracco:
Hardness and approximation results for Black Hole Search in arbitrary networks.
Theor. Comput. Sci. 384(2-3): 201-221 (2007) |
| 10 | EE | Euripides Markou,
Andrzej Pelc:
Efficient Exploration of Faulty Trees.
Theory Comput. Syst. 40(3): 225-247 (2007) |
| 2006 |
|---|
| 9 | EE | Ioannis Z. Emiris,
Euripides Markou,
Aris Pagourtzis:
Distributed Routing in Tree Networks with Few Landmarks.
CAAN 2006: 45-57 |
| 8 | EE | Ralf Klasing,
Euripides Markou,
Andrzej Pelc:
Gathering Asynchronous Oblivious Mobile Robots in a Ring.
ISAAC 2006: 744-753 |
| 7 | EE | Evangelos Kranakis,
Danny Krizanc,
Euripides Markou:
Mobile Agent Rendezvous in a Synchronous Torus.
LATIN 2006: 653-664 |
| 6 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Complexity of Searching for a Black Hole.
Fundam. Inform. 71(2-3): 229-242 (2006) |
| 2005 |
|---|
| 5 | EE | Ralf Klasing,
Euripides Markou,
Tomasz Radzik,
Fabiano Sarracco:
Approximation Bounds for Black Hole Search Problems.
OPODIS 2005: 261-274 |
| 4 | EE | Christodoulos Fragoudakis,
Euripides Markou,
Stathis Zachos:
How to Place Efficiently Guards and Paintings in an Art Gallery.
Panhellenic Conference on Informatics 2005: 145-154 |
| 3 | EE | Ralf Klasing,
Euripides Markou,
Tomasz Radzik,
Fabiano Sarracco:
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.
SIROCCO 2005: 200-215 |
| 2004 |
|---|
| 2 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Searching for a Black Hole in Tree Networks.
OPODIS 2004: 67-80 |
| 2003 |
|---|
| 1 | EE | Euripides Markou,
Stathis Zachos,
Christodoulos Fragoudakis:
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete.
CIAC 2003: 24-35 |
