Periodic Metro Scheduling. - Evangelos Bampas; Georgia Kaouri; Michael Lampis; Aris Pagourtzis (ATMOS, 2006)

Quantum Data and Control Made Easier. - Michael Lampis; Kyriakos G. Ginis; Michalis A. Papakyriakou; Nikolaos S. Papaspyrou (QPL, 2006)

Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover - Michael Lampis (CoRR, 2009)

The Ferry Cover Problem. - Michael Lampis; Valia Mitsou (Theory Comput. Syst., 2009)

On the algorithmic effectiveness of digraph decompositions and complexity measures. - Michael Lampis; Georgia Kaouri; Valia Mitsou (Discret. Optim., 2011)

A kernel of order 2 k-c log k for vertex cover. - Michael Lampis (Inf. Process. Lett., 2011)

Vertex Cover Problem Parameterized Above and Below Tight Bounds. - Gregory Z. Gutin; Eun Jung Kim 002; Michael Lampis; Valia Mitsou (Theory Comput. Syst., 2011)

Parameterized Modal Satisfiability. - Antonis Achilleos; Michael Lampis; Valia Mitsou (Algorithmica, 2012)

Algorithmic Meta-theorems for Restrictions of Treewidth. - Michael Lampis (Algorithmica, 2012)

Local Improvement Gives Better Expanders - Michael Lampis (CoRR, 2012)

Online maximum directed cut. - Amotz Bar-Noy; Michael Lampis (J. Comb. Optim., 2012)

Ordered coloring of grids and related graphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Michael Lampis; Valia Mitsou; Stathis Zachos (Theor. Comput. Sci., 2012)

Parameterized Algorithms for Modular-Width. - Jakub Gajarský; Michael Lampis; Sebastian Ordyniak (IPEC, 2013)

Closing a Gap in the Complexity of Refinement Modal Logic. - Antonis Achilleos; Michael Lampis (CoRR, 2013)

Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch. - Michael Lampis (SIGACT News, 2013)

Parameterized maximum path coloring. - Michael Lampis (Theor. Comput. Sci., 2013)

Parameterized Approximation Schemes Using Graph Widths. - Michael Lampis (ICALP (1), 2014)

The Computational Complexity of the Game of Set and Its Theoretical Applications. - Michael Lampis; Valia Mitsou (LATIN, 2014)

Model Checking Lower Bounds for Simple Graphs - Michael Lampis (Log. Methods Comput. Sci., 2014)

Guest column: the elusive inapproximability of the TSP. - Michael Lampis (SIGACT News, 2014)

Improved Inapproximability for TSP. - Michael Lampis (Theory Comput., 2014)

Parameterized Algorithms for Parity Games. - Jakub Gajarský; Michael Lampis; Kazuhisa Makino; Valia Mitsou; Sebastian Ordyniak (MFCS (2), 2015)

Algorithmic Aspects of Upper Domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (CoRR, 2015)

New inapproximability bounds for TSP. - Marek Karpinski; Michael Lampis; Richard Schmied (J. Comput. Syst. Sci., 2015)

Scrabble is PSPACE-Complete. - Michael Lampis; Valia Mitsou; Karolina Soltys (J. Inf. Process., 2015)

Algorithmic Aspects of Upper Domination: A Parameterised Perspective. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (AAIM, 2016)

Upper Domination: Complexity and Approximation. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (IWOCA, 2016)

Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. - Dimitris Fotakis 001; Michael Lampis; Vangelis Th. Paschos (STACS, 2016)

Treewidth with a Quantifier Alternation Revisited. - Michael Lampis; Valia Mitsou (IPEC, 2017)

Complexity and Approximability of Parameterized MAX-CSPs. - Holger Dell; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Tobias Mömke (Algorithmica, 2017)

QBF as an Alternative to Courcelle's Theorem. - Michael Lampis; Stefan Mengel; Valia Mitsou (SAT, 2018)

Multistage Matchings. - Evripidis Bampis; Bruno Escoffier; Michael Lampis; Vangelis Th. Paschos (SWAT, 2018)

Parameterized Edge Hamiltonicity. - Michael Lampis; Kazuhisa Makino; Valia Mitsou; Yushi Uno (Discret. Appl. Math., 2018)

Parameterized Power Vertex Cover. - Eric Angel; Evripidis Bampis; Bruno Escoffier; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2018)

Time-approximation trade-offs for inapproximable problems. - Édouard Bonnet; Michael Lampis; Vangelis Th. Paschos (J. Comput. Syst. Sci., 2018)

The many facets of upper domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (Theor. Comput. Sci., 2018)

Structural parameters, tight bounds, and approximation for (k, r)-center. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (Discret. Appl. Math., 2019)

How Bad is the Freedom to Flood-It? - Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi (J. Graph Algorithms Appl., 2019)

On the parameterized complexity of red-blue points separation. - Edouard Bonnet; Panos Giannopoulos; Michael Lampis (J. Comput. Geom., 2019)

Independent Set Reconfiguration Parameterized by Modular-Width. - Rémy Belmonte; Tesshu Hanaka; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2020)

