Δημοσιεύσεις

Βιβλία

- E. Markou, W. Shi, Dangerous Graphs. Chapter in: P. Flocchini, G. Prencipe, N. Santoro (eds) Distributed Computing by Mobile Entities, LNCS 11340, Springer, 2019, pp. 455-515.

- Αλγοριθμική Θεωρία Κατανεμημένων Υπολογισμών. Ευριπίδης Μάρκου, Ευάγγελος Κρανάκης, Άρης Παγουρτζής και Danny Krizanc. [ηλεκτρ. βιβλ.] Αθήνα:Σύνδεσμος Ελληνικών Ακαδημαϊκών Βιβλιοθηκών. ISBN: 978-960-603-504-3.

- The Mobile Agent Rendezvous Problem in the Ring. Evangelos Kranakis, Danny Krizanc, and Euripides Markou. Morgan and Claypool Publishers. Synthesis Lectures on Distributed Computing Theory. xvi + 106 pages, 2010. ISBN: 9781608451364 Paperback.

Διδακτορικό

Ε. Μάρκου, Προσεγγιστικοί αλγόριθμοι για την κάλυψη πολυγωνικών περιοχών, Διδακτορική διατριβή, Εθνικό Μετσόβιο Πολυτεχνείο, 2003. pdf

Περιοδικά

  • S. Das, R. Focardi, F. Luccio, E. Markou, M. Squarcina, Gathering of Robots in a Ring with Mobile Faults, Theoretical Computer Science, 764 (2019), pp. 42-60.

  • E. Markou, N. Nisse, S. Perennes, Exclusive Graph Searching vs. Pathwidth, Information and Computation, 252 (2017), pp. 243-260.

  • E. Bampas, N. Leonardos, E. Markou, A. Pagourtzis, M. Petrolia, Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host, Theoretical Computer Science, 608 (2015), pp. 231-254.

  • G. Karakostas, E. Markou, Emergency connectivity in ad-hoc networks with selfish nodes, Algorithmica, 68 (2) (2014), pp. 358-389. pdf

  • J. Chalopin, S. Das, A. Labourel, E. Markou, Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings, Theoretical Computer Science, 509 (2013), pp. 70-85. pdf

  • E. Markou, Identifying Hostile Nodes in Networks Using Mobile Agents, Bulletin of the European Association for Theoretical Computer Science, 108 (2012), pp. 93-129.

  • E. Kranakis, D. Krizanc, E. Markou, Deterministic Symmetric Rendezvous with Tokens in a Synchronous Torus, Discrete Applied Mathematics, 159 (2011), pp. 896-923. pdf

  • R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, 390 (2008), pp. 27-39. pdf

  • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Networks, 52 (4) (2008), pp. 216-226. pdf

  • C. Fragoudakis, E. Markou, S. Zachos, Maximizing the Guarded Boundary of an Art Gallery is APX-complete, Computational Geometry: Theory and Applications, 38 (3) (2007), pp. 170-180. pdf

  • J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in synchronous tree networks, Combinatorics, Probability & Computing, 16 (4) (2007), pp. 595-619. pdf

  • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black hole search in arbitrary networks, Theoretical Computer Science, 384 (2-3) (2007), pp. 201-221. pdf

  • E. Markou, A. Pelc, Efficient exploration of faulty trees, Theory of Computing Systems, 40 (2007), pp. 225-247. pdf

  • J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae, 71 (2-3) 2006, 229-242. pdf

