Stéphan Thomassé
Orcid: 0000-0002-7090-1790
According to our database1,
Stéphan Thomassé
authored at least 135 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs.
SIAM J. Comput., February, 2024
SIAM J. Comput., 2024
J. Comb. Theory B, 2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Maximum Independent Set when excluding an induced minor: K<sub>1</sub> + tK<sub>2</sub> and tC<sub>3</sub> ⊎ C<sub>4</sub>.
CoRR, 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Degeneracy of <i>P</i><sub><i>t</i></sub>-free and <i>C</i><sub>⩾<i>t</i></sub>-free graphs with no large complete bipartite subgraphs.
J. Comb. Theory B, 2022
CoRR, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
(Theta, triangle)-free and (even hole, K<sub>4</sub>)-free graphs. Part 2: Bounds on treewidth.
J. Graph Theory, 2021
J. ACM, 2021
Discret. Math., 2021
2020
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five.
SIAM J. Discret. Math., 2020
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Testing Balanced Splitting Cycles in Complete Triangulations.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
ACM Trans. Algorithms, 2019
Comb. Probab. Comput., 2019
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.
CoRR, 2019
Electron. J. Comb., 2019
Comb., 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Algorithmica, 2017
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
2016
SIAM J. Discret. Math., 2016
Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique.
J. Comput. Syst. Sci., 2016
2015
SIAM J. Discret. Math., 2015
2014
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.
J. Graph Theory, 2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2013
J. Comput. Syst. Sci., 2013
CoRR, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
2012
Eur. J. Comb., 2012
Comb. Probab. Comput., 2012
2011
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem.
Discret. Appl. Math., 2011
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems
CoRR, 2011
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
2010
J. Comb. Theory B, 2010
2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
2008
J. Complex., 2008
Proceedings of the Algorithm Theory, 2008
2007
Comb. Probab. Comput., 2007
Comb., 2007
2006
2005
Discret. Math., 2005
2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Every strong digraph has a spanning strong subgraph with at most <i>n</i>+2 alpha-2 arcs.
J. Comb. Theory B, 2003
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
Discret. Appl. Math., 2003
2002
Eur. J. Comb., 2002
2001
J. Comb. Theory B, 2001
2000
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.
J. Graph Theory, 2000
J. Comb. Theory B, 2000
1998
1997