| 2014 | SODA | Finding small patterns in permutations in linear time. | Sylvain Guillemot, Dniel Marx |
| 2012 | CPM | Fixed-Parameter Algorithms for Finding Agreement Supertrees. | David Fernndez-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati |
| 2011 | ISAAC | Parameterized Algorithms for Inclusion of Linear Matchings. | Sylvain Guillemot |
| 2010 | MFCS | Finding and Counting Vertex-Colored Subtrees. | Sylvain Guillemot, Florian Sikora |
| 2010 | TAMC | Kernel and Fast Algorithm for Dense Triplet Inconsistency. | Sylvain Guillemot, Matthias Mnich |
| 2009 | ISAAC | Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. | Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung |
| 2009 | ISAAC | Pattern Matching for 321-Avoiding Permutations. | Sylvain Guillemot, Stphane Vialette |
| 2008 | ISAAC | New Results on Optimizing Rooted Triplets Consistency. | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson |
| 2007 | CPM | Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. | Sylvain Guillemot, Vincent Berry |
| 2006 | CPM | Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. | Sylvain Guillemot, Franois Nicolas |
| 2006 | ISAAC | Parameterized Problems on Coincidence Graphs. | Sylvain Guillemot |
| 2005 | COCOON | On the Approximation of Computing Evolutionary Trees. | Vincent Berry, Sylvain Guillemot, Franois Nicolas, Christophe Paul |