( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.

, , , , и . Theory Comput. Syst., 41 (3): 479-492 (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.

Frances Allen

Frances Buttelmann

Frances McGinnity

Daniela Frances

Frances Livings

 

Другие публикации лиц с тем же именем

Parameterized approximation of dominating set problems., , , и . Inf. Process. Lett., 109 (1): 68-70 (2008)Clique-Width is NP-Complete., , , и . SIAM J. Discret. Math., 23 (2): 909-939 (2009)Parameterized approximation via fidelity preserving transformations., , , и . J. Comput. Syst. Sci., (2018)Abstract Milling with Turn Costs, , , , , , и . CoRR, (2009)Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors., , и . Algorithms, 13 (9): 236 (2020)The Complexity of Polynomial-Time Approximation., , , и . Theory Comput. Syst., 41 (3): 459-477 (2007)On the parameterized complexity of multiple-interval graph problems., , , и . Theor. Comput. Sci., 410 (1): 53-61 (2009)Local Search: Is Brute-Force Avoidable?, , , , , и . IJCAI, стр. 486-491. (2009)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 268-277. Springer, (2007)Distortion Is Fixed Parameter Tractable., , , , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 463-474. Springer, (2009)