Nicolas Bousquet

According to our database, Nicolas Bousquet authored at least 112 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A note on locating-dominating sets in twin-free graphs.

Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry, Amaury Jacques, Laure Morelle

Discret. Math., 2025

2024

Square Coloring Planar Graphs with Automatic Discharging.

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron

SIAM J. Discret. Math., March, 2024

Digraph redicolouring.

Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald

Eur. J. Comb., February, 2024

Token Sliding on Graphs of Girth Five.

Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz

Algorithmica, February, 2024

Local certification of graph decompositions and applications to minor-free classes.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

J. Parallel Distributed Comput., 2024

A note on highly connected K2,-minor free graphs.

Nicolas Bousquet, Théo Pierron, Alexandra Wesolek

Discret. Math., 2024

A survey on the parameterized complexity of reconfiguration problems.

Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz

Comput. Sci. Rev., 2024

Benchmarking XAI Explanations with Human-Aligned Evaluations.

Rémi Kazmierczak, Steve Azzolin, Eloïse Berthier, Anna Hedström, Patricia Delhomme, Nicolas Bousquet, Goran Frehse, Massimiliano Mancini, Baptiste Caramiaux, Andrea Passerini, Gianni Franchi

CoRR, 2024

A subquadratic certification scheme for P5-free graphs.

Nicolas Bousquet, Sébastien Zeitoun

CoRR, 2024

Renaming in distributed certification.

Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun

CoRR, 2024

Local certification of forbidden subgraphs.

Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun

CoRR, 2024

Global certification via perfect hashing.

Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun

CoRR, 2024

A Note on the Complexity of Graph Recoloring.

Nicolas Bousquet

CoRR, 2024

Independent Set Reconfiguration in H-Free Graphs.

Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Fast Winning Strategies for the Attacker in Eternal Domination.

Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters.

Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Brief Announcement: Global certification via perfect hashing.

Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

How Local Constraints Influence Network Diameter and Applications to LCL Generalizations.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

Parameterized Shortest Path Reconfiguration.

Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Reconfiguration of Plane Trees in Convex Geometric Graphs.

Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Feedback vertex set reconfiguration in planar graphs.

Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theor. Comput. Sci., November, 2023

From free-text electronic health records to structured cohorts: Onconum, an innovative methodology for real-world data mining in breast cancer.

Antoine Simoulin, Nicolas Thiebaut, Karl Neuberger, Issam Ibnouhsein, Nicolas J.-B. Brunel, Raphaël Viné, Nicolas Bousquet, Jules Latapy, Nathalie Reix, Sébastien Molière, Massimo Lodi, Carole Mathelin

Comput. Methods Programs Biomed., October, 2023

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints.

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

Algorithmica, September, 2023

The smallest 5-chromatic tournament.

Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron

Math. Comput., August, 2023

Improved square coloring of planar graphs.

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron

Discret. Math., April, 2023

Recoloring Planar Graphs of Girth at Least Five.

Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron

SIAM J. Discret. Math., March, 2023

Galactic token sliding.

Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad

J. Comput. Syst. Sci., 2023

Locating-dominating sets: From graphs to oriented graphs.

Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau

Discret. Math., 2023

A note on highly connected K_{2, 𝓁}-minor free graphs.

Nicolas Bousquet, Théo Pierron, Alexandra Wesolek

CoRR, 2023

Extremal Independent Set Reconfiguration.

Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé

Electron. J. Comb., 2023

A Note on the Flip Distance between Non-crossing Spanning Trees.

Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron

Comput. Geom. Topol., 2023

Metric Dimension Parameterized by Treewidth in Chordal Graphs.

Nicolas Bousquet, Quentin Deschamps, Aline Parreau

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Lymphedema measurements (including periods of curative treatments).

Nicolas Bousquet, Carole Mathelin

Dataset, May, 2022

A polynomial version of Cereceda's conjecture.

Nicolas Bousquet, Marc Heinrich

J. Comb. Theory B, 2022

Degeneracy of <i>P</i>_<i>t</i>-free and <i>C</i>_⩾<i>t</i>-free graphs with no large complete bipartite subgraphs.

Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak

J. Comb. Theory B, 2022

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems.

Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz

CoRR, 2022