Parameterized Orientable Deletion. - Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Yota Otachi; Florian Sikora (Algorithmica, 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

K3 Edge Cover Problem in a Wide Sense. - Kyohei Chiba; Rémy Belmonte; Hiro Ito; Michael Lampis; Atsuki Nagao; Yota Otachi (J. Inf. Process., 2020)

Parameterized (Approximate) Defective Coloring. - Rémy Belmonte; Michael Lampis; Valia Mitsou (SIAM J. Discret. Math., 2020)

Finer Tight Bounds for Coloring on Clique-Width. - Michael Lampis (SIAM J. Discret. Math., 2020)

Maximum independent sets in subcubic graphs: New results. - Ararat Harutyunyan; Michael Lampis; Vadim V. Lozin; Jérôme Monnot (Theor. Comput. Sci., 2020)

Minimum Stable Cut and Treewidth. - Michael Lampis (ICALP, 2021)

New Algorithms for Mixed Dominating Set. - Louis Dublois; Michael Lampis; Vangelis Th. Paschos (Discret. Math. Theor. Comput. Sci., 2021)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

Structural Graph Parameters, Fine-Grained Complexity, and Approximation. - Michael Lampis (2022)

Hedonic Games and Treewidth Revisited. - Tesshu Hanaka; Michael Lampis (ESA, 2022)

Determining a Slater Winner Is Complete for Parallel Access to NP. - Michael Lampis (STACS, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Structurally parameterized d-scattered set. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (Discret. Appl. Math., 2022)

Defective Coloring on Classes of Perfect Graphs. - Rémy Belmonte; Michael Lampis; Valia Mitsou (Discret. Math. Theor. Comput. Sci., 2022)

(In)approximability of maximum minimal FVS. - Louis Dublois; Tesshu Hanaka; Mehdi Khosravian Ghadikolaei; Michael Lampis; Nikolaos Melissinos (J. Comput. Syst. Sci., 2022)

Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. - Louis Dublois; Michael Lampis; Vangelis Th. Paschos (Theor. Comput. Sci., 2022)

Grundy Distinguishes Treewidth from Pathwidth. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi (SIAM J. Discret. Math., 2022)

First Order Logic on Pathwidth Revisited Again. - Michael Lampis (ICALP, 2023)

Parameterized Max Min Feedback Vertex Set. - Michael Lampis; Nikolaos Melissinos; Manolis Vasilakis (MFCS, 2023)

New Results on Directed Edge Dominating Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Eun Jung Kim 002; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2023)

Improved (In-)Approximability Bounds for d-Scattered Set. - Ioannis Katsikarelis; Michael Lampis; Vangelis Th. Paschos (J. Graph Algorithms Appl., 2023)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. - Andreas Emil Feldmann; Michael Lampis (ICALP, 2024)

Core Stability in Additively Separable Hedonic Games of Low Treewidth. - Tesshu Hanaka; Noleen Köhler; Michael Lampis (ISAAC, 2024)

Parameterized Vertex Integrity Revisited. - Tesshu Hanaka; Michael Lampis; Manolis Vasilakis; Kanae Yoshiwatari (MFCS, 2024)

Faster Winner Determination Algorithms for (Colored) Arc Kayles. - Tesshu Hanaka; Hironori Kiya; Michael Lampis; Hirotaka Ono 001; Kanae Yoshiwatari (SOFSEM, 2024)

Parameterized Maximum Node-Disjoint Paths. - Michael Lampis; Manolis Vasilakis (CoRR, 2024)

Circuits and Backdoors: Five Shades of the SETH. - Michael Lampis (CoRR, 2024)

Fine-grained Meta-Theorems for Vertex Integrity. - Michael Lampis; Valia Mitsou (Log. Methods Comput. Sci., 2024)

Filling crosswords is very hard. - Laurent Gourvès; Ararat Harutyunyan; Michael Lampis; Nikolaos Melissinos (Theor. Comput. Sci., 2024)

Digraph Coloring and Distance to Acyclicity. - Ararat Harutyunyan; Michael Lampis; Nikolaos Melissinos (Theory Comput. Syst., 2024)

Structural Parameterizations for Two Bounded Degree Problems Revisited. - Michael Lampis; Manolis Vasilakis (ACM Trans. Comput. Theory, 2024)

Satisfactory Budget Division. - Laurent Gourvès; Michael Lampis; Nikolaos Melissinos; Aris Pagourtzis (AAMAS, 2025)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Parameterized Spanning Tree Congestion. - Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

The Primal Pathwidth SETH. - Michael Lampis (SODA, 2025)

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule. - Georgios Amanatidis; Michael Lampis; Evangelos Markakis; Georgios Papasotiropoulos (Inf. Process. Lett., 2025)

Structural Parameterizations for Induced and Acyclic Matching. - Michael Lampis; Manolis Vasilakis (CoRR, 2025)

Structural Parameters for Steiner Orientation. - Tesshu Hanaka; Michael Lampis; Nikolaos Melissinos; Edouard Nemery; Hirotaka Ono 001; Manolis Vasilakis (CoRR, 2025)