Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDNicolas Trotignon
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j48]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part IV: Induced paths and cycles. J. Comb. Theory, Ser. B 146: 495-531 (2021)- 2020
- [j47]Emilie Diot, Marko Radovanovic
, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs. J. Comb. Theory, Ser. B 143: 123-147 (2020) - [j46]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part II: Structure theorem. J. Comb. Theory, Ser. B 143: 148-184 (2020) - [j45]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring. J. Comb. Theory, Ser. B 143: 185-218 (2020) - [i29]Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2 : bounds on treewidth. CoRR abs/2001.01607 (2020) - [i28]Chính Hoàng, Nicolas Trotignon:
A class of graphs of large rankwidth. CoRR abs/2007.11513 (2020) - [i27]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. CoRR abs/2008.05504 (2020)
2010 – 2019
- 2019
- [j44]Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Coloring square-free Berge graphs. J. Comb. Theory, Ser. B 135: 96-128 (2019) - [j43]Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic:
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92(2): 67-95 (2019) - [c3]Edin Husic, Stéphan Thomassé, Nicolas Trotignon:
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC 2019: 21:1-21:12 - [i26]Ni Luh Dewi Sintiari, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs. Part 1 : Layered wheels. CoRR abs/1906.10998 (2019) - [i25]Myriam Preissmann, Cléophée Robin, Nicolas Trotignon:
On the complexity of colouring antiprismatic graphs. CoRR abs/1910.11001 (2019) - [i24]Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR abs/1912.11246 (2019) - 2018
- [j42]Martin Milanic, Irena Penev, Nicolas Trotignon:
Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica 80(2): 415-447 (2018) - [j41]Nicolas Trotignon, Lan Anh Pham:
χ-bounds, operations, and chords. J. Graph Theory 88(2): 312-336 (2018) - [i23]Ngoc-Khang Le, Nicolas Trotignon:
Connected greedy colouring in claw-free graphs. CoRR abs/1805.01953 (2018) - 2017
- [j40]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica 77(3): 619-641 (2017) - [j39]Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon:
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231: 1-3 (2017) - [j38]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j37]Nicolas Trotignon, Kristina Vuskovic:
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. J. Graph Theory 84(3): 233-248 (2017) - [j36]Martin Milanic, Nicolas Trotignon:
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. J. Graph Theory 84(4): 536-551 (2017) - [j35]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017) - 2016
- [j34]Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory, Ser. B 116: 456-464 (2016) - [j33]Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. 30(1): 592-619 (2016) - [r1]Nicolas Trotignon:
LexBFS, Structure, and Algorithms. Encyclopedia of Algorithms 2016: 1103-1107 - [i22]Lan Anh Pham, Nicolas Trotignon:
$χ$-bounds, operations and chords. CoRR abs/1608.07413 (2016) - [i21]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. CoRR abs/1611.09907 (2016) - 2015
- [j32]Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic:
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338(5): 825-834 (2015) - [j31]Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Wheel-free planar graphs. Eur. J. Comb. 49: 57-67 (2015) - [j30]Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Z. Li, Raphael Carlos Santos Machado, Nicolas Trotignon:
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions. Electron. Notes Discret. Math. 50: 169-174 (2015) - [j29]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. J. Comb. Theory, Ser. B 115: 26-65 (2015) - [i20]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Colouring graphs with constraints on connectivity. CoRR abs/1505.01616 (2015) - 2014
- [j28]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs. Discret. Appl. Math. 164: 191-199 (2014) - [j27]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Linear Balanceable and Subcubic Balanceable Graphs. J. Graph Theory 75(2): 150-166 (2014) - [c2]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG 2014: 408-419 - [i19]Martin Milanic, Nicolas Trotignon:
Equistarable graphs and counterexamples to three conjectures on equistable graphs. CoRR abs/1407.1670 (2014) - 2013
- [j26]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Edge-colouring and total-colouring chordless graphs. Discret. Math. 313(14): 1547-1552 (2013) - [j25]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Substitution and χ-boundedness. J. Comb. Theory, Ser. B 103(5): 567-586 (2013) - [j24]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. J. Comb. Theory, Ser. B 103(5): 630-641 (2013) - [i18]Nicolas Trotignon:
Perfect graphs: a survey. CoRR abs/1301.5149 (2013) - [i17]Emilie Diot, Sébastien Tavenas, Nicolas Trotignon:
Detecting wheels. CoRR abs/1308.6433 (2013) - [i16]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. CoRR abs/1308.6444 (2013) - [i15]Frédéric Maffray, Nicolas Trotignon:
Algorithms for perfectly contractile graphs. CoRR abs/1309.0435 (2013) - [i14]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs. CoRR abs/1309.0694 (2013) - [i13]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. CoRR abs/1309.0971 (2013) - [i12]Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon:
The four-in-a-tree problem in triangle-free graphs. CoRR abs/1309.0978 (2013) - [i11]Wei Liu, Nicolas Trotignon:
The $k$-in-a-tree problem for graphs of girth at least~$k$. CoRR abs/1309.1279 (2013) - [i10]Nicolas Trotignon, Kristina Vuskovic:
Combinatorial optimization with 2-joins. CoRR abs/1309.1547 (2013) - [i9]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. CoRR abs/1309.1553 (2013) - [i8]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs that do not contain a cycle with a node that has at least two neighbors on it. CoRR abs/1309.1841 (2013) - [i7]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Edge-colouring and total-colouring chordless graphs. CoRR abs/1309.1842 (2013) - [i6]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. CoRR abs/1309.1960 (2013) - [i5]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Complexity of colouring problems restricted to unichord-free and \{square, unichord\}-free graphs. CoRR abs/1309.2749 (2013) - [i4]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR abs/1310.6205 (2013) - 2012
- [j23]Nicolas Trotignon, Kristina Vuskovic:
Combinatorial optimization with 2-joins. J. Comb. Theory, Ser. B 102(1): 153-185 (2012) - [j22]Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon:
On graphs with no induced subdivision of K4. J. Comb. Theory, Ser. B 102(4): 924-947 (2012) - [j21]András Gyárfás, András Sebö, Nicolas Trotignon:
The chromatic gap and its extremes. J. Comb. Theory, Ser. B 102(5): 1155-1178 (2012) - [j20]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. J. Discrete Algorithms 17: 60-66 (2012) - [j19]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71(1): 49-68 (2012) - [j18]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. SIAM J. Discret. Math. 26(4): 1510-1531 (2012) - [j17]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443: 10-24 (2012) - [i3]Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic:
LexBFS, structure and algorithms. CoRR abs/1205.2535 (2012) - 2011
- [j16]Maurice Pouzet, Hamza Si Kaddour, Nicolas Trotignon:
Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem. Contributions Discret. Math. 6(1) (2011) - [j15]Nicolas Trotignon, Kristina Vuskovic:
On Roussel-Rubio-type lemmas and their consequences. Discret. Math. 311(8-9): 684-687 (2011) - [j14]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37: 9-14 (2011) - [i2]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. CoRR abs/1107.3977 (2011) - 2010
- [j13]Wei Liu, Nicolas Trotignon:
The k-in-a-tree problem for graphs of girth at least k. Discret. Appl. Math. 158(15): 1644-1649 (2010) - [j12]Nicolas Trotignon, Kristina Vuskovic:
A structure theorem for graphs with no cycle with a unique chord and its consequences. J. Graph Theory 63(1): 31-67 (2010) - [c1]Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Chromatic Index of Chordless Graphs. CTW 2010: 51-54
2000 – 2009
- 2009
- [j11]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Discret. Appl. Math. 157(17): 3540-3551 (2009) - [j10]Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon:
The Four-in-a-Tree Problem in Triangle-Free Graphs. Graphs Comb. 25(4): 489-502 (2009) - [j9]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009) - 2008
- [j8]Nicolas Trotignon:
Decomposing Berge graphs and detecting balanced skew partitions. J. Comb. Theory, Ser. B 98(1): 173-225 (2008) - [j7]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discret. Math. 22(1): 51-71 (2008) - 2007
- [j6]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Electron. Notes Discret. Math. 29: 207-211 (2007) - 2006
- [j5]Frédéric Maffray, Nicolas Trotignon:
A class of perfectly contractile graphs. J. Comb. Theory, Ser. B 96(1): 1-19 (2006) - 2005
- [j4]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for 3PC(., .)-free Berge graphs. Electron. Notes Discret. Math. 22: 73-77 (2005) - [j3]Nicolas Trotignon:
On the structure of self-complementary graphs. Electron. Notes Discret. Math. 22: 79-82 (2005) - [j2]Frédéric Maffray, Nicolas Trotignon:
Algorithms for Perfectly Contractile Graphs. SIAM J. Discret. Math. 19(3): 553-574 (2005) - [i1]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. CoRR abs/cs/0504082 (2005) - 2004
- [b1]Nicolas Trotignon:
Graphes parfaits : structure et algorithmes. (Perfect graphs : structure and algorithms). Joseph Fourier University, Grenoble, France, 2004 - [j1]Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon:
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets. Eur. J. Comb. 25(5): 719-734 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-12-03 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
