default search action
Euripides Markou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c22]Shantanu Das
, Nikos Giachoudis
Broadcasting with Mobile Agents in Dynamic Networks. OPODIS 2020: 24:1-24:16 - [c21]Nikos Giachoudis
Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents. SIROCCO 2020: 220-236
2010 – 2019
- 2019
- [j14]Shantanu Das, Riccardo Focardi
Gathering of robots in a ring with mobile faults. Theor. Comput. Sci. 764: 42-60 (2019) - [c20]Shantanu Das, Nikos Giachoudis
Gathering of Robots in a Grid with Mobile Faults. SOFSEM 2019: 164-178 - [p1]Euripides Markou, Wei Shi
Dangerous Graphs. Distributed Computing by Mobile Entities 2019: 455-515 - 2018
- [c19]Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2018: 381-395 - 2017
- [j13]Euripides Markou, Nicolas Nisse, Stéphane Pérennes:
Exclusive graph searching vs. pathwidth. Inf. Comput. 252: 243-260 (2017) - [c18]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis
Stathis Zachos at 70! CIAC 2017: 469-484 - [c17]Evangelos Kranakis
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. SOFSEM 2017: 79-90 - [i4]Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou:
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. CoRR abs/1710.00775 (2017) - 2016
- [c16]Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, Marco Squarcina:
Gathering of Robots in a Ring with Mobile Faults. ICTCS 2016: 122-135 - 2015
- [j12]Evangelos Bampas
Improved periodic data retrieval in asynchronous rings with a faulty host. Theor. Comput. Sci. 608: 231-254 (2015) - [c15]Shantanu Das, Flaminia L. Luccio
Mobile Agents Rendezvous in Spite of a Malicious Agent. ALGOSENSORS 2015: 211-224 - 2014
- [j11]George Karakostas
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes. Algorithmica 68(2): 358-389 (2014) - [c14]Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. SIROCCO 2014: 355-370 - [i3]Flaminia L. Luccio, Euripides Markou:
Mobile Agents Rendezvous in spite of a Malicious Agent. CoRR abs/1410.4772 (2014) - 2013
- [j10]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509: 70-85 (2013) - 2012
- [j9]Euripides Markou:
Identifying Hostile Nodes in Networks Using Mobile Agents. Bull. EATCS 108: 93-129 (2012) - [c13]Euripides Markou, Michel Paquette:
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata. OPODIS 2012: 239-253 - [c12]Stefan Dobrev, Rastislav Královic
Online Graph Exploration with Advice. SIROCCO 2012: 267-278 - 2011
- [j8]Evangelos Kranakis
Deterministic symmetric rendezvous with tokens in a synchronous torus. Discret. Appl. Math. 159(9): 896-923 (2011) - [c11]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197 - [c10]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446 - [i2]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings. CoRR abs/1104.5076 (2011) - [i1]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. CoRR abs/1106.6037 (2011) - 2010
- [b1]Evangelos Kranakis, Danny Krizanc, Euripides Markou:
The Mobile Agent Rendezvous Problem in the Ring. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2010, ISBN 978-3-031-00871-9
2000 – 2009
- 2008
- [j7]Ralf Klasing, Euripides Markou, Tomasz Radzik
Approximation bounds for Black Hole Search problems. Networks 52(4): 216-226 (2008) - [j6]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1): 27-39 (2008) - [c9]George Karakostas
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. LATIN 2008: 350-361 - 2007
- [j5]Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38(3): 170-180 (2007) - [j4]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Searching for a Black Hole in Synchronous Tree Networks. Comb. Probab. Comput. 16(4): 595-619 (2007) - [j3]Euripides Markou, Andrzej Pelc:
Efficient Exploration of Faulty Trees. Theory Comput. Syst. 40(3): 225-247 (2007) - [j2]Ralf Klasing, Euripides Markou, Tomasz Radzik
Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384(2-3): 201-221 (2007) - 2006
- [j1]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Complexity of Searching for a Black Hole. Fundam. Informaticae 71(2-3): 229-242 (2006) - [c8]Ioannis Z. Emiris
Distributed Routing in Tree Networks with Few Landmarks. CAAN 2006: 45-57 - [c7]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering Asynchronous Oblivious Mobile Robots in a Ring. ISAAC 2006: 744-753 - [c6]Evangelos Kranakis
Mobile Agent Rendezvous in a Synchronous Torus. LATIN 2006: 653-664 - 2005
- [c5]Ralf Klasing, Euripides Markou, Tomasz Radzik
Approximation Bounds for Black Hole Search Problems. OPODIS 2005: 261-274 - [c4]Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
How to Place Efficiently Guards and Paintings in an Art Gallery. Panhellenic Conference on Informatics 2005: 145-154 - [c3]Ralf Klasing, Euripides Markou, Tomasz Radzik
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO 2005: 200-215 - 2004
- [c2]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Searching for a Black Hole in Tree Networks. OPODIS 2004: 67-80 - 2003
- [c1]Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis:
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. CIAC 2003: 24-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: