12 results on '"Paul, Christophe"'
Search Results
2. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
3. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
4. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
5. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
6. Parameterized Domination in Circle Graphs
7. Parameterized Domination in Circle Graphs
8. A polynomial time algorithm to compute the connected treewidth of a series–parallel graph.
9. Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
10. EXPLICIT LINEAR KERNELS VIA DYNAMIC PROGRAMMING.
11. A polynomial-time algorithm for Outerplanar Diameter Improvement.
12. A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.