Follow
Michael Lampis
Michael Lampis
Verified email at dauphine.fr - Homepage
Title
Cited by
Cited by
Year
Algorithmic meta-theorems for restrictions of treewidth
M Lampis
Algorithms–ESA 2010, 549-560, 2011
1752011
New inapproximability bounds for TSP
M Karpinski, M Lampis, R Schmied
Journal of Computer and System Sciences 81 (8), 1665-1677, 2015
1252015
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
International Symposium on Parameterized and Exact Computation, 163-176, 2013
702013
On the algorithmic effectiveness of digraph decompositions and complexity measures
M Lampis, G Kaouri, V Mitsou
Discrete Optimization 8 (1), 129-138, 2011
512011
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
45*2018
Vertex cover problem parameterized above and below tight bounds
G Gutin, EJ Kim, M Lampis, V Mitsou
Theory of Computing Systems 48 (2), 402-410, 2011
382011
Improved inapproximability for TSP
M Lampis
Theory of Computing 10 (1), 217-236, 2014
372014
A kernel of order 2k− clogk for vertex cover
M Lampis
Information Processing Letters 111 (23-24), 1089-1091, 2011
352011
Structural parameters, tight bounds, and approximation for (k, r)-center
I Katsikarelis, M Lampis, VT Paschos
Discrete Applied Mathematics 264, 90-117, 2019
322019
Model checking lower bounds for simple graphs
M Lampis
Logical Methods in Computer Science 10, 2014
312014
Multistage matchings
E Bampis, B Escoffier, M Lampis, VT Paschos
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018
292018
Time-approximation trade-offs for inapproximable problems
É Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
252018
Treewidth with a quantifier alternation revisited
M Lampis, V Mitsou
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
222018
Structurally parameterized d-scattered set
I Katsikarelis, M Lampis, VT Paschos
Discrete Applied Mathematics, 2020
212020
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65 (4), 662-686, 2021
202021
Parameterized approximation schemes using graph widths
M Lampis
International Colloquium on Automata, Languages, and Programming, 775-786, 2014
182014
Finer tight bounds for coloring on clique-width
M Lampis
SIAM Journal on Discrete Mathematics 34 (3), 1538-1558, 2020
162020
Sub-exponential approximation schemes for csps: From dense to almost sparse
D Fotakis, M Lampis, VT Paschos
arXiv preprint arXiv:1507.04391, 2015
162015
Periodic metro scheduling
E Bampas, G Kaouri, M Lampis, A Pagourtzis
6th Workshop on Algorithmic Methods and Models for Optimization of Railways …, 2006
162006
The computational complexity of the game of set and its theoretical applications
M Lampis, V Mitsou
Latin American Symposium on Theoretical Informatics, 24-34, 2014
152014
The system can't perform the operation now. Try again later.
Articles 1–20