Nicolas Trotignon
72
Documents
Publications
- 15
- 12
- 8
- 7
- 7
- 6
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 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
- 13
- 10
- 5
- 4
- 4
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsWG 2014, Jun 2014, Orleans, France. pp.408-419
Conference papers
hal-01993372v1
|
|
Finding an induced subdivision of a digraphVI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. pp.09--14
Conference papers
inria-00638464v1
|
|
Decomposing Berge graphs and detecting balanced skew partitionsGraph Theory, organized by: Reinhard Diestel, Alexander Schrijver and Paul Seymour, Mar 2007, Oberwolfach, Germany
Conference papers
hal-00265245v1
|
|
Detecting induced subgraphsEUROCOMB'07, 2007, Seville, Spain. pp.207--211
Conference papers
hal-00265499v1
|
|
Algorithms for 3PC- free Berge graphsICGT'05, 2005, Hyères, France. pp.73-77
Conference papers
hal-00265501v1
|
|
On the structure of self-complementary graphsICGT'05, 2005, Hyères, France. pp.79-82
Conference papers
hal-00265500v1
|
|
Odd pair of cliquesGraph Theory 2004, a Conference in Memory of Claude Berge, 2004, Paris, France. pp.85-95
Conference papers
hal-00166915v1
|
LexBFS, Structure, and AlgorithmsEncyclopedia of Algorithms, Springer New York, pp.1103-1107, 2016
Book sections
hal-01995745v1
|
|
The four-in-a-tree problem in triangle-free graphs2008
Other publications
halshs-00270623v1
|
|
A structure theorem for graphs with no cycle with a unique chord and its consequences2008
Other publications
halshs-00265957v1
|
|
Detecting induced subgraphs2007
Other publications
halshs-00180953v1
|
|
On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph2007
Other publications
halshs-00180961v1
|
|
Decomposing Berge graphs2006
Other publications
halshs-00082823v1
|
|
Algorithms for square-3PC(.,.)-free Berge graphs2006
Other publications
halshs-00130439v1
|
|
Decomposing Berge graphs and detecting balanced skew partitions2006
Other publications
halshs-00115625v1
|
|
A new decomposition theorem for Berge graphs2005
Other publications
halshs-00196448v1
|
|
Maximum independent sets in (pyramid, even hole)-free graphs2021
Preprints, Working Papers, ...
hal-02424059v1
|
On the tree-width of even-hole-free graphs2021
Preprints, Working Papers, ...
hal-03107567v1
|
|
|
Coloring graphs with no induced subdivision of $K_4^+$2021
Preprints, Working Papers, ...
hal-03092640v1
|
|
A class of graphs with large rankwidth2020
Preprints, Working Papers, ...
hal-03029483v1
|
(Theta, triangle)-free and (even hole, $K_4$)-free graphs. Part 1 : Layered wheels2019
Preprints, Working Papers, ...
hal-02190126v1
|
|
On wheel-free graphs[Research Report] RR-7651, INRIA. 2011
Reports
inria-00602079v1
|
|
Finding an induced subdivision of a digraph[Research Report] RR-7430, INRIA. 2010
Reports
inria-00527518v1
|
|
Graphes parfaits : structure et algorithmesAutre [cs.OH]. Université Joseph-Fourier - Grenoble I, 2004. Français. ⟨NNT : ⟩
Theses
tel-00008558v1
|