( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of List H-Packing for Sparse Graph Classes.

, , , , , , , и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 421-435. Springer, (2024)

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.

No persons found for author name Hanaka, Tesshu
add a person with the name Hanaka, Tesshu
 

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

Parameterized Algorithms for Maximum Cut with Connectivity Constraints., , , и . IPEC, том 148 из LIPIcs, стр. 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)(In)approximability of maximum minimal FVS., , , , и . J. Comput. Syst. Sci., (2022)Turning Tiles is PSPACE-complete., , , , и . CoRR, (2023)Parameterized Algorithms for the Happy Set Problem., , , , , и . WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 323-328. Springer, (2020)A Fixed-Parameter Algorithm for Max Edge Domination., и . SOFSEM (Student Research Forum Papers / Posters), том 1326 из CEUR Workshop Proceedings, стр. 31-40. CEUR-WS.org, (2015)On Directed Covering and Domination Problems., , и . ISAAC, том 92 из LIPIcs, стр. 45:1-45:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Structural Parameterizations of Vertex Integrity., , , , , и . CoRR, (2023)An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion., , , , , , , и . CoRR, (2020)New Results on Directed Edge Dominating Set., , , , и . Discret. Math. Theor. Comput. Sci., (2023)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 87-98. Springer, (2019)