Valia Mitsou - RankMe

55 papers A* 1A 4B 11Misc 3Journal 34Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Broadcasting Under Structural Restrictions. MFCS Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Broadcasting under Structural Restrictions. CoRR Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Complexity of Jelly-No and Hanano games with various constraints. CoRR Owen Crabtree, Valia Mitsou
2025	B	`conf`	Parameterized Spanning Tree Congestion. MFCS Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2024	J	`jnl`	Fine-grained Meta-Theorems for Vertex Integrity. Log. Methods Comput. Sci. Michael Lampis, Valia Mitsou
2024	J	`jnl`	Parameterized Spanning Tree Congestion. CoRR Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2022	J	`jnl`	Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. Rémy Belmonte, Michael Lampis, Valia Mitsou
2022	J	`jnl`	Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2022	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2021	B	`conf`	Fine-Grained Meta-Theorems for Vertex Integrity. ISAAC Michael Lampis, Valia Mitsou
2021	J	`jnl`	Fine-grained Meta-Theorems for Vertex Integrity. CoRR Michael Lampis, Valia Mitsou
2021	J	`jnl`	Token Sliding on Split Graphs. Theory Comput. Syst. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2020	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2020	A	`conf`	Grundy Distinguishes Treewidth from Pathwidth. ESA Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	J	`jnl`	Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. Rémy Belmonte, Michael Lampis, Valia Mitsou
2019	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. CoRR François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2019	B	`conf`	Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	J	`jnl`	Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	A	`conf`	Token Sliding on Split Graphs. STACS Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018	A	`conf`	Parameterized (Approximate) Defective Coloring. STACS Rémy Belmonte, Michael Lampis, Valia Mitsou
2018	J	`jnl`	Parameterized (Approximate) Defective Coloring. CoRR Rémy Belmonte, Michael Lampis, Valia Mitsou
2018	J	`jnl`	Parameterized Edge Hamiltonicity. Discret. Appl. Math. Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2018	A	`conf`	QBF as an Alternative to Courcelle's Theorem. SAT Michael Lampis, Stefan Mengel, Valia Mitsou
2018	J	`jnl`	QBF as an Alternative to Courcelle's Theorem. CoRR Michael Lampis, Stefan Mengel, Valia Mitsou
2018	J	`jnl`	Token Sliding on Split Graphs. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2017	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2017	B	`conf`	Defective Coloring on Classes of Perfect Graphs. WG Rémy Belmonte, Michael Lampis, Valia Mitsou
2017	J	`jnl`	Defective Coloring on Classes of Perfect Graphs. CoRR Rémy Belmonte, Michael Lampis, Valia Mitsou
2017	J	`jnl`	Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2017	B	`conf`	Treewidth with a Quantifier Alternation Revisited. IPEC Michael Lampis, Valia Mitsou
2016	A*	`conf`	Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. ICALP Dániel Marx, Valia Mitsou
2016	Misc	`conf`	Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2016	J	`jnl`	Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2015	B	`conf`	Complexity and Approximability of Parameterized MAX-CSPs. IPEC Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. CoRR Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	—	`conf`	Parameterized Algorithms for Parity Games. MFCS (2) Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
2015	J	`jnl`	Scrabble is PSPACE-Complete. J. Inf. Process. Michael Lampis, Valia Mitsou, Karolina Soltys
2014	B	`conf`	Parameterized Edge Hamiltonicity. WG Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014	J	`jnl`	Parameterized Edge Hamiltonicity. CoRR Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014	B	`conf`	The Computational Complexity of the Game of Set and Its Theoretical Applications. LATIN Michael Lampis, Valia Mitsou
2013	J	`jnl`	The Computational Complexity of the Game of Set and its Theoretical Applications. CoRR Michael Lampis, Valia Mitsou
2012	J	`jnl`	Ordered coloring of grids and related graphs. Theor. Comput. Sci. Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2012	J	`jnl`	Parameterized Modal Satisfiability. Algorithmica Antonis Achilleos, Michael Lampis, Valia Mitsou
2012	Misc	`conf`	Scrabble Is PSPACE-Complete. FUN Michael Lampis, Valia Mitsou, Karolina Soltys
2012	J	`jnl`	Scrabble is PSPACE-Complete CoRR Michael Lampis, Valia Mitsou, Karolina Soltys
2011	J	`jnl`	On the algorithmic effectiveness of digraph decompositions and complexity measures. Discret. Optim. Michael Lampis, Georgia Kaouri, Valia Mitsou
2011	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2010	—	`conf`	Parameterized Modal Satisfiability. ICALP (2) Antonis Achilleos, Michael Lampis, Valia Mitsou
2009	B	`conf`	Ordered Coloring Grids and Related Graphs. SIROCCO Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2009	J	`jnl`	Parameterized Modal Satisfiability CoRR Antonis Achilleos, Michael Lampis, Valia Mitsou
2009	J	`jnl`	The Ferry Cover Problem. Theory Comput. Syst. Michael Lampis, Valia Mitsou
2009	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2008	B	`conf`	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC Michael Lampis, Georgia Kaouri, Valia Mitsou
2007	Misc	`conf`	The Ferry Cover Problem. FUN Michael Lampis, Valia Mitsou