@article{DBLP:journals/mst/HarutyunyanLM24,
author = {Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Digraph Coloring and Distance to Acyclicity},
journal = {Theory Comput. Syst.},
volume = {68},
number = {4},
pages = {986--1013},
year = {2024},
url = {https://doi.org/10.1007/s00224-022-10103-x},
doi = {10.1007/S00224-022-10103-X},
timestamp = {Sun, 08 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HarutyunyanLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesHLM24,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Filling crosswords is very hard},
journal = {Theor. Comput. Sci.},
volume = {982},
pages = {114275},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114275},
doi = {10.1016/J.TCS.2023.114275},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GourvesHLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmannL24,
author = {Andreas Emil Feldmann and
Michael Lampis},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {Parameterized Algorithms for Steiner Forest in Bounded Width Graphs},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {61:1--61:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.61},
doi = {10.4230/LIPICS.ICALP.2024.61},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FeldmannL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HanakaLVY24,
author = {Tesshu Hanaka and
Michael Lampis and
Manolis Vasilakis and
Kanae Yoshiwatari},
editor = {Rastislav Kr{\'{a}}lovic and
Anton{\'{\i}}n Kucera},
title = {Parameterized Vertex Integrity Revisited},
booktitle = {49th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2024, August 26-30, 2024, Bratislava, Slovakia},
series = {LIPIcs},
volume = {306},
pages = {58:1--58:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2024.58},
doi = {10.4230/LIPICS.MFCS.2024.58},
timestamp = {Mon, 26 Aug 2024 16:40:52 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HanakaLVY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HanakaKLOY24,
author = {Tesshu Hanaka and
Hironori Kiya and
Michael Lampis and
Hirotaka Ono and
Kanae Yoshiwatari},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {Faster Winner Determination Algorithms for (Colored) Arc Kayles},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {297--310},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_21},
doi = {10.1007/978-3-031-52113-3\_21},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/HanakaKLOY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-09835,
author = {Andreas Emil Feldmann and
Michael Lampis},
title = {Parameterized Algorithms for Steiner Forest in Bounded Width Graphs},
journal = {CoRR},
volume = {abs/2402.09835},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.09835},
doi = {10.48550/ARXIV.2402.09835},
eprinttype = {arXiv},
eprint = {2402.09835},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-09835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-09971,
author = {Tesshu Hanaka and
Michael Lampis and
Manolis Vasilakis and
Kanae Yoshiwatari},
title = {Parameterized Vertex Integrity Revisited},
journal = {CoRR},
volume = {abs/2402.09971},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.09971},
doi = {10.48550/ARXIV.2402.09971},
eprinttype = {arXiv},
eprint = {2402.09971},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-09971.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-10815,
author = {Tesshu Hanaka and
Noleen K{\"{o}}hler and
Michael Lampis},
title = {Core Stability in Additively Separable Hedonic Games of Low Treewidth},
journal = {CoRR},
volume = {abs/2402.10815},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.10815},
doi = {10.48550/ARXIV.2402.10815},
eprinttype = {arXiv},
eprint = {2402.10815},
timestamp = {Mon, 26 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-10815.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-07239,
author = {Michael Lampis},
title = {The Primal Pathwidth {SETH}},
journal = {CoRR},
volume = {abs/2403.07239},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.07239},
doi = {10.48550/ARXIV.2403.07239},
eprinttype = {arXiv},
eprint = {2403.07239},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-07239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-14849,
author = {Michael Lampis and
Manolis Vasilakis},
title = {Parameterized Maximum Node-Disjoint Paths},
journal = {CoRR},
volume = {abs/2404.14849},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.14849},
doi = {10.48550/ARXIV.2404.14849},
eprinttype = {arXiv},
eprint = {2404.14849},
timestamp = {Sat, 25 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-14849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-09683,
author = {Michael Lampis},
title = {Circuits and Backdoors: Five Shades of the {SETH}},
journal = {CoRR},
volume = {abs/2407.09683},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.09683},
doi = {10.48550/ARXIV.2407.09683},
eprinttype = {arXiv},
eprint = {2407.09683},
timestamp = {Thu, 15 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-09683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BelmonteHKKL23,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Eun Jung Kim and
Michael Lampis},
title = {New Results on Directed Edge Dominating Set},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {25},
year = {2023},
url = {https://doi.org/10.46298/dmtcs.5378},
doi = {10.46298/DMTCS.5378},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BelmonteHKKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KatsikarelisLP23,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {219--238},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00621},
doi = {10.7155/JGAA.00621},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KatsikarelisLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LampisV23,
author = {Michael Lampis and
Manolis Vasilakis},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Structural Parameterizations for Two Bounded Degree Problems Revisited},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {77:1--77:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.77},
doi = {10.4230/LIPICS.ESA.2023.77},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/LampisV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lampis23,
author = {Michael Lampis},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {First Order Logic on Pathwidth Revisited Again},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {132:1--132:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.132},
doi = {10.4230/LIPICS.ICALP.2023.132},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Lampis23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LampisMV23,
author = {Michael Lampis and
Nikolaos Melissinos and
Manolis Vasilakis},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Parameterized Max Min Feedback Vertex Set},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {62:1--62:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.62},
doi = {10.4230/LIPICS.MFCS.2023.62},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LampisMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-09604,
author = {Michael Lampis and
Nikolaos Melissinos and
Manolis Vasilakis},
title = {Parameterized Max Min Feedback Vertex Set},
journal = {CoRR},
volume = {abs/2302.09604},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.09604},
doi = {10.48550/ARXIV.2302.09604},
eprinttype = {arXiv},
eprint = {2302.09604},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-09604.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-14724,
author = {Michael Lampis and
Manolis Vasilakis},
title = {Structural Parameterizations for Two Bounded Degree Problems Revisited},
journal = {CoRR},
volume = {abs/2304.14724},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.14724},
doi = {10.48550/ARXIV.2304.14724},
eprinttype = {arXiv},
eprint = {2304.14724},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-14724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/hal/Lampis22,
author = {Michael Lampis},
title = {Structural Graph Parameters, Fine-Grained Complexity, and Approximation},
year = {2022},
url = {https://tel.archives-ouvertes.fr/tel-03848575},
timestamp = {Mon, 12 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/hal/Lampis22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHKKKKLO22,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of (A, {\(\mathscr{l}\)} )-Path Packing},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {871--895},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00875-y},
doi = {10.1007/S00453-021-00875-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHKKKKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatsikarelisLP22,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structurally parameterized d-scattered set},
journal = {Discret. Appl. Math.},
volume = {308},
pages = {168--186},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2020.03.052},
doi = {10.1016/J.DAM.2020.03.052},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatsikarelisLP22.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/jcss/DubloisHGLM22,
author = {Louis Dublois and
Tesshu Hanaka and
Mehdi Khosravian Ghadikolaei and
Michael Lampis and
Nikolaos Melissinos},
title = {(In)approximability of maximum minimal {FVS}},
journal = {J. Comput. Syst. Sci.},
volume = {124},
pages = {26--40},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.09.001},
doi = {10.1016/J.JCSS.2021.09.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DubloisHGLM22.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/tcs/DubloisLP22,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential
approximation},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {271--291},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.013},
doi = {10.1016/J.TCS.2022.05.013},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DubloisLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HanakaL22,
author = {Tesshu Hanaka and
Michael Lampis},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Hedonic Games and Treewidth Revisited},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {64:1--64:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.64},
doi = {10.4230/LIPICS.ESA.2022.64},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HanakaL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lampis22,
author = {Michael Lampis},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Determining a Slater Winner Is Complete for Parallel Access to {NP}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.45},
doi = {10.4230/LIPICS.STACS.2022.45},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lampis22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06925,
author = {Tesshu Hanaka and
Michael Lampis},
title = {Hedonic Games and Treewidth Revisited},
journal = {CoRR},
volume = {abs/2202.06925},
year = {2022},
url = {https://arxiv.org/abs/2202.06925},
eprinttype = {arXiv},
eprint = {2202.06925},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06925.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-09899,
author = {Michael Lampis},
title = {First Order Logic on Pathwidth Revisited Again},
journal = {CoRR},
volume = {abs/2210.09899},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.09899},
doi = {10.48550/ARXIV.2210.09899},
eprinttype = {arXiv},
eprint = {2210.09899},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-09899.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {New Algorithms for Mixed Dominating Set},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {23},
number = {1},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.6824},
doi = {10.46298/DMTCS.6824},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DubloisLP21.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/ciac/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential
Approximation},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {202--215},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_14},
doi = {10.1007/978-3-030-75242-2\_14},
timestamp = {Thu, 06 May 2021 09:40:55 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DubloisLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lampis21,
author = {Michael Lampis},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Minimum Stable Cut and Treewidth},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {92:1--92:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.92},
doi = {10.4230/LIPICS.ICALP.2021.92},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Lampis21.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}
}
@inproceedings{DBLP:conf/isaac/GourvesHLM21,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Filling Crosswords Is Very Hard},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {36:1--36:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.36},
doi = {10.4230/LIPICS.ISAAC.2021.36},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GourvesHLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HarutyunyanLM21,
author = {Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Digraph Coloring and Distance to Acyclicity},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {41:1--41:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.41},
doi = {10.4230/LIPICS.STACS.2021.41},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HarutyunyanLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07550,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential
Approximation},
journal = {CoRR},
volume = {abs/2101.07550},
year = {2021},
url = {https://arxiv.org/abs/2101.07550},
eprinttype = {arXiv},
eprint = {2101.07550},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-16416,
author = {Michael Lampis},
title = {Determining a Slater Winner is Complete for Parallel Access to {NP}},
journal = {CoRR},
volume = {abs/2103.16416},
year = {2021},
url = {https://arxiv.org/abs/2103.16416},
eprinttype = {arXiv},
eprint = {2103.16416},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-16416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-13097,
author = {Michael Lampis},
title = {Minimum Stable Cut and Treewidth},
journal = {CoRR},
volume = {abs/2104.13097},
year = {2021},
url = {https://arxiv.org/abs/2104.13097},
eprinttype = {arXiv},
eprint = {2104.13097},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-13097.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/corr/abs-2109-11203,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Filling Crosswords is Very Hard},
journal = {CoRR},
volume = {abs/2109.11203},
year = {2021},
url = {https://arxiv.org/abs/2109.11203},
eprinttype = {arXiv},
eprint = {2109.11203},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-11203.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HanakaKLOS20,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
title = {Parameterized Orientable Deletion},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1909--1938},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00679-6},
doi = {10.1007/S00453-020-00679-6},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HanakaKLOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2586--2605},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00700-y},
doi = {10.1007/S00453-020-00700-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHLOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteHKLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of Safe Set},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {215--245},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00528},
doi = {10.7155/JGAA.00528},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteHKLOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/ChibaBILNO20,
author = {Kyohei Chiba and
R{\'{e}}my Belmonte and
Hiro Ito and
Michael Lampis and
Atsuki Nagao and
Yota Otachi},
title = {\emph{K}\({}_{\mbox{3}}\) Edge Cover Problem in a Wide Sense},
journal = {J. Inf. Process.},
volume = {28},
pages = {849--858},
year = {2020},
url = {https://doi.org/10.2197/ipsjjip.28.849},
doi = {10.2197/IPSJJIP.28.849},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jip/ChibaBILNO20.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}
}
@article{DBLP:journals/siamdm/Lampis20,
author = {Michael Lampis},
title = {Finer Tight Bounds for Coloring on Clique-Width},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {1538--1558},
year = {2020},
url = {https://doi.org/10.1137/19M1280326},
doi = {10.1137/19M1280326},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Lampis20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarutyunyanLLM20,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum independent sets in subcubic graphs: New results},
journal = {Theor. Comput. Sci.},
volume = {846},
pages = {14--26},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.010},
doi = {10.1016/J.TCS.2020.09.010},
timestamp = {Wed, 04 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarutyunyanLLM20.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}
}
@inproceedings{DBLP:conf/isaac/DubloisHGLM20,
author = {Louis Dublois and
Tesshu Hanaka and
Mehdi Khosravian Ghadikolaei and
Michael Lampis and
Nikolaos Melissinos},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {(In)approximability of Maximum Minimal {FVS}},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {3:1--3:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.3},
doi = {10.4230/LIPICS.ISAAC.2020.3},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DubloisHGLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BelmonteHKK0KLO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Parameterized Complexity of (A, {\(\mathscr{l}\)} )-Path Packing},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {43--55},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_4},
doi = {10.1007/978-3-030-48966-3\_4},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BelmonteHKK0KLO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DubloisLP20,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {New Algorithms for Mixed Dominating Set},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.9},
doi = {10.4230/LIPICS.IPEC.2020.9},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/DubloisLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03448,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of (A, {\unicode{120001}})-Path Packing},
journal = {CoRR},
volume = {abs/2008.03448},
year = {2020},
url = {https://arxiv.org/abs/2008.03448},
eprinttype = {arXiv},
eprint = {2008.03448},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03448.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}
}
@article{DBLP:journals/corr/abs-2009-09971,
author = {Louis Dublois and
Tesshu Hanaka and
Mehdi Khosravian Ghadikolaei and
Michael Lampis and
Nikolaos Melissinos},
title = {(In)approximability of Maximum Minimal {FVS}},
journal = {CoRR},
volume = {abs/2009.09971},
year = {2020},
url = {https://arxiv.org/abs/2009.09971},
eprinttype = {arXiv},
eprint = {2009.09971},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-09971.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-06317,
author = {Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Digraph Coloring and Distance to Acyclicity},
journal = {CoRR},
volume = {abs/2010.06317},
year = {2020},
url = {https://arxiv.org/abs/2010.06317},
eprinttype = {arXiv},
eprint = {2010.06317},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-06317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatsikarelisLP19,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structural parameters, tight bounds, and approximation for (k, r)-center},
journal = {Discret. Appl. Math.},
volume = {264},
pages = {90--117},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.11.002},
doi = {10.1016/J.DAM.2018.11.002},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatsikarelisLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteGKLO19,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
title = {How Bad is the Freedom to Flood-It?},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {111--134},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00486},
doi = {10.7155/JGAA.00486},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteGKLO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BonnetGL19,
author = {Edouard Bonnet and
Panos Giannopoulos and
Michael Lampis},
title = {On the parameterized complexity of red-blue points separation},
journal = {J. Comput. Geom.},
volume = {10},
number = {1},
pages = {181--206},
year = {2019},
url = {https://doi.org/10.20382/jocg.v10i1a7},
doi = {10.20382/JOCG.V10I1A7},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BonnetGL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BelmonteHKLOO19,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of Safe Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {38--49},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_4},
doi = {10.1007/978-3-030-17402-6\_4},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BelmonteHKLOO19.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}
}
@inproceedings{DBLP:conf/waoa/KatsikarelisLP19,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Evripidis Bampis and
Nicole Megow},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
booktitle = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
pages = {202--216},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-39479-0\_14},
doi = {10.1007/978-3-030-39479-0\_14},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KatsikarelisLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HarutyunyanLLM19,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {40--52},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_4},
doi = {10.1007/978-3-030-30786-8\_4},
timestamp = {Tue, 29 Dec 2020 18:38:49 +0100},
biburl = {https://dblp.org/rec/conf/wg/HarutyunyanLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteHLOO19,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21, 2019,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {285--297},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_22},
doi = {10.1007/978-3-030-30786-8\_22},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BelmonteHLOO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09434,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of Safe Set},
journal = {CoRR},
volume = {abs/1901.09434},
year = {2019},
url = {http://arxiv.org/abs/1901.09434},
eprinttype = {arXiv},
eprint = {1901.09434},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-09434.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04919,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Eun Jung Kim and
Michael Lampis},
title = {New Results on Directed Edge Dominating Set},
journal = {CoRR},
volume = {abs/1902.04919},
year = {2019},
url = {http://arxiv.org/abs/1902.04919},
eprinttype = {arXiv},
eprint = {1902.04919},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00340,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
journal = {CoRR},
volume = {abs/1905.00340},
year = {2019},
url = {http://arxiv.org/abs/1905.00340},
eprinttype = {arXiv},
eprint = {1905.00340},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-05589,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
journal = {CoRR},
volume = {abs/1910.05589},
year = {2019},
url = {http://arxiv.org/abs/1910.05589},
eprinttype = {arXiv},
eprint = {1910.05589},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-05589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-08964,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {New Algorithms for Mixed Dominating Set},
journal = {CoRR},
volume = {abs/1911.08964},
year = {2019},
url = {http://arxiv.org/abs/1911.08964},
eprinttype = {arXiv},
eprint = {1911.08964},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-08964.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}
}
@article{DBLP:journals/dmtcs/AngelBEL18,
author = {Eric Angel and
Evripidis Bampis and
Bruno Escoffier and
Michael Lampis},
title = {Parameterized Power Vertex Cover},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {20},
number = {2},
year = {2018},
url = {https://doi.org/10.23638/DMTCS-20-2-10},
doi = {10.23638/DMTCS-20-2-10},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/AngelBEL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BonnetLP18,
author = {{\'{E}}douard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
title = {Time-approximation trade-offs for inapproximable problems},
journal = {J. Comput. Syst. Sci.},
volume = {92},
pages = {171--180},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.09.009},
doi = {10.1016/J.JCSS.2017.09.009},
timestamp = {Tue, 28 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BonnetLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganBCFJKLLMP18,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {The many facets of upper domination},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {2--25},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.05.042},
doi = {10.1016/J.TCS.2017.05.042},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganBCFJKLLMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BelmonteGKLO18,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {How Bad is the Freedom to Flood-It?},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.5},
doi = {10.4230/LIPICS.FUN.2018.5},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/BelmonteGKLO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lampis18,
author = {Michael Lampis},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Finer Tight Bounds for Coloring on Clique-Width},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {86:1--86:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.86},
doi = {10.4230/LIPICS.ICALP.2018.86},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Lampis18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BelmonteHK0L18,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Eun Jung Kim and
Michael Lampis},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {New Results on Directed Edge Dominating Set},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {67:1--67:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.67},
doi = {10.4230/LIPICS.MFCS.2018.67},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BelmonteHK0L18.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}
}
@inproceedings{DBLP:conf/swat/BampisELP18,
author = {Evripidis Bampis and
Bruno Escoffier and
Michael Lampis and
Vangelis Th. Paschos},
editor = {David Eppstein},
title = {Multistage Matchings},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.7},
doi = {10.4230/LIPICS.SWAT.2018.7},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BampisELP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HanakaKLOS18,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
editor = {David Eppstein},
title = {Parameterized Orientable Deletion},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.24},
doi = {10.4230/LIPICS.SWAT.2018.24},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HanakaKLOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KatsikarelisLP18,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Structurally Parameterized d-Scattered Set},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {292--305},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_24},
doi = {10.1007/978-3-030-00256-5\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KatsikarelisLP18.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-1801-10476,
author = {Eric Angel and
Evripidis Bampis and
Bruno Escoffier and
Michael Lampis},
title = {Parameterized Power Vertex Cover},
journal = {CoRR},
volume = {abs/1801.10476},
year = {2018},
url = {http://arxiv.org/abs/1801.10476},
eprinttype = {arXiv},
eprint = {1801.10476},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-10476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07975,
author = {Michael Lampis},
title = {Finer Tight Bounds for Coloring on Clique-Width},
journal = {CoRR},
volume = {abs/1804.07975},
year = {2018},
url = {http://arxiv.org/abs/1804.07975},
eprinttype = {arXiv},
eprint = {1804.07975},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07975.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08236,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
title = {How Bad is the Freedom to Flood-It?},
journal = {CoRR},
volume = {abs/1804.08236},
year = {2018},
url = {http://arxiv.org/abs/1804.08236},
eprinttype = {arXiv},
eprint = {1804.08236},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08236.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/corr/abs-1807-11518,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
title = {Parameterized Orientable Deletion},
journal = {CoRR},
volume = {abs/1807.11518},
year = {2018},
url = {http://arxiv.org/abs/1807.11518},
eprinttype = {arXiv},
eprint = {1807.11518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-11518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10940,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
journal = {CoRR},
volume = {abs/1810.10940},
year = {2018},
url = {http://arxiv.org/abs/1810.10940},
eprinttype = {arXiv},
eprint = {1810.10940},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10940.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}
}
@inproceedings{DBLP:conf/isaac/KatsikarelisLP17,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {50:1--50:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.50},
doi = {10.4230/LIPICS.ISAAC.2017.50},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KatsikarelisLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonnetGL17,
author = {{\'{E}}douard Bonnet and
Panos Giannopoulos and
Michael Lampis},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {On the Parameterized Complexity of Red-Blue Points Separation},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.8},
doi = {10.4230/LIPICS.IPEC.2017.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BonnetGL17.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 = {Thu, 23 Aug 2018 01:00:00 +0200},
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}
}
@article{DBLP:journals/corr/KatsikarelisLP17,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center},
journal = {CoRR},
volume = {abs/1704.08868},
year = {2017},
url = {http://arxiv.org/abs/1704.08868},
eprinttype = {arXiv},
eprint = {1704.08868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KatsikarelisLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02180,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structurally Parameterized {\textdollar}d{\textdollar}-Scattered Set},
journal = {CoRR},
volume = {abs/1709.02180},
year = {2017},
url = {http://arxiv.org/abs/1709.02180},
eprinttype = {arXiv},
eprint = {1709.02180},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02180.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-00637,
author = {{\'{E}}douard Bonnet and
Panos Giannopoulos and
Michael Lampis},
title = {On the Parameterized Complexity of Red-Blue Points Separation},
journal = {CoRR},
volume = {abs/1710.00637},
year = {2017},
url = {http://arxiv.org/abs/1710.00637},
eprinttype = {arXiv},
eprint = {1710.00637},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-00637.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Algorithmic Aspects of Upper Domination: {A} Parameterised Perspective},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {113--124},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_10},
doi = {10.1007/978-3-319-41168-2\_10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Upper Domination: Complexity and Approximation},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {241--252},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_19},
doi = {10.1007/978-3-319-44543-4\_19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BonnetLP16,
author = {{\'{E}}douard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Time-Approximation Trade-offs for Inapproximable Problems},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.22},
doi = {10.4230/LIPICS.STACS.2016.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BonnetLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FotakisLP16,
author = {Dimitris Fotakis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Sub-exponential Approximation Schemes for CSPs: From Dense to Almost
Sparse},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {37:1--37:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.37},
doi = {10.4230/LIPICS.STACS.2016.37},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FotakisLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AngelBEL16,
author = {Eric Angel and
Evripidis Bampis and
Bruno Escoffier and
Michael Lampis},
editor = {Pinar Heggernes},
title = {Parameterized Power Vertex Cover},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {97--108},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_9},
doi = {10.1007/978-3-662-53536-3\_9},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AngelBEL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KarpinskiLS15,
author = {Marek Karpinski and
Michael Lampis and
Richard Schmied},
title = {New inapproximability bounds for {TSP}},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {8},
pages = {1665--1677},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2015.06.003},
doi = {10.1016/J.JCSS.2015.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KarpinskiLS15.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/BonnetLP15,
author = {Edouard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
title = {Time-Approximation Trade-offs for Inapproximable Problems},
journal = {CoRR},
volume = {abs/1502.05828},
year = {2015},
url = {http://arxiv.org/abs/1502.05828},
eprinttype = {arXiv},
eprint = {1502.05828},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BazganBCFJLLMP15,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Algorithmic Aspects of Upper Domination},
journal = {CoRR},
volume = {abs/1506.07260},
year = {2015},
url = {http://arxiv.org/abs/1506.07260},
eprinttype = {arXiv},
eprint = {1506.07260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BazganBCFJLLMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FotakisLP15,
author = {Dimitris Fotakis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Sub-exponential Approximation Schemes for CSPs: from Dense to Almost
Sparse},
journal = {CoRR},
volume = {abs/1507.04391},
year = {2015},
url = {http://arxiv.org/abs/1507.04391},
eprinttype = {arXiv},
eprint = {1507.04391},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FotakisLP15.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}
}
@article{DBLP:journals/corr/abs-1302-4266,
author = {Michael Lampis},
title = {Model Checking Lower Bounds for Simple Graphs},
journal = {Log. Methods Comput. Sci.},
volume = {10},
number = {1},
year = {2014},
url = {https://doi.org/10.2168/LMCS-10(1:18)2014},
doi = {10.2168/LMCS-10(1:18)2014},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-4266.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Lampis14,
author = {Michael Lampis},
title = {Guest column: the elusive inapproximability of the {TSP}},
journal = {{SIGACT} News},
volume = {45},
number = {1},
pages = {48--65},
year = {2014},
url = {https://doi.org/10.1145/2596583.2596599},
doi = {10.1145/2596583.2596599},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Lampis14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Lampis14,
author = {Michael Lampis},
title = {Improved Inapproximability for {TSP}},
journal = {Theory Comput.},
volume = {10},
pages = {217--236},
year = {2014},
url = {https://doi.org/10.4086/toc.2014.v010a009},
doi = {10.4086/TOC.2014.V010A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Lampis14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lampis14,
author = {Michael Lampis},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Parameterized Approximation Schemes Using Graph Widths},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {775--786},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_64},
doi = {10.1007/978-3-662-43948-7\_64},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Lampis14.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/sigact/Lampis13,
author = {Michael Lampis},
title = {Review of exact exponential algorithms by Fedor V. Fomin and Dieter
Kratsch},
journal = {{SIGACT} News},
volume = {44},
number = {2},
pages = {17--21},
year = {2013},
url = {https://doi.org/10.1145/2491533.2491539},
doi = {10.1145/2491533.2491539},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Lampis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lampis13,
author = {Michael Lampis},
title = {Parameterized maximum path coloring},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {42--53},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.012},
doi = {10.1016/J.TCS.2013.01.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lampis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lampis13,
author = {Michael Lampis},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Model Checking Lower Bounds for Simple Graphs},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {673--683},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_57},
doi = {10.1007/978-3-642-39206-1\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Lampis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KarpinskiLS13,
author = {Marek Karpinski and
Michael Lampis and
Richard Schmied},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {New Inapproximability Bounds for {TSP}},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {568--578},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_53},
doi = {10.1007/978-3-642-45030-3\_53},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KarpinskiLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GajarskyLO13,
author = {Jakub Gajarsk{\'{y}} and
Michael Lampis and
Sebastian Ordyniak},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Parameterized Algorithms for Modular-Width},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {163--176},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_15},
doi = {10.1007/978-3-319-03898-8\_15},
timestamp = {Sun, 04 Aug 2024 19:43:27 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GajarskyLO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-6437,
author = {Marek Karpinski and
Michael Lampis and
Richard Schmied},
title = {New Inapproximability Bounds for {TSP}},
journal = {CoRR},
volume = {abs/1303.6437},
year = {2013},
url = {http://arxiv.org/abs/1303.6437},
eprinttype = {arXiv},
eprint = {1303.6437},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-6437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GajarskyLO13,
author = {Jakub Gajarsk{\'{y}} and
Michael Lampis and
Sebastian Ordyniak},
title = {Parameterized Algorithms for Modular-Width},
journal = {CoRR},
volume = {abs/1308.2858},
year = {2013},
url = {http://arxiv.org/abs/1308.2858},
eprinttype = {arXiv},
eprint = {1308.2858},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GajarskyLO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AchilleosL13,
author = {Antonis Achilleos and
Michael Lampis},
title = {Closing a Gap in the Complexity of Refinement Modal Logic},
journal = {CoRR},
volume = {abs/1309.5184},
year = {2013},
url = {http://arxiv.org/abs/1309.5184},
eprinttype = {arXiv},
eprint = {1309.5184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AchilleosL13.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/corr/Lampis13,
author = {Michael Lampis},
title = {Parameterized Approximation Schemes using Graph Widths},
journal = {CoRR},
volume = {abs/1311.2466},
year = {2013},
url = {http://arxiv.org/abs/1311.2466},
eprinttype = {arXiv},
eprint = {1311.2466},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Lampis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarpinskiLS13,
author = {Marek Karpinski and
Michael Lampis and
Richard Schmied},
title = {New Inapproximability Bounds for {TSP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-045}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/045},
eprinttype = {ECCC},
eprint = {TR13-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KarpinskiLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Lampis12,
author = {Michael Lampis},
title = {Algorithmic Meta-theorems for Restrictions of Treewidth},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {19--37},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9554-x},
doi = {10.1007/S00453-011-9554-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Lampis12.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/jco/Bar-NoyL12,
author = {Amotz Bar{-}Noy and
Michael Lampis},
title = {Online maximum directed cut},
journal = {J. Comb. Optim.},
volume = {24},
number = {1},
pages = {52--64},
year = {2012},
url = {https://doi.org/10.1007/s10878-010-9318-6},
doi = {10.1007/S10878-010-9318-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bar-NoyL12.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/approx/Lampis12,
author = {Michael Lampis},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Improved Inapproximability for {TSP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {243--253},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_21},
doi = {10.1007/978-3-642-32512-0\_21},
timestamp = {Sun, 04 Aug 2024 19:37:16 +0200},
biburl = {https://dblp.org/rec/conf/approx/Lampis12.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/corr/abs-1206-2497,
author = {Michael Lampis},
title = {Improved Inapproximability for {TSP}},
journal = {CoRR},
volume = {abs/1206.2497},
year = {2012},
url = {http://arxiv.org/abs/1206.2497},
eprinttype = {arXiv},
eprint = {1206.2497},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-2497.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0524,
author = {Michael Lampis},
title = {Local Improvement Gives Better Expanders},
journal = {CoRR},
volume = {abs/1211.0524},
year = {2012},
url = {http://arxiv.org/abs/1211.0524},
eprinttype = {arXiv},
eprint = {1211.0524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0524.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/ipl/Lampis11,
author = {Michael Lampis},
title = {A kernel of order 2 k-c log k for vertex cover},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1089--1091},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.003},
doi = {10.1016/J.IPL.2011.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lampis11.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/iwpec/Lampis11,
author = {Michael Lampis},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Parameterized Maximum Path Coloring},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011. Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {232--245},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_19},
doi = {10.1007/978-3-642-28050-4\_19},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Lampis11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Lampis10,
author = {Michael Lampis},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Algorithmic Meta-theorems for Restrictions of Treewidth},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {549--560},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_47},
doi = {10.1007/978-3-642-15775-2\_47},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Lampis10.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/isaac/Bar-NoyL09,
author = {Amotz Bar{-}Noy and
Michael Lampis},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Online Maximum Directed Cut},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {1124--1133},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_113},
doi = {10.1007/978-3-642-10631-6\_113},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyL09.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-0910-0582,
author = {Michael Lampis},
title = {Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover},
journal = {CoRR},
volume = {abs/0910.0582},
year = {2009},
url = {http://arxiv.org/abs/0910.0582},
eprinttype = {arXiv},
eprint = {0910.0582},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-0582.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}
}
@inproceedings{DBLP:conf/atmos/BampasKLP06,
author = {Evangelos Bampas and
Georgia Kaouri and
Michael Lampis and
Aris Pagourtzis},
editor = {Riko Jacob and
Matthias M{\"{u}}ller{-}Hannemann},
title = {Periodic Metro Scheduling},
booktitle = {{ATMOS} 2006 - 6th Workshop on Algorithmic Methods and Models for
Optimization of Railways, September 14, 2006, {ETH} Z{\"{u}}rich,
Zurich, Switzerland, Selected Papers},
series = {OASIcs},
volume = {6},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/684},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/atmos/BampasKLP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/LampisGPP08,
author = {Michael Lampis and
Kyriakos G. Ginis and
Michalis A. Papakyriakou and
Nikolaos S. Papaspyrou},
editor = {Peter Selinger},
title = {Quantum Data and Control Made Easier},
booktitle = {Proceedings of the 4th International Workshop on Quantum Programming
Languages, {QPL} 2006, Oxford, UK, July 17-19, 2006},
series = {Electronic Notes in Theoretical Computer Science},
volume = {210},
pages = {85--105},
publisher = {Elsevier},
year = {2006},
url = {https://doi.org/10.1016/j.entcs.2008.04.020},
doi = {10.1016/J.ENTCS.2008.04.020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/LampisGPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
