Author of the publication

PSPACE-hardness of Two Graph Coloring Games.

, , , and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 333-344. Elsevier, (2019)

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.

 

Other publications of authors with the same name

PSPACE-hardness of Two Graph Coloring Games., , , and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 333-344. Elsevier, (2019)Spy game: FPT-algorithm, hardness and graph products., , and . Theor. Comput. Sci., (2022)Spy Game: FPT-Algorithm and Results on Graph Products., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 680-691. Springer, (2021)Inapproximability results related to monophonic convexity., , and . Discret. Appl. Math., (2015)PSPACE-completeness of two graph coloring games., , , and . Theor. Comput. Sci., (2020)Spy game: FPT-algorithm, hardness and graph products., , and . CoRR, (2021)FPT algorithms to recognize well covered graphs., , , , and . Discret. Math. Theor. Comput. Sci., (2019)