Συνέδρια

  • S. Das, N. Giachoudis, F. Luccio, E. Markou, Broadcasting with mobile agents in dynamic networks, Proc. 24th International Conference on Principles of Distributed Systems (OPODIS 2020), December 2020, Strasbourg, France (virtual conference), LIPIcs, pp. 24:1-24:16.

  • N. Giachoudis, M. Kokkou, E. Markou, Black Virus Decontamination of synchronous ring networks by initially scattered mobile agents, Proc. 27th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2020), June 2020, Paderborn, Germany, LNCS 12156, pp. 220-236.

  • S. Das, N. Giachoudis, F. Luccio, E. Markou, Gathering of Robots in a Grid with Mobile Faults, Proc. 45th International Conference on Current Trends in Theory and Practice of Computer Science, Foundations of Computer Science Track (SOFSEM’ 2019), January 2019, Novy Smokovec, Slovakia, LNCS 11376, pp. 164-178.

  • J. Czyzowicz, M. Godon, E. Kranakis, A. Labourel, E. Markou, Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots, Proc. 44th International Conference on Current Trends in Theory and Practice of Computer Science, Foundations of Computer Science Track (SOFSEM’ 2018), January 2018, Krems an der Donau, Austria, pp. 381-395.

  • E. Kranakis, D. Krizanc, E. Markou, A. Pagourtzis, F. Ramirez, Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs, Proc. 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Foundations of Computer Science Track (SOFSEM’ 2017), January 2017, Limerick, Ireland, LNCS 10139, pp. 79-90.

  • S. Das, R. Focardi, F. Luccio, E. Markou, D. Moro, M. Squarcina, Gathering of Robots in a Ring with Mobile Faults, Proc. 17th Italian Conference on Theoretical Computer Science (ICTCS' 2016), September 2016, Lecce, Italy, pp. 122-135.

  • S. Das, F. Luccio, E. Markou, Mobile Agents Rendezvous in spite of a Malicious Agent, Proc. 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS’ 2015), September 2015, Patras, Greece, LNCS 9536, pp. 211-224.

  • E. Bampas, N. Leonardos, E. Markou, A. Pagourtzis, M. Petrolia, Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host, Proc. 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO’ 2014), July 2014, Hida Takayama, Japan, LNCS 8576, pp. 355-370. pdf

  • E. Markou, M. Paquette, Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata, Proc. 16th International Conference on Principles of Distributed Systems (OPODIS' 12), December 2012, Rome, Italy, LNCS 7702, pp. 239-253. pdf

  • S. Dobrev, R. Královič, E. Markou, Online Graph Exploration with Advice, Proc. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO' 12), June 2012, Reykjavík, Iceland, LNCS 7355, pp. 267-278. pdf

  • J. Chalopin, S. Das, A. Labourel, E. Markou, Black Hole Search with Finite Automata Scattered in a Synchronous Torus, Proc. 25th International Symposium on Distributed Computing (DISC' 11), September 2011, Rome, Italy, LNCS 6950, pp. 432-446. pdf

  • J. Chalopin, S. Das, A. Labourel, E. Markou, Tight Bounds for Scattered Black Hole Search in a Ring, Proc. 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO' 11), June 2011, Gdansk, Poland, LNCS 6796, pp. 186-197. pdf

  • G. Karakostas, E. Markou, Emergency connectivity in ad-hoc networks with selfish nodes, Proc. 8th Latin American Theoretical Informatics Symposium (LATIN' 08), April 2008, Rio de Janeiro, Brazil, LNCS 4957, pp. 350-361. pdf

  • R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Proc. 17th International Symposium on Algorithms and Computation (ISAAC' 06), December 2006, Kolkata, India, LNCS 4288, pp. 744-753.pdf

  • I. Emiris, E. Markou, A. Pagourtzis, Distributed Routing in Trees Networks with Few Landmarks, Proc. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN' 06), July 2006, Chester, United Kingdom, LNCS 4235, pp. 45-57.pdf

  • I. Emiris, C. Fragoudakis, E. Markou, Maximizing the Guarded Interior of an Art Gallery, Proc. 22nd European Workshop on Computational Geometry, March 2006, Delphi, Greece, pp. 165-168.pdf

  • E. Kranakis, D. Krizanc, E. Markou, Mobile agent rendezvous in a synchronous torus, Proc. 7th Latin American Theoretical Informatics Symposium (LATIN' 06), March 2006, Valdivia, Chile, LNCS 3887, pp. 653-664.pdf

  • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Proc. 9th International Conference on Principles of Distributed Systems (OPODIS' 05), December 2005, Pisa, Italy, LNCS 3974, pp. 261-274.pdf

  • C. Fragoudakis, E. Markou, S. Zachos, How to place efficiently guards and paintings in an art gallery, Proc. 10th Panhellenic Conference on Informatics (PCI' 05), November 2005, Volos, Greece, LNCS 3746, pp. 145-154.pdf

  • R. Klasing,E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black - hole search in arbitrary graphs, Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO' 05), May 2005, Le Mont Saint-Michel, France, LNCS 3499, pp. 200-215.pdf

  • J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in tree networks, Proc. 8th International Conference on Principles of Distributed Systems (OPODIS' 04), December 2004, Grenoble, France, LNCS 3544, pp. 67-80.pdf

  • E. Markou, A. Pelc, Efficient exploration of faulty trees, Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA' 04), July 2004, Ballina Beach Resort, New South Wales, Australia, 52-63.pdf

  • E. Markou, S. Zachos, C. Fragoudakis, Budgeted Coverage of a Maximum Part of a Polygonal Area, 1st Balkan Conference on Informatics (BCI' 03) Thessaloniki, Greece 2003, pp. 174-182.pdf

  • E. Markou, S. Zachos, C. Fragoudakis, Maximizing the Guarded Boundary of an Art Gallery is APX-complete, 5th Italian Conference on Algorithms and Complexity (CIAC' 03) Rome, Italy 2003, LNCS 2653, pp. 24 - 35.pdf

  • E. Markou, C. Fragoudakis, S. Zachos, Approximating Visibility Problems within a constant, 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE' 02) Rome, Italy 2002, 91-103.pdf

  • C. Nomikos, S. Zachos, E. Markou, Coloring Paths In A Tree, 6th Panhellenic Conference on Informatics (PCI' 97) Athens, Greece 1997, 578 - 588 (in greek).pdf

Τεχνικά δελτία

    • G. Karakostas, E. Markou, Connectivity in ad-hoc networks with selfish nodes, Technical Report CAS-07-02-GK, July 2007, McMaster University, Hamilton, Canada.
    • R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Technical Report RR-1422-07, January 2007, LaBRI, Bordeaux, France. pdf
    • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Technical Report RR-1407-06, July 2006, LaBRI, Bordeaux, France. pdf
    • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black hole search in arbitrary graphs, Technical Report 5659, July 2005, INRIA, Sophia-Antipolis, France. pdf

    Σε προετοιμασία

    • Gathering of robots in a grid with mobile faults, S. Das, N. Giachoudis, F. Luccio, E. Markou.

    • Sustainable Exploration of a Tree, E. Bampas, J. Chalopin, J. Czyzowicz, S. Das, D. Dereniowski, C. Karousatou, A. Labourel, E. Markou.

    • Exploration with deadlines, S. Das, N. Giachoudis, F. Luccio, E. Markou

    Αναφορές

    Πάνω από 800 αναφορές.

    Δείτε επίσης την σχετική ιστοσελίδα με αναφορές από το Google Scholar.

    Ενημέρωση: 12-Οκτ-2023                                                                                                                            email: e<lastname>@dib.uth.gr