default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValia Mitsou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84(5): 1183-1212 (2022)- [j14]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j13]Rémy Belmonte, Eun Jung Kim
, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36(3): 1761-1787 (2022) - 2021
- [j12]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - [c19]Michael Lampis, Valia Mitsou:
Fine-Grained Meta-Theorems for Vertex Integrity. ISAAC 2021: 34:1-34:15 - [i15]Michael Lampis, Valia Mitsou:
Fine-grained Meta-Theorems for Vertex Integrity. CoRR abs/2109.10333 (2021) - 2020
- [j11]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284: 166-178 (2020) - [j10]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34(2): 1084-1106 (2020) - [c18]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - [i14]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. CoRR abs/2008.07425 (2020)
2010 – 2019
- 2019
- [c17]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC 2019: 15:1-15:16 - [c16]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [i13]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. CoRR abs/1907.03266 (2019) - [i12]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR abs/1910.01099 (2019) - 2018
- [j9]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248: 68-78 (2018) - [c15]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. SAT 2018: 235-252 - [c14]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. STACS 2018: 10:1-10:15 - [i11]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. CoRR abs/1801.03879 (2018) - [i10]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. CoRR abs/1805.08456 (2018) - [i9]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - 2017
- [j8]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - [j7]Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675: 43-55 (2017) - [c13]Michael Lampis, Valia Mitsou:
Treewidth with a Quantifier Alternation Revisited. IPEC 2017: 26:1-26:12 - [c12]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. WG 2017: 113-126 - [i8]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. CoRR abs/1702.08903 (2017) - 2016
- [c11]Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN 2016: 4:1-4:17 - [c10]Dániel Marx, Valia Mitsou:
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. ICALP 2016: 28:1-28:15 - [i7]Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR abs/1603.01911 (2016) - 2015
- [j6]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. J. Inf. Process. 23(3): 284-292 (2015) - [c9]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - [c8]Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - [i6]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. CoRR abs/1511.05546 (2015) - 2014
- [c7]Michael Lampis, Valia Mitsou:
The Computational Complexity of the Game of Set and Its Theoretical Applications. LATIN 2014: 24-34 - [c6]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. WG 2014: 348-359 - [i5]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. CoRR abs/1403.2041 (2014) - 2013
- [i4]Michael Lampis, Valia Mitsou:
The Computational Complexity of the Game of Set and its Theoretical Applications. CoRR abs/1309.6504 (2013) - 2012
- [j5]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. Algorithmica 64(1): 38-55 (2012) - [j4]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012) - [c5]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble Is PSPACE-Complete. FUN 2012: 258-269 - [i3]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. CoRR abs/1201.5298 (2012) - 2011
- [j3]Michael Lampis, Georgia Kaouri, Valia Mitsou:
On the algorithmic effectiveness of digraph decompositions and complexity measures. Discret. Optim. 8(1): 129-138 (2011) - [j2]Gregory Z. 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
- [c4]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. ICALP (2) 2010: 369-380
2000 – 2009
- 2009
- [j1]Michael Lampis, Valia Mitsou:
The Ferry Cover Problem. Theory Comput. Syst. 44(2): 215-229 (2009) - [c3]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 - [i2]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. CoRR abs/0907.4488 (2009) - [i1]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. CoRR abs/0912.4941 (2009) - 2008
- [c2]Michael Lampis, Georgia Kaouri, Valia Mitsou:
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC 2008: 220-231 - 2007
- [c1]Michael Lampis, Valia Mitsou:
The Ferry Cover Problem. FUN 2007: 227-239
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
