From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Target Set Selection in Dense Graph Classes.

P. Dvorák, D. Knop, и T. Toufar. ISAAC, том 123 из LIPIcs, стр. 18:1-18: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.

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.D. Knop, M. Koutecký, T. Masarík, и T. Toufar. WG, том 10520 из Lecture Notes in Computer Science, стр. 344-357. Springer, (2017)Target Set Selection in Dense Graph Classes.P. Dvorák, D. Knop, и T. Toufar. ISAAC, том 123 из LIPIcs, стр. 18:1-18:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Parameterized Complexity of Fair Deletion Problems.T. Masarík, и T. Toufar. TAMC, том 10185 из Lecture Notes in Computer Science, стр. 628-642. (2017)Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.D. Knop, M. Koutecký, T. Masarík, и T. Toufar. Log. Methods Comput. Sci., (2019)Parameterized Complexity of Fair Vertex Evaluation Problems.D. Knop, T. Masarík, и T. Toufar. MFCS, том 138 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)