Digraphs Exploration with Little Memory. - Pierre Fraigniaud; David Ilcinkas (STACS, 2004)

Space Lower Bounds for Graph Exploration via Reduced Automata. - Pierre Fraigniaud; David Ilcinkas; Sergio Rajsbaum; Sébastien Tixeuil (SIROCCO, 2005)

Graph exploration by a finite automaton. - Pierre Fraigniaud; David Ilcinkas; Guy Peer; Andrzej Pelc; David Peleg (Theor. Comput. Sci., 2005)

The Reduced Automata Technique for Graph Exploration Space Lower Bounds. - Pierre Fraigniaud; David Ilcinkas; Sergio Rajsbaum; Sébastien Tixeuil (Essays in Memory of Shimon Even, 2006)

Tree Exploration with an Oracle. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (MFCS, 2006)

Oracle size: a new measure of difficulty for communication tasks. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (PODC, 2006)

Complexité en espace de l'exploration de graphes. - David Ilcinkas (2006)

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. - Paola Flocchini; David Ilcinkas; Nicola Santoro (DISC, 2008)

Impact of memory size on graph exploration capability. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (Discret. Appl. Math., 2008)

Impact of Asynchrony on the Behavior of Rational Selfish Agents. - David Ilcinkas; Andrzej Pelc (Fundam. Informaticae, 2008)

Tree exploration with advice. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (Inf. Comput., 2008)

Label-guided graph exploration by a finite automaton. - Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg (ACM Trans. Algorithms, 2008)

Setting port numbers for fast graph exploration. - David Ilcinkas (Theor. Comput. Sci., 2008)

Euler Tour Lock-In Problem in the Rotor-Router Model. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski (DISC, 2009)

Labeling Schemes for Tree Representation. - Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg (Algorithmica, 2009)

Distributed computing with advice: information sensitivity of graph coloring. - Pierre Fraigniaud; Cyril Gavoille; David Ilcinkas; Andrzej Pelc (Distributed Comput., 2009)

The cost of monotonicity in distributed graph searching. - David Ilcinkas; Nicolas Nisse; David Soguet (Distributed Comput., 2009)

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? - Nicolas Hanusse; David Ilcinkas; Adrian Kosowski; Nicolas Nisse (PODC, 2010)

Optimal Exploration of Terrains with Obstacles. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (SWAT, 2010)

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. - Evangelos Bampas; Jurek Czyzowicz; Leszek Gasieniec; David Ilcinkas; Arnaud Labourel (DISC, 2010)

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; David Ilcinkas (WG, 2010)

Communication algorithms with advice. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (J. Comput. Syst. Sci., 2010)

Remembering without memory: Tree exploration by asynchronous oblivious robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Theor. Comput. Sci., 2010)

Fast radio broadcasting with advice. - David Ilcinkas; Dariusz R. Kowalski; Andrzej Pelc (Theor. Comput. Sci., 2010)

The Impact of Edge Deletions on the Number of Errors in Networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas (OPODIS, 2011)

On the Power of Waiting When Exploring Public Transportation Systems. - David Ilcinkas; Ahmed Mouhamadou Wade (OPODIS, 2011)

Derandomizing random walks in undirected graphs using locally fair exploration strategies. - Colin Cooper; David Ilcinkas; Ralf Klasing; Adrian Kosowski (Distributed Comput., 2011)

How many oblivious robots can explore a line. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Inf. Process. Lett., 2011)

Asynchronous deterministic rendezvous in bounded terrains. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (Theor. Comput. Sci., 2011)

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. - Paola Flocchini; David Ilcinkas; Nicola Santoro (Algorithmica, 2012)

More efficient periodic traversal in anonymous undirected graphs. - Jurek Czyzowicz; Stefan Dobrev; Leszek Gasieniec; David Ilcinkas; Jesper Jansson 001; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2012)

On the Communication Complexity of Distributed Name-Independent Routing Schemes. - Cyril Gavoille; Christian Glacet; Nicolas Hanusse; David Ilcinkas (DISC, 2013)

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Algorithmica, 2013)

Worst-case optimal exploration of terrains with obstacles. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (Inf. Comput., 2013)

Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. - David Ilcinkas; Ralf Klasing; Ahmed Mouhamadou Wade (SIROCCO, 2014)

Distributedly Testing Cycle-Freeness. - Heger Arfaoui; Pierre Fraigniaud; David Ilcinkas; Fabien Mathieu (WG, 2014)

Brief Announcement: Routing the Internet with Very Few Entries. - Cyril Gavoille; Christian Glacet; Nicolas Hanusse; David Ilcinkas (PODC, 2015)

The impact of dynamic events on the number of errors in networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas (Theor. Comput. Sci., 2016)

Robustness of the Rotor-Router Mechanism. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski; Tomasz Radzik (Algorithmica, 2017)

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Discret. Math. Theor. Comput. Sci., 2017)

On mobile agent verifiable problems. - Evangelos Bampas; David Ilcinkas (Inf. Comput., 2018)

Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. - David Ilcinkas; Ahmed Mouhamadou Wade (Theory Comput. Syst., 2018)

Structural Information in Distributed Computing. - David Ilcinkas (2019)

Silent self-stabilizing scheme for spanning-tree-like constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (ICDCN, 2019)

Linear Search by a Pair of Distinct-Speed Robots. - Evangelos Bampas; Jurek Czyzowicz; Leszek Gasieniec; David Ilcinkas; Ralf Klasing; Tomasz Kociumaka; Dominik Pajak (Algorithmica, 2019)

Disconnected components detection and rooted shortest-path tree maintenance in networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas; Colette Johnen (J. Parallel Distributed Comput., 2019)

On asynchronous rendezvous in general graphs. - Evangelos Bampas; Lélia Blin; Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Maria Potop-Butucaru; Sébastien Tixeuil (Theor. Comput. Sci., 2019)

Oblivious Robots on Graphs: Exploration. - David Ilcinkas (Distributed Computing by Mobile Entities, 2019)

Framing Algorithms for Approximate Multicriteria Shortest Paths. - Nicolas Hanusse; David Ilcinkas; Antonin Lentz (ATMOS, 2020)

Deciding and verifying network properties locally with few output bits. - Heger Arfaoui; Pierre Fraigniaud; David Ilcinkas; Fabien Mathieu; Andrzej Pelc (Distributed Comput., 2020)

Beachcombing on strips and islands. - Evangelos Bampas; Jurek Czyzowicz; David Ilcinkas; Ralf Klasing (Theor. Comput. Sci., 2020)

Exploration of carrier-based time-varying networks: The power of waiting. - David Ilcinkas; Ahmed Mouhamadou Wade (Theor. Comput. Sci., 2020)

Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. - David Ilcinkas; Ahmed Mouhamadou Wade (Theory Comput. Syst., 2021)

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Algorithmica, 2022)

Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. - Colette Johnen; Stéphane Devismes; Frédéric Mazoit; David Ilcinkas (PODC, 2024)

A State-of-the-Art Karp-Miller Algorithm Certified in Coq. - Thibault Hilaire; David Ilcinkas; Jérôme Leroux (TACAS (1), 2024)

Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (STACS, 2025)