
NT
Nicolas Trotignon
81
Documents
Publications
15
13
10
8
8
6
6
6
5
5
3
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
15
10
6
5
4
3
3
3
2
2
1
1
1
1
1
1
1
1
Publications
|
Detecting $K_{2,3}$ as an Induced MinorIWOCA 2024, Jul 2024, Ischia, Italy. pp.151-164, ⟨10.1007/978-3-031-63021-7_12⟩
Communication dans un congrès
hal-04659728
v1
|
|
The Independent Set Problem Is FPT for Even-Hole-Free Graphs14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Sep 2019, Munchen, Germany. ⟨10.4230/LIPIcs.IPEC.2019.21⟩
Communication dans un congrès
hal-04635919
v1
|
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsWG 2014, Jun 2014, Orleans, France. pp.408-419
Communication dans un congrès
hal-01993372
v1
|
|
Finding an induced subdivision of a digraphVI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. pp.09--14
Communication dans un congrès
inria-00638464
v1
|
|
Odd pair of cliquesGraph Theory 2004, a Conference in Memory of Claude Berge, 2004, Paris, France. pp.85-95
Communication dans un congrès
hal-00166915
v1
|
|
Decomposing Berge graphs and detecting balanced skew partitionsGraph Theory, organized by: Reinhard Diestel, Alexander Schrijver and Paul Seymour, Mar 2007, Oberwolfach, Germany
Communication dans un congrès
hal-00265245
v1
|
|
Detecting induced subgraphsEUROCOMB'07, 2007, Seville, Spain. pp.207--211
Communication dans un congrès
hal-00265499
v1
|
|
On the structure of self-complementary graphsICGT'05, 2005, Hyères, France. pp.79-82
Communication dans un congrès
hal-00265500
v1
|
|
Algorithms for 3PC- free Berge graphsICGT'05, 2005, Hyères, France. pp.73-77
Communication dans un congrès
hal-00265501
v1
|
LexBFS, Structure, and AlgorithmsEncyclopedia of Algorithms, Springer New York, pp.1103-1107, 2016
Chapitre d'ouvrage
hal-01995745
v1
|
|
The four-in-a-tree problem in triangle-free graphs2008
Autre publication scientifique
halshs-00270623
v1
|
|
A structure theorem for graphs with no cycle with a unique chord and its consequences2008
Autre publication scientifique
halshs-00265957
v1
|
|
On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph2007
Autre publication scientifique
halshs-00180961
v1
|
|
Detecting induced subgraphs2007
Autre publication scientifique
halshs-00180953
v1
|
|
Decomposing Berge graphs2006
Autre publication scientifique
halshs-00082823
v1
|
|
Decomposing Berge graphs and detecting balanced skew partitions2006
Autre publication scientifique
halshs-00115625
v1
|
|
Algorithms for square-3PC(.,.)-free Berge graphs2006
Autre publication scientifique
halshs-00130439
v1
|
|
A new decomposition theorem for Berge graphs2005
Autre publication scientifique
halshs-00196448
v1
|
|
On the tree-width of even-hole-free graphs2021
Pré-publication, Document de travail
hal-03107567
v1
|
|
Coloring graphs with no induced subdivision of $K_4^+$2021
Pré-publication, Document de travail
hal-03092640
v1
|
|
Maximum independent sets in (pyramid, even hole)-free graphs2021
Pré-publication, Document de travail
hal-02424059
v1
|
|
A class of graphs with large rankwidth2020
Pré-publication, Document de travail
hal-03029483
v1
|
|
(Theta, triangle)-free and (even hole, $K_4$)-free graphs. Part 1 : Layered wheels2019
Pré-publication, Document de travail
hal-02190126
v1
|
|
On wheel-free graphs[Research Report] RR-7651, INRIA. 2011
Rapport
(rapport de recherche)
inria-00602079
v1
|
|
Finding an induced subdivision of a digraph[Research Report] RR-7430, INRIA. 2010
Rapport
(rapport de recherche)
inria-00527518
v1
|
|
Graphes parfaits : structure et algorithmesAutre [cs.OH]. Université Joseph-Fourier - Grenoble I, 2004. Français. ⟨NNT : ⟩
Thèse
tel-00008558
v1
|
Chargement...
Chargement...