Nicolas Bousquet

Cited by

	All	Since 2018
Citations	1031	770
h-index	19	16
i10-index	27	24

240

120

180

201020112012201320142015201620172018201920202021202220234 19 18 31 30 41 55 54 71 101 114 170 230 83

Public access

View all

26 articles

1 article

available

not available

Based on funding mandates

Co-authors

Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
Théo PierronUniversité de LyonVerified email at univ-lyon1.fr
Aurélie LagoutteLIMOS, Université Clermont Auvergne, FranceVerified email at uca.fr
Laurent FeuilloleyCNRS, LIRIS, Université Lyon 1, Univ. LyonVerified email at univ-lyon1.fr
Adrian VettaProfessor of Mathematics/ Professor of Computer Science, McGill UniversityVerified email at math.mcgill.ca
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Guillem PerarnauUniversitat Politècnica de CatalunyaVerified email at upc.edu
François PirotAssociate Professor, Université Paris-SaclayVerified email at lisn.fr
Kunihiro WasaHosei UniversityVerified email at hosei.ac.jp
Yusuke KOBAYASHIKyoto UniversityVerified email at kurims.kyoto-u.ac.jp
Carl FeghaliENS Lyon, LIPVerified email at ens-lyon.fr
Paul OuvrardLaBRI, Université de BordeauxVerified email at u-bordeaux.fr
Moritz MühlenthalerMaître de Conférences, Laboratoire G-SCOP, GrenobleVerified email at grenoble-inp.fr
Alex ScottProfessor of Mathematics, University of OxfordVerified email at maths.ox.ac.uk
Carla GroenlandUtrecht UniversityVerified email at uu.nl
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Matthew JohnsonProfessor in Computer Science, Durham UniversityVerified email at dur.ac.uk
Sergey NorinAssociate Professor, McGill UniversityVerified email at math.mcgill.ca
Anders YeoUniversity of Southern DenmarkVerified email at imada.sdu.dk
Christophe PaulCNRS LIRMMVerified email at lirmm.fr

Nicolas Bousquet

CNRS, LIRIS, University Lyon 1, Univ. de Lyon

Verified email at liris.cnrs.fr - Homepage

graph theory algorithms combinatorics economic game theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Multicut is FPT N Bousquet, J Daligault, S Thomassé Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	108	2011
Recoloring graphs via tree decompositions M Bonamy, N Bousquet European Journal of Combinatorics 69, 200-213, 2018	92*	2018
Fast recoloring of sparse graphs N Bousquet, G Perarnau European Journal of Combinatorics 52, 1-11, 2016	42	2016
On a conjecture of Mohar concerning Kempe equivalence of regular graphs M Bonamy, N Bousquet, C Feghali, M Johnson Journal of Combinatorial Theory, Series B 135, 179-199, 2019	37	2019
Token sliding on chordal graphs M Bonamy, N Bousquet Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017	37	2017
VC-dimension and Erdős–Pósa property N Bousquet, S Thomassé Discrete Mathematics 338 (12), 2302-2317, 2015	37	2015
The Erdős–Hajnal conjecture for paths and antipaths N Bousquet, A Lagoutte, S Thomassé Journal of Combinatorial Theory, Series B 113, 261-264, 2015	36	2015
Identifying codes in hereditary classes of graphs and VC-dimension N Bousquet, A Lagoutte, Z Li, A Parreau, S Thomassé SIAM Journal on Discrete Mathematics 29 (4), 2047-2064, 2015	36	2015
A near-optimal mechanism for impartial selection N Bousquet, S Norin, A Vetta Web and Internet Economics: 10th International Conference, WINE 2014 …, 2014	30	2014
A polynomial kernel for multicut in trees N Bousquet, J Daligault, S Thomassé, A Yeo arXiv preprint arXiv:0902.1047, 2009	29	2009
A polynomial version of Cereceda's conjecture N Bousquet, M Heinrich Journal of Combinatorial Theory, Series B 155, 1-16, 2022	24	2022
The Erdös--Hajnal Conjecture for Long Holes and Antiholes M Bonamy, N Bousquet, S Thomassé SIAM Journal on Discrete Mathematics 30 (2), 1159-1164, 2016	24	2016
Token jumping in minor-closed classes N Bousquet, A Mary, A Parreau Fundamentals of Computation Theory: 21st International Symposium, FCT 2017 …, 2017	23	2017
Reconfiguring independent sets in cographs M Bonamy, N Bousquet arXiv preprint arXiv:1406.1433, 2014	23	2014
Parameterized complexity of independent set in H-free graphs É Bonnet, N Bousquet, P Charbit, S Thomassé, R Watrigant Algorithmica 82 (8), 2360-2394, 2020	22	2020
EPTAS for max clique on disks and unit balls M Bonamy, E Bonnet, N Bousquet, P Charbit, S Thomassé 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018	22*	2018
Clique versus independent set N Bousquet, A Lagoutte, S Thomassé European Journal of Combinatorics 40, 73-92, 2014	22	2014
Equivalence and inclusion problem for strongly unambiguous Büchi automata N Bousquet, C Löding Language and Automata Theory and Applications: 4th International Conference …, 2010	22	2010
Adjacent vertex-distinguishing edge coloring of graphs M Bonamy, N Bousquet, H Hocquard The Seventh European Conference on Combinatorics, Graph Theory and …, 2013	21	2013
The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019	19	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors