( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.

, , , , и . SODA, стр. 1419-1432. SIAM, (2017)

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.

Michal Wrochna

Marcin Wlodarski

Marcin Å0yszkiewicz

Marcin Grzegorzek

Marcin Tysiac

 

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

Treewidth-Pliability and PTAS for Max-CSPs., , и . SODA, стр. 473-483. SIAM, (2021)PTAS for Sparse General-Valued CSPs., , и . LICS, стр. 1-11. IEEE, (2021)On Directed Feedback Vertex Set Parameterized by Treewidth., , , , , и . WG, том 11159 из Lecture Notes in Computer Science, стр. 65-78. Springer, (2018)Edge Bipartization Faster Than 2^k., , и . IPEC, том 63 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor., , и . IPEC, том 89 из LIPIcs, стр. 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Integer Programming and Incidence Treedepth., , , , , и . IPCO, том 11480 из Lecture Notes in Computer Science, стр. 194-204. Springer, (2019)On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs., и . STACS, том 47 из LIPIcs, стр. 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems., , , и . SIAM J. Comput., 49 (6): 1232-1248 (2020)Reconfiguration over Tree Decompositions., , , и . IPEC, том 8894 из Lecture Notes in Computer Science, стр. 246-257. Springer, (2014)Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth., , , , и . ACM Trans. Algorithms, 14 (3): 34:1-34:45 (2018)