( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity of the Steiner Network Problem with Respect to the Number of Terminals.

, , , и . STACS, том 126 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Ondrej Burkacky

Ondrej Kuncar

Kurt Suchy

Ulrich Suchy

Herbert Suchy

 

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

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation., , , и . SIAM J. Discret. Math., 30 (3): 1371-1384 (2016)Solving Multicut Faster Than 2 n., , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 666-676. Springer, (2014)Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound., , , и . FSTTCS, том 18 из LIPIcs, стр. 412-423. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Parameterized Problems Related to Seidel's Switching., , , и . Discret. Math. Theor. Comput. Sci., 13 (2): 19-44 (2011)Waypoint Routing on Bounded Treewidth Graphs., и . CoRR, (2020)On Kernels for d-Path Vertex Cover., , и . CoRR, (2021)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , и . IPEC, том 285 из LIPIcs, стр. 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Parameterized Complexity View on Collapsing k-Cores., , и . IPEC, том 115 из LIPIcs, стр. 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Predictive control of PMSM using improved model of the drive., , , и . IECON, стр. 1-5. IEEE, (2021)Constant factor approximation for tracking paths and fault tolerant feedback vertex set., , , , , и . Discret. Optim., (февраля 2023)