( en | de | ru )

 

Disambiguation of "Paul, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
Abstract Milling with Turn Costs

, , , , , , and . CoRR, (2009)

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 Zerpka

Christophe Schwarz

Christophe Kunze

Christophe Bobda

Christophe Huber

 

Other publications of authors with the same name

Parameterized algorithms for min-max multiway cut and list digraph homomorphism., , , and . J. Comput. Syst. Sci., (2017)A survey on algorithmic aspects of modular decomposition, and . CoRR, (2009)Abstract Milling with Turn Costs, , , , , , and . CoRR, (2009)FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion., , , and . CoRR, (2015)An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion., , , and . Algorithmica, 79 (1): 66-95 (2017)An FPT 2-Approximation for Tree-Cut Decomposition., , , , and . Algorithmica, 80 (1): 116-135 (2018)Approximate Distance Labeling Schemes., , , , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 476-487. Springer, (2001)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)Linear time recognition of P4-indifference graphs., , and . Discret. Math. Theor. Comput. Sci., 4 (2): 173-178 (2001)Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs., , and . ACM Trans. Algorithms, 14 (3): 38:1-38:31 (2018)