default search action
Sylvain Guillemot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i7]Sylvain Guillemot:
Parameterized covering in semi-ladder-free hypergraphs. CoRR abs/2311.00466 (2023) - 2022
- [i6]Sylvain Guillemot:
Alternative polynomial-time algorithm for Bipartite Matching. CoRR abs/2211.00711 (2022)
2010 – 2019
- 2015
- [j12]David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. SIAM J. Comput. 44(2): 384-410 (2015) - 2014
- [c16]Sylvain Guillemot, Dániel Marx:
Finding small patterns in permutations in linear time. SODA 2014: 82-101 - 2013
- [j11]Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. Algorithmica 65(4): 828-844 (2013) - [j10]Sylvain Guillemot, Frédéric Havet, Christophe Paul
, Anthony Perez:
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. Algorithmica 65(4): 900-926 (2013) - [j9]Sylvain Guillemot, Dániel Marx:
A faster FPT algorithm for Bipartite Contraction. Inf. Process. Lett. 113(22-24): 906-912 (2013) - [j8]Sylvain Guillemot, Matthias Mnich
Kernel and fast algorithm for dense triplet inconsistency. Theor. Comput. Sci. 494: 134-143 (2013) - [c15]Sylvain Guillemot, Dániel Marx:
A Faster FPT Algorithm for Bipartite Contraction. IPEC 2013: 177-188 - [i5]Sylvain Guillemot, Dániel Marx:
A faster FPT algorithm for Bipartite Contraction. CoRR abs/1305.2743 (2013) - [i4]Sylvain Guillemot, Dániel Marx:
Finding small patterns in permutations in linear time. CoRR abs/1307.3073 (2013) - 2012
- [c14]David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. CPM 2012: 373-384 - 2011
- [j7]Sylvain Guillemot:
Parameterized complexity and approximability of the Longest Compatible Sequence problem. Discret. Optim. 8(1): 50-60 (2011) - [j6]Sylvain Guillemot:
FPT algorithms for path-transversal and cycle-transversal problems. Discret. Optim. 8(1): 61-71 (2011) - [j5]Sylvain Guillemot, Jesper Jansson
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 1141-1147 (2011) - [c13]Sylvain Guillemot:
Parameterized Algorithms for Inclusion of Linear Matchings. ISAAC 2011: 354-363 - 2010
- [j4]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
New results on optimizing rooted triplets consistency. Discret. Appl. Math. 158(11): 1136-1147 (2010) - [j3]Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 342-353 (2010) - [c12]Sylvain Guillemot, Christophe Paul
On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. IPEC 2010: 147-157 - [c11]Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. MFCS 2010: 405-416 - [c10]Sylvain Guillemot, Matthias Mnich
Kernel and Fast Algorithm for Dense Triplet Inconsistency. TAMC 2010: 247-257 - [i3]Sylvain Guillemot, Florian Sikora:
Finding and counting vertex-colored subtrees. CoRR abs/1002.1880 (2010) - [i2]Sylvain Guillemot, Christophe Paul, Anthony Perez:
On the (non-)existence of polynomial kernels for Pl-free edge modification problems. CoRR abs/1007.4011 (2010)
2000 – 2009
- 2009
- [j2]Sylvain Guillemot, François Nicolas, Vincent Berry
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discret. Appl. Math. 157(7): 1555-1570 (2009) - [j1]Vincent Berry
Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms 5(2): 23:1-23:18 (2009) - [c9]Sylvain Guillemot, Stéphane Vialette:
Pattern Matching for 321-Avoiding Permutations. ISAAC 2009: 1064-1073 - [c8]Sylvain Guillemot, Jesper Jansson
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. ISAAC 2009: 1205-1214 - 2008
- [b1]Sylvain Guillemot:
Approches Combinatoires pour le Consensus d'Arbres et de Séquences. (Combinatorial Approaches for the Consensus of Trees and Sequences). Montpellier 2 University, France, 2008 - [c7]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
New Results on Optimizing Rooted Triplets Consistency. ISAAC 2008: 484-495 - [c6]Sylvain Guillemot:
Parameterized Complexity and Approximability of the SLCS Problem. IWPEC 2008: 115-128 - [c5]Sylvain Guillemot:
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. IWPEC 2008: 129-140 - [i1]Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees. CoRR abs/0802.0024 (2008) - 2007
- [c4]Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. CPM 2007: 274-285 - 2006
- [c3]Sylvain Guillemot, François Nicolas:
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. CPM 2006: 165-176 - [c2]Sylvain Guillemot:
Parameterized Problems on Coincidence Graphs. ISAAC 2006: 253-266 - 2005
- [c1]Vincent Berry
On the Approximation of Computing Evolutionary Trees. COCOON 2005: 115-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: