( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exploring Subexponential Parameterized Complexity of Completion Problems.

, , , и . CoRR, (2013)

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.

Pål Sætrom

Pål Orten

Pål Nilsson

Pål Fugelli

Günter Drange

 

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

Fast Biclustering by Dual Parameterization., , , и . IPEC, том 43 из LIPIcs, стр. 402-413. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Exploring Subexponential Parameterized Complexity of Completion Problems., , , и . STACS, том 25 из LIPIcs, стр. 288-299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Correlation Clustering with Vertex Splitting., , , , и . SWAT, том 294 из LIPIcs, стр. 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)PACE Solver Description: Zygosity., , , , , и . IPEC, том 285 из LIPIcs, стр. 39:1-39:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Computational Complexity of Vertex Integrity and Component Order Connectivity., , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 285-297. Springer, (2014)On the threshold of intractability., , , и . J. Comput. Syst. Sci., (2022)A Polynomial Kernel for Trivially Perfect Editing., и . ESA, том 9294 из Lecture Notes in Computer Science, стр. 424-436. Springer, (2015)An O(c^k n) 5-Approximation Algorithm for Treewidth., , , , , и . FOCS, стр. 499-508. IEEE Computer Society, (2013)Two-Sets Cut-Uncut on Planar Graphs., , , , и . ICALP, том 297 из LIPIcs, стр. 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Leveraging Fixed-Parameter Tractability for Robot Inspection Planning., , , , , , , и . CoRR, (2024)