The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Stéphan Thomassé" ( http://dblp.L3S.de/Authors/Stéphan_Thomassé )

  Author page on DBLP  Author page in RDF  Community of Stéphan Thomassé in ASPL-2

Publication years (Num. hits)
1997-2006 (15) 2007-2009 (23) 2010-2011 (18) 2012-2013 (17) 2014-2015 (17) 2016-2018 (22) 2019 (10)
Publication types (Num. hits)
article(101) inproceedings(21)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 123 publication records. Showing 122 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Louis Esperet, Ross J. Kang, Stéphan Thomassé Separation Choosability and Dense Bipartite Induced Subgraphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Search on Bibsonomy Combinatorica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Mateusz Skomra, Stéphan Thomassé Convexly independent subsets of Minkowski sums of convex polygons. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant When Maximum Stable Set can be solved in FPT time. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu Coloring tournaments: From local to global. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, William Lochet, Stéphan Thomassé A proof of the Erdős-Sands-Sauer-Woodrow conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant When Maximum Stable Set Can Be Solved in FPT Time. Search on Bibsonomy ISAAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé Domination and Fractional Domination in Digraphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2018 DBLP  BibTeX  RDF
1Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé Additive Bases and Flows in Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant Parameterized Complexity of Independent Set in H-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé EPTAS for Max Clique on Disks and Unit Balls. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Tereza Klimosova, Stéphan Thomassé Edge-decomposing graphs into coprime forests. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Louis Esperet, Ross J. Kang, Stéphan Thomassé Separation choosability and dense bipartite induced subgraphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé Domination in tournaments. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé Multicut Is FPT. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé EPTAS for Max Clique on Disks and Unit Balls. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant Parameterized Complexity of Independent Set in H-Free Graphs. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé Coloring dense digraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tereza Klimosova, Stéphan Thomassé Decomposing graphs into paths and trees. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé Additive bases and flows in graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé A proof of the Barát-Thomassen conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé On the Complexity of Partial Derivatives. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé The Erdös-Hajnal Conjecture for Long Holes and Antiholes. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Irena Penev, Stéphan Thomassé, Nicolas Trotignon Isolating Highly Connected Induced Subgraphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Anthony Perez 0001, Stéphan Thomassé Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé On the complexity of partial derivatives. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon Perfect graphs of arbitrarily large clique-chromatic number. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pierre Aboulker, Zhentao Li, Stéphan Thomassé Excluding clocks. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé A $$\tau $$ τ -Conjecture for Newton Polygons. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Stéphan Thomassé VC-dimension and Erdős-Pósa property. Search on Bibsonomy Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé The Erdős-Hajnal conjecture for paths and antipaths. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh 0001, Stéphan Thomassé Hitting and Harvesting Pumpkins. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé Clique versus independent set. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim 0002, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Daniel Gonçalves 0001, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé Parameterized Domination in Circle Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Stéphan Thomassé VC-dimension and Erdős-Pósa property. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé Identifying codes in hereditary classes of graphs and VC-dimension. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Nicolas Delfosse, Zhentao Li, Stéphan Thomassé A note on the minimum distance of quantum LDPC codes. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Marthe Bonamy, Pierre Charbit, Stéphan Thomassé Graphs with large chromatic number induce $3k$-cycles. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nicolas Delfosse, Zhentao Li, Stéphan Thomassé A Note on the Minimum Distance of Quantum LDPC Codes. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott 0001, Paul D. Seymour, Stéphan Thomassé A counterexample to a conjecture of Schwartz. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé A linear vertex kernel for maximum internal spanning tree. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé A tau-conjecture for Newton polygons. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé Clique versus Independent Set Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic Parameterized algorithm for weighted independent set problem in bull-free graphs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé The Erdős-Hajnal Conjecture for Paths and Antipaths Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé Oriented trees in digraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott 0001, Paul D. Seymour, Stéphan Thomassé Tournaments and colouring. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé Graph coloring, communication complexity and the stubborn problem (Invited talk). Search on Bibsonomy STACS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Stéphan Thomassé Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé A stability theorem on fractional covering of triangles by edges. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé Packing and Covering Triangles in K 4-free Planar Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Daniel Gonçalves 0001, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé Parameterized Domination in Circle Graphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Bruno Grenet, Thierry Monteil 0002, Stéphan Thomassé Symmetric Determinantal Representations in Characteristic 2 Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel Gonçalves 0001, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé On spanning galaxies in digraphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jan van den Heuvel, Stéphan Thomassé Cyclic orderings and cyclic arboricity of matroids. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Daniel Gonçalves 0001, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé Parameterized Domination in Circle Graphs. Search on Bibsonomy WG The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Gonçalves 0001, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé The Domination Number of Grids. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo Kernel bounds for disjoint cycles and disjoint paths. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez 0001, Saket Saurabh 0001, Stéphan Thomassé Kernels for feedback arc set in tournaments. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Anthony Perez 0001, Stéphan Thomassé Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel Gonçalves 0001, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé The Domination Number of Grids Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh 0001, Stéphan Thomassé Hitting and Harvesting Pumpkins Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Flavio Guiñez, Martín Matamala, Stéphan Thomassé Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh 0001, Stéphan Thomassé Hitting and Harvesting Pumpkins. Search on Bibsonomy ESA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Anthony Perez 0001, Stéphan Thomassé Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé Multicut is FPT. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean Daligault, Michaël Rao, Stéphan Thomassé Well-Quasi-Order of Relabel Functions. Search on Bibsonomy Order The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé WDM and Directed Star Arboricity. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stéphan Thomassé A 4k2 kernel for feedback vertex set. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé Partitions versus sets: A case of duality. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé Multicut is FPT Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Matt DeVos, Stéphan Thomassé Edge Growth in Graph Cubes Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Stéphane Bessy, Stéphan Thomassé Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Daniel Gonçalves 0001, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet Spanning galaxies in digraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo A Polynomial Kernel For Multicut In Trees Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé Partitions versus sets : a case of duality Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé A Linear Vertex Kernel for Maximum Internal Spanning Tree Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez 0001, Saket Saurabh 0001, Stéphan Thomassé Kernels for Feedback Arc Set In Tournaments Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Jean Daligault, Stéphan Thomassé On Finding Directed Trees with Many Leaves Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Frédéric Havet, Stéphan Thomassé Complexity of (p, 1)-total labelling. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé Submodular partition functions. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé A Linear Vertex Kernel for Maximum Internal Spanning Tree. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Stéphan Thomassé A quadratic kernel for feedback vertex set. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo Kernel Bounds for Disjoint Cycles and Disjoint Paths. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo A Polynomial Kernel for Multicut in Trees. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez 0001, Saket Saurabh 0001, Stéphan Thomassé Kernels for Feedback Arc Set In Tournaments. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean Daligault, Stéphan Thomassé On Finding Directed Trees with Many Leaves. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé Finding a vector orthogonal to roughly half a collection of vectors. Search on Bibsonomy J. Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Frédéric Havet, Stéphan Thomassé, Anders Yeo Hoàng-Reed conjecture holds for tournaments. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 122 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license