On the Approximation of Computing Evolutionary Trees. - Vincent Berry; Sylvain Guillemot; François Nicolas; Christophe Paul (COCOON, 2005)

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. - Sylvain Guillemot; François Nicolas (CPM, 2006)

Parameterized Problems on Coincidence Graphs. - Sylvain Guillemot (ISAAC, 2006)

Parameterized Complexity and Approximability of the SLCS Problem. - Sylvain Guillemot (IWPEC, 2008)

FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. - Sylvain Guillemot (IWPEC, 2008)

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

Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. - Sylvain Guillemot; Jesper Jansson 001; Wing-Kin Sung (ISAAC, 2009)

Pattern Matching for 321-Avoiding Permutations. - Sylvain Guillemot; Stéphane Vialette (ISAAC, 2009)

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. - Sylvain Guillemot; François Nicolas; Vincent Berry; Christophe Paul (Discret. Appl. Math., 2009)

Linear time 3-approximation for the MAST problem. - Vincent Berry; Christophe Paul; Sylvain Guillemot; François Nicolas (ACM Trans. Algorithms, 2009)

On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (IPEC, 2010)

On the (non-)existence of polynomial kernels for Pl-free edge modification problems - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (CoRR, 2010)

New results on optimizing rooted triplets consistency. - Jaroslaw Byrka; Sylvain Guillemot; Jesper Jansson 001 (Discret. Appl. Math., 2010)

Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. - Sylvain Guillemot; Vincent Berry (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Parameterized Algorithms for Inclusion of Linear Matchings. - Sylvain Guillemot (ISAAC, 2011)

Parameterized complexity and approximability of the Longest Compatible Sequence problem. - Sylvain Guillemot (Discret. Optim., 2011)

FPT algorithms for path-transversal and cycle-transversal problems. - Sylvain Guillemot (Discret. Optim., 2011)

Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. - Sylvain Guillemot; Jesper Jansson 001; Wing-Kin Sung (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. - Sylvain Guillemot; Frédéric Havet; Christophe Paul; Anthony Perez 001 (Algorithmica, 2013)

Finding and Counting Vertex-Colored Subtrees. - Sylvain Guillemot; Florian Sikora (Algorithmica, 2013)

A faster FPT algorithm for Bipartite Contraction. - Sylvain Guillemot; Dániel Marx (Inf. Process. Lett., 2013)

Kernel and fast algorithm for dense triplet inconsistency. - Sylvain Guillemot; Matthias Mnich (Theor. Comput. Sci., 2013)

Finding small patterns in permutations in linear time. - Sylvain Guillemot; Dániel Marx (SODA, 2014)

Fixed-Parameter Algorithms for Finding Agreement Supertrees. - David Fernández-Baca; Sylvain Guillemot; Brad Shutters; Sudheer Vakati (SIAM J. Comput., 2015)

Alternative polynomial-time algorithm for Bipartite Matching. - Sylvain Guillemot (CoRR, 2022)

Parameterized covering in semi-ladder-free hypergraphs. - Sylvain Guillemot (ACM Trans. Comput. Theory, 2025)