Several students of our departement publish research paper during their studies. This page lists some of these publications.


  • Masahito Hasegawa (Kyoto University) and Serge Lechenne (ENS Paris-Saclay, promo 2021): "Braids, Twists, Trace and Duality in Combinatory Algebras", LICS 2024
  • Tanguy Bozec (U. Grenoble-Alpes and ENS Paris-Saclay, promo 2021), Nicolas Peltier (U. Grenoble-Alpes and CNRS), Quentin Petitjean (LMF, U. Paris-Saclay and CNRS), Mihaela Sighireanu (LMF, U. Paris-Saclay and CNRS). What is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment? IJCAR 2024
  • Martin Bromberger (Max Planck Institute for Informatics), Florent Krasnopol (ENS Paris-Saclay, promo 2021), Sibylle Möhle (Max Planck Institute for Informatics) and Christoph Weidenbach (Max Planck Institute for Informatics). First-Order Automatic Literal Model Generation IJCAR 2024


  • Josué Moreau and Léo Kulinski: Jonglerie musicale : quand les notes de musique subissent la gravité, Congrès junior multi-disciplinaire Paris-Saclay 2023
  • Basavesh Ammanaghatta Shivakumar (MPI-SP), Gilles Barthe (MPI-SP and IMDEA Software Institute), Benjamin Grégoire (Inria and Université Côte d'Azur), Vincent Laporte (Inria Nancy), Tiago Oliviera (MPI-SP), Swarn Priya (Inria and Université Côte d'Azur), Peter Schwabe (MPI-SP & Radboud University), Lucas Tabary-Maujean (ENS Paris-Saclay, promo 2021): Typing High-Speed Cryptography against Spectre v1, SP 2023 (Distinguished Paper Awards)
  • Thomas Lamiaux (promo 2020), Axel Ljungström, Anders Mörtberg: Computing Cohomology Rings in Cubical Agda. CPP 2023 (Distinguished paper award)


  • Manon Blanc (promo 2017) and Olivier Bournez. ''A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations". MCU 2022 (Best student paper award)
  • Antonin Callard (promo 2018) and Benjamin Hellouin de Menibus. The aperiodic Domino problem in higher dimension. STACS 2022
  • Hugo Jacob (promo 2019), Marcin Pilipczuk. Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. WG 2022
  • Hans L. Bodlaender, Carla Groenland, Hugo Jacob (promo 2019). List Colouring Trees in Logarithmic Space. ESA 2022
  • Hans L. Bodlaender, Carla Groenland, Hugo Jacob (promo 2019), Marcin Pilipczuk, Michal Pilipczuk. On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022
  • Hans L. Bodlaender, Carla Groenland, Hugo Jacob (promo 2019). On the Parameterized Complexity of Computing Tree-Partitions. IPEC 2022
  • Hans L. Bodlaender, Carla Groenland, Hugo Jacob (promo 2019), Lars Jaffke, Paloma T. Lima. XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022 (Best paper ward)
  • Darya Melnyk, Jukka Suomela, and Neven Villani (promo 2020). Mending Partial Solutions with Few Changes. OPODIS 2022


  • Léonard Brice (promo 2017), Jean-François Raskin and Marie Van Den Bogaard. Subgame-perfect Equilibria in Mean-payoff Games, CONCUR 2021 (Best paper award)
  • Yoan Géran, Bastien Laboureix, Corto Mascle, and Valentin D. Richard (promo 2017). Keyboards as a New Model of Computation, MFCS 2021 (Best student paper award)
  • Hugo Jacob (promo 2019), Thomas Bellitto, Oscar Defrain, and Marcin Pilipczuk. Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021
  • Pascal Vanier and Antonin Callard (promo 2018). Computational characterization of surface entropies for Z² subshifts of finite type, ICALP 2021.