Nicolas Bousquet

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 127

Top Venues

CoRR

Discret. Math.

Algorithmica

Montpellier 2 University, France (PHD)

Education History

Montpellier 2 University, France

PHD

Publications

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. 38 (1) (2024)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53 (2024)
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
A note on highly connected K2,-minor free graphs. Discret. Math. 347 (7) (2024)
Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun
Local certification of forbidden subgraphs. CoRR (2024)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token Sliding on Graphs of Girth Five. Algorithmica 86 (2) (2024)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. Eur. J. Comb. 116 (2024)
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
Global certification via perfect hashing. CoRR (2024)
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
Brief Announcement: Global certification via perfect hashing. PODC (2024)
Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler
Independent set reconfiguration in H-free graphs. CoRR (2024)
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. STACS (2024)
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
Parameterized Shortest Path Reconfiguration. CoRR (2024)
Nicolas Bousquet
A Note on the Complexity of Graph Recoloring. CoRR (2024)
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
Fast winning strategies for the attacker in eternal domination. CoRR (2024)
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG (2024)
Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad
Galactic token sliding. J. Comput. Syst. Sci. 136 (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Algorithmica 85 (9) (2023)
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
Local certification of local properties: tight bounds, trade-offs and new parameters. CoRR (2023)
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
-minor free graphs. CoRR (2023)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. Math. Comput. 93 (345) (2023)
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
Reconfiguration of plane trees in convex geometric graphs. CoRR (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. CoRR (2023)
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
Improved square coloring of planar graphs. Discret. Math. 346 (4) (2023)
Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau
Locating-dominating sets: From graphs to oriented graphs. Discret. Math. 346 (1) (2023)
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
A note on the flip distance between non-crossing spanning trees. CoRR (2023)
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979 (2023)
Nicolas Bousquet, Quentin Deschamps, Aline Parreau
Metric Dimension Parameterized by Treewidth in Chordal Graphs. WG (2023)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. CoRR (2023)
Nicolas Bousquet, Quentin Deschamps, Aline Parreau
Metric dimension parameterized by treewidth in chordal graphs. CoRR (2023)
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
From free-text electronic health records to structured cohorts: Onconum, an innovative methodology for real-world data mining in breast cancer. Comput. Methods Programs Biomed. 240 (2023)
Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron
Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. 37 (1) (2023)
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2 (1) (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30 (3) (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. CoRR (2022)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. CoRR (2022)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token sliding on graphs of girth five. CoRR (2022)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token Sliding on Graphs of Girth Five. WG (2022)
Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad
Galactic Token Sliding. ESA (2022)
Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica 84 (11) (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. STACS (2022)
Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152 (2022)
Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad
Galactic Token Sliding. CoRR (2022)
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
Short and local transformations between (Δ+1)-colorings. CoRR (2022)
Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos
Chordal Directed Graphs Are Not $\chi$-Bounded. Electron. J. Comb. 29 (2) (2022)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. CoRR (2022)
Laurent Feuilloley, Nicolas Bousquet, Théo Pierron
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC (2022)
Nicolas Bousquet, Marc Heinrich
A polynomial version of Cereceda's conjecture. J. Comb. Theory, Ser. B 155 (2022)
Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron
Square coloring planar graphs with automatic discharging. CoRR (2022)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
What can be certified compactly? CoRR (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification of MSO properties for bounded treedepth graphs. CoRR (2021)
Nicolas Bousquet, Alice Joffard
TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs. CoRR (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30 (3) (2021)
Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83 (3) (2021)
Nicolas Bousquet, Alice Joffard
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. FCT (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS (2021)
Valentin Bartier, Nicolas Bousquet, Marc Heinrich
Recoloring graphs of treewidth 2. Discret. Math. 344 (12) (2021)
Gabriel Bathie, Nicolas Bousquet, Théo Pierron
(Sub)linear kernels for edge modification problems towards structured graph classes. CoRR (2021)
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. IPEC (2021)
Nicolas Bousquet, Quentin Deschamps, Aline Parreau, Ignacio M. Pelayo
Metric dimension on sparse graphs and its applications to zero forcing sets. CoRR (2021)
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
Guiding Measurement Protocols of Connected Medical Devices Using Digital Twins: A Statistical Methodology Applied to Detecting and Monitoring Lymphedema. IEEE Access 9 (2021)
Nicolas Bousquet, Louis Esperet, François Pirot
Distributed Algorithms for Fractional Coloring. SIROCCO (2021)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. Algorithmica 83 (9) (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification of graph decompositions and applications to minor-free classes. CoRR (2021)
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
Distributed Recoloring of Interval and Chordal Graphs. OPODIS (2021)
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
PACE Solver Description: μSolver - Heuristic Track. IPEC (2021)
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie
Distributed recoloring of interval and chordal graphs. CoRR (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC (2021)
Gabriel Bathie, Nicolas Bousquet, Théo Pierron
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC (2021)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and Covering Balls in Graphs Excluding a Minor. Comb. 41 (3) (2021)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. ESA (2020)
Nicolas Bousquet, Alice Joffard
Approximating Shortest Connected Graph Transformation for Trees. SOFSEM (2020)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and covering balls in graphs excluding a minor. CoRR (2020)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR (2020)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82 (8) (2020)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ISAAC (2020)
Nicolas Bousquet, Bastien Durain
A note on the simultaneous edge coloring. CoRR (2020)
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
On girth and the parameterized complexity of token sliding and token jumping. CoRR (2020)
Valentin Bartier, Nicolas Bousquet, Marc Heinrich
Recoloring graphs of treewidth 2. CoRR (2020)
Nicolas Bousquet, Alice Joffard, Paul Ouvrard
Linear transformations between dominating sets in the TAR-model. CoRR (2020)
Nicolas Bousquet, Bastien Durain
A note on the simultaneous edge coloring. Discret. Math. 343 (5) (2020)
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR (2020)
Nicolas Bousquet, Louis Esperet, François Pirot
Distributed algorithms for fractional coloring. CoRR (2020)
Nicolas Bousquet, Alice Joffard, Paul Ouvrard
Linear Transformations Between Dominating Sets in the TAR-Model. ISAAC (2020)
Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory, Ser. B 135 (2019)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26 (4) (2019)
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
When Maximum Stable Set Can Be Solved in FPT Time. ISAAC (2019)
Nicolas Bousquet, Valentin Bartier
Linear Transformations Between Colorings in Chordal Graphs. ESA (2019)
Nicolas Bousquet, Marc Heinrich
A polynomial version of Cereceda's conjecture. CoRR (2019)
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28 (2) (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. MFCS (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. CoRR (2019)
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
Shortest Reconfiguration of Matchings. WG (2019)
Nicolas Bousquet, Valentin Bartier
Linear transformations between colorings in chordal graphs. CoRR (2019)
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
When Maximum Stable Set can be solved in FPT time. CoRR (2019)
Nicolas Bousquet, William Lochet, Stéphan Thomassé
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory, Ser. B 137 (2019)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR (2018)
Nicolas Bousquet, Arnaud Mary
Reconfiguration of Graphs with Connectivity Constraints. WAOA (2018)
Nicolas Bousquet, Arnaud Mary
Reconfiguration of graphs with connectivity constraints. CoRR (2018)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC (2018)

Nicolas Bousquet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicolas Bousquet