( en | de | ru )

 

Disambiguation of "Suchý, Ondrej"

Author of the publication

copydeleteadd this publication to your clipboard
Cluster Editing in Multi-Layer and Temporal Graphs.

, , , and . ISAAC, volume 123 of LIPIcs, page 24:1-24:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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. You can also use the button next to the name to display some publications already assigned to the person.

Ondrej Burkacky

Ondrej Kuncar

Kurt Suchy

Ulrich Suchy

Herbert Suchy

 

Other publications of authors with the same name

On Kernels for d-Path Vertex Cover., , and . CoRR, (2021)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Solving Multicut Faster Than 2 n., , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 666-676. Springer, (2014)Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound., , , and . FSTTCS, volume 18 of LIPIcs, page 412-423. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation., , , and . SIAM J. Discret. Math., 30 (3): 1371-1384 (2016)Predictive control of PMSM using improved model of the drive., , , and . IECON, page 1-5. IEEE, (2021)A Parameterized Complexity View on Collapsing k-Cores., , and . IPEC, volume 115 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)., , , and . FSTTCS, volume 29 of LIPIcs, page 85-96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On Kernels for d-Path Vertex Cover., , and . MFCS, volume 241 of LIPIcs, page 29:1-29:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hedonic Diversity Games: A Complexity Picture with More than Two Colors., , , , and . AAAI, page 5034-5042. AAAI Press, (2022)