Michael Lampis

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 101

Top Venues

CoRR

STACS

IPEC

Publications

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM (2024)
Michael Lampis, Manolis Vasilakis
Parameterized Maximum Node-Disjoint Paths. CoRR (2024)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling crosswords is very hard. Theor. Comput. Sci. 982 (2024)
Andreas Emil Feldmann, Michael Lampis
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. CoRR (2024)
Michael Lampis
Circuits and Backdoors: Five Shades of the SETH. CoRR (2024)
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
Parameterized Vertex Integrity Revisited. MFCS (2024)
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
Parameterized Vertex Integrity Revisited. CoRR (2024)
Tesshu Hanaka, Noleen Köhler, Michael Lampis
Core Stability in Additively Separable Hedonic Games of Low Treewidth. CoRR (2024)
Andreas Emil Feldmann, Michael Lampis
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ICALP (2024)
Michael Lampis
The Primal Pathwidth SETH. CoRR (2024)
Michael Lampis
First Order Logic on Pathwidth Revisited Again. ICALP (2023)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27 (3) (2023)
Michael Lampis, Manolis Vasilakis
Structural Parameterizations for Two Bounded Degree Problems Revisited. ESA (2023)
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
Parameterized Max Min Feedback Vertex Set. MFCS (2023)
Michael Lampis, Manolis Vasilakis
Structural Parameterizations for Two Bounded Degree Problems Revisited. CoRR (2023)
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
Parameterized Max Min Feedback Vertex Set. CoRR (2023)
Tesshu Hanaka, Michael Lampis
Hedonic Games and Treewidth Revisited. ESA (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24 (2022)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. 124 (2022)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. 923 (2022)
Michael Lampis
Determining a Slater Winner Is Complete for Parallel Access to NP. STACS (2022)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally parameterized d-scattered set. Discret. Appl. Math. 308 (2022)
Michael Lampis
First Order Logic on Pathwidth Revisited Again. CoRR (2022)
Tesshu Hanaka, Michael Lampis
Hedonic Games and Treewidth Revisited. CoRR (2022)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36 (3) (2022)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords Is Very Hard. ISAAC (2021)
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Digraph Coloring and Distance to Acyclicity. STACS (2021)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords is Very Hard. CoRR (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Michael Lampis, Valia Mitsou
Fine-Grained Meta-Theorems for Vertex Integrity. ISAAC (2021)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. Theory Comput. Syst. 65 (4) (2021)
Michael Lampis, Valia Mitsou
Fine-grained Meta-Theorems for Vertex Integrity. CoRR (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. CIAC (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. CoRR (2021)
Michael Lampis
Minimum Stable Cut and Treewidth. CoRR (2021)
Michael Lampis
Minimum Stable Cut and Treewidth. ICALP (2021)
Michael Lampis
Determining a Slater Winner is Complete for Parallel Access to NP. CoRR (2021)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846 (2020)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of Maximum Minimal FVS. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24 (3) (2020)
Michael Lampis
Finer Tight Bounds for Coloring on Clique-Width. SIAM J. Discret. Math. 34 (3) (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82 (9) (2020)
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Digraph Coloring and Distance to Acyclicity. CoRR (2020)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. IPEC (2020)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of Maximum Minimal FVS. ISAAC (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. ESA (2020)
Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi
Edge Cover Problem in a Wide Sense. J. Inf. Process. 28 (2020)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34 (2) (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. CoRR (2020)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. Algorithmica 82 (7) (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR (2019)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264 (2019)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. WG (2019)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. STACS (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. CoRR (2019)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. CoRR (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CIAC (2019)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. WG (2019)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. CoRR (2019)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. WAOA (2019)
Edouard Bonnet, Panos Giannopoulos, Michael Lampis
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10 (1) (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. 23 (2) (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CoRR (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? CoRR (2018)
Michael Lampis
Finer Tight Bounds for Coloring on Clique-Width. CoRR (2018)
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92 (2018)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. CoRR (2018)
Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
Multistage Matchings. SWAT (2018)
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Parameterized Power Vertex Cover. CoRR (2018)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248 (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. CoRR (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. CoRR (2018)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally Parameterized d-Scattered Set. WG (2018)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR (2018)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. MFCS (2018)
Michael Lampis, Stefan Mengel, Valia Mitsou
QBF as an Alternative to Courcelle's Theorem. SAT (2018)
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. SWAT (2018)
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. Theor. Comput. Sci. 717 (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. STACS (2018)
Michael Lampis
Finer Tight Bounds for Coloring on Clique-Width. ICALP (2018)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It?. FUN (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. CoRR (2018)
Michael Lampis, Valia Mitsou
Treewidth with a Quantifier Alternation Revisited. IPEC (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. WG (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
On the Parameterized Complexity of Red-Blue Points Separation. IPEC (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally Parameterized $d$-Scattered Set. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
On the Parameterized Complexity of Red-Blue Points Separation. CoRR (2017)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79 (1) (2017)
Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Upper Domination: Complexity and Approximation. IWOCA (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM (2016)
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-Approximation Trade-offs for Inapproximable Problems. STACS (2016)

Michael Lampis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Lampis