A Polynomial Kernel for Multicut in Trees. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé; Anders Yeo (STACS, 2009)

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. - Nicolas Bousquet 001; Christof Löding (LATA, 2010)

Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. - Nicolas Bousquet 001; Stéphan Thomassé (Comb. Probab. Comput., 2012)

Graph coloring, communication complexity and the stubborn problem (Invited talk). - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (STACS, 2013)

Recoloring bounded treewidth graphs. - Marthe Bonamy; Nicolas Bousquet 001 (Electron. Notes Discret. Math., 2013)

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. - Marin Bougeret; Nicolas Bousquet 001; Rodolphe Giroudeau; Rémi Watrigant (SOFSEM, 2014)

A Near-Optimal Mechanism for Impartial Selection. - Nicolas Bousquet 001; Sergey Norin; Adrian Vetta (WINE, 2014)

Reconfiguring Independent Sets in Cographs. - Marthe Bonamy; Nicolas Bousquet 001 (CoRR, 2014)

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. - Marthe Bonamy; Nicolas Bousquet 001; Stéphan Thomassé (CoRR, 2014)

Brooks' theorem on powers of graphs. - Marthe Bonamy; Nicolas Bousquet 001 (Discret. Math., 2014)

Clique versus independent set. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (Eur. J. Comb., 2014)

Parameterized Domination in Circle Graphs. - Nicolas Bousquet 001; Daniel Gonçalves 001; George B. Mertzios; Christophe Paul; Ignasi Sau; Stéphan Thomassé (Theory Comput. Syst., 2014)

Coalition Games on Interaction Graphs: A Horticultural Perspective. - Nicolas Bousquet 001; Zhentao Li; Adrian Vetta (EC, 2015)

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. - Nicolas Bousquet 001; Yang Cai 001; Adrian Vetta (WINE, 2015)

Excluding cycles with a fixed number of chords. - Pierre Aboulker; Nicolas Bousquet 001 (Discret. Appl. Math., 2015)

VC-dimension and Erdős-Pósa property. - Nicolas Bousquet 001; Stéphan Thomassé (Discret. Math., 2015)

The Erdős-Hajnal conjecture for paths and antipaths. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (J. Comb. Theory B, 2015)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. - Nicolas Bousquet 001; Aurélie Lagoutte; Zhentao Li; Aline Parreau; Stéphan Thomassé (SIAM J. Discret. Math., 2015)

On the Economic Efficiency of the Combinatorial Clock Auction. - Nicolas Bousquet 001; Yang Cai 001; Christoph Hunkenschröder; Adrian Vetta (SODA, 2016)

Fast recoloring of sparse graphs. - Nicolas Bousquet 001; Guillem Perarnau (Eur. J. Comb., 2016)

The Erdös-Hajnal Conjecture for Long Holes and Antiholes. - Marthe Bonamy; Nicolas Bousquet 001; Stéphan Thomassé (SIAM J. Discret. Math., 2016)

Token Jumping in Minor-Closed Classes. - Nicolas Bousquet 001; Arnaud Mary; Aline Parreau (FCT, 2017)

Token Sliding on Chordal Graphs. - Marthe Bonamy; Nicolas Bousquet 001 (WG, 2017)

Computing Maximum Cliques in B_2 -EPG Graphs. - Nicolas Bousquet 001; Marc Heinrich (WG, 2017)

A Vizing-like theorem for union vertex-distinguishing edge coloring. - Nicolas Bousquet 001; Antoine Dailly; Éric Duchêne; Hamamache Kheddouci; Aline Parreau (Discret. Appl. Math., 2017)

Colorful paths for 3-chromatic graphs. - Stéphane Bessy; Nicolas Bousquet 001 (Discret. Math., 2017)

Functional Weibull-based models of steel fracture toughness for structural risk analysis: estimation and selection. - Nadia Pérot; Nicolas Bousquet 001 (Reliab. Eng. Syst. Saf., 2017)

EPTAS for Max Clique on Disks and Unit Balls. - Marthe Bonamy; Edouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé (FOCS, 2018)

Reconfiguration of Graphs with Connectivity Constraints. - Nicolas Bousquet 001; Arnaud Mary (WAOA, 2018)

Decomposition techniques applied to the Clique-Stable set separation problem. - Nicolas Bousquet 001; Aurélie Lagoutte; Frédéric Maffray; Lucas Pastor (Discret. Math., 2018)

Recoloring graphs via tree decompositions. - Marthe Bonamy; Nicolas Bousquet 001 (Eur. J. Comb., 2018)