Short and local transformations between (Δ+1)-colorings.

Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie

CoRR, 2022

What can be certified compactly?

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

CoRR, 2022

Chordal Directed Graphs Are Not $\chi$-Bounded.

Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos

Electron. J. Comb., 2022

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes.

Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron

Algorithmica, 2022

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs.

Laurent Feuilloley, Nicolas Bousquet, Théo Pierron

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.

Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé

J. ACM, 2021

Recoloring graphs of treewidth 2.

Valentin Bartier, Nicolas Bousquet, Marc Heinrich

Discret. Math., 2021

Frozen (Δ + 1)-colourings of bounded degree graphs.

Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau

Comb. Probab. Comput., 2021

Metric dimension on sparse graphs and its applications to zero forcing sets.

Nicolas Bousquet, Quentin Deschamps, Aline Parreau, Ignacio M. Pelayo

CoRR, 2021

Local certification of MSO properties for bounded treedepth graphs.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

CoRR, 2021

Packing and Covering Balls in Graphs Excluding a Minor.

Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot

Comb., 2021

Graph Isomorphism for (H_{1, H₂₎}-Free Graphs: An Almost Complete Dichotomy.

Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron

Algorithmica, 2021

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.

Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad

Algorithmica, 2021

Guiding Measurement Protocols of Connected Medical Devices Using Digital Twins: A Statistical Methodology Applied to Detecting and Monitoring Lymphedema.

Loïc Béthencourt, Walid Dabachine, Vincent Dejouy, Zakaria Lalmiche, Karl Neuberger, Issam Ibnouhsein, Sandrine Chéreau, Carole Mathelin, Nicolas Savy, Philippe Saint-Pierre, Nicolas Bousquet

IEEE Access, 2021

Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes.

Nicolas Bousquet, Laurent Feuilloley, Théo Pierron

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Distributed Algorithms for Fractional Coloring.

Nicolas Bousquet, Louis Esperet, François Pirot

Proceedings of the Structural Information and Communication Complexity, 2021

Distributed Recoloring of Interval and Chordal Graphs.

Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes.

Gabriel Bathie, Nicolas Bousquet, Théo Pierron

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: μSolver - Heuristic Track.

Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters.

Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs.

Nicolas Bousquet, Alice Joffard

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

A note on the simultaneous edge coloring.

Nicolas Bousquet, Bastien Durain

Discret. Math., 2020

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.

Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott

CoRR, 2020

Parameterized Complexity of Independent Set in H-Free Graphs.

Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant

Algorithmica, 2020

Approximating Shortest Connected Graph Transformation for Trees.

Nicolas Bousquet, Alice Joffard

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Linear Transformations Between Dominating Sets in the TAR-Model.

Nicolas Bousquet, Alice Joffard, Paul Ouvrard

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Reconfiguration of Spanning Trees with Many or Few Leaves.

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

A proof of the Erdős-Sands-Sauer-Woodrow conjecture.

Nicolas Bousquet, William Lochet, Stéphan Thomassé

J. Comb. Theory B, 2019

On a conjecture of Mohar concerning Kempe equivalence of regular graphs.

Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson

J. Comb. Theory B, 2019

Exact Distance Colouring in Trees.

Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos

Comb. Probab. Comput., 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.

Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet

Electron. J. Comb., 2019

Shortest Reconfiguration of Matchings.

Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Perfect Matching Reconfiguration Problem.

Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

When Maximum Stable Set Can Be Solved in FPT Time.

Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Linear Transformations Between Colorings in Chordal Graphs.

Nicolas Bousquet, Valentin Bartier

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Multicut Is FPT.

Nicolas Bousquet, Jean Daligault, Stéphan Thomassé

SIAM J. Comput., 2018

Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification.

Nicolas Bousquet, Thierry Klein, Vincent Moutoussamy

SIAM/ASA J. Uncertain. Quantification, 2018

χ-bounded families of oriented graphs.

Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora

J. Graph Theory, 2018

Frozen colourings of bounded degree graphs.

Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau

Electron. Notes Discret. Math., 2018

Recoloring graphs via tree decompositions.

Marthe Bonamy, Nicolas Bousquet

Eur. J. Comb., 2018

Decomposition techniques applied to the Clique-Stable set separation problem.

Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor

Discret. Math., 2018

Reconfiguration of Graphs with Connectivity Constraints.

Nicolas Bousquet, Arnaud Mary

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

EPTAS for Max Clique on Disks and Unit Balls.

Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Functional Weibull-based models of steel fracture toughness for structural risk analysis: estimation and selection.

Nadia Pérot, Nicolas Bousquet

Reliab. Eng. Syst. Saf., 2017

Colorful paths for 3-chromatic graphs.

Stéphane Bessy, Nicolas Bousquet

Discret. Math., 2017

A Vizing-like theorem for union vertex-distinguishing edge coloring.

Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau

Discret. Appl. Math., 2017

An innovative solution for breast cancer textual big data analysis.

Nicolas Thiebaut, Antoine Simoulin, Karl Neuberger, Issam Ibnouhsein, Nicolas Bousquet, Nathalie Reix, Sébastien Molière, Carole Mathelin

CoRR, 2017

Computing Maximum Cliques in B_2 -EPG Graphs.

Nicolas Bousquet, Marc Heinrich

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Token Sliding on Chordal Graphs.

Marthe Bonamy, Nicolas Bousquet

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Token Jumping in Minor-Closed Classes.

Nicolas Bousquet, Arnaud Mary, Aline Parreau

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

The Erdös-Hajnal Conjecture for Long Holes and Antiholes.

Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé

SIAM J. Discret. Math., 2016

Fast recoloring of sparse graphs.

Nicolas Bousquet, Guillem Perarnau

Eur. J. Comb., 2016

On the Economic Efficiency of the Combinatorial Clock Auction.

Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension.

Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé

SIAM J. Discret. Math., 2015

On the Practical Interest of Discrete Inverse Pólya and Weibull-1 Models in Industrial Reliability Studies.

Alberto Pasanisi, Côme Roero, Emmanuel Remy, Nicolas Bousquet

Qual. Reliab. Eng. Int., 2015

The Erdős-Hajnal conjecture for paths and antipaths.

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

J. Comb. Theory B, 2015

VC-dimension and Erdős-Pósa property.

Nicolas Bousquet, Stéphan Thomassé

Discret. Math., 2015

Excluding cycles with a fixed number of chords.

Pierre Aboulker, Nicolas Bousquet

Discret. Appl. Math., 2015

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.

Nicolas Bousquet, Yang Cai, Adrian Vetta

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Coalition Games on Interaction Graphs: A Horticultural Perspective.

Nicolas Bousquet, Zhentao Li, Adrian Vetta

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Parameterized Domination in Circle Graphs.

Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé

Theory Comput. Syst., 2014

Clique versus independent set.

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

Eur. J. Comb., 2014

Brooks' theorem on powers of graphs.

Marthe Bonamy, Nicolas Bousquet

Discret. Math., 2014

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes.

Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé

CoRR, 2014

Reconfiguring Independent Sets in Cographs.

Marthe Bonamy, Nicolas Bousquet

CoRR, 2014

A Near-Optimal Mechanism for Impartial Selection.

Nicolas Bousquet, Sergey Norin, Adrian Vetta

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.

Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013

Hitting sets : VC-dimension and Multicut. (Hitting sets : VC-dimension et Multicut).

Nicolas Bousquet

PhD thesis, 2013

Recoloring bounded treewidth graphs.

Marthe Bonamy, Nicolas Bousquet

Electron. Notes Discret. Math., 2013

Graph coloring, communication complexity and the stubborn problem (Invited talk).

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Estimating discrete Markov models from various incomplete data schemes.

Alberto Pasanisi, Shuai Fu, Nicolas Bousquet

Comput. Stat. Data Anal., 2012

Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs.

Nicolas Bousquet, Stéphan Thomassé

Comb. Probab. Comput., 2012

Security of Mobile Devices, Applications and Transactions.

Daniel Borleteau, Nicolas Bousquet, Thierry Crespo, Xavier Dubarry, Jan Eichholz, Virginie Galindo

Proceedings of the ISSE 2012, 2012

2010

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata.

Nicolas Bousquet, Christof Löding

Proceedings of the Language and Automata Theory and Applications, 2010

2009

A Polynomial Kernel for Multicut in Trees.

Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009