26 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 [formula omitted]-EPG graphs
6. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
7. Contracting chordal graphs and bipartite graphs to paths and trees
8. Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
9. Polynomial kernels for 3-leaf power graph modification problems
10. Branchwidth of chordal graphs
11. Kinetic maintenance of mobile [formula omitted]-centres on trees
12. On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
13. Edge-maximal graphs of branchwidth [formula omitted]: The [formula omitted]-branches
14. Competitive graph searches
15. Can transitive orientation make sandwich problems easier?
16. A simple linear time algorithm for cograph recognition
17. Distance labeling scheme and split decomposition
18. Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
19. Diameter determination on restricted graph families
20. Approximate Distance Labeling Schemes
21. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
22. A more efficient algorithm for perfect sorting by reversals
23. Edge-maximal graphs of branchwidth k
24. Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015
25. A survey of the algorithmic aspects of modular decomposition.
26. A note on finding all homogeneous set sandwiches
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.