Publications

• Easy and Hard Problems on Bounded-Degree Boolean Automata Networks Samuel Humeau and Kévin Perrot, ACANCOS workshop, 2026.

Testing H-freeness on sparse graphs, the case of bounded expansion Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny Preprint version, 2025, accepted at STACS 2026.

• Making Graphs Irregular through Irregularising Walks Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod, Theoretical Computer Science, Volume 1067, 2026.

• Structures and equations of sourced graphs : small treewidth and disjoint paths Samuel Humeau, PhD manuscript, under the supervision of Amina Doumane and Damien Pous, ENS de Lyon, ED 512, 2025.

• On the Two Paths Theorem and the Two Disjoint Paths Problem Samuel Humeau and Damien Pous, Preprint, 2025.

• Correspondences Between Codensity and Coupling-Based Liftings, a Practical Approach Samuel Humeau, Daniela Petrisan, and Jurriaan Rot, In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 326, pp. 29:1-29:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025.

• A Finite Presentation of Graphs of Treewidth at Most Three, Amina Doumane, Samuel Humeau, and Damien Pous, In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 135:1-135:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.

• Codensity Games for Bisimilarity, Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Samuel Humeau, Clovis Eberhart, Ichiro Hasuo, p. 403-465, New Generation Computing, 2022, vol. 40, no 2, 403-465, Springer.

You can also read my different internship reports there.