Author of the publication

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.

, , , and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 110-121. Springer, (2014)

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.

 

Other publications of authors with the same name

Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs., , , and . CoRR, (2015)Parameterizing above or below guaranteed values., , and . J. Comput. Syst. Sci., 75 (2): 137-153 (2009)The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles., , , and . Algorithmica, 68 (2): 504-530 (2014)Representing Trees of Higher Degree., , , , , and . Algorithmica, 43 (4): 275-292 (2005)On Parameterized Independent Feedback Vertex Set., , , and . Theor. Comput. Sci., (2012)Parameterized algorithms for feedback set problems and their duals in tournaments., and . Theor. Comput. Sci., 351 (3): 446-458 (2006)Succinct representations of permutations and functions., , , and . Theor. Comput. Sci., (2012)Upper and Lower Bounds for Weak Backdoor Set Detection., , , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 394-402. Springer, (2013)Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems., , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 139-151. Springer, (2006)Selection from Read-Only Memory and Sorting with Optimum Data Movement., and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 380-391. Springer, (1992)