Valia Mitsou

According to our database¹, Valia Mitsou authored at least 23 papers between 2009 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2022

Grundy Distinguishes Treewidth from Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Defective Coloring on Classes of Perfect Graphs.

[BibT_eX]

[DOI]

Rémy Belmonte

Michael Lampis

Valia Mitsou

Discret. Math. Theor. Comput. Sci., 2022

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Token Sliding on Split Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Fine-Grained Meta-Theorems for Vertex Integrity.

[BibT_eX]

[DOI]

Michael Lampis

Valia Mitsou

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Parameterized (Approximate) Defective Coloring.

[BibT_eX]

[DOI]

Rémy Belmonte

Michael Lampis

Valia Mitsou

SIAM J. Discret. Math., 2020

Complexity of planar signed graph homomorphisms to cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Parameterized Edge Hamiltonicity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

QBF as an Alternative to Courcelle's Theorem.

[BibT_eX]

[DOI]

Michael Lampis

Stefan Mengel

Valia Mitsou

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

2017

Hanabi is NP-hard, even for cheaters who look at their cards.

[BibT_eX]

[DOI]

Jean-François Baffier

Theor. Comput. Sci., 2017

Complexity and Approximability of Parameterized MAX-CSPs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Treewidth with a Quantifier Alternation Revisited.

[BibT_eX]

[DOI]

Michael Lampis

Valia Mitsou

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.

[BibT_eX]

[DOI]

Dániel Marx

Valia Mitsou

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.

[BibT_eX]

[DOI]

Jean-François Baffier

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Scrabble is PSPACE-Complete.

[BibT_eX]

[DOI]

Michael Lampis

Valia Mitsou

Karolina Soltys

J. Inf. Process., 2015

Parameterized Algorithms for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

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

[BibT_eX]

[DOI]

Michael Lampis

Valia Mitsou

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2012

Ordered coloring of grids and related graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Parameterized Modal Satisfiability.

[BibT_eX]

[DOI]

Antonis Achilleos

Michael Lampis

Valia Mitsou

Algorithmica, 2012

2011

Vertex Cover Problem Parameterized Above and Below Tight Bounds.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

On the algorithmic effectiveness of digraph decompositions and complexity measures.

[BibT_eX]

[DOI]

Michael Lampis

Georgia Kaouri

Valia Mitsou

Discret. Optim., 2011

2009

The Ferry Cover Problem.

[BibT_eX]

[DOI]

Michael Lampis

Valia Mitsou

Theory Comput. Syst., 2009

Valia Mitsou

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...