Ilcinkas, David; Wade, Ahmed M. Exploration of carrier-based time-varying networks: the power of waiting. (English) Zbl 1455.68141 Theor. Comput. Sci. 841, 50-61 (2020). MSC: 68R10 68Q25 90B10 PDFBibTeX XMLCite \textit{D. Ilcinkas} and \textit{A. M. Wade}, Theor. Comput. Sci. 841, 50--61 (2020; Zbl 1455.68141) Full Text: DOI HAL
Bampas, Evangelos; Czyzowicz, Jurek; Ilcinkas, David; Klasing, Ralf Beachcombing on strips and islands. (English) Zbl 1437.68179 Theor. Comput. Sci. 806, 236-255 (2020). MSC: 68U05 68T40 68W25 68W27 PDFBibTeX XMLCite \textit{E. Bampas} et al., Theor. Comput. Sci. 806, 236--255 (2020; Zbl 1437.68179) Full Text: DOI HAL
Bampas, Evangelos; Blin, Lélia; Czyzowicz, Jurek; Ilcinkas, David; Labourel, Arnaud; Potop-Butucaru, Maria; Tixeuil, Sébastien On asynchronous rendezvous in general graphs. (English) Zbl 1407.68345 Theor. Comput. Sci. 753, 80-90 (2019). MSC: 68R10 05C57 68T42 68W15 PDFBibTeX XMLCite \textit{E. Bampas} et al., Theor. Comput. Sci. 753, 80--90 (2019; Zbl 1407.68345) Full Text: DOI HAL
Glacet, Christian; Hanusse, Nicolas; Ilcinkas, David The impact of dynamic events on the number of errors in networks. (English) Zbl 1338.68029 Theor. Comput. Sci. 627, 1-12 (2016). MSC: 68M15 68R10 PDFBibTeX XMLCite \textit{C. Glacet} et al., Theor. Comput. Sci. 627, 1--12 (2016; Zbl 1338.68029) Full Text: DOI
Czyzowicz, Jurek; Dobrev, Stefan; Gąsieniec, Leszek; Ilcinkas, David; Jansson, Jesper; Klasing, Ralf; Lignos, Ioannis; Martin, Russell; Sadakane, Kunihiko; Sung, Wing-Kin More efficient periodic traversal in anonymous undirected graphs. (English) Zbl 1246.68169 Theor. Comput. Sci. 444, 60-76 (2012). MSC: 68R10 68P05 68Q25 68T42 05C85 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 444, 60--76 (2012; Zbl 1246.68169) Full Text: DOI
Czyzowicz, Jurek; Ilcinkas, David; Labourel, Arnaud; Pelc, Andrzej Asynchronous deterministic rendezvous in bounded terrains. (English) Zbl 1227.68107 Theor. Comput. Sci. 412, No. 50, 6926-6937 (2011). MSC: 68T40 68T42 68U05 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 412, No. 50, 6926--6937 (2011; Zbl 1227.68107) Full Text: DOI
Flocchini, Paola; Ilcinkas, David; Pelc, Andrzej; Santoro, Nicola Remembering without memory: tree exploration by asynchronous oblivious robots. (English) Zbl 1191.68712 Theor. Comput. Sci. 411, No. 14-15, 1583-1598 (2010). MSC: 68T40 68T42 PDFBibTeX XMLCite \textit{P. Flocchini} et al., Theor. Comput. Sci. 411, No. 14--15, 1583--1598 (2010; Zbl 1191.68712) Full Text: DOI HAL
Ilcinkas, David; Kowalski, Dariusz R.; Pelc, Andrzej Fast radio broadcasting with advice. (English) Zbl 1191.68040 Theor. Comput. Sci. 411, No. 14-15, 1544-1557 (2010). MSC: 68M10 PDFBibTeX XMLCite \textit{D. Ilcinkas} et al., Theor. Comput. Sci. 411, No. 14--15, 1544--1557 (2010; Zbl 1191.68040) Full Text: DOI HAL
Ilcinkas, David Setting port numbers for fast graph exploration. (English) Zbl 1147.68042 Theor. Comput. Sci. 401, No. 1-3, 236-242 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Ilcinkas}, Theor. Comput. Sci. 401, No. 1--3, 236--242 (2008; Zbl 1147.68042) Full Text: DOI HAL
Fraigniaud, Pierre; Ilcinkas, David; Peer, Guy; Pelc, Andrzej; Peleg, David Graph exploration by a finite automaton. (English) Zbl 1081.68045 Theor. Comput. Sci. 345, No. 2-3, 331-344 (2005). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Theor. Comput. Sci. 345, No. 2--3, 331--344 (2005; Zbl 1081.68045) Full Text: DOI HAL