The following pages link to Christophe Paul (Q221666):
Displaying 50 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- A note on finding all homogeneous set sandwiches (Q1014412) (← links)
- Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches (Q1024454) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Eclecticism shrinks even small worlds (Q2375296) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Competitive graph searches (Q2481952) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- (Q2752464) (← links)
- On Independent Set on B1-EPG Graphs (Q2788999) (← links)
- (Q2816089) (← links)
- A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem (Q2904548) (← links)
- (Q2911626) (← links)
- Kernels for Feedback Arc Set In Tournaments (Q2920111) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- (Q2965494) (← links)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619) (← links)
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs (Q3057623) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem (Q3088066) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Explicit Linear Kernels via Dynamic Programming (Q3195132) (← links)
- Optimal Distance Labeling for Interval Graphs and Related Graph Families (Q3395001) (← links)
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs (Q3438963) (← links)
