Sylvain Guillemot

Orcid: 0009-0004-8888-5153

According to our database1, Sylvain Guillemot authored at least 26 papers between 2005 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Parameterized covering in semi-ladder-free hypergraphs.
ACM Trans. Comput. Theory, June, 2025

2022
Alternative polynomial-time algorithm for Bipartite Matching.
CoRR, 2022

2014
Finding small patterns in permutations in linear time.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
On the (Non-)Existence of Polynomial Kernels for <i>P</i> <sub> <i>l</i> </sub>-Free Edge Modification Problems.
Algorithmica, 2013

A Faster FPT Algorithm for Bipartite Contraction.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012
Fixed-Parameter Algorithms for Finding Agreement Supertrees.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

FPT algorithms for path-transversal and cycle-transversal problems.
Discret. Optim., 2011

Parameterized complexity and approximability of the Longest Compatible Sequence problem.
Discret. Optim., 2011

Parameterized Algorithms for Inclusion of Linear Matchings.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
On the (non-)existence of polynomial kernels for Pl-free edge modification problems
CoRR, 2010

Kernel and Fast Algorithm for Dense Triplet Inconsistency.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Finding and Counting Vertex-Colored Subtrees.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

On the (Non-)existence of Polynomial Kernels for <i>P</i><sub><i>l</i></sub>-free Edge Modification Problems.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009
Linear time 3-approximation for the MAST problem.
ACM Trans. Algorithms, 2009

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.
Discret. Appl. Math., 2009

Pattern Matching for 321-Avoiding Permutations.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Approches Combinatoires pour le Consensus d'Arbres et de Séquences. (Combinatorial Approaches for the Consensus of Trees and Sequences).
PhD thesis, 2008

FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Parameterized Complexity and Approximability of the SLCS Problem.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

New Results on Optimizing Rooted Triplets Consistency.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Parameterized Problems on Coincidence Graphs.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
On the Approximation of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005


  Loading...