( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Target Set Selection in Dense Graph Classes.

, , и . CoRR, (2016)

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.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

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

Target Set Selection in Dense Graph Classes., , и . SIAM J. Discret. Math., 36 (1): 536-572 (2022)Parameterized complexity of fair deletion problems II., , и . CoRR, (2018)Target Set Selection in Dense Graph Classes., , и . ISAAC, том 123 из LIPIcs, стр. 18:1-18:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity., , , и . Log. Methods Comput. Sci., (2019)Parameterized Complexity of Fair Vertex Evaluation Problems., , и . MFCS, том 138 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterized Complexity of Fair Deletion Problems., и . TAMC, том 10185 из Lecture Notes in Computer Science, стр. 628-642. (2017)Parameterized complexity of fair deletion problems., и . Discret. Appl. Math., (2020)Target Set Selection in Dense Graph Classes., , и . CoRR, (2016)Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices., , , , , и . SIAM J. Discret. Math., 35 (1): 546-574 (2021)Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity., , , и . CoRR, (2017)