Nombre de documents

23

CV de Nicolas Bousquet


Communication dans un congrès7 documents

  • Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM: Current Trends in Theory and Practice of Computer Science, Jan 2014, High Tatras, Slovakia. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, 8327, pp.150-161, 2014, LNCS. <www.sofsem.sk>. <10.1007/978-3-319-04298-5_14>. <lirmm-01251025>
  • Marthe Bonamy, Nicolas Bousquet, Hervé Hocquard. Adjacent vertex-distinguishing edge coloring of graphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2013, Pise, Italy. pp.313-318, 2013, The Seventh European Conference on Combinatorics, Graph Theory and Applications. <10.1007/978-88-7642-475-5_50>. <lirmm-01264408>
  • Marthe Bonamy, Nicolas Bousquet. Recoloring bounded treewidth graphs. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, 2013, Playa del Carmen, Mexico. VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS) April 22-26, 2013 Playa del Carmen, Mexico, 44, pp.293-297, 2013, Electronic Notes in Discrete Mathematics. <10.1016/j.endm.2013.10.040>. <lirmm-01264399>
  • Nicolas Bousquet, Jean Daligault, Stéphan Thomassé. Multicut is FPT. STOC'11: Symposium on Theory of Computing, United States. pp.459-468, 2011. <lirmm-00741933>
  • Christof Loeding, Nicolas Bousquet. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. Dediu, Adrian Horia and Fernau, Henning and Martín-Vide, Carlos. LATA'10: Language and Automata Theory and Applications, Germany. Springer, 6031, pp.118-129, 2010, Lecture Notes in Computer Science. <lirmm-00741988>
  • Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau, et al.. Parameterized Domination in Circle Graphs. WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. LNCS (7551), pp.308-319, 2012, Graph-Theoretic Concepts in Computer Science. <https://sites.google.com/site/wg2012conf/>. <10.1007/978-3-642-34611-8_31>. <lirmm-00738534>
  • Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo. A Polynomial Kernel For Multicut In Trees. Susanne Albers and Jean-Yves Marion. STACS'2009: 26th International Symposium on Theoretical Aspects of Computer Science, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.183-194, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. <inria-00359171>

Article dans une revue9 documents

Pré-publication, Document de travail5 documents

  • Marthe Bonamy, Nicolas Bousquet. Reconfiguring Independent Sets in Cographs. 2017. <hal-01431388>
  • Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé. The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. 2017. <hal-01431381>
  • Nicolas Bousquet, Antoine Dailly, Eric Duchene, Hamamache Kheddouci, Aline Parreau. A Vizing-like theorem for union vertex-distinguishing edge coloring. 2016. <hal-01313088>
  • Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, et al.. χ-bounded families of oriented graphs. 2016. <hal-01412667>
  • Nicolas Bousquet, Thierry Klein, Vincent Moutoussamy. APPROXIMATION OF LIMIT STATE SURFACES IN MONOTONIC MONTE CARLO SETTINGS. 2015. <hal-01133340>

Rapport1 document

  • Rémi Watrigant, Nicolas Bousquet, Marin Bougeret, Rodolphe Giroudeau. Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs. [Research Report] RR-13033, LIRMM. 2013. <lirmm-00875132>

Thèse1 document

  • Nicolas Bousquet. Hitting sets : VC-dimension and Multicut. Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2013. English. <NNT : 2013MON20082>. <tel-01012106>