Nicolas Trotignon
Publications
Publications
|
|
Induced Disjoint Paths Without an Induced MinorICALP 2025, Jul 2025, Aarhus, Denmark |
|
|
Detecting $K_{2,3}$ as an Induced MinorIWOCA 2024, Jul 2024, Ischia, Italy. pp.151-164, ⟨10.1007/978-3-031-63021-7_12⟩ |
|
|
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⟩ |
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsWG 2014, Jun 2014, Orleans, France. pp.408-419 |
|
Finding an induced subdivision of a digraphVI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. pp.09--14 |
|
Decomposing Berge graphs and detecting balanced skew partitionsGraph Theory, organized by: Reinhard Diestel, Alexander Schrijver and Paul Seymour, Mar 2007, Oberwolfach, Germany |
|
Odd pair of cliquesGraph Theory 2004, a Conference in Memory of Claude Berge, 2004, Paris, France. pp.85-95 |
|
Detecting induced subgraphsEUROCOMB'07, 2007, Seville, Spain. pp.207--211 |
|
On the structure of self-complementary graphsICGT'05, 2005, Hyères, France. pp.79-82 |
|
Algorithms for 3PC- free Berge graphsICGT'05, 2005, Hyères, France. pp.73-77 |
LexBFS, Structure, and AlgorithmsEncyclopedia of Algorithms, Springer New York, pp.1103-1107, 2016 |
|
|
The four-in-a-tree problem in triangle-free graphs2008 |
|
|
A structure theorem for graphs with no cycle with a unique chord and its consequences2008 |
|
|
Detecting induced subgraphs2007 |
|
|
On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph2007 |
|
|
Decomposing Berge graphs and detecting balanced skew partitions2006 |
|
|
Decomposing Berge graphs2006 |
|
|
Algorithms for square-3PC(.,.)-free Berge graphs2006 |
|
|
A new decomposition theorem for Berge graphs2005 |
|
|
Every Graph is Essential to Large Treewidth2025 |
|
|
A tamed family of triangle-free graphs with unbounded chromatic number2025 |
|
|
Coloring graphs with no induced subdivision of $K_4^+$2021 |
|
|
On the tree-width of even-hole-free graphs2021 |
|
|
Maximum independent sets in (pyramid, even hole)-free graphs2021 |
|
|
A class of graphs with large rankwidth2020 |
|
|
(Theta, triangle)-free and (even hole, $K_4$)-free graphs. Part 1 : Layered wheels2019 |
|
|
On wheel-free graphs[Research Report] RR-7651, INRIA. 2011 |
|
|
Finding an induced subdivision of a digraph[Research Report] RR-7430, INRIA. 2010 |
|
|
Graphes parfaits : structure et algorithmesAutre [cs.OH]. Université Joseph-Fourier - Grenoble I, 2004. Français. ⟨NNT : ⟩ |