Michael Lampis

179 papers A* 7A 11B 33C 6Misc 3Journal 109Unranked 9
YearRankTypeTitle / Venue / Authors
2026 A* conf
Circuits and Backdoors: Five Shades of the SETH.
SODA
Michael Lampis
2026 J jnl
Core stability in additively separable hedonic games of low treewidth.
J. Comput. Syst. Sci.
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2026 J jnl
Faster winner determination algorithms for (Colored) Arc Kayles.
J. Comput. Syst. Sci.
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2026 J jnl
d-QBF with Few Existential Variables Revisited.
CoRR
Andreas Grigorjew, Michael Lampis
2026 A* conf
k-SUM Hardness Implies Treewidth-SETH.
SODA
Michael Lampis
2025 B conf
Broadcasting Under Structural Restrictions.
MFCS
Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025 J jnl
Broadcasting under Structural Restrictions.
CoRR
Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025 B conf
On Maximum 2-Clubs.
IPEC
Joanne Dumont, Michael Lampis, Mathieu Liedloff, Anthony Perez, Ioan Todinca
2025 J jnl
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule.
Inf. Process. Lett.
Georgios Amanatidis, Michael Lampis, Evangelos Markakis, Georgios Papasotiropoulos
2025 J jnl
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs.
ACM Trans. Algorithms
Andreas Emil Feldmann, Michael Lampis
2025 J jnl
Parameterized Max Min Feedback Vertex Set.
SIAM J. Discret. Math.
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2025 B conf
Parameterized Maximum Node-Disjoint Paths.
IPEC
Michael Lampis, Manolis Vasilakis
2025 B conf
Parameterized Spanning Tree Congestion.
MFCS
Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025 A conf
Satisfactory Budget Division.
AAMAS
Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025 J jnl
Satisfactory Budget Division.
CoRR
Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025 B conf
Structural Parameterizations for Induced and Acyclic Matching.
WG
Michael Lampis, Manolis Vasilakis
2025 J jnl
Structural Parameterizations for Induced and Acyclic Matching.
CoRR
Michael Lampis, Manolis Vasilakis
2025 B conf
Structural Parameters for Steiner Orientation.
ISAAC
Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025 J jnl
Structural Parameters for Steiner Orientation.
CoRR
Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025 A* conf
The Primal Pathwidth SETH.
SODA
Michael Lampis
2025 J jnl
k-SUM Hardness Implies Treewidth-SETH.
CoRR
Michael Lampis
2024 J jnl
Circuits and Backdoors: Five Shades of the SETH.
CoRR
Michael Lampis
2024 B conf
Core Stability in Additively Separable Hedonic Games of Low Treewidth.
ISAAC
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2024 J jnl
Core Stability in Additively Separable Hedonic Games of Low Treewidth.
CoRR
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2024 J jnl
Digraph Coloring and Distance to Acyclicity.
Theory Comput. Syst.
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024 B conf
Faster Winner Determination Algorithms for (Colored) Arc Kayles.
SOFSEM
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2024 J jnl
Filling crosswords is very hard.
Theor. Comput. Sci.
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024 J jnl
Fine-grained Meta-Theorems for Vertex Integrity.
Log. Methods Comput. Sci.
Michael Lampis, Valia Mitsou
2024 J jnl
On the Tractability Landscape of Conditional Minisum Approval Voting Rule.
CoRR
Georgios Amanatidis, Michael Lampis, Evangelos Markakis, Georgios Papasotiropoulos
2024 A* conf
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs.
ICALP
Andreas Emil Feldmann, Michael Lampis
2024 J jnl
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs.
CoRR
Andreas Emil Feldmann, Michael Lampis
2024 J jnl
Parameterized Maximum Node-Disjoint Paths.
CoRR
Michael Lampis, Manolis Vasilakis
2024 J jnl
Parameterized Spanning Tree Congestion.
CoRR
Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2024 B conf
Parameterized Vertex Integrity Revisited.
MFCS
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
2024 J jnl
Parameterized Vertex Integrity Revisited.
CoRR
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
2024 J jnl
Structural Parameterizations for Two Bounded Degree Problems Revisited.
ACM Trans. Comput. Theory
Michael Lampis, Manolis Vasilakis
2024 J jnl
The Primal Pathwidth SETH.
CoRR
Michael Lampis
2023 A* conf
First Order Logic on Pathwidth Revisited Again.
ICALP
Michael Lampis
2023 J jnl
Improved (In-)Approximability Bounds for d-Scattered Set.
J. Graph Algorithms Appl.
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2023 J jnl
New Results on Directed Edge Dominating Set.
Discret. Math. Theor. Comput. Sci.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2023 B conf
Parameterized Max Min Feedback Vertex Set.
MFCS
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2023 J jnl
Parameterized Max Min Feedback Vertex Set.
CoRR
Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2023 A conf
Structural Parameterizations for Two Bounded Degree Problems Revisited.
ESA
Michael Lampis, Manolis Vasilakis
2023 J jnl
Structural Parameterizations for Two Bounded Degree Problems Revisited.
CoRR
Michael Lampis, Manolis Vasilakis
2022 J jnl
(In)approximability of maximum minimal FVS.
J. Comput. Syst. Sci.
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2022 J jnl
Defective Coloring on Classes of Perfect Graphs.
Discret. Math. Theor. Comput. Sci.
Rémy Belmonte, Michael Lampis, Valia Mitsou
2022 A conf
Determining a Slater Winner Is Complete for Parallel Access to NP.
STACS
Michael Lampis
2022 J jnl
First Order Logic on Pathwidth Revisited Again.
CoRR
Michael Lampis
2022 J jnl
Grundy Distinguishes Treewidth from Pathwidth.
SIAM J. Discret. Math.
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2022 A conf
Hedonic Games and Treewidth Revisited.
ESA
Tesshu Hanaka, Michael Lampis
2022 J jnl
Hedonic Games and Treewidth Revisited.
CoRR
Tesshu Hanaka, Michael Lampis
2022 J jnl
Parameterized Complexity of (A, ℓ )-Path Packing.
Algorithmica
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022 — book
Structural Graph Parameters, Fine-Grained Complexity, and Approximation.
Michael Lampis
2022 J jnl
Structurally parameterized d-scattered set.
Discret. Appl. Math.
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2022 J jnl
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation.
Theor. Comput. Sci.
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021 J jnl
Determining a Slater Winner is Complete for Parallel Access to NP.
CoRR
Michael Lampis
2021 A conf
Digraph Coloring and Distance to Acyclicity.
STACS
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 B conf
Filling Crosswords Is Very Hard.
ISAAC
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 J jnl
Filling Crosswords is Very Hard.
CoRR
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 B conf
Fine-Grained Meta-Theorems for Vertex Integrity.
ISAAC
Michael Lampis, Valia Mitsou
2021 J jnl
Fine-grained Meta-Theorems for Vertex Integrity.
CoRR
Michael Lampis, Valia Mitsou
2021 A* conf
Minimum Stable Cut and Treewidth.
ICALP
Michael Lampis
2021 J jnl
Minimum Stable Cut and Treewidth.
CoRR
Michael Lampis
2021 J jnl
New Algorithms for Mixed Dominating Set.
Discret. Math. Theor. Comput. Sci.
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021 J jnl
Token Sliding on Split Graphs.
Theory Comput. Syst.
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2021 J jnl
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation.
CoRR
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021 C conf
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation.
CIAC
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2020 B conf
(In)approximability of Maximum Minimal FVS.
ISAAC
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 J jnl
(In)approximability of Maximum Minimal FVS.
CoRR
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 J jnl
Digraph Coloring and Distance to Acyclicity.
CoRR
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2020 J jnl
Finer Tight Bounds for Coloring on Clique-Width.
SIAM J. Discret. Math.
Michael Lampis
2020 A conf
Grundy Distinguishes Treewidth from Pathwidth.
ESA
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020 J jnl
Grundy Distinguishes Treewidth from Pathwidth.
CoRR
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020 J jnl
Independent Set Reconfiguration Parameterized by Modular-Width.
Algorithmica
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Maximum independent sets in subcubic graphs: New results.
Theor. Comput. Sci.
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2020 B conf
New Algorithms for Mixed Dominating Set.
IPEC
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2020 J jnl
Parameterized (Approximate) Defective Coloring.
SIAM J. Discret. Math.
Rémy Belmonte, Michael Lampis, Valia Mitsou
2020 C conf
Parameterized Complexity of (A, ℓ )-Path Packing.
IWOCA
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Complexity of (A, 𝓁)-Path Packing.
CoRR
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Complexity of Safe Set.
J. Graph Algorithms Appl.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Orientable Deletion.
Algorithmica
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2019 J jnl
How Bad is the Freedom to Flood-It?
J. Graph Algorithms Appl.
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2019 B conf
Improved (In-)Approximability Bounds for d-Scattered Set.
WAOA
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2019 J jnl
Improved (In-)Approximability Bounds for d-Scattered Set.
CoRR
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2019 B conf
Independent Set Reconfiguration Parameterized by Modular-Width.
WG
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
Independent Set Reconfiguration Parameterized by Modular-Width.
CoRR
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 B conf
Maximum Independent Sets in Subcubic Graphs: New Results.
WG
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2019 J jnl
New Algorithms for Mixed Dominating Set.
CoRR
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2019 J jnl
New Results on Directed Edge Dominating Set.
CoRR
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2019 J jnl
On the parameterized complexity of red-blue points separation.
J. Comput. Geom.
Edouard Bonnet, Panos Giannopoulos, Michael Lampis
2019 C conf
Parameterized Complexity of Safe Set.
CIAC
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
Parameterized Complexity of Safe Set.
CoRR
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
Structural parameters, tight bounds, and approximation for (k, r)-center.
Discret. Appl. Math.
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2019 A conf
Token Sliding on Split Graphs.
STACS
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018 A* conf
Finer Tight Bounds for Coloring on Clique-Width.
ICALP
Michael Lampis
2018 J jnl
Finer Tight Bounds for Coloring on Clique-Width.
CoRR
Michael Lampis
2018 J jnl
How Bad is the Freedom to Flood-It?
CoRR
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018 Misc conf
How Bad is the Freedom to Flood-It?.
FUN
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018 J jnl
Maximum Independent Sets in Subcubic Graphs: New Results.
CoRR
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2018 — conf
Multistage Matchings.
SWAT
Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
2018 B conf
New Results on Directed Edge Dominating Set.
MFCS
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2018 A conf
Parameterized (Approximate) Defective Coloring.
STACS
Rémy Belmonte, Michael Lampis, Valia Mitsou
2018 J jnl
Parameterized (Approximate) Defective Coloring.
CoRR
Rémy Belmonte, Michael Lampis, Valia Mitsou
2018 J jnl
Parameterized Edge Hamiltonicity.
Discret. Appl. Math.
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2018 — conf
Parameterized Orientable Deletion.
SWAT
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 J jnl
Parameterized Orientable Deletion.
CoRR
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 J jnl
Parameterized Power Vertex Cover.
CoRR
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2018 J jnl
Parameterized Power Vertex Cover.
Discret. Math. Theor. Comput. Sci.
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2018 A conf
QBF as an Alternative to Courcelle's Theorem.
SAT
Michael Lampis, Stefan Mengel, Valia Mitsou
2018 J jnl
QBF as an Alternative to Courcelle's Theorem.
CoRR
Michael Lampis, Stefan Mengel, Valia Mitsou
2018 B conf
Structurally Parameterized d-Scattered Set.
WG
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2018 J jnl
The many facets of upper domination.
Theor. Comput. Sci.
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2018 J jnl
Time-approximation trade-offs for inapproximable problems.
J. Comput. Syst. Sci.
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2018 J jnl
Token Sliding on Split Graphs.
CoRR
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2017 J jnl
Complexity and Approximability of Parameterized MAX-CSPs.
Algorithmica
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2017 B conf
Defective Coloring on Classes of Perfect Graphs.
WG
Rémy Belmonte, Michael Lampis, Valia Mitsou
2017 J jnl
Defective Coloring on Classes of Perfect Graphs.
CoRR
Rémy Belmonte, Michael Lampis, Valia Mitsou
2017 B conf
On the Parameterized Complexity of Red-Blue Points Separation.
IPEC
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017 J jnl
On the Parameterized Complexity of Red-Blue Points Separation.
CoRR
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017 B conf
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center.
ISAAC
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2017 J jnl
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center.
CoRR
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2017 J jnl
Structurally Parameterized $d$-Scattered Set.
CoRR
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2017 B conf
Treewidth with a Quantifier Alternation Revisited.
IPEC
Michael Lampis, Valia Mitsou
2016 C conf
Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
AAIM
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016 B conf
Parameterized Power Vertex Cover.
WG
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2016 A conf
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse.
STACS
Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
2016 A conf
Time-Approximation Trade-offs for Inapproximable Problems.
STACS
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2016 C conf
Upper Domination: Complexity and Approximation.
IWOCA
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015 J jnl
Algorithmic Aspects of Upper Domination.
CoRR
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015 B conf
Complexity and Approximability of Parameterized MAX-CSPs.
IPEC
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015 J jnl
Complexity and Approximability of Parameterized MAX-CSPs.
CoRR
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015 J jnl
New inapproximability bounds for TSP.
J. Comput. Syst. Sci.
Marek Karpinski, Michael Lampis, Richard Schmied
2015 — conf
Parameterized Algorithms for Parity Games.
MFCS (2)
Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
2015 J jnl
Scrabble is PSPACE-Complete.
J. Inf. Process.
Michael Lampis, Valia Mitsou, Karolina Soltys
2015 J jnl
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse.
CoRR
Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
2015 J jnl
Time-Approximation Trade-offs for Inapproximable Problems.
CoRR
Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2014 J jnl
Guest column: the elusive inapproximability of the TSP.
SIGACT News
Michael Lampis
2014 J jnl
Improved Inapproximability for TSP.
Theory Comput.
Michael Lampis
2014 J jnl
Model Checking Lower Bounds for Simple Graphs
Log. Methods Comput. Sci.
Michael Lampis
2014 — conf
Parameterized Approximation Schemes Using Graph Widths.
ICALP (1)
Michael Lampis
2014 B conf
Parameterized Edge Hamiltonicity.
WG
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014 J jnl
Parameterized Edge Hamiltonicity.
CoRR
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014 B conf
The Computational Complexity of the Game of Set and Its Theoretical Applications.
LATIN
Michael Lampis, Valia Mitsou
2013 J jnl
Closing a Gap in the Complexity of Refinement Modal Logic.
CoRR
Antonis Achilleos, Michael Lampis
2013 — conf
Model Checking Lower Bounds for Simple Graphs.
ICALP (1)
Michael Lampis
2013 J jnl
New Inapproximability Bounds for TSP
CoRR
Marek Karpinski, Michael Lampis, Richard Schmied
2013 B conf
New Inapproximability Bounds for TSP.
ISAAC
Marek Karpinski, Michael Lampis, Richard Schmied
2013 J jnl
New Inapproximability Bounds for TSP.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Michael Lampis, Richard Schmied
2013 B conf
Parameterized Algorithms for Modular-Width.
IPEC
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 J jnl
Parameterized Algorithms for Modular-Width.
CoRR
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 J jnl
Parameterized Approximation Schemes using Graph Widths.
CoRR
Michael Lampis
2013 J jnl
Parameterized maximum path coloring.
Theor. Comput. Sci.
Michael Lampis
2013 J jnl
Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch.
SIGACT News
Michael Lampis
2013 J jnl
The Computational Complexity of the Game of Set and its Theoretical Applications.
CoRR
Michael Lampis, Valia Mitsou
2012 J jnl
Algorithmic Meta-theorems for Restrictions of Treewidth.
Algorithmica
Michael Lampis
2012 J jnl
Improved Inapproximability for TSP
CoRR
Michael Lampis
2012 — conf
Improved Inapproximability for TSP.
APPROX-RANDOM
Michael Lampis
2012 J jnl
Local Improvement Gives Better Expanders
CoRR
Michael Lampis
2012 J jnl
Online maximum directed cut.
J. Comb. Optim.
Amotz Bar-Noy, Michael Lampis
2012 J jnl
Ordered coloring of grids and related graphs.
Theor. Comput. Sci.
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2012 J jnl
Parameterized Modal Satisfiability.
Algorithmica
Antonis Achilleos, Michael Lampis, Valia Mitsou
2012 Misc conf
Scrabble Is PSPACE-Complete.
FUN
Michael Lampis, Valia Mitsou, Karolina Soltys
2012 J jnl
Scrabble is PSPACE-Complete
CoRR
Michael Lampis, Valia Mitsou, Karolina Soltys
2011 J jnl
A kernel of order 2 k-c log k for vertex cover.
Inf. Process. Lett.
Michael Lampis
2011 J jnl
On the algorithmic effectiveness of digraph decompositions and complexity measures.
Discret. Optim.
Michael Lampis, Georgia Kaouri, Valia Mitsou
2011 B conf
Parameterized Maximum Path Coloring.
IPEC
Michael Lampis
2011 J jnl
Vertex Cover Problem Parameterized Above and Below Tight Bounds.
Theory Comput. Syst.
Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2010 — conf
Algorithmic Meta-theorems for Restrictions of Treewidth.
ESA (1)
Michael Lampis
2010 — conf
Parameterized Modal Satisfiability.
ICALP (2)
Antonis Achilleos, Michael Lampis, Valia Mitsou
2009 J jnl
Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover
CoRR
Michael Lampis
2009 B conf
Online Maximum Directed Cut.
ISAAC
Amotz Bar-Noy, Michael Lampis
2009 B conf
Ordered Coloring Grids and Related Graphs.
SIROCCO
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2009 J jnl
Parameterized Modal Satisfiability
CoRR
Antonis Achilleos, Michael Lampis, Valia Mitsou
2009 J jnl
The Ferry Cover Problem.
Theory Comput. Syst.
Michael Lampis, Valia Mitsou
2009 J jnl
Vertex Cover Problem Parameterized Above and Below Tight Bounds
CoRR
Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2008 B conf
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.
ISAAC
Michael Lampis, Georgia Kaouri, Valia Mitsou
2007 Misc conf
The Ferry Cover Problem.
FUN
Michael Lampis, Valia Mitsou
2006 C conf
Periodic Metro Scheduling.
ATMOS
Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis
2006 — conf
Quantum Data and Control Made Easier.
QPL
Michael Lampis, Kyriakos G. Ginis, Michalis A. Papakyriakou, Nikolaos S. Papaspyrou