Author of the publication

Token Sliding on Split Graphs.

, , , , , and . STACS, volume 126 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (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.

No persons found for author name Mitsou, Valia
add a person with the name Mitsou, Valia
 

Other publications of authors with the same name

Token Sliding on Split Graphs., , , , , and . CoRR, (2018)Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)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 fuer Informatik, (2016)On the algorithmic effectiveness of digraph decompositions and complexity measures., , and . Discrete Optimization, 8 (1): 129-138 (2011)Scrabble is PSPACE-Complete., , and . JIP, 23 (3): 284-292 (2015)Vertex Cover Problem Parameterized Above and Below Tight Bounds, , , and . CoRR, (2009)The Computational Complexity of the Game of Set and its Theoretical Applications., and . CoRR, (2013)On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 220-231. Springer, (2008)Parameterized Algorithms for Parity Games., , , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 336-347. Springer, (2015)The Computational Complexity of the Game of Set and Its Theoretical Applications., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 24-34. Springer, (2014)