( en | de | ru )

 

Disambiguation of "Mitsou, Valia"

Author of the publication

copydeleteadd this publication to your clipboard
Hanabi is NP-hard, even for cheaters who look at their cards.

, , , , , , , and . Theor. Comput. Sci., (2017)

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.

Valia Partassidou

Paul Valiant

Elisabetta Valiante

Maya Valiaparampil

 

Other publications of authors with the same name

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , and . FUN, volume 49 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)Hanabi is NP-hard, even for cheaters who look at their cards., , , , , , , and . Theor. Comput. Sci., (2017)Complexity of planar signed graph homomorphisms to cycles., , , , and . Discret. Appl. Math., (2020)Defective Coloring on Classes of Perfect Graphs., , and . Discret. Math. Theor. Comput. Sci., (2022)Vertex Cover Problem Parameterized Above and Below Tight Bounds., , , and . Theory Comput. Syst., 48 (2): 402-410 (2011)The Ferry Cover Problem., and . Theory Comput. Syst., 44 (2): 215-229 (2009)Complexity of planar signed graph homomorphisms to cycles., , , , and . CoRR, (2019)Vertex Cover Problem Parameterized Above and Below Tight Bounds, , , and . CoRR, (2009)