The following pages link to Sylvain Guillemot (Q391096):
Displaying 27 items.
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- (Q456696) (redirect page) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Robustness of phylogenetic inference based on minimum evolution (Q611949) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q2904511) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Parameterized Algorithms for Inclusion of Linear Matchings (Q3104630) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem (Q3506929) (← links)
- Kernel and Fast Algorithm for Dense Triplet Inconsistency (Q3569080) (← links)
- Finding and Counting Vertex-Colored Subtrees (Q3586101) (← links)
- New Results on Optimizing Rooted Triplets Consistency (Q3596743) (← links)
- Pattern Matching for 321-Avoiding Permutations (Q3652292) (← links)
- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets (Q3652305) (← links)
- Linear time 3-approximation for the MAST problem (Q4962789) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees (Q5307503) (← links)
- Finding small patterns in permutations in linear time (Q5383966) (← links)
- Parameterized Problems on Coincidence Graphs (Q5459121) (← links)
- Computing and Combinatorics (Q5716929) (← links)
