| 2025 | STACS | Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. | Stphane Devismes, David Ilcinkas, Colette Johnen, Frdric Mazoit |
| 2024 | PODC | Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. | Colette Johnen, Stphane Devismes, Frdric Mazoit, David Ilcinkas |
| 2024 | TACAS | A State-of-the-Art Karp-Miller Algorithm Certified in Coq. | Thibault Hilaire, David Ilcinkas, Jrme Leroux |
| 2020 | ATMOS | Framing Algorithms for Approximate Multicriteria Shortest Paths. | Nicolas Hanusse, David Ilcinkas, Antonin Lentz |
| 2019 | ICDCN | Silent self-stabilizing scheme for spanning-tree-like constructions. | Stphane Devismes, David Ilcinkas, Colette Johnen |
| 2016 | LATIN | On Mobile Agent Verifiable Problems. | Evangelos Bampas, David Ilcinkas |
| 2016 | OPODIS | Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. | Stphane Devismes, David Ilcinkas, Colette Johnen |
| 2016 | SIROCCO | Linear Search by a Pair of Distinct-Speed Robots. | Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak |
| 2015 | Algosensors | Beachcombing on Strips and Islands. | Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing |
| 2015 | PODC | Brief Announcement: Routing the Internet with Very Few Entries. | Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas |
| 2014 | SIROCCO | Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. | David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade |
| 2014 | SSS | Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. | Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen |
| 2014 | WG | Distributedly Testing Cycle-Freeness. | Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu |
| 2013 | SIROCCO | Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. | David Ilcinkas, Ahmed Mouhamadou Wade |
| 2011 | OPODIS | The Impact of Edge Deletions on the Number of Errors in Networks. | Christian Glacet, Nicolas Hanusse, David Ilcinkas |
| 2011 | OPODIS | On the Power of Waiting When Exploring Public Transportation Systems. | David Ilcinkas, Ahmed Mouhamadou Wade |
| 2010 | PODC | 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 |
| 2010 | SIROCCO | Asynchronous Deterministic Rendezvous in Bounded Terrains. | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc |
| 2010 | WG | Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas |
| 2009 | ICALP | Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski |
| 2009 | SIROCCO | More Efficient Periodic Traversal in Anonymous Undirected Graphs. | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung |
| 2008 | SIROCCO | Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
| 2008 | SIROCCO | Fast Radio Broadcasting with Advice. | David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc |
| 2007 | ICALP | Distributed Computing with Advice: Information Sensitivity of Graph Coloring. | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
| 2007 | OPODIS | Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
| 2007 | OPODIS | The Cost of Monotonicity in Distributed Graph Searching. | David Ilcinkas, Nicolas Nisse, David Soguet |
| 2006 | MFCS | Tree Exploration with an Oracle. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2006 | PODC | Oracle size: a new measure of difficulty for communication tasks. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2006 | SIROCCO | Setting Port Numbers for Fast Graph Exploration. | David Ilcinkas |
| 2005 | ICALP | Label-Guided Graph Exploration by a Finite Automaton. | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
| 2005 | SIROCCO | Space Lower Bounds for Graph Exploration via Reduced Automata. | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sbastien Tixeuil |
| 2004 | MFCS | Graph Exploration by a Finite Automaton. | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
| 2004 | STACS | Digraphs Exploration with Little Memory. | Pierre Fraigniaud, David Ilcinkas |