default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Lampis
Person information
- affiliation: Université Paris Dauphine, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Ararat Harutyunyan, Michael Lampis
, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. Theory Comput. Syst. 68(4): 986-1013 (2024)- [j41]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling crosswords is very hard. Theor. Comput. Sci. 982: 114275 (2024) - [c58]Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. ICALP 2024: 61:1-61:20 - [c57]Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari:
Parameterized Vertex Integrity Revisited. MFCS 2024: 58:1-58:14 - [c56]Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM 2024: 297-310 - [i53]Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. CoRR abs/2402.09835 (2024) - [i52]Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari:
Parameterized Vertex Integrity Revisited. CoRR abs/2402.09971 (2024) - [i51]Tesshu Hanaka, Noleen Köhler, Michael Lampis:
Core Stability in Additively Separable Hedonic Games of Low Treewidth. CoRR abs/2402.10815 (2024) - [i50]Michael Lampis:
The Primal Pathwidth SETH. CoRR abs/2403.07239 (2024) - [i49]Michael Lampis, Manolis Vasilakis:
Parameterized Maximum Node-Disjoint Paths. CoRR abs/2404.14849 (2024) - [i48]Michael Lampis:
Circuits and Backdoors: Five Shades of the SETH. CoRR abs/2407.09683 (2024) - 2023
- [j40]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) - [j39]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27(3): 219-238 (2023) - [c55]Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. ESA 2023: 77:1-77:16 - [c54]Michael Lampis:
First Order Logic on Pathwidth Revisited Again. ICALP 2023: 132:1-132:17 - [c53]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. MFCS 2023: 62:1-62:15 - [i47]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. CoRR abs/2302.09604 (2023) - [i46]Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. CoRR abs/2304.14724 (2023) - 2022
- [b1]Michael Lampis:
Structural Graph Parameters, Fine-Grained Complexity, and Approximation. Paris Dauphine University, France, 2022 - [j38]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): 871-895 (2022) - [j37]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally parameterized d-scattered set. Discret. Appl. Math. 308: 168-186 (2022) - [j36]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j35]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. 124: 26-40 (2022) - [j34]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36(3): 1761-1787 (2022) - [j33]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. 923: 271-291 (2022) - [c52]Tesshu Hanaka, Michael Lampis:
Hedonic Games and Treewidth Revisited. ESA 2022: 64:1-64:16 - [c51]Michael Lampis:
Determining a Slater Winner Is Complete for Parallel Access to NP. STACS 2022: 45:1-45:14 - [i45]Tesshu Hanaka, Michael Lampis:
Hedonic Games and Treewidth Revisited. CoRR abs/2202.06925 (2022) - [i44]Michael Lampis:
First Order Logic on Pathwidth Revisited Again. CoRR abs/2210.09899 (2022) - 2021
- [j32]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j31]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - [c50]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. CIAC 2021: 202-215 - [c49]Michael Lampis:
Minimum Stable Cut and Treewidth. ICALP 2021: 92:1-92:16 - [c48]Michael Lampis, Valia Mitsou:
Fine-Grained Meta-Theorems for Vertex Integrity. ISAAC 2021: 34:1-34:15 - [c47]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords Is Very Hard. ISAAC 2021: 36:1-36:16 - [c46]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. STACS 2021: 41:1-41:15 - [i43]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. CoRR abs/2101.07550 (2021) - [i42]Michael Lampis:
Determining a Slater Winner is Complete for Parallel Access to NP. CoRR abs/2103.16416 (2021) - [i41]Michael Lampis:
Minimum Stable Cut and Treewidth. CoRR abs/2104.13097 (2021) - [i40]Michael Lampis, Valia Mitsou:
Fine-grained Meta-Theorems for Vertex Integrity. CoRR abs/2109.10333 (2021) - [i39]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords is Very Hard. CoRR abs/2109.11203 (2021) - 2020
- [j30]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020) - [j29]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82(9): 2586-2605 (2020) - [j28]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24(3): 215-245 (2020) - [j27]Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi:
K3 Edge Cover Problem in a Wide Sense. J. Inf. Process. 28: 849-858 (2020) - [j26]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34(2): 1084-1106 (2020) - [j25]Michael Lampis:
Finer Tight Bounds for Coloring on Clique-Width. SIAM J. Discret. Math. 34(3): 1538-1558 (2020) - [j24]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846: 14-26 (2020) - [c45]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - [c44]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. ISAAC 2020: 3:1-3:14 - [c43]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: 43-55 - [c42]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. IPEC 2020: 9:1-9:17 - [i38]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 abs/2008.03448 (2020) - [i37]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. CoRR abs/2008.07425 (2020) - [i36]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. CoRR abs/2009.09971 (2020) - [i35]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. CoRR abs/2010.06317 (2020)
2010 – 2019
- 2019
- [j23]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264: 90-117 (2019) - [j22]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): 111-134 (2019) - [j21]Edouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10(1): 181-206 (2019) - [c41]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c40]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [c39]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. WAOA 2019: 202-216 - [c38]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. WG 2019: 40-52 - [c37]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - [i34]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i33]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019) - [i32]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - [i31]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. CoRR abs/1910.05589 (2019) - [i30]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. CoRR abs/1911.08964 (2019) - 2018
- [j20]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248: 68-78 (2018) - [j19]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j18]Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92: 171-180 (2018) - [j17]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: 2-25 (2018) - [c36]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It?. FUN 2018: 5:1-5:13 - [c35]Michael Lampis:
Finer Tight Bounds for Coloring on Clique-Width. ICALP 2018: 86:1-86:14 - [c34]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16 - [c33]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. SAT 2018: 235-252 - [c32]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. STACS 2018: 10:1-10:15 - [c31]Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. SWAT 2018: 7:1-7:13 - [c30]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13 - [c29]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized d-Scattered Set. WG 2018: 292-305 - [i29]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. CoRR abs/1801.03879 (2018) - [i28]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. CoRR abs/1801.10476 (2018) - [i27]Michael Lampis:
Finer Tight Bounds for Coloring on Clique-Width. CoRR abs/1804.07975 (2018) - [i26]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? CoRR abs/1804.08236 (2018) - [i25]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. CoRR abs/1805.08456 (2018) - [i24]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - [i23]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018) - [i22]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR abs/1810.10940 (2018) - 2017
- [j16]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - [c28]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC 2017: 50:1-50:13 - [c27]Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. IPEC 2017: 8:1-8:13 - [c26]Michael Lampis, Valia Mitsou:
Treewidth with a Quantifier Alternation Revisited. IPEC 2017: 26:1-26:12 - [c25]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. WG 2017: 113-126 - [i21]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. CoRR abs/1702.08903 (2017) - [i20]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR abs/1704.08868 (2017) - [i19]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized $d$-Scattered Set. CoRR abs/1709.02180 (2017) - [i18]Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. CoRR abs/1710.00637 (2017) - 2016
- [c24]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: 113-124 - [c23]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: 241-252 - [c22]Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-Approximation Trade-offs for Inapproximable Problems. STACS 2016: 22:1-22:14 - [c21]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS 2016: 37:1-37:14 - [c20]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. WG 2016: 97-108 - 2015
- [j15]Marek Karpinski, Michael Lampis, Richard Schmied:
New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81(8): 1665-1677 (2015) - [j14]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. J. Inf. Process. 23(3): 284-292 (2015) - [c19]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - [c18]Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - [i17]Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-Approximation Trade-offs for Inapproximable Problems. CoRR abs/1502.05828 (2015) - [i16]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. CoRR abs/1506.07260 (2015) - [i15]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. CoRR abs/1507.04391 (2015) - [i14]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. CoRR abs/1511.05546 (2015) - 2014
- [j13]Michael Lampis:
Model Checking Lower Bounds for Simple Graphs. Log. Methods Comput. Sci. 10(1) (2014) - [j12]Michael Lampis:
Guest column: the elusive inapproximability of the TSP. SIGACT News 45(1): 48-65 (2014) - [j11]Michael Lampis:
Improved Inapproximability for TSP. Theory Comput. 10: 217-236 (2014) - [c17]Michael Lampis:
Parameterized Approximation Schemes Using Graph Widths. ICALP (1) 2014: 775-786 - [c16]Michael Lampis, Valia Mitsou:
The Computational Complexity of the Game of Set and Its Theoretical Applications. LATIN 2014: 24-34 - [c15]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. WG 2014: 348-359 - [i13]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. CoRR abs/1403.2041 (2014) - 2013
- [j10]Michael Lampis:
Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch. SIGACT News 44(2): 17-21 (2013) - [j9]Michael Lampis:
Parameterized maximum path coloring. Theor. Comput. Sci. 511: 42-53 (2013) - [c14]Michael Lampis:
Model Checking Lower Bounds for Simple Graphs. ICALP (1) 2013: 673-683 - [c13]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. ISAAC 2013: 568-578 - [c12]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. IPEC 2013: 163-176 - [i12]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. CoRR abs/1303.6437 (2013) - [i11]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. CoRR abs/1308.2858 (2013) - [i10]Antonis Achilleos, Michael Lampis:
Closing a Gap in the Complexity of Refinement Modal Logic. CoRR abs/1309.5184 (2013) - [i9]Michael Lampis, Valia Mitsou:
The Computational Complexity of the Game of Set and its Theoretical Applications. CoRR abs/1309.6504 (2013) - [i8]Michael Lampis:
Parameterized Approximation Schemes using Graph Widths. CoRR abs/1311.2466 (2013) - [i7]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j8]Michael Lampis:
Algorithmic Meta-theorems for Restrictions of Treewidth. Algorithmica 64(1): 19-37 (2012) - [j7]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. Algorithmica 64(1): 38-55 (2012) - [j6]Amotz Bar-Noy, Michael Lampis:
Online maximum directed cut. J. Comb. Optim. 24(1): 52-64 (2012) - [j5]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012) - [c11]Michael Lampis:
Improved Inapproximability for TSP. APPROX-RANDOM 2012: 243-253 - [c10]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble Is PSPACE-Complete. FUN 2012: 258-269 - [i6]Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. CoRR abs/1201.5298 (2012) - [i5]Michael Lampis:
Improved Inapproximability for TSP. CoRR abs/1206.2497 (2012) - [i4]Michael Lampis:
Local Improvement Gives Better Expanders. CoRR abs/1211.0524 (2012) - 2011
- [j4]Michael Lampis, Georgia Kaouri, Valia Mitsou:
On the algorithmic effectiveness of digraph decompositions and complexity measures. Discret. Optim. 8(1): 129-138 (2011) - [j3]Michael Lampis:
A kernel of order 2 k-c log k for vertex cover. Inf. Process. Lett. 111(23-24): 1089-1091 (2011) - [j2]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011) - [c9]Michael Lampis:
Parameterized Maximum Path Coloring. IPEC 2011: 232-245 - 2010
- [c8]Michael Lampis:
Algorithmic Meta-theorems for Restrictions of Treewidth. ESA (1) 2010: 549-560 - [c7]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. ICALP (2) 2010: 369-380
2000 – 2009
- 2009
- [j1]Michael Lampis, Valia Mitsou:
The Ferry Cover Problem. Theory Comput. Syst. 44(2): 215-229 (2009) - [c6]Amotz Bar-Noy, Michael Lampis:
Online Maximum Directed Cut. ISAAC 2009: 1124-1133 - [c5]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 - [i3]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. CoRR abs/0907.4488 (2009) - [i2]Michael Lampis:
Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover. CoRR abs/0910.0582 (2009) - [i1]Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. CoRR abs/0912.4941 (2009) - 2008
- [c4]Michael Lampis, Georgia Kaouri, Valia Mitsou:
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ISAAC 2008: 220-231 - 2007
- [c3]Michael Lampis, Valia Mitsou:
The Ferry Cover Problem. FUN 2007: 227-239 - 2006
- [c2]Evangelos Bampas, Georgia Kaouri, Michael Lampis, Aris Pagourtzis:
Periodic Metro Scheduling. ATMOS 2006 - [c1]Michael Lampis, Kyriakos G. Ginis, Michalis A. Papakyriakou, Nikolaos S. Papaspyrou:
Quantum Data and Control Made Easier. QPL 2006: 85-105
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
