Nicolas Bousquet
Nicolas Bousquet
CNRS, Laboratoire G-SCOP, Grenoble INP, Univ. Grenoble-Alpes
Verified email at - Homepage
Cited by
Cited by
Multicut is FPT
N Bousquet, J Daligault, S Thomassé
SIAM Journal on Computing 47 (1), 166-207, 2018
Recoloring graphs via tree decompositions
M Bonamy, N Bousquet
European Journal of Combinatorics 69, 200-213, 2018
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
A polynomial kernel for multicut in trees
N Bousquet, J Daligault, S Thomassé, A Yeo
arXiv preprint arXiv:0902.1047, 2009
Fast recoloring of sparse graphs
N Bousquet, G Perarnau
European Journal of Combinatorics 52, 1-11, 2016
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
VC-dimension and Erdős–Pósa property
N Bousquet, S Thomassé
Discrete Mathematics 338 (12), 2302-2317, 2015
The Erdös--Hajnal Conjecture for Long Holes and Antiholes
M Bonamy, N Bousquet, S Thomassé
SIAM Journal on Discrete Mathematics 30 (2), 1159-1164, 2016
Reconfiguring independent sets in cographs
M Bonamy, N Bousquet
arXiv preprint arXiv:1406.1433, 2014
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
A near-optimal mechanism for impartial selection
N Bousquet, S Norin, A Vetta
International Conference on Web and Internet Economics, 133-146, 2014
Clique versus independent set
N Bousquet, A Lagoutte, S Thomassé
European Journal of Combinatorics 40, 73-92, 2014
Token sliding on chordal graphs
M Bonamy, N Bousquet
International Workshop on Graph-Theoretic Concepts in Computer Science, 127-139, 2017
Adjacent vertex-distinguishing edge coloring of graphs
M Bonamy, N Bousquet, H Hocquard
The Seventh European Conference on Combinatorics, Graph Theory and …, 2013
Equivalence and inclusion problem for strongly unambiguous Büchi automata
N Bousquet, C Löding
International Conference on Language and Automata Theory and Applications …, 2010
Token jumping in minor-closed classes
N Bousquet, A Mary, A Parreau
International Symposium on Fundamentals of Computation Theory, 136-149, 2017
Coalition games on interaction graphs: a horticultural perspective
N Bousquet, Z Li, A Vetta
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 95-112, 2015
Distributed coloring in sparse graphs with fewer colors
P Aboulker, M Bonamy, N Bousquet, L Esperet
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
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
Brooksą theorem on powers of graphs
M Bonamy, N Bousquet
Discrete Mathematics 325, 12-16, 2014
The system can't perform the operation now. Try again later.
Articles 1–20