Search the dblp DataBase

Publications of Author

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