641 results on '"Paul, Christophe"'
Search Results
52. A polynomial-time algorithm for Outerplanar Diameter Improvement
53. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
54. Parameterized algorithms for min-max multiway cut and list digraph homomorphism
55. Split Decomposition via Graph-Labelled Trees
56. Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique
57. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
58. Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
59. Bacterial spores, from ecology to biotechnology
60. Universal Obstructions of Graph Parameters
61. A single-exponential FPT algorithm for the [formula omitted]-minor cover problem
62. Reading as a Skill or as a Social Practice in French Immersion?
63. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
64. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
65. The 'Zygous Rule' applied to Blastozoan basal plates
66. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
67. A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
68. Contracting Graphs to Paths and Trees
69. Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem
70. Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
71. Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
72. Contracting chordal graphs and bipartite graphs to paths and trees
73. Polynomial Kernels for 3-Leaf Power Graph Modification Problems
74. The Structure of Level-k Phylogenetic Networks
75. Automatic acquisition of synonyms from French UMLS for enhanced search of EHRs.
76. Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
77. Perfect DCJ Rearrangement
78. Kinetic Maintenance of Mobile k-Centres on Trees
79. Dynamic Distance Hereditary Graphs Using Split Decomposition
80. Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework.
81. Generation of Graphs with Bounded Branchwidth
82. Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework
83. An FPT 2-Approximation for Tree-Cut Decomposition
84. Revisiting T. Uno and M. Yagiura’s Algorithm
85. New Tools and Simpler Algorithms for Branchwidth
86. Perfect Sorting by Reversals Is Not Always Difficult
87. On the Approximation of Computing Evolutionary Trees
88. Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
89. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
90. A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
91. Maximal Common Connected Sets of Interval Graphs
92. A Simple Linear Time LexBFS Cograph Recognition Algorithm
93. Optimal Distance Labeling for Interval and Circular-Arc Graphs
94. Typical Sequences Revisited — Computing Width Parameters of Graphs
95. Approximate Distance Labeling Schemes : Extended Abstract
96. Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
97. High diversity of lysis‐resistant cells upon the application of targeted physical and chemical lysis to environmental samples originating from three different water bodies
98. A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata
99. Diameter Determination on Restricted Graph Families
100. Kernels for feedback arc set in tournaments
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.