( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.

, , , , и . COCOA, том 8881 из Lecture Notes in Computer Science, стр. 625-636. 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.

Frances Allen

Frances Buttelmann

Frances McGinnity

Daniela Frances

Frances Dielmann

 

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

Efficient Parameterized Preprocessing for Cluster Editing., , , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 312-321. Springer, (2007)Local Search: Is Brute-Force Avoidable?, , , , , и . IJCAI, стр. 486-491. (2009)Distortion Is Fixed Parameter Tractable., , , , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 463-474. Springer, (2009)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 268-277. Springer, (2007)On the parameterized complexity of multiple-interval graph problems., , , и . Theor. Comput. Sci., 410 (1): 53-61 (2009)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , и 2 other автор(ы). GD, том 2265 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2001)Clustering with Partial Information., , , , , и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 144-155. Springer, (2008)On the Parameterized Complexity of Layered Graph Drawing., , , , , , , , , и 2 other автор(ы). ESA, том 2161 из Lecture Notes in Computer Science, стр. 488-499. Springer, (2001)Local search: Is brute-force avoidable?, , , , , и . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number., , , , и . Discret. Appl. Math., (2018)