Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. - José R. Correa; Laurent Feuilloley; José A. Soto (LATIN, 2014)

Brief Announcement: Average Complexity for the LOCAL Model. - Laurent Feuilloley (PODC, 2015)

Randomized Local Network Computing. - Laurent Feuilloley; Pierre Fraigniaud (SPAA, 2015)

Locally Optimal Load Balancing. - Laurent Feuilloley; Juho Hirvonen; Jukka Suomela (DISC, 2015)

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. - José Correa 001; Laurent Feuilloley; Pablo Pérez-Lantero; José A. Soto (Discret. Comput. Geom., 2015)

Survey of Distributed Decision. - Laurent Feuilloley; Pierre Fraigniaud (Bull. EATCS, 2016)

Local Verification of Global Proofs. - Laurent Feuilloley; Juho Hirvonen (DISC, 2018)

Local certification in distributed computing: error-sensitivity, uniformity, redundancy, and interactivity. (Certification locale en calcul distribué : sensibilité aux erreurs, uniformité, redondance et interactivité). - Laurent Feuilloley (2018)

Lower bounds for text indexing with mismatches and differences. - Vincent Cohen-Addad; Laurent Feuilloley; Tatiana Starikovskaya (SODA, 2019)

Brief Announcement: Memory Lower Bounds for Self-Stabilization. - Lélia Blin; Laurent Feuilloley; Gabriel Le Bouder (DISC, 2019)

Memory Lower Bounds for Self-Stabilization. - Lélia Blin; Laurent Feuilloley; Gabriel Le Bouder (CoRR, 2019)

Note on distributed certification of minimum spanning trees. - Laurent Feuilloley (CoRR, 2019)

Silent MST Approximation for Tiny Memory. - Lélia Blin; Swan Dubois; Laurent Feuilloley (SSS, 2020)

Bibliography of distributed approximation on structurally sparse graph classes. - Laurent Feuilloley (CoRR, 2020)

How long it takes for an ordinary node with an ordinary id to output? - Laurent Feuilloley (Theor. Comput. Sci., 2020)

Distributed Recoloring of Interval and Chordal Graphs. - Nicolas Bousquet 001; Laurent Feuilloley; Marc Heinrich; Mikaël Rabie (OPODIS, 2021)

Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (DISC, 2021)

Compact Distributed Certification of Planar Graphs. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Algorithmica, 2021)

Local certification of MSO properties for bounded treedepth graphs. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (CoRR, 2021)

Classifying grounded intersection graphs via ordered forbidden patterns. - Laurent Feuilloley; Michel Habib (CoRR, 2021)

Redundancy in distributed proofs. - Laurent Feuilloley; Pierre Fraigniaud; Juho Hirvonen; Ami Paz; Mor Perry (Distributed Comput., 2021)

Introduction to local certification. - Laurent Feuilloley (Discret. Math. Theor. Comput. Sci., 2021)

Graph Classes and Forbidden Patterns on Three Vertices. - Laurent Feuilloley; Michel Habib (SIAM J. Discret. Math., 2021)

A hierarchy of local decision. - Laurent Feuilloley; Pierre Fraigniaud; Juho Hirvonen (Theor. Comput. Sci., 2021)

Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. - Laurent Feuilloley; Pierre Fraigniaud (ACM Trans. Parallel Comput., 2021)

What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. - Laurent Feuilloley; Nicolas Bousquet 001; Théo Pierron (PODC, 2022)

What can be certified compactly? - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (CoRR, 2022)

Short and local transformations between (Δ+1)-colorings. - Nicolas Bousquet 001; Laurent Feuilloley; Marc Heinrich; Mikaël Rabie (CoRR, 2022)

Error-sensitive proof-labeling schemes. - Laurent Feuilloley; Pierre Fraigniaud (J. Parallel Distributed Comput., 2022)

Pattern detection in ordered graphs. - Guillaume Ducoffe; Laurent Feuilloley; Michel Habib; François Pitois (CoRR, 2023)

Local certification of graphs with bounded genus. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Discret. Appl. Math., 2023)

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. - Lélia Blin; Laurent Feuilloley; Gabriel Le Bouder (Discret. Math. Theor. Comput. Sci., 2023)

A lower bound for constant-size local certification. - Virginia Ardévol Martínez; Marco Caoduro; Laurent Feuilloley; Jonathan Narboni; Pegah Pournajafi; Jean-Florent Raymond (Theor. Comput. Sci., 2023)

The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC. - Laurent Feuilloley; Tijn de Vos (SIGACT News, 2023)

How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (OPODIS, 2024)

Brief Announcement: Global certification via perfect hashing. - Nicolas Bousquet 001; Laurent Feuilloley; Sébastien Zeitoun (PODC, 2024)

Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. - Nicolas Bousquet 001; Laurent Feuilloley; Sébastien Zeitoun (STACS, 2024)

Global certification via perfect hashing. - Nicolas Bousquet 001; Laurent Feuilloley; Sébastien Zeitoun (CoRR, 2024)

Local certification of forbidden subgraphs. - Nicolas Bousquet 001; Linda Cook; Laurent Feuilloley; Théo Pierron; Sébastien Zeitoun (CoRR, 2024)

Renaming in distributed certification. - Nicolas Bousquet 001; Louis Esperet; Laurent Feuilloley; Sébastien Zeitoun (CoRR, 2024)

Local certification of graph decompositions and applications to minor-free classes. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (J. Parallel Distributed Comput., 2024)

The Secretary Problem with Independent Sampling. - José Correa 001; Andrés Cristi; Laurent Feuilloley; Tim Oosterwijk; Alexandros Tsigonias-Dimitriadis (Manag. Sci., 2025)

When should you wait before updating? - Toward a robustness refinement. - Swan Dubois; Laurent Feuilloley; Franck Petit; Mikaël Rabie (Theor. Comput. Sci., 2025)

Decreasing verification radius in local certification. - Laurent Feuilloley; Jan Janousek; Jan Matyás Kristan; Josef Erik Sedlácek (Theor. Comput. Sci., 2025)

Complexity landscape for local certification. - Nicolas Bousquet 001; Laurent Feuilloley; Sébastien Zeitoun (CoRR, 2025)