Valia Mitsou

	2012
12		Michael Lampis, Valia Mitsou, Karolina Soltys: Scrabble Is PSPACE-Complete. FUN 2012: 258-269
11		Antonis Achilleos, Michael Lampis, Valia Mitsou: Parameterized Modal Satisfiability. Algorithmica 64(1): 38-55 (2012)
10		Michael Lampis, Valia Mitsou, Karolina Soltys: Scrabble is PSPACE-Complete CoRR abs/1201.5298: (2012)
	2011
9		Michael Lampis, Georgia Kaouri, Valia Mitsou: On the algorithmic effectiveness of digraph decompositions and complexity measures. Discrete Optimization 8(1): 129-138 (2011)
8		Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou: Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011)
	2010
7		Antonis Achilleos, Michael Lampis, Valia Mitsou: Parameterized Modal Satisfiability. ICALP (2) 2010: 369-380
	2009
6		Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43
5		Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou: Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR abs/0907.4488: (2009)
4		Antonis Achilleos, Michael Lampis, Valia Mitsou: Parameterized Modal Satisfiability CoRR abs/0912.4941: (2009)
3		Michael Lampis, Valia Mitsou: The Ferry Cover Problem. Theory Comput. Syst. 44(2): 215-229 (2009)
	2008
2		Michael Lampis, Georgia Kaouri, Valia Mitsou: On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC 2008: 220-231
	2007
1		Michael Lampis, Valia Mitsou: The Ferry Cover Problem. FUN 2007: 227-239

Coauthor Index

1	Antonis Achilleos	[4] [7] [11]
2	Amotz Bar-Noy	[6]
3	Panagiotis Cheilaris	[6]
4	Gregory Gutin	[5] [8]
5	Georgia Kaouri	[2] [9]
6	Eun Jung Kim	[5] [8]
7	Michael Lampis	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
8	Karolina Soltys	[10] [12]
9	Stathis Zachos	[6]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page