( en | de | ru )

 

Disambiguation of "Paul, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christophe Kunze

Christophe Bobda

Christophe Huber

Christophe Zerpka

Christophe Schwarz

 

Other publications of authors with the same name

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs., , and . ACM Trans. Algorithms, 14 (3): 38:1-38:31 (2018)Linear time recognition of P4-indifference graphs., , and . Discret. Math. Theor. Comput. Sci., 4 (2): 173-178 (2001)An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion., , , and . Algorithmica, 79 (1): 66-95 (2017)Hierarchical Clusterings of Unweighted Graphs., , and . MFCS, volume 170 of LIPIcs, page 47:1-47:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Chordal Graphs and Their Clique Graphs., , and . WG, volume 1017 of Lecture Notes in Computer Science, page 358-371. Springer, (1995)Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations., , , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 634-645. Springer, (2008)Approximate Distance Labeling Schemes., , , , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 476-487. Springer, (2001)An FPT 2-Approximation for Tree-cut Decomposition., , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 35-46. Springer, (2015)Diameter Determination on Restricted Graph Faminlies., , , and . WG, volume 1517 of Lecture Notes in Computer Science, page 192-202. Springer, (1998)Connected Search for a Lazy Robber., , and . FSTTCS, volume 150 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)