The following pages link to Christophe Paul (Q221666):
Displaying 49 items.
- Edge-maximal graphs of branchwidth k (Q3439366) (← links)
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (Q3521955) (← links)
- Generation of Graphs with Bounded Branchwidth (Q3522958) (← links)
- (Q3549635) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- Interval Completion Is Fixed Parameter Tractable (Q3642873) (← links)
- A Simple Linear Time LexBFS Cograph Recognition Algorithm (Q3648499) (← links)
- Polynomial Kernels for 3-Leaf Power Graph Modification Problems (Q3651535) (← links)
- (Q4232788) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (Q4554366) (← links)
- Strong immersion is a well‐quasi‐ordering for semicomplete digraphs (Q4632018) (← links)
- (Q4796196) (← links)
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (Q4962217) (← links)
- Linear time 3-approximation for the MAST problem (Q4962789) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5089215) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs (Q5111401) (← links)
- (Q5111862) (← links)
- Parameterized Domination in Circle Graphs (Q5200517) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- Combinatorial Pattern Matching (Q5315344) (← links)
- Algorithm Theory - SWAT 2004 (Q5315370) (← links)
- Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (Q5363762) (← links)
- An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (Q5363767) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- Kinetic Maintenance of Mobile k-Centres on Trees (Q5387769) (← links)
- Obtaining a Bipartite Graph by Contracting Few Edges (Q5408613) (← links)
- Algorithms – ESA 2005 (Q5475848) (← links)
- Eclecticism shrinks even small worlds (Q5501496) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710825) (← links)
- Computing and Combinatorics (Q5716929) (← links)
- (Q5874536) (← links)
- Connected Search for a Lazy Robber (Q5875639) (← links)
- Hitting and Harvesting Pumpkins (Q5892008) (← links)
- Algorithms - ESA 2003 (Q5897251) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897542) (← links)
- Algorithms and Computation (Q5897848) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902515) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- Hierarchical Clusterings of Unweighted Graphs (Q6346660) (← links)
- Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces (Q6733831) (← links)
- Obstructions to Erdős-Pósa Dualities for Minors (Q6736368) (← links)
- Twin-width one (Q6760707) (← links)
