Michael Lampis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
17
Active years
2006–2026
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Pure Nash Equilibria in Graphical Games of Bounded Width Revisited. | Michael Lampis, Yiren Lu |
| 2026 | ICALP | Faster Algorithms for k-Orthogonal Vectors in Low Dimension. | Anita Drr, Evangelos Kipouridis, Michael Lampis, Karol Wegrzycki |
| 2026 | MFCS | Lower Bounds for Meta-Reconfiguration. | Kord Eickmeyer, Tatsuya Gima, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2026 | SODA | k-SUM Hardness Implies Treewidth-SETH. | Michael Lampis |
| 2026 | SODA | Circuits and Backdoors: Five Shades of the SETH. | Michael Lampis |
| 2026 | SAT | D-QBF with Few Existential Variables Revisited. | Andreas Grigorjew, Michael Lampis |
| 2025 | ISAAC | Structural Parameters for Steiner Orientation. | Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis |
| 2025 | MFCS | Broadcasting Under Structural Restrictions. | Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | MFCS | Parameterized Spanning Tree Congestion. | Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | SODA | The Primal Pathwidth SETH. | Michael Lampis |
| 2025 | WG | Structural Parameterizations for Induced and Acyclic Matching. | Michael Lampis, Manolis Vasilakis |
| 2024 | ICALP | Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. | Andreas Emil Feldmann, Michael Lampis |
| 2024 | ISAAC | Core Stability in Additively Separable Hedonic Games of Low Treewidth. | Tesshu Hanaka, Noleen Khler, Michael Lampis |
| 2024 | MFCS | Parameterized Vertex Integrity Revisited. | Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari |
| 2024 | SOFSEM | Faster Winner Determination Algorithms for (Colored) Arc Kayles. | Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari |
| 2023 | ESA | Structural Parameterizations for Two Bounded Degree Problems Revisited. | Michael Lampis, Manolis Vasilakis |
| 2023 | ICALP | First Order Logic on Pathwidth Revisited Again. | Michael Lampis |
| 2023 | MFCS | Parameterized Max Min Feedback Vertex Set. | Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis |
| 2022 | ESA | Hedonic Games and Treewidth Revisited. | Tesshu Hanaka, Michael Lampis |
| 2022 | STACS | Determining a Slater Winner Is Complete for Parallel Access to NP. | Michael Lampis |
| 2021 | CIAC | Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. | Louis Dublois, Michael Lampis, Vangelis Th. Paschos |
| 2021 | ICALP | Minimum Stable Cut and Treewidth. | Michael Lampis |
| 2021 | ISAAC | Filling Crosswords Is Very Hard. | Laurent Gourvs, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | ISAAC | Fine-Grained Meta-Theorems for Vertex Integrity. | Michael Lampis, Valia Mitsou |
| 2021 | STACS | Digraph Coloring and Distance to Acyclicity. | Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2020 | ESA | Grundy Distinguishes Treewidth from Pathwidth. | Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi |
| 2020 | ISAAC | (In)approximability of Maximum Minimal FVS. | Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | CIAC | Parameterized Complexity of Safe Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | STACS | Token Sliding on Split Graphs. | Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
| 2019 | WAOA | Improved (In-)Approximability Bounds for d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2019 | WG | Independent Set Reconfiguration Parameterized by Modular-Width. | Rmy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | WG | Maximum Independent Sets in Subcubic Graphs: New Results. | Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jrme Monnot |
| 2018 | FUN | How Bad is the Freedom to Flood-It?. | Rmy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi |
| 2018 | ICALP | Finer Tight Bounds for Coloring on Clique-Width. | Michael Lampis |
| 2018 | MFCS | New Results on Directed Edge Dominating Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis |
| 2018 | STACS | Parameterized (Approximate) Defective Coloring. | Rmy Belmonte, Michael Lampis, Valia Mitsou |
| 2018 | SAT | QBF as an Alternative to Courcelle's Theorem. | Michael Lampis, Stefan Mengel, Valia Mitsou |
| 2018 | WG | Structurally Parameterized d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2017 | ISAAC | Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2017 | WG | Defective Coloring on Classes of Perfect Graphs. | Rmy Belmonte, Michael Lampis, Valia Mitsou |
| 2016 | AAIM | 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, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | STACS | Time-Approximation Trade-offs for Inapproximable Problems. | douard Bonnet, Michael Lampis, Vangelis Th. Paschos |
| 2016 | STACS | Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. | Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos |
| 2016 | WG | Parameterized Power Vertex Cover. | Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis |
| 2015 | MFCS | Parameterized Algorithms for Parity Games. | Jakub Gajarsk, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak |
| 2014 | ICALP | Parameterized Approximation Schemes Using Graph Widths. | Michael Lampis |
| 2014 | LATIN | The Computational Complexity of the Game of Set and Its Theoretical Applications. | Michael Lampis, Valia Mitsou |
| 2014 | WG | Parameterized Edge Hamiltonicity. | Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno |
| 2013 | ICALP | Model Checking Lower Bounds for Simple Graphs. | Michael Lampis |
| 2013 | ISAAC | New Inapproximability Bounds for TSP. | Marek Karpinski, Michael Lampis, Richard Schmied |
| 2012 | FUN | Scrabble Is PSPACE-Complete. | Michael Lampis, Valia Mitsou, Karolina Soltys |
| 2010 | ESA | Algorithmic Meta-theorems for Restrictions of Treewidth. | Michael Lampis |
| 2010 | ICALP | Parameterized Modal Satisfiability. | Antonis Achilleos, Michael Lampis, Valia Mitsou |
| 2009 | ISAAC | Online Maximum Directed Cut. | Amotz Bar-Noy, Michael Lampis |
| 2009 | SIROCCO | Ordered Coloring Grids and Related Graphs. | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos |
| 2008 | ISAAC | On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. | Michael Lampis, Georgia Kaouri, Valia Mitsou |
| 2007 | FUN | The Ferry Cover Problem. | Michael Lampis, Valia Mitsou |
| 2006 | ATMOS | Periodic Metro Scheduling. | Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis |