default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Bousquet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j56]Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry, Amaury Jacques, Laure Morelle:
A note on locating-dominating sets in twin-free graphs. Discret. Math. 348(2): 114297 (2025)- 2024
- [j55]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. Algorithmica 86(2): 638-655 (2024) - [j54]Nicolas Bousquet, Amer E. Mouawad
, Naomi Nishimura, Sebastian Siebertz:
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53: 100663 (2024) - [j53]Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2,-minor free graphs. Discret. Math. 347(7): 114005 (2024) - [j52]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. Eur. J. Comb. 116: 103876 (2024) - [j51]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. J. Parallel Distributed Comput. 193: 104954 (2024) - [j50]Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. 38(1): 504-528 (2024) - [c43]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG 2024: 22:1-22:17 - [c42]Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. IPEC 2024: 23:1-23:14 - [c41]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Brief Announcement: Global certification via perfect hashing. PODC 2024: 429-431 - [c40]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. STACS 2024: 21:1-21:18 - [i75]Nicolas Bousquet:
A Note on the Complexity of Graph Recoloring. CoRR abs/2401.03011 (2024) - [i74]Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron:
Fast winning strategies for the attacker in eternal domination. CoRR abs/2401.10584 (2024) - [i73]Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler:
Independent set reconfiguration in H-free graphs. CoRR abs/2402.03063 (2024) - [i72]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Global certification via perfect hashing. CoRR abs/2402.03849 (2024) - [i71]Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun:
Local certification of forbidden subgraphs. CoRR abs/2402.12148 (2024) - [i70]Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. CoRR abs/2406.12717 (2024) - [i69]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
How local constraints influence network diameter and applications to LCL generalizations. CoRR abs/2409.01305 (2024) - [i68]Nicolas Bousquet, Louis Esperet, Laurent Feuilloley, Sébastien Zeitoun:
Renaming in distributed certification. CoRR abs/2409.15404 (2024) - [i67]Nicolas Bousquet, Sébastien Zeitoun:
A subquadratic certification scheme for P5-free graphs. CoRR abs/2410.14658 (2024) - [i66]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:
Benchmarking XAI Explanations with Human-Aligned Evaluations. CoRR abs/2411.02470 (2024) - 2023
- [j49]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): 2779-2816 (2023) - [j48]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): 8:1-8:7 (2023) - [j47]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: 107693 (2023) - [j46]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30(3) (2023) - [j45]Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau:
Locating-dominating sets: From graphs to oriented graphs. Discret. Math. 346(1): 113124 (2023) - [j44]Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Improved square coloring of planar graphs. Discret. Math. 346(4): 113288 (2023) - [j43]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic token sliding. J. Comput. Syst. Sci. 136: 220-248 (2023) - [j42]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. Math. Comput. 93(345): 443-458 (2023) - [j41]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): 332-350 (2023) - [j40]Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979: 114188 (2023) - [c39]Nicolas Bousquet, Quentin Deschamps, Aline Parreau:
Metric Dimension Parameterized by Treewidth in Chordal Graphs. WG 2023: 130-142 - [i65]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. CoRR abs/2301.02020 (2023) - [i64]Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2, 𝓁-minor free graphs. CoRR abs/2301.02133 (2023) - [i63]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. CoRR abs/2301.03417 (2023) - [i62]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A note on the flip distance between non-crossing spanning trees. CoRR abs/2303.07710 (2023) - [i61]Nicolas Bousquet, Quentin Deschamps, Aline Parreau:
Metric dimension parameterized by treewidth in chordal graphs. CoRR abs/2303.10646 (2023) - [i60]Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of plane trees in convex geometric graphs. CoRR abs/2310.18518 (2023) - [i59]Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Local certification of local properties: tight bounds, trade-offs and new parameters. CoRR abs/2312.13702 (2023) - 2022
- [j39]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): 3338-3364 (2022) - [j38]Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos:
Chordal Directed Graphs Are Not $\chi$-Bounded. Electron. J. Comb. 29(2) (2022) - [j37]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory B 152: 353-378 (2022) - [j36]Nicolas Bousquet, Marc Heinrich:
A polynomial version of Cereceda's conjecture. J. Comb. Theory B 155: 1-16 (2022) - [c38]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. ESA 2022: 15:1-15:14 - [c37]Laurent Feuilloley, Nicolas Bousquet, Théo Pierron:
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC 2022: 131-140 - [c36]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: 15:1-15:21 - [c35]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. WG 2022: 56-69 - [d1]Nicolas Bousquet, Carole Mathelin:
Lymphedema measurements (including periods of curative treatments). IEEE DataPort, 2022
- [i58]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 abs/2201.04354 (2022) - [i57]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
What can be certified compactly? CoRR abs/2202.06065 (2022) - [i56]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Short and local transformations between (Δ+1)-colorings. CoRR abs/2203.08885 (2022) - [i55]Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. CoRR abs/2204.05549 (2022) - [i54]Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron:
Square coloring planar graphs with automatic discharging. CoRR abs/2204.05791 (2022) - [i53]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 abs/2204.10526 (2022) - [i52]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token sliding on graphs of girth five. CoRR abs/2205.01009 (2022) - [i51]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. CoRR abs/2210.09936 (2022) - 2021
- [j35]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: 39444-39465 (2021) - [j34]Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021) - [j33]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): 2914-2951 (2021) - [j32]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): 299-318 (2021) - [j31]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30(3): 330-343 (2021) - [j30]Valentin Bartier, Nicolas Bousquet, Marc Heinrich:
Recoloring graphs of treewidth 2. Discret. Math. 344(12): 112553 (2021) - [j29]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): 9:1-9:38 (2021) - [c34]Nicolas Bousquet, Alice Joffard:
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. FCT 2021: 114-134 - [c33]Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC 2021: 8:1-8:14 - [c32]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: 29:1-29:4 - [c31]Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: μSolver - Heuristic Track. IPEC 2021: 33:1-33:3 - [c30]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Distributed Recoloring of Interval and Chordal Graphs. OPODIS 2021: 19:1-19:17 - [c29]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS 2021: 22:1-22:17 - [c28]Nicolas Bousquet, Louis Esperet, François Pirot:
Distributed Algorithms for Fractional Coloring. SIROCCO 2021: 15-30 - [c27]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC 2021: 49:1-49:4 - [i50]Nicolas Bousquet, Alice Joffard:
TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs. CoRR abs/2102.10568 (2021) - [i49]Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear kernels for edge modification problems towards structured graph classes. CoRR abs/2105.09566 (2021) - [i48]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of graph decompositions and applications to minor-free classes. CoRR abs/2108.00059 (2021) - [i47]Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Distributed recoloring of interval and chordal graphs. CoRR abs/2109.06021 (2021) - [i46]Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local certification of MSO properties for bounded treedepth graphs. CoRR abs/2110.01936 (2021) - [i45]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 abs/2110.15419 (2021) - [i44]Nicolas Bousquet, Quentin Deschamps, Aline Parreau, Ignacio M. Pelayo:
Metric dimension on sparse graphs and its applications to zero forcing sets. CoRR abs/2111.07845 (2021) - 2020
- [j28]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020) - [j27]Nicolas Bousquet, Bastien Durain:
A note on the simultaneous edge coloring. Discret. Math. 343(5): 111781 (2020) - [c26]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: 24:1-24:15 - [c25]Nicolas Bousquet, Alice Joffard, Paul Ouvrard:
Linear Transformations Between Dominating Sets in the TAR-Model. ISAAC 2020: 37:1-37:14 - [c24]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: 44:1-44:17 - [c23]Nicolas Bousquet, Alice Joffard:
Approximating Shortest Connected Graph Transformation for Trees. SOFSEM 2020: 76-87 - [i43]Nicolas Bousquet, Bastien Durain:
A note on the simultaneous edge coloring. CoRR abs/2001.01463 (2020) - [i42]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 abs/2001.04517 (2020) - [i41]Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa:
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR abs/2006.14309 (2020) - [i40]Nicolas Bousquet, Alice Joffard, Paul Ouvrard:
Linear transformations between dominating sets in the TAR-model. CoRR abs/2006.16726 (2020) - [i39]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 abs/2007.01673 (2020) - [i38]Nicolas Bousquet, Louis Esperet, François Pirot:
Distributed algorithms for fractional coloring. CoRR abs/2012.01752 (2020) - [i37]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 abs/2012.02435 (2020) - [i36]Valentin Bartier, Nicolas Bousquet, Marc Heinrich:
Recoloring graphs of treewidth 2. CoRR abs/2012.11459 (2020)
2010 – 2019
- 2019
- [j26]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26(4): 4 (2019) - [j25]Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28(2): 177-186 (2019) - [j24]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B 135: 179-199 (2019) - [j23]Nicolas Bousquet, William Lochet, Stéphan Thomassé:
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory B 137: 316-319 (2019) - [c22]Nicolas Bousquet, Valentin Bartier:
Linear Transformations Between Colorings in Chordal Graphs. ESA 2019: 24:1-24:15 - [c21]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set Can Be Solved in FPT Time. ISAAC 2019: 49:1-49:22 - [c20]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [c19]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. WG 2019: 162-174 - [i35]Nicolas Bousquet, Marc Heinrich:
A polynomial version of Cereceda's conjecture. CoRR abs/1903.05619 (2019) - [i34]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - [i33]Nicolas Bousquet, Valentin Bartier:
Linear transformations between colorings in chordal graphs. CoRR abs/1907.01863 (2019) - [i32]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set can be solved in FPT time. CoRR abs/1909.08426 (2019) - 2018
- [j22]Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor:
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341(5): 1492-1501 (2018) - [j21]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. Eur. J. Comb. 69: 200-213 (2018) - [j20]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. 68: 167-172 (2018) - [j19]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - [j18]Nicolas Bousquet, Thierry Klein, Vincent Moutoussamy:
Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification. SIAM/ASA J. Uncertain. Quantification 6(1): 1-33 (2018) - [j17]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut Is FPT. SIAM J. Comput. 47(1): 166-207 (2018) - [c18]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c17]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC 2018: 17:1-17:13 - [c16]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC 2018: 419-425 - [c15]Nicolas Bousquet, Arnaud Mary:
Reconfiguration of Graphs with Connectivity Constraints. WAOA 2018: 295-309 - [i31]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed coloring in sparse graphs with fewer colors. CoRR abs/1802.05582 (2018) - [i30]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i29]Nicolas Bousquet, Arnaud Mary:
Reconfiguration of graphs with connectivity constraints. CoRR abs/1809.05443 (2018) - [i28]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR abs/1810.04620 (2018) - [i27]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. CoRR abs/1812.05419 (2018) - 2017
- [j16]Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau:
A Vizing-like theorem for union vertex-distinguishing edge coloring. Discret. Appl. Math. 232: 88-98 (2017) - [j15]Stéphane Bessy, Nicolas Bousquet:
Colorful paths for 3-chromatic graphs. Discret. Math. 340(5): 1000-1007 (2017) - [j14]Nadia Pérot, Nicolas Bousquet:
Functional Weibull-based models of steel fracture toughness for structural risk analysis: estimation and selection. Reliab. Eng. Syst. Saf. 165: 355-367 (2017) - [c14]Nicolas Bousquet, Arnaud Mary, Aline Parreau:
Token Jumping in Minor-Closed Classes. FCT 2017: 136-149 - [c13]Marthe Bonamy, Nicolas Bousquet:
Token Sliding on Chordal Graphs. WG 2017: 127-139 - [c12]Nicolas Bousquet, Marc Heinrich:
Computing Maximum Cliques in B_2 -EPG Graphs. WG 2017: 140-152 - [i26]Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor:
Decomposition techniques applied to the Clique-Stable set Separation problem. CoRR abs/1703.07106 (2017) - [i25]Nicolas Bousquet, Marc Heinrich:
Computing maximum cliques in $B_2$-EPG graphs. CoRR abs/1706.06685 (2017) - [i24]Nicolas Bousquet, Arnaud Mary, Aline Parreau:
Token Jumping in minor-closed classes. CoRR abs/1706.09608 (2017) - [i23]Nicolas Thiebaut, Antoine Simoulin, Karl Neuberger, Issam Ibnouhsein, Nicolas Bousquet, Nathalie Reix, Sébastien Molière, Carole Mathelin:
An innovative solution for breast cancer textual big data analysis. CoRR abs/1712.02259 (2017) - 2016
- [j13]Nicolas Bousquet, Guillem Perarnau:
Fast recoloring of sparse graphs. Eur. J. Comb. 52: 1-11 (2016) - [j12]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. 30(2): 1159-1164 (2016) - [c11]Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta:
On the Economic Efficiency of the Combinatorial Clock Auction. SODA 2016: 1407-1423 - [i22]Marthe Bonamy, Nicolas Bousquet:
Token Sliding on Chordal Graphs. CoRR abs/1605.00442 (2016) - [i21]Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau:
A Vizing-like theorem for union vertex-distinguishing edge coloring. CoRR abs/1605.02588 (2016) - [i20]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
$χ$-bounded families of oriented graphs. CoRR abs/1605.07411 (2016) - 2015
- [j11]Pierre Aboulker, Nicolas Bousquet:
Excluding cycles with a fixed number of chords. Discret. Appl. Math. 180: 11-24 (2015) - [j10]Nicolas Bousquet, Stéphan Thomassé:
VC-dimension and Erdős-Pósa property. Discret. Math. 338(12): 2302-2317 (2015) - [j9]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal conjecture for paths and antipaths. J. Comb. Theory B 113: 261-264 (2015) - [j8]Alberto Pasanisi, Côme Roero, Emmanuel Remy, Nicolas Bousquet:
On the Practical Interest of Discrete Inverse Pólya and Weibull-1 Models in Industrial Reliability Studies. Qual. Reliab. Eng. Int. 31(7): 1161-1175 (2015) - [j7]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. SIAM J. Discret. Math. 29(4): 2047-2064 (2015) - [c10]Nicolas Bousquet, Zhentao Li, Adrian Vetta:
Coalition Games on Interaction Graphs: A Horticultural Perspective. EC 2015: 95-112 - [c9]Nicolas Bousquet, Yang Cai, Adrian Vetta:
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. WINE 2015: 216-229 - [i19]Nicolas Bousquet, Zhentao Li, Adrian Vetta:
Coalition Games on Interaction Graphs: A Horticultural Perspective. CoRR abs/1502.07713 (2015) - [i18]Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta:
On the Economic Efficiency of the Combinatorial Clock Auction. CoRR abs/1507.06495 (2015) - [i17]Nicolas Bousquet, Yang Cai, Adrian Vetta:
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. CoRR abs/1510.00295 (2015) - [i16]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - 2014
- [j6]Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. Discret. Math. 325: 12-16 (2014) - [j5]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus independent set. Eur. J. Comb. 40: 73-92 (2014) - [j4]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54(1): 45-72 (2014) - [c8]Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant:
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM 2014: 150-161 - [c7]Nicolas Bousquet, Sergey Norin, Adrian Vetta:
A Near-Optimal Mechanism for Impartial Selection. WINE 2014: 133-146 - [i15]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. CoRR abs/1403.6386 (2014) - [i14]Marthe Bonamy, Nicolas Bousquet:
Reconfiguring Independent Sets in Cographs. CoRR abs/1406.1433 (2014) - [i13]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying codes in hereditary classes of graphs and VC-dimension. CoRR abs/1407.5833 (2014) - [i12]Nicolas Bousquet, Sergey Norin, Adrian Vetta:
A Near-Optimal Mechanism for Impartial Selection. CoRR abs/1407.8535 (2014) - [i11]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR abs/1408.1964 (2014) - [i10]Nicolas Bousquet, Guillem Perarnau:
Fast Recoloring of Sparse Graphs. CoRR abs/1411.6997 (2014) - [i9]Nicolas Bousquet, Stéphan Thomassé:
VC-dimension and Erdős-Pósa property. CoRR abs/1412.1793 (2014) - 2013
- [b1]Nicolas Bousquet:
Hitting sets : VC-dimension and Multicut. (Hitting sets : VC-dimension et Multicut). Montpellier 2 University, France, 2013 - [j3]Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. Electron. Notes Discret. Math. 44: 257-262 (2013) - [c6]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS 2013: 3-4 - [i8]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus Independent Set. CoRR abs/1301.2474 (2013) - [i7]Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. CoRR abs/1302.3486 (2013) - [i6]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Paths and Antipaths. CoRR abs/1303.5205 (2013) - [i5]Pierre Aboulker, Nicolas Bousquet:
Excluding cycles with a fixed number of chords. CoRR abs/1304.1718 (2013) - [i4]Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. CoRR abs/1310.5493 (2013) - 2012
- [j2]Nicolas Bousquet, Stéphan Thomassé:
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Comb. Probab. Comput. 21(4): 512-514 (2012) - [j1]Alberto Pasanisi, Shuai Fu, Nicolas Bousquet:
Estimating discrete Markov models from various incomplete data schemes. Comput. Stat. Data Anal. 56(9): 2609-2625 (2012) - [c5]Daniel Borleteau, Nicolas Bousquet, Thierry Crespo, Xavier Dubarry, Jan Eichholz, Virginie Galindo:
Security of Mobile Devices, Applications and Transactions. ISSE 2012: 149-160 - [c4]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. WG 2012: 308-319 - [i3]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012) - 2011
- [c3]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut is FPT. STOC 2011: 459-468 - 2010
- [c2]Nicolas Bousquet, Christof Löding:
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA 2010: 118-129 - [i2]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut is FPT. CoRR abs/1010.5197 (2010)
2000 – 2009
- 2009
- [c1]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo:
A Polynomial Kernel for Multicut in Trees. STACS 2009: 183-194 - [i1]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo:
A Polynomial Kernel For Multicut In Trees. CoRR abs/0902.1047 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 18:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
