Nombre de documents

8

CV de Nicolas Bousquet


Communication dans un congrès5 documents

  • 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>
  • 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>
  • 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, Jean Daligault, Stéphan Thomassé. Multicut is FPT. STOC'11: Symposium on Theory of Computing, United States. pp.459-468, 2011. <lirmm-00741933>
  • 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>

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>

Article dans une revue2 documents

  • Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau, et al.. Parameterized domination in circle graphs. Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72. <10.1007/s00224-013-9478-8>. <hal-01178188>
  • Stéphan Thomassé, Nicolas Bousquet. Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2012, 21, pp.512-514. <10.1017/S0963548312000065>. <lirmm-00741917>