Algorithmic meta-theorems for restrictions of treewidth M Lampis Algorithms–ESA 2010, 549-560, 2011 | 242 | 2011 |
New inapproximability bounds for TSP M Karpinski, M Lampis, R Schmied Journal of Computer and System Sciences 81 (8), 1665-1677, 2015 | 146 | 2015 |
Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013 | 110 | 2013 |
On the algorithmic effectiveness of digraph decompositions and complexity measures M Lampis, G Kaouri, V Mitsou Discrete Optimization 8 (1), 129-138, 2011 | 57 | 2011 |
Structural parameters, tight bounds, and approximation for (k, r)-center I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 264, 90-117, 2019 | 55 | 2019 |
The many facets of upper domination C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... Theoretical Computer Science 717, 2-25, 2018 | 54* | 2018 |
Finer tight bounds for coloring on clique-width M Lampis SIAM Journal on Discrete Mathematics 34 (3), 1538-1558, 2020 | 44 | 2020 |
Vertex cover problem parameterized above and below tight bounds G Gutin, EJ Kim, M Lampis, V Mitsou Theory of Computing Systems 48, 402-410, 2011 | 42 | 2011 |
Improved inapproximability for TSP M Lampis Theory OF Computing 10 (1), 217-236, 2014 | 41 | 2014 |
A kernel of order 2k− clogk for vertex cover M Lampis Information Processing Letters 111 (23-24), 1089-1091, 2011 | 39 | 2011 |
Treewidth with a quantifier alternation revisited M Lampis, V Mitsou 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018 | 36 | 2018 |
Multistage matchings E Bampis, B Escoffier, M Lampis, VT Paschos 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018 | 35 | 2018 |
Model checking lower bounds for simple graphs M Lampis Logical Methods in Computer Science 10, 2014 | 35 | 2014 |
Token sliding on split graphs R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora Theory of Computing Systems 65, 662-686, 2021 | 33 | 2021 |
Structurally parameterized d-scattered set I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 308, 168-186, 2022 | 32 | 2022 |
Parameterized approximation schemes using graph widths M Lampis International Colloquium on Automata, Languages, and Programming, 775-786, 2014 | 30 | 2014 |
Time-approximation trade-offs for inapproximable problems É Bonnet, M Lampis, VT Paschos Journal of Computer and System Sciences 92, 171-180, 2018 | 26 | 2018 |
Grundy distinguishes treewidth from pathwidth R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi SIAM Journal on Discrete Mathematics 36 (3), 1761-1787, 2022 | 22 | 2022 |
On the parameterized complexity of red-blue points separation P Giannopoulos, E Bonnet, M Lampis Journal of Computational Geometry 10 (1), 181-206, 2019 | 22* | 2019 |
Sub-exponential approximation schemes for csps: From dense to almost sparse D Fotakis, M Lampis, VT Paschos arXiv preprint arXiv:1507.04391, 2015 | 22 | 2015 |