☰

Vasiliki-Despoina Mitsou, Ph.D.

Affiliations: 
2014 Computer Science City University of New York, New York, NY, United States 
Area:
Computer Science
Google:
"Vasiliki-Despoina Mitsou"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Amotz Bar-Noy grad student 2014 CUNY
 (The computational complexity of some games and puzzles with theoretical applications.)

Children

Sign in to add trainee

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Dell H, Kim EJ, Lampis M, et al. (2015) Complexity and approximability of parameterized MAX-CSPs Leibniz International Proceedings in Informatics, Lipics. 43: 294-306
Gajarský J, Lampis M, Makino K, et al. (2015) Parameterized algorithms for parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 336-347
Lampis M, Mitsou V. (2014) The computational complexity of the game of set and its theoretical applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8392: 24-34
Lampis M, Makino K, Mitsou V, et al. (2014) Parameterized edge hamiltonicity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8747: 348-359
Bar-Noy A, Cheilaris P, Lampis M, et al. (2012) Ordered coloring of grids and related graphs Theoretical Computer Science. 444: 40-51
Lampis M, Mitsou V, Sołtys K. (2012) Scrabble is PSPACE-complete Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7288: 258-269
Lampis M, Kaouri G, Mitsou V. (2011) On the algorithmic effectiveness of digraph decompositions and complexity measures Discrete Optimization. 8: 129-138
Gutin G, Kim EJ, Lampis M, et al. (2011) Vertex Cover Problem Parameterized Above and Below Tight Bounds Theory of Computing Systems. 48: 402-410
Achilleos A, Lampis M, Mitsou V. (2010) Parameterized modal satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6199: 369-380
Bar-Noy A, Cheilaris P, Lampis M, et al. (2010) Ordered coloring grids and related graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5869: 30-43
See more...