Frozen colourings of bounded degree graphs. - Marthe Bonamy; Nicolas Bousquet 001; Guillem Perarnau (Electron. Notes Discret. Math., 2018)

χ-bounded families of oriented graphs. - Pierre Aboulker; Jørgen Bang-Jensen; Nicolas Bousquet 001; Pierre Charbit; Frédéric Havet; Frédéric Maffray; José Zamora (J. Graph Theory, 2018)

Multicut Is FPT. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé (SIAM J. Comput., 2018)

Linear Transformations Between Colorings in Chordal Graphs. - Nicolas Bousquet 001; Valentin Bartier (ESA, 2019)

When Maximum Stable Set Can Be Solved in FPT Time. - Édouard Bonnet; Nicolas Bousquet 001; Stéphan Thomassé; Rémi Watrigant (ISAAC, 2019)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

Shortest Reconfiguration of Matchings. - Nicolas Bousquet 001; Tatsuhiko Hatanaka; Takehiro Ito; Moritz Mühlenthaler (WG, 2019)

Distributed Coloring in Sparse Graphs with Fewer Colors. - Pierre Aboulker; Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet (Electron. J. Comb., 2019)

Exact Distance Colouring in Trees. - Nicolas Bousquet 001; Louis Esperet; Ararat Harutyunyan; Rémi de Joannis de Verclos (Comb. Probab. Comput., 2019)

On a conjecture of Mohar concerning Kempe equivalence of regular graphs. - Marthe Bonamy; Nicolas Bousquet 001; Carl Feghali; Matthew Johnson 002 (J. Comb. Theory B, 2019)

A proof of the Erdős-Sands-Sauer-Woodrow conjecture. - Nicolas Bousquet 001; William Lochet; Stéphan Thomassé (J. Comb. Theory B, 2019)

Reconfiguration of Spanning Trees with Many or Few Leaves. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (ESA, 2020)

Linear Transformations Between Dominating Sets in the TAR-Model. - Nicolas Bousquet 001; Alice Joffard; Paul Ouvrard (ISAAC, 2020)

Approximating Shortest Connected Graph Transformation for Trees. - Nicolas Bousquet 001; Alice Joffard (SOFSEM, 2020)

Parameterized Complexity of Independent Set in H-Free Graphs. - Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2020)

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. - Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet; Carla Groenland; Chun-Hung Liu; François Pirot; Alex D. Scott (CoRR, 2020)

A note on the simultaneous edge coloring. - Nicolas Bousquet 001; Bastien Durain (Discret. Math., 2020)

TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. - Nicolas Bousquet 001; Alice Joffard (FCT, 2021)

PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. - Valentin Bartier; Gabriel Bathie; Nicolas Bousquet 001; Marc Heinrich; Théo Pierron; Ulysse Prieto (IPEC, 2021)

PACE Solver Description: μSolver - Heuristic Track. - Valentin Bartier; Gabriel Bathie; Nicolas Bousquet 001; Marc Heinrich; Théo Pierron; Ulysse Prieto (IPEC, 2021)

