default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Valia Mitsou
@article{DBLP:journals/algorithmica/FoucaudHLMP22,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou and
Valia Mitsou and
Th{\'{e}}o Pierron},
title = {Graph Modification for Edge-Coloured and Signed Graph Homomorphism
Problems: Parameterized and Classical Complexity},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1183--1212},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00918-4},
doi = {10.1007/S00453-021-00918-4},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FoucaudHLMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BelmonteLM22,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
title = {Defective Coloring on Classes of Perfect Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {24},
number = {1},
year = {2022},
url = {https://doi.org/10.46298/dmtcs.4926},
doi = {10.46298/DMTCS.4926},
timestamp = {Mon, 23 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BelmonteLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BelmonteKLMO22,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
title = {Grundy Distinguishes Treewidth from Pathwidth},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1761--1787},
year = {2022},
url = {https://doi.org/10.1137/20m1385779},
doi = {10.1137/20M1385779},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BelmonteKLMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BelmonteKLMOS21,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
title = {Token Sliding on Split Graphs},
journal = {Theory Comput. Syst.},
volume = {65},
number = {4},
pages = {662--686},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-09967-8},
doi = {10.1007/S00224-020-09967-8},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BelmonteKLMOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LampisM21,
author = {Michael Lampis and
Valia Mitsou},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Fine-Grained Meta-Theorems for Vertex Integrity},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.34},
doi = {10.4230/LIPICS.ISAAC.2021.34},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LampisM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-10333,
author = {Michael Lampis and
Valia Mitsou},
title = {Fine-grained Meta-Theorems for Vertex Integrity},
journal = {CoRR},
volume = {abs/2109.10333},
year = {2021},
url = {https://arxiv.org/abs/2109.10333},
eprinttype = {arXiv},
eprint = {2109.10333},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-10333.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DrossFMOP20,
author = {Fran{\c{c}}ois Dross and
Florent Foucaud and
Valia Mitsou and
Pascal Ochem and
Th{\'{e}}o Pierron},
title = {Complexity of planar signed graph homomorphisms to cycles},
journal = {Discret. Appl. Math.},
volume = {284},
pages = {166--178},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.03.029},
doi = {10.1016/J.DAM.2020.03.029},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DrossFMOP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BelmonteLM20,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
title = {Parameterized (Approximate) Defective Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {2},
pages = {1084--1106},
year = {2020},
url = {https://doi.org/10.1137/18M1223666},
doi = {10.1137/18M1223666},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BelmonteLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Belmonte0LMO20,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Grundy Distinguishes Treewidth from Pathwidth},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {14:1--14:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.14},
doi = {10.4230/LIPICS.ESA.2020.14},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Belmonte0LMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07425,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
title = {Grundy Distinguishes Treewidth from Pathwidth},
journal = {CoRR},
volume = {abs/2008.07425},
year = {2020},
url = {https://arxiv.org/abs/2008.07425},
eprinttype = {arXiv},
eprint = {2008.07425},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FoucaudHLMP19,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou and
Valia Mitsou and
Th{\'{e}}o Pierron},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism
Problems},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {15:1--15:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.15},
doi = {10.4230/LIPICS.IPEC.2019.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FoucaudHLMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Belmonte0LMOS19,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Token Sliding on Split Graphs},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {13:1--13:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.13},
doi = {10.4230/LIPICS.STACS.2019.13},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Belmonte0LMOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-03266,
author = {Fran{\c{c}}ois Dross and
Florent Foucaud and
Valia Mitsou and
Pascal Ochem and
Th{\'{e}}o Pierron},
title = {Complexity of planar signed graph homomorphisms to cycles},
journal = {CoRR},
volume = {abs/1907.03266},
year = {2019},
url = {http://arxiv.org/abs/1907.03266},
eprinttype = {arXiv},
eprint = {1907.03266},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-03266.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-01099,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou and
Valia Mitsou and
Th{\'{e}}o Pierron},
title = {Parameterized complexity of edge-coloured and signed graph homomorphism
problems},
journal = {CoRR},
volume = {abs/1910.01099},
year = {2019},
url = {http://arxiv.org/abs/1910.01099},
eprinttype = {arXiv},
eprint = {1910.01099},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-01099.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LampisMMU18,
author = {Michael Lampis and
Kazuhisa Makino and
Valia Mitsou and
Yushi Uno},
title = {Parameterized Edge Hamiltonicity},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {68--78},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.04.045},
doi = {10.1016/J.DAM.2017.04.045},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LampisMMU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LampisMM18,
author = {Michael Lampis and
Stefan Mengel and
Valia Mitsou},
editor = {Olaf Beyersdorff and
Christoph M. Wintersteiger},
title = {{QBF} as an Alternative to Courcelle's Theorem},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
International Conference, {SAT} 2018, Held as Part of the Federated
Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10929},
pages = {235--252},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94144-8\_15},
doi = {10.1007/978-3-319-94144-8\_15},
timestamp = {Mon, 16 Sep 2019 15:30:17 +0200},
biburl = {https://dblp.org/rec/conf/sat/LampisMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BelmonteLM18,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Parameterized (Approximate) Defective Coloring},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {10:1--10:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.10},
doi = {10.4230/LIPICS.STACS.2018.10},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BelmonteLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-03879,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
title = {Parameterized (Approximate) Defective Coloring},
journal = {CoRR},
volume = {abs/1801.03879},
year = {2018},
url = {http://arxiv.org/abs/1801.03879},
eprinttype = {arXiv},
eprint = {1801.03879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-03879.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08456,
author = {Michael Lampis and
Stefan Mengel and
Valia Mitsou},
title = {{QBF} as an Alternative to Courcelle's Theorem},
journal = {CoRR},
volume = {abs/1805.08456},
year = {2018},
url = {http://arxiv.org/abs/1805.08456},
eprinttype = {arXiv},
eprint = {1805.08456},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-08456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05322,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
title = {Token Sliding on Split Graphs},
journal = {CoRR},
volume = {abs/1807.05322},
year = {2018},
url = {http://arxiv.org/abs/1807.05322},
eprinttype = {arXiv},
eprint = {1807.05322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DellKLMM17,
author = {Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias M{\"{o}}mke},
title = {Complexity and Approximability of Parameterized MAX-CSPs},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {230--250},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0310-8},
doi = {10.1007/S00453-017-0310-8},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DellKLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaffierCDKMRRU17,
author = {Jean{-}Fran{\c{c}}ois Baffier and
Man{-}Kwun Chiu and
Yago Diez and
Matias Korman and
Valia Mitsou and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Yushi Uno},
title = {Hanabi is NP-hard, even for cheaters who look at their cards},
journal = {Theor. Comput. Sci.},
volume = {675},
pages = {43--55},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.02.024},
doi = {10.1016/J.TCS.2017.02.024},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaffierCDKMRRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/LampisM17,
author = {Michael Lampis and
Valia Mitsou},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Treewidth with a Quantifier Alternation Revisited},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {26:1--26:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.26},
doi = {10.4230/LIPICS.IPEC.2017.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/LampisM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteLM17,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Defective Coloring on Classes of Perfect Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {113--126},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_9},
doi = {10.1007/978-3-319-68705-6\_9},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BelmonteLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelmonteLM17,
author = {R{\'{e}}my Belmonte and
Michael Lampis and
Valia Mitsou},
title = {Defective Coloring on Classes of Perfect Graphs},
journal = {CoRR},
volume = {abs/1702.08903},
year = {2017},
url = {http://arxiv.org/abs/1702.08903},
eprinttype = {arXiv},
eprint = {1702.08903},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelmonteLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BaffierCDKMRRU16,
author = {Jean{-}Fran{\c{c}}ois Baffier and
Man{-}Kwun Chiu and
Yago Diez and
Matias Korman and
Valia Mitsou and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Yushi Uno},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {Hanabi is NP-complete, Even for Cheaters who Look at Their Cards},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {4:1--4:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.4},
doi = {10.4230/LIPICS.FUN.2016.4},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fun/BaffierCDKMRRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MarxM16,
author = {D{\'{a}}niel Marx and
Valia Mitsou},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Double-Exponential and Triple-Exponential Bounds for Choosability
Problems Parameterized by Treewidth},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {28:1--28:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.28},
doi = {10.4230/LIPICS.ICALP.2016.28},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/MarxM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaffierCDKMRRU16,
author = {Jean{-}Fran{\c{c}}ois Baffier and
Man{-}Kwun Chiu and
Yago Diez and
Matias Korman and
Valia Mitsou and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Yushi Uno},
title = {Hanabi is NP-complete, Even for Cheaters who Look at Their Cards},
journal = {CoRR},
volume = {abs/1603.01911},
year = {2016},
url = {http://arxiv.org/abs/1603.01911},
eprinttype = {arXiv},
eprint = {1603.01911},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaffierCDKMRRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/LampisMS15,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
title = {Scrabble is PSPACE-Complete},
journal = {J. Inf. Process.},
volume = {23},
number = {3},
pages = {284--292},
year = {2015},
url = {https://doi.org/10.2197/ipsjjip.23.284},
doi = {10.2197/IPSJJIP.23.284},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/LampisMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Dell0LMM15,
author = {Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias M{\"{o}}mke},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Complexity and Approximability of Parameterized MAX-CSPs},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {294--306},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.294},
doi = {10.4230/LIPICS.IPEC.2015.294},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Dell0LMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GajarskyLMMO15,
author = {Jakub Gajarsk{\'{y}} and
Michael Lampis and
Kazuhisa Makino and
Valia Mitsou and
Sebastian Ordyniak},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Parameterized Algorithms for Parity Games},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {336--347},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_28},
doi = {10.1007/978-3-662-48054-0\_28},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GajarskyLMMO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dell0LMM15,
author = {Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias M{\"{o}}mke},
title = {Complexity and Approximability of Parameterized MAX-CSPs},
journal = {CoRR},
volume = {abs/1511.05546},
year = {2015},
url = {http://arxiv.org/abs/1511.05546},
eprinttype = {arXiv},
eprint = {1511.05546},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Dell0LMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/LampisM14,
author = {Michael Lampis and
Valia Mitsou},
editor = {Alberto Pardo and
Alfredo Viola},
title = {The Computational Complexity of the Game of Set and Its Theoretical
Applications},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {24--34},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_3},
doi = {10.1007/978-3-642-54423-1\_3},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/LampisM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LampisMMU14,
author = {Michael Lampis and
Kazuhisa Makino and
Valia Mitsou and
Yushi Uno},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Parameterized Edge Hamiltonicity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {348--359},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_29},
doi = {10.1007/978-3-319-12340-0\_29},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LampisMMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LampisMMU14,
author = {Michael Lampis and
Kazuhisa Makino and
Valia Mitsou and
Yushi Uno},
title = {Parameterized Edge Hamiltonicity},
journal = {CoRR},
volume = {abs/1403.2041},
year = {2014},
url = {http://arxiv.org/abs/1403.2041},
eprinttype = {arXiv},
eprint = {1403.2041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LampisMMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LampisM13,
author = {Michael Lampis and
Valia Mitsou},
title = {The Computational Complexity of the Game of Set and its Theoretical
Applications},
journal = {CoRR},
volume = {abs/1309.6504},
year = {2013},
url = {http://arxiv.org/abs/1309.6504},
eprinttype = {arXiv},
eprint = {1309.6504},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LampisM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AchilleosLM12,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
title = {Parameterized Modal Satisfiability},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {38--55},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9552-z},
doi = {10.1007/S00453-011-9552-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AchilleosLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NoyCLMZ12,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Michael Lampis and
Valia Mitsou and
Stathis Zachos},
title = {Ordered coloring of grids and related graphs},
journal = {Theor. Comput. Sci.},
volume = {444},
pages = {40--51},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.04.036},
doi = {10.1016/J.TCS.2012.04.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NoyCLMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/LampisMS12,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Scrabble Is PSPACE-Complete},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {258--269},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_26},
doi = {10.1007/978-3-642-30347-0\_26},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/LampisMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-5298,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
title = {Scrabble is PSPACE-Complete},
journal = {CoRR},
volume = {abs/1201.5298},
year = {2012},
url = {http://arxiv.org/abs/1201.5298},
eprinttype = {arXiv},
eprint = {1201.5298},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-5298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LampisKM11,
author = {Michael Lampis and
Georgia Kaouri and
Valia Mitsou},
title = {On the algorithmic effectiveness of digraph decompositions and complexity
measures},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {129--138},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.03.010},
doi = {10.1016/J.DISOPT.2010.03.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LampisKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GutinKLM11,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou},
title = {Vertex Cover Problem Parameterized Above and Below Tight Bounds},
journal = {Theory Comput. Syst.},
volume = {48},
number = {2},
pages = {402--410},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9262-y},
doi = {10.1007/S00224-010-9262-Y},
timestamp = {Thu, 22 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GutinKLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AchilleosLM10,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Parameterized Modal Satisfiability},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6199},
pages = {369--380},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14162-1\_31},
doi = {10.1007/978-3-642-14162-1\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AchilleosLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LampisM09,
author = {Michael Lampis and
Valia Mitsou},
title = {The Ferry Cover Problem},
journal = {Theory Comput. Syst.},
volume = {44},
number = {2},
pages = {215--229},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9107-0},
doi = {10.1007/S00224-008-9107-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LampisM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Bar-NoyCLMZ09,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Michael Lampis and
Valia Mitsou and
Stathis Zachos},
editor = {Shay Kutten and
Janez Zerovnik},
title = {Ordered Coloring Grids and Related Graphs},
booktitle = {Structural Information and Communication Complexity, 16th International
Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5869},
pages = {30--43},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11476-2\_4},
doi = {10.1007/978-3-642-11476-2\_4},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/Bar-NoyCLMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-4488,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou},
title = {Vertex Cover Problem Parameterized Above and Below Tight Bounds},
journal = {CoRR},
volume = {abs/0907.4488},
year = {2009},
url = {http://arxiv.org/abs/0907.4488},
eprinttype = {arXiv},
eprint = {0907.4488},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-4488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-4941,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
title = {Parameterized Modal Satisfiability},
journal = {CoRR},
volume = {abs/0912.4941},
year = {2009},
url = {http://arxiv.org/abs/0912.4941},
eprinttype = {arXiv},
eprint = {0912.4941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-4941.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LampisKM08,
author = {Michael Lampis and
Georgia Kaouri and
Valia Mitsou},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {On the Algorithmic Effectiveness of Digraph Decompositions and Complexity
Measures},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {220--231},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_22},
doi = {10.1007/978-3-540-92182-0\_22},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LampisKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/LampisM07,
author = {Michael Lampis and
Valia Mitsou},
editor = {Pierluigi Crescenzi and
Giuseppe Prencipe and
Geppino Pucci},
title = {The Ferry Cover Problem},
booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
Italy, June 3-5, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4475},
pages = {227--239},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72914-3\_20},
doi = {10.1007/978-3-540-72914-3\_20},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/LampisM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 23:12 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:
