Author of the publication

A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem.

. Inf. Process. Lett., 104 (2): 53-58 (2007)

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

A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem.. Inf. Process. Lett., 104 (2): 53-58 (2007)Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 142-152. Springer, (2012)Tree-width dichotomy., and . CoRR, (2020)Complexity Analysis of Generalized and Fractional Hypertree Decompositions., , , and . J. ACM, 68 (5): 38:1-38:50 (2021)Linear read-once and related Boolean functions., , , , and . Discret. Appl. Math., (2018)Generalizing Global Constraints Based on Network Flows., , and . CSCLP, volume 5129 of Lecture Notes in Computer Science, page 127-141. Springer, (2007)Complexity Analysis of Heuristic CSP Search Algorithms.. CSCLP, volume 3978 of Lecture Notes in Computer Science, page 88-99. Springer, (2005)Querying the Deep Web: Back to the Foundations., , , and . AMW, volume 1912 of CEUR Workshop Proceedings, CEUR-WS.org, (2017)CSP Search with Responsibility Sets and Kernels., and . IJCAI, page 1533-1534. Professional Book Center, (2005)Specifying a positive threshold function via extremal points., , , , and . ALT, volume 76 of Proceedings of Machine Learning Research, page 208-222. PMLR, (2017)