Ararat Harutyunyan Michael Lampis Nikolaos Melissinos Digraph Coloring and Distance to Acyclicity. 986-1013 2024 August 68 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-022-10103-x db/journals/mst/mst68.html#HarutyunyanLM24 streams/journals/mst
Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos Filling crosswords is very hard. 114275 2024 January 982 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2023.114275 db/journals/tcs/tcs982.html#GourvesHLM24
Andreas Emil Feldmann Michael Lampis Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. 2024 abs/2402.09835 CoRR https://doi.org/10.48550/arXiv.2402.09835 db/journals/corr/corr2402.html#abs-2402-09835
Tesshu Hanaka Michael Lampis Manolis Vasilakis Kanae Yoshiwatari Parameterized Vertex Integrity Revisited. 2024 abs/2402.09971 CoRR https://doi.org/10.48550/arXiv.2402.09971 db/journals/corr/corr2402.html#abs-2402-09971
Tesshu Hanaka Noleen Köhler Michael Lampis Core Stability in Additively Separable Hedonic Games of Low Treewidth. 2024 abs/2402.10815 CoRR https://doi.org/10.48550/arXiv.2402.10815 db/journals/corr/corr2402.html#abs-2402-10815
Michael Lampis The Primal Pathwidth SETH. 2024 abs/2403.07239 CoRR https://doi.org/10.48550/arXiv.2403.07239 db/journals/corr/corr2403.html#abs-2403-07239
Michael Lampis Manolis Vasilakis Parameterized Maximum Node-Disjoint Paths. 2024 abs/2404.14849 CoRR https://doi.org/10.48550/arXiv.2404.14849 db/journals/corr/corr2404.html#abs-2404-14849
Michael Lampis Circuits and Backdoors: Five Shades of the SETH. 2024 abs/2407.09683 CoRR https://doi.org/10.48550/arXiv.2407.09683 db/journals/corr/corr2407.html#abs-2407-09683 streams/journals/corr
Rémy Belmonte Tesshu Hanaka Ioannis Katsikarelis Eun Jung Kim 0002 Michael Lampis New Results on Directed Edge Dominating Set. 2023 25 Discret. Math. Theor. Comput. Sci. https://doi.org/10.46298/dmtcs.5378 db/journals/dmtcs/dmtcs25.html#BelmonteHKKL23
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Improved (In-)Approximability Bounds for d-Scattered Set. 219-238 2023 27 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00621 db/journals/jgaa/jgaa27.html#KatsikarelisLP23
Michael Lampis Nikolaos Melissinos Manolis Vasilakis Parameterized Max Min Feedback Vertex Set. 2023 abs/2302.09604 CoRR https://doi.org/10.48550/arXiv.2302.09604 db/journals/corr/corr2302.html#abs-2302-09604
Michael Lampis Manolis Vasilakis Structural Parameterizations for Two Bounded Degree Problems Revisited. 2023 abs/2304.14724 CoRR https://doi.org/10.48550/arXiv.2304.14724 db/journals/corr/corr2304.html#abs-2304-14724
Rémy Belmonte Tesshu Hanaka Masaaki Kanzaki Masashi Kiyomi Yasuaki Kobayashi Yusuke Kobayashi 0001 Michael Lampis Hirotaka Ono 0001 Yota Otachi Parameterized Complexity of (A, ℓ )-Path Packing. 871-895 2022 84 Algorithmica 4 https://doi.org/10.1007/s00453-021-00875-y db/journals/algorithmica/algorithmica84.html#BelmonteHKKKKLO22
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Structurally parameterized d-scattered set. 168-186 2022 308 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.03.052 db/journals/dam/dam308.html#KatsikarelisLP22
Rémy Belmonte Michael Lampis Valia Mitsou Defective Coloring on Classes of Perfect Graphs. 2022 24 Discret. Math. Theor. Comput. Sci. 1 https://doi.org/10.46298/dmtcs.4926 db/journals/dmtcs/dmtcs24.html#BelmonteLM22
Louis Dublois Tesshu Hanaka Mehdi Khosravian Ghadikolaei Michael Lampis Nikolaos Melissinos (In)approximability of maximum minimal FVS. 26-40 2022 124 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2021.09.001 db/journals/jcss/jcss124.html#DubloisHGLM22
Rémy Belmonte Eun Jung Kim 0002 Michael Lampis Valia Mitsou Yota Otachi Grundy Distinguishes Treewidth from Pathwidth. 1761-1787 2022 September 36 SIAM J. Discret. Math. 3 https://doi.org/10.1137/20m1385779 db/journals/siamdm/siamdm36.html#BelmonteKLMO22
Louis Dublois Michael Lampis Vangelis Th. Paschos Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. 271-291 2022 923 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.05.013 https://www.wikidata.org/entity/Q114129104 db/journals/tcs/tcs923.html#DubloisLP22
Tesshu Hanaka Michael Lampis Hedonic Games and Treewidth Revisited. 2022 abs/2202.06925 CoRR https://arxiv.org/abs/2202.06925 db/journals/corr/corr2202.html#abs-2202-06925
Michael Lampis First Order Logic on Pathwidth Revisited Again. 2022 abs/2210.09899 CoRR https://doi.org/10.48550/arXiv.2210.09899 db/journals/corr/corr2210.html#abs-2210-09899
Louis Dublois Michael Lampis Vangelis Th. Paschos New Algorithms for Mixed Dominating Set. 2021 23 Discret. Math. Theor. Comput. Sci. 1 https://doi.org/10.46298/dmtcs.6824 db/journals/dmtcs/dmtcs23.html#DubloisLP21
Rémy Belmonte Eun Jung Kim 0002 Michael Lampis Valia Mitsou Yota Otachi Florian Sikora Token Sliding on Split Graphs. 662-686 2021 65 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-020-09967-8 db/journals/mst/mst65.html#BelmonteKLMOS21
Louis Dublois Michael Lampis Vangelis Th. Paschos Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. 2021 abs/2101.07550 CoRR https://arxiv.org/abs/2101.07550 db/journals/corr/corr2101.html#abs-2101-07550
Michael Lampis Determining a Slater Winner is Complete for Parallel Access to NP. 2021 abs/2103.16416 CoRR https://arxiv.org/abs/2103.16416 db/journals/corr/corr2103.html#abs-2103-16416
Michael Lampis Minimum Stable Cut and Treewidth. 2021 abs/2104.13097 CoRR https://arxiv.org/abs/2104.13097 db/journals/corr/corr2104.html#abs-2104-13097
Michael Lampis Valia Mitsou Fine-grained Meta-Theorems for Vertex Integrity. 2021 abs/2109.10333 CoRR https://arxiv.org/abs/2109.10333 db/journals/corr/corr2109.html#abs-2109-10333
Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos Filling Crosswords is Very Hard. 2021 abs/2109.11203 CoRR https://arxiv.org/abs/2109.11203 db/journals/corr/corr2109.html#abs-2109-11203
Tesshu Hanaka Ioannis Katsikarelis Michael Lampis Yota Otachi Florian Sikora Parameterized Orientable Deletion. 1909-1938 2020 82 Algorithmica 7 https://doi.org/10.1007/s00453-020-00679-6 db/journals/algorithmica/algorithmica82.html#HanakaKLOS20
Rémy Belmonte Tesshu Hanaka Michael Lampis Hirotaka Ono 0001 Yota Otachi Independent Set Reconfiguration Parameterized by Modular-Width. 2586-2605 2020 82 Algorithmica 9 https://doi.org/10.1007/s00453-020-00700-y db/journals/algorithmica/algorithmica82.html#BelmonteHLOO20
Rémy Belmonte Tesshu Hanaka Ioannis Katsikarelis Michael Lampis Hirotaka Ono 0001 Yota Otachi Parameterized Complexity of Safe Set. 215-245 2020 24 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00528 db/journals/jgaa/jgaa24.html#BelmonteHKLOO20
Kyohei Chiba Rémy Belmonte Hiro Ito Michael Lampis Atsuki Nagao Yota Otachi <i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense. 849-858 2020 28 J. Inf. Process. https://doi.org/10.2197/ipsjjip.28.849 db/journals/jip/jip28.html#ChibaBILNO20
Rémy Belmonte Michael Lampis Valia Mitsou Parameterized (Approximate) Defective Coloring. 1084-1106 2020 34 SIAM J. Discret. Math. 2 https://doi.org/10.1137/18M1223666 db/journals/siamdm/siamdm34.html#BelmonteLM20
Michael Lampis Finer Tight Bounds for Coloring on Clique-Width. 1538-1558 2020 34 SIAM J. Discret. Math. 3 https://doi.org/10.1137/19M1280326 db/journals/siamdm/siamdm34.html#Lampis20
Ararat Harutyunyan Michael Lampis Vadim V. Lozin Jérôme Monnot Maximum independent sets in subcubic graphs: New results. 14-26 2020 846 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.09.010 db/journals/tcs/tcs846.html#HarutyunyanLLM20
Rémy Belmonte Tesshu Hanaka Masaaki Kanzaki Masashi Kiyomi Yasuaki Kobayashi Yusuke Kobayashi 0001 Michael Lampis Hirotaka Ono 0001 Yota Otachi Parameterized Complexity of (A, 𝓁)-Path Packing. 2020 abs/2008.03448 CoRR https://arxiv.org/abs/2008.03448 db/journals/corr/corr2008.html#abs-2008-03448
Rémy Belmonte Eun Jung Kim 0002 Michael Lampis Valia Mitsou Yota Otachi Grundy Distinguishes Treewidth from Pathwidth. 2020 abs/2008.07425 CoRR https://arxiv.org/abs/2008.07425 db/journals/corr/corr2008.html#abs-2008-07425
Louis Dublois Tesshu Hanaka Mehdi Khosravian Ghadikolaei Michael Lampis Nikolaos Melissinos (In)approximability of Maximum Minimal FVS. 2020 abs/2009.09971 CoRR https://arxiv.org/abs/2009.09971 db/journals/corr/corr2009.html#abs-2009-09971
Ararat Harutyunyan Michael Lampis Nikolaos Melissinos Digraph Coloring and Distance to Acyclicity. 2020 abs/2010.06317 CoRR https://arxiv.org/abs/2010.06317 db/journals/corr/corr2010.html#abs-2010-06317
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Structural parameters, tight bounds, and approximation for (k, r)-center. 90-117 2019 264 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.11.002 db/journals/dam/dam264.html#KatsikarelisLP19
Rémy Belmonte Mehdi Khosravian Ghadikolaei Masashi Kiyomi Michael Lampis Yota Otachi How Bad is the Freedom to Flood-It? 111-134 2019 23 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00486 db/journals/jgaa/jgaa23.html#BelmonteGKLO19
Edouard Bonnet Panos Giannopoulos Michael Lampis On the parameterized complexity of red-blue points separation. 181-206 2019 10 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v10i1a7 db/journals/jocg/jocg10.html#BonnetGL19
Rémy Belmonte Tesshu Hanaka Ioannis Katsikarelis Michael Lampis Hirotaka Ono 0001 Yota Otachi Parameterized Complexity of Safe Set. 2019 abs/1901.09434 CoRR http://arxiv.org/abs/1901.09434 db/journals/corr/corr1901.html#abs-1901-09434
Rémy Belmonte Tesshu Hanaka Ioannis Katsikarelis Eun Jung Kim 0002 Michael Lampis New Results on Directed Edge Dominating Set. 2019 abs/1902.04919 CoRR http://arxiv.org/abs/1902.04919 db/journals/corr/corr1902.html#abs-1902-04919
Rémy Belmonte Tesshu Hanaka Michael Lampis Hirotaka Ono 0001 Yota Otachi Independent Set Reconfiguration Parameterized by Modular-Width. 2019 abs/1905.00340 CoRR http://arxiv.org/abs/1905.00340 db/journals/corr/corr1905.html#abs-1905-00340
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Improved (In-)Approximability Bounds for d-Scattered Set. 2019 abs/1910.05589 CoRR http://arxiv.org/abs/1910.05589 db/journals/corr/corr1910.html#abs-1910-05589
Louis Dublois Michael Lampis Vangelis Th. Paschos New Algorithms for Mixed Dominating Set. 2019 abs/1911.08964 CoRR http://arxiv.org/abs/1911.08964 db/journals/corr/corr1911.html#abs-1911-08964
Michael Lampis Kazuhisa Makino Valia Mitsou Yushi Uno Parameterized Edge Hamiltonicity. 68-78 2018 248 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.04.045 db/journals/dam/dam248.html#LampisMMU18
Eric Angel Evripidis Bampis Bruno Escoffier Michael Lampis Parameterized Power Vertex Cover. 2018 20 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.23638/DMTCS-20-2-10 db/journals/dmtcs/dmtcs20.html#AngelBEL18
Édouard Bonnet Michael Lampis Vangelis Th. Paschos Time-approximation trade-offs for inapproximable problems. 171-180 2018 92 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2017.09.009 db/journals/jcss/jcss92.html#BonnetLP18
Cristina Bazgan Ljiljana Brankovic Katrin Casel Henning Fernau Klaus Jansen Kim-Manuel Klein Michael Lampis Mathieu Liedloff Jérôme Monnot Vangelis Th. Paschos The many facets of upper domination. 2-25 2018 717 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2017.05.042 db/journals/tcs/tcs717.html#BazganBCFJKLLMP18
Rémy Belmonte Michael Lampis Valia Mitsou Parameterized (Approximate) Defective Coloring. 2018 abs/1801.03879 CoRR http://arxiv.org/abs/1801.03879 db/journals/corr/corr1801.html#abs-1801-03879
Eric Angel Evripidis Bampis Bruno Escoffier Michael Lampis Parameterized Power Vertex Cover. 2018 abs/1801.10476 CoRR http://arxiv.org/abs/1801.10476 db/journals/corr/corr1801.html#abs-1801-10476
Michael Lampis Finer Tight Bounds for Coloring on Clique-Width. 2018 abs/1804.07975 CoRR http://arxiv.org/abs/1804.07975 db/journals/corr/corr1804.html#abs-1804-07975
Rémy Belmonte Mehdi Khosravian Ghadikolaei Masashi Kiyomi Michael Lampis Yota Otachi How Bad is the Freedom to Flood-It? 2018 abs/1804.08236 CoRR http://arxiv.org/abs/1804.08236 db/journals/corr/corr1804.html#abs-1804-08236
Michael Lampis Stefan Mengel Valia Mitsou QBF as an Alternative to Courcelle's Theorem. 2018 abs/1805.08456 CoRR http://arxiv.org/abs/1805.08456 db/journals/corr/corr1805.html#abs-1805-08456
Rémy Belmonte Eun Jung Kim 0002 Michael Lampis Valia Mitsou Yota Otachi Florian Sikora Token Sliding on Split Graphs. 2018 abs/1807.05322 CoRR http://arxiv.org/abs/1807.05322 db/journals/corr/corr1807.html#abs-1807-05322
Tesshu Hanaka Ioannis Katsikarelis Michael Lampis Yota Otachi Florian Sikora Parameterized Orientable Deletion. 2018 abs/1807.11518 CoRR http://arxiv.org/abs/1807.11518 db/journals/corr/corr1807.html#abs-1807-11518
Ararat Harutyunyan Michael Lampis Vadim V. Lozin Jérôme Monnot Maximum Independent Sets in Subcubic Graphs: New Results. 2018 abs/1810.10940 CoRR http://arxiv.org/abs/1810.10940 db/journals/corr/corr1810.html#abs-1810-10940
Holger Dell Eun Jung Kim 0002 Michael Lampis Valia Mitsou Tobias Mömke Complexity and Approximability of Parameterized MAX-CSPs. 230-250 2017 79 Algorithmica 1 https://doi.org/10.1007/s00453-017-0310-8 db/journals/algorithmica/algorithmica79.html#DellKLMM17
Rémy Belmonte Michael Lampis Valia Mitsou Defective Coloring on Classes of Perfect Graphs. 2017 abs/1702.08903 CoRR http://arxiv.org/abs/1702.08903 db/journals/corr/corr1702.html#BelmonteLM17
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. 2017 abs/1704.08868 CoRR http://arxiv.org/abs/1704.08868 db/journals/corr/corr1704.html#KatsikarelisLP17
Ioannis Katsikarelis Michael Lampis Vangelis Th. Paschos Structurally Parameterized $d$-Scattered Set. 2017 abs/1709.02180 CoRR http://arxiv.org/abs/1709.02180 db/journals/corr/corr1709.html#abs-1709-02180
Édouard Bonnet Panos Giannopoulos Michael Lampis On the Parameterized Complexity of Red-Blue Points Separation. 2017 abs/1710.00637 CoRR http://arxiv.org/abs/1710.00637 db/journals/corr/corr1710.html#abs-1710-00637
Marek Karpinski Michael Lampis Richard Schmied New inapproximability bounds for TSP. 1665-1677 2015 81 J. Comput. Syst. Sci. 8 https://doi.org/10.1016/j.jcss.2015.06.003 https://www.wikidata.org/entity/Q55899759 db/journals/jcss/jcss81.html#KarpinskiLS15
Michael Lampis Valia Mitsou Karolina Soltys Scrabble is PSPACE-Complete. 284-292 2015 23 J. Inf. Process. 3 https://doi.org/10.2197/ipsjjip.23.284 db/journals/jip/jip23.html#LampisMS15
Edouard Bonnet Michael Lampis Vangelis Th. Paschos Time-Approximation Trade-offs for Inapproximable Problems. 2015 abs/1502.05828 CoRR http://arxiv.org/abs/1502.05828 db/journals/corr/corr1502.html#BonnetLP15
Cristina Bazgan Ljiljana Brankovic Katrin Casel Henning Fernau Klaus Jansen Michael Lampis Mathieu Liedloff Jérôme Monnot Vangelis Th. Paschos Algorithmic Aspects of Upper Domination. 2015 abs/1506.07260 CoRR http://arxiv.org/abs/1506.07260 db/journals/corr/corr1506.html#BazganBCFJLLMP15
Dimitris Fotakis 0001 Michael Lampis Vangelis Th. Paschos Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. 2015 abs/1507.04391 CoRR http://arxiv.org/abs/1507.04391 db/journals/corr/corr1507.html#FotakisLP15
Holger Dell Eun Jung Kim 0002 Michael Lampis Valia Mitsou Tobias Mömke Complexity and Approximability of Parameterized MAX-CSPs. 2015 abs/1511.05546 CoRR http://arxiv.org/abs/1511.05546 db/journals/corr/corr1511.html#Dell0LMM15
Michael Lampis Model Checking Lower Bounds for Simple Graphs https://doi.org/10.2168/LMCS-10(1:18)2014 http://arxiv.org/abs/1302.4266 2014 Log. Methods Comput. Sci. 10 1 db/journals/lmcs/lmcs10.html#abs-1302-4266
Michael Lampis Guest column: the elusive inapproximability of the TSP. 48-65 2014 45 SIGACT News 1 https://doi.org/10.1145/2596583.2596599 db/journals/sigact/sigact45.html#Lampis14
Michael Lampis Improved Inapproximability for TSP. 217-236 2014 10 Theory Comput. https://doi.org/10.4086/toc.2014.v010a009 db/journals/toc/toc10.html#Lampis14
Michael Lampis Kazuhisa Makino Valia Mitsou Yushi Uno Parameterized Edge Hamiltonicity. 2014 abs/1403.2041 CoRR http://arxiv.org/abs/1403.2041 db/journals/corr/corr1403.html#LampisMMU14
Michael Lampis Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch. 17-21 2013 44 SIGACT News 2 https://doi.org/10.1145/2491533.2491539 db/journals/sigact/sigact44.html#Lampis13
Michael Lampis Parameterized maximum path coloring. 42-53 2013 511 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.01.012 db/journals/tcs/tcs511.html#Lampis13
Marek Karpinski Michael Lampis Richard Schmied New Inapproximability Bounds for TSP http://arxiv.org/abs/1303.6437 2013 CoRR abs/1303.6437 db/journals/corr/corr1303.html#abs-1303-6437
Jakub Gajarský Michael Lampis Sebastian Ordyniak Parameterized Algorithms for Modular-Width. 2013 CoRR http://arxiv.org/abs/1308.2858 abs/1308.2858 db/journals/corr/corr1308.html#GajarskyLO13
Antonis Achilleos Michael Lampis Closing a Gap in the Complexity of Refinement Modal Logic. 2013 CoRR http://arxiv.org/abs/1309.5184 abs/1309.5184 db/journals/corr/corr1309.html#AchilleosL13
Michael Lampis Valia Mitsou The Computational Complexity of the Game of Set and its Theoretical Applications. 2013 CoRR http://arxiv.org/abs/1309.6504 abs/1309.6504 db/journals/corr/corr1309.html#LampisM13
Michael Lampis Parameterized Approximation Schemes using Graph Widths. 2013 CoRR http://arxiv.org/abs/1311.2466 abs/1311.2466 db/journals/corr/corr1311.html#Lampis13
Marek Karpinski Michael Lampis Richard Schmied New Inapproximability Bounds for TSP. TR13-045 2013 TR13 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2013/045 db/journals/eccc/eccc20.html#KarpinskiLS13
Michael Lampis Algorithmic Meta-theorems for Restrictions of Treewidth. 19-37 2012 64 Algorithmica 1 https://doi.org/10.1007/s00453-011-9554-x db/journals/algorithmica/algorithmica64.html#Lampis12
Antonis Achilleos Michael Lampis Valia Mitsou Parameterized Modal Satisfiability. 38-55 2012 64 Algorithmica 1 https://doi.org/10.1007/s00453-011-9552-z db/journals/algorithmica/algorithmica64.html#AchilleosLM12
Amotz Bar-Noy Michael Lampis Online maximum directed cut. 52-64 2012 24 J. Comb. Optim. 1 https://doi.org/10.1007/s10878-010-9318-6 db/journals/jco/jco24.html#Bar-NoyL12
Amotz Bar-Noy Panagiotis Cheilaris Michael Lampis Valia Mitsou Stathis Zachos Ordered coloring of grids and related graphs. 40-51 2012 444 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.04.036 db/journals/tcs/tcs444.html#Bar-NoyCLMZ12
Michael Lampis Valia Mitsou Karolina Soltys Scrabble is PSPACE-Complete http://arxiv.org/abs/1201.5298 2012 CoRR abs/1201.5298 db/journals/corr/corr1201.html#abs-1201-5298
Michael Lampis Improved Inapproximability for TSP http://arxiv.org/abs/1206.2497 2012 CoRR abs/1206.2497 db/journals/corr/corr1206.html#abs-1206-2497
Michael Lampis Local Improvement Gives Better Expanders http://arxiv.org/abs/1211.0524 2012 CoRR abs/1211.0524 db/journals/corr/corr1211.html#abs-1211-0524
Michael Lampis Georgia Kaouri Valia Mitsou On the algorithmic effectiveness of digraph decompositions and complexity measures. 129-138 2011 8 Discret. Optim. 1 https://doi.org/10.1016/j.disopt.2010.03.010 db/journals/disopt/disopt8.html#LampisKM11
Michael Lampis A kernel of order 2 k-c log k for vertex cover. 1089-1091 2011 111 Inf. Process. Lett. 23-24 https://doi.org/10.1016/j.ipl.2011.09.003 db/journals/ipl/ipl111.html#Lampis11
Gregory Z. Gutin Eun Jung Kim 0002 Michael Lampis Valia Mitsou Vertex Cover Problem Parameterized Above and Below Tight Bounds. 402-410 2011 48 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-010-9262-y db/journals/mst/mst48.html#GutinKLM11
Michael Lampis Valia Mitsou The Ferry Cover Problem. 215-229 2009 44 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9107-0 db/journals/mst/mst44.html#LampisM09
Gregory Z. Gutin Eun Jung Kim 0002 Michael Lampis Valia Mitsou Vertex Cover Problem Parameterized Above and Below Tight Bounds http://arxiv.org/abs/0907.4488 2009 CoRR abs/0907.4488 db/journals/corr/corr0907.html#abs-0907-4488
Michael Lampis Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover http://arxiv.org/abs/0910.0582 2009 CoRR abs/0910.0582 db/journals/corr/corr0910.html#abs-0910-0582
Antonis Achilleos Michael Lampis Valia Mitsou Parameterized Modal Satisfiability http://arxiv.org/abs/0912.4941 2009 CoRR abs/0912.4941 db/journals/corr/corr0912.html#abs-0912-4941
