33 results on '"Paul, Christophe"'
Search Results
2. The mixed search game against an agile and visible fugitive is monotone
3. A polynomial time algorithm to compute the connected treewidth of a series–parallel graph
4. Edge degeneracy: Algorithmic and structural results
5. On independent set in B1-EPG graphs
6. Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015
7. A polynomial-time algorithm for Outerplanar Diameter Improvement
8. Kinetic maintenance of mobile k-centres on trees
9. Edge-maximal graphs of branchwidth k: The k-branches
10. Vacuum-assisted large-core needle biopsy (VLNB) improves the management of patients with breast microcalcifications – Analysis of 1009 cases
11. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
12. Parameterized algorithms for min-max multiway cut and list digraph homomorphism
13. Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique
14. A single-exponential FPT algorithm for the K4-minor cover problem
15. Contracting chordal graphs and bipartite graphs to paths and trees
16. Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
17. Kernels for feedback arc set in tournaments
18. Polynomial kernels for 3-leaf power graph modification problems
19. A survey of the algorithmic aspects of modular decomposition
20. Branchwidth of chordal graphs
21. On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
22. A more efficient algorithm for perfect sorting by reversals
23. Competitive graph searches
24. Can transitive orientation make sandwich problems easier?
25. Edge-maximal graphs of branchwidth k
26. A simple linear time algorithm for cograph recognition
27. Distance labeling scheme and split decomposition
28. A note on finding all homogeneous set sandwiches
29. Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
30. Diameter determination on restricted graph families
31. A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
32. Approximate Distance Labeling Schemes
33. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.