(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. - Gabriel Bathie; Nicolas Bousquet 001; Théo Pierron (IPEC, 2021)

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

Distributed Algorithms for Fractional Coloring. - Nicolas Bousquet 001; Louis Esperet; François Pirot (SIROCCO, 2021)

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

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. - Valentin Bartier; Nicolas Bousquet 001; Clément Dallard; Kyle Lomer; Amer E. Mouawad (Algorithmica, 2021)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Nicolas Bousquet 001; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma; Théo Pierron (Algorithmica, 2021)

Packing and Covering Balls in Graphs Excluding a Minor. - Nicolas Bousquet 001; Wouter Cames van Batenburg; Louis Esperet; Gwenaël Joret; William Lochet; Carole Muller; François Pirot (Comb., 2021)

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

Metric dimension on sparse graphs and its applications to zero forcing sets. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau; Ignacio M. Pelayo (CoRR, 2021)

Frozen (Δ + 1)-colourings of bounded degree graphs. - Marthe Bonamy; Nicolas Bousquet 001; Guillem Perarnau (Comb. Probab. Comput., 2021)

Recoloring graphs of treewidth 2. - Valentin Bartier; Nicolas Bousquet 001; Marc Heinrich (Discret. Math., 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 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)

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (STACS, 2022)

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. - Gabriel Bathie; Nicolas Bousquet 001; Yixin Cao 001; Yuping Ke; Théo Pierron (Algorithmica, 2022)

Chordal Directed Graphs Are Not $ chi$-Bounded. - Pierre Aboulker; Nicolas Bousquet 001; Rémi de Joannis de Verclos (Electron. J. Comb., 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)

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (CoRR, 2022)

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. - Marthe Bonamy; Nicolas Bousquet 001; Michal Pilipczuk; Pawel Rzazewski; Stéphan Thomassé; Bartosz Walczak (J. Comb. Theory B, 2022)

A polynomial version of Cereceda's conjecture. - Nicolas Bousquet 001; Marc Heinrich (J. Comb. Theory B, 2022)

Metric Dimension Parameterized by Treewidth in Chordal Graphs. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau (WG, 2023)

A Note on the Flip Distance between Non-crossing Spanning Trees. - Nicolas Bousquet 001; Valentin Gledel; Jonathan Narboni; Théo Pierron (Comput. Geom. Topol., 2023)

Extremal Independent Set Reconfiguration. - Nicolas Bousquet 001; Bastien Durain; Théo Pierron; Stéphan Thomassé (Electron. J. Comb., 2023)

A note on highly connected K2, 𝓁-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (CoRR, 2023)

Locating-dominating sets: From graphs to oriented graphs. - Nicolas Bousquet 001; Quentin Deschamps; Tuomo Lehtilä; Aline Parreau (Discret. Math., 2023)

Galactic token sliding. - Valentin Bartier; Nicolas Bousquet 001; Amer E. Mouawad (J. Comput. Syst. Sci., 2023)

Recoloring Planar Graphs of Girth at Least Five. - Valentin Bartier; Nicolas Bousquet 001; Carl Feghali; Marc Heinrich; Benjamin Moore; Théo Pierron (SIAM J. Discret. Math., 2023)

Improved square coloring of planar graphs. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (Discret. Math., 2023)

The smallest 5-chromatic tournament. - Thomas Bellitto; Nicolas Bousquet 001; Adam Kabela; Théo Pierron (Math. Comput., 2023)

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (Algorithmica, 2023)

Feedback vertex set reconfiguration in planar graphs. - Nicolas Bousquet 001; Felix Hommelsheim; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Reconfiguration of Plane Trees in Convex Geometric Graphs. - Nicolas Bousquet 001; Lucas de Meyer; Théo Pierron; Alexandra Wesolek (SoCG, 2024)

Parameterized Shortest Path Reconfiguration. - Nicolas Bousquet 001; Kshitij Gajjar; Abhiruk Lahiri; Amer E. Mouawad (IPEC, 2024)

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)

Fast Winning Strategies for the Attacker in Eternal Domination. - Guillaume Bagan; Nicolas Bousquet 001; Nacim Oijid; Théo Pierron (WG, 2024)

Independent Set Reconfiguration in H-Free Graphs. - Valentin Bartier; Nicolas Bousquet 001; Moritz Mühlenthaler (WG, 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)

Benchmarking XAI Explanations with Human-Aligned Evaluations. - Rémi Kazmierczak; Steve Azzolin; Eloïse Berthier; Anna Hedström; Patricia Delhomme; Nicolas Bousquet 001; Goran Frehse; Massimiliano Mancini; Baptiste Caramiaux; Andrea Passerini; Gianni Franchi (CoRR, 2024)

A survey on the parameterized complexity of reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (Comput. Sci. Rev., 2024)

A note on highly connected K2,-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (Discret. Math., 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)

Token Sliding on Graphs of Girth Five. - Valentin Bartier; Nicolas Bousquet 001; Jihad Hanna; Amer E. Mouawad; Sebastian Siebertz (Algorithmica, 2024)

Digraph redicolouring. - Nicolas Bousquet 001; Frédéric Havet; Nicolas Nisse; Lucas Picasarri-Arrieta; Amadeus Reinald (Eur. J. Comb., 2024)

Square Coloring Planar Graphs with Automatic Discharging. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (SIAM J. Discret. Math., 2024)

A note on locating-dominating sets in twin-free graphs. - Nicolas Bousquet 001; Quentin Chuet; Victor Falgas-Ravry; Amaury Jacques; Laure Morelle (Discret. Math., 2025)

A subquadratic certification scheme for P5-free graphs. - Nicolas Bousquet 001; Sébastien Zeitoun (Theor. Comput. Sci., 2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration. - Nicolas Bousquet 001; Quentin Deschamps; Arnaud Mary; Amer E. Mouawad; Théo Pierron (CoRR, 2025)

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

On the complexity of constrained reconfiguration and motion planning. - Nicolas Bousquet 001; Remy El Sabeh; Amer E. Mouawad; Naomi Nishimura (CoRR, 2025)