From post

The Computational Complexity of the Game of Set and Its Theoretical Applications.

, и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 24-34. Springer, (2014)

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.

 

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

Ordered Coloring Grids and Related Graphs., , , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 30-43. Springer, (2009)Parameterized Power Vertex Cover., , , и . WG, том 9941 из Lecture Notes in Computer Science, стр. 97-108. (2016)Parameterized Algorithms for Modular-Width., , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 163-176. Springer, (2013)Finer Tight Bounds for Coloring on Clique-Width.. ICALP, том 107 из LIPIcs, стр. 86:1-86:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)New Results on Directed Edge Dominating Set., , , , и . MFCS, том 117 из LIPIcs, стр. 67:1-67:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Token Sliding on Split Graphs., , , , , и . Theory Comput. Syst., 65 (4): 662-686 (2021)Maximum Independent Sets in Subcubic Graphs: New Results., , , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 40-52. Springer, (2019)Parameterized Complexity of Safe Set., , , , , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 38-49. Springer, (2019)The Ferry Cover Problem., и . Theory Comput. Syst., 44 (2): 215-229 (2009)Structurally Parameterized d-Scattered Set., , и . WG, том 11159 из Lecture Notes in Computer Science, стр. 292-305. Springer, (2018)