Spremljaj
Nicolas Bousquet
Nicolas Bousquet
CNRS, LIRIS, University Lyon 1, Univ. de Lyon
Preverjeni e-poštni naslov na liris.cnrs.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
Multicut is FPT
N Bousquet, J Daligault, S Thomassé
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1132011
Recoloring graphs via tree decompositions
M Bonamy, N Bousquet
European Journal of Combinatorics 69, 200-213, 2018
91*2018
Fast recoloring of sparse graphs
N Bousquet, G Perarnau
European Journal of Combinatorics 52, 1-11, 2016
402016
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
362019
Token sliding on chordal graphs
M Bonamy, N Bousquet
International Workshop on Graph-Theoretic Concepts in Computer Science, 127-139, 2017
362017
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
362015
VC-dimension and Erdős–Pósa property
N Bousquet, S Thomassé
Discrete Mathematics 338 (12), 2302-2317, 2015
342015
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
342015
A polynomial kernel for multicut in trees
N Bousquet, J Daligault, S Thomassé, A Yeo
arXiv preprint arXiv:0902.1047, 2009
312009
A near-optimal mechanism for impartial selection
N Bousquet, S Norin, A Vetta
International Conference on Web and Internet Economics, 133-146, 2014
272014
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
232016
A polynomial version of Cereceda's conjecture
N Bousquet, M Heinrich
Journal of Combinatorial Theory, Series B 155, 1-16, 2022
222022
Token jumping in minor-closed classes
N Bousquet, A Mary, A Parreau
International Symposium on Fundamentals of Computation Theory, 136-149, 2017
222017
Clique versus independent set
N Bousquet, A Lagoutte, S Thomassé
European Journal of Combinatorics 40, 73-92, 2014
222014
Reconfiguring independent sets in cographs
M Bonamy, N Bousquet
arXiv preprint arXiv:1406.1433, 2014
222014
Parameterized complexity of independent set in H-free graphs
É Bonnet, N Bousquet, P Charbit, S Thomassé, R Watrigant
Algorithmica 82 (8), 2360-2394, 2020
202020
Adjacent vertex-distinguishing edge coloring of graphs
M Bonamy, N Bousquet, H Hocquard
The Seventh European Conference on Combinatorics, Graph Theory and …, 2013
202013
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
202010
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
192019
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
19*2018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20