Suivre
Michael Lampis
Michael Lampis
Adresse e-mail validée de dauphine.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Algorithmic meta-theorems for restrictions of treewidth
M Lampis
Algorithms–ESA 2010, 549-560, 2011
1842011
New inapproximability bounds for TSP
M Karpinski, M Lampis, R Schmied
Journal of Computer and System Sciences 81 (8), 1665-1677, 2015
1272015
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
International Symposium on Parameterized and Exact Computation, 163-176, 2013
732013
On the algorithmic effectiveness of digraph decompositions and complexity measures
M Lampis, G Kaouri, V Mitsou
Discrete Optimization 8 (1), 129-138, 2011
552011
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
47*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
Structural parameters, tight bounds, and approximation for (k, r)-center
I Katsikarelis, M Lampis, VT Paschos
Discrete Applied Mathematics 264, 90-117, 2019
372019
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
362011
Model checking lower bounds for simple graphs
M Lampis
Logical Methods in Computer Science 10, 2014
332014
Multistage matchings
E Bampis, B Escoffier, M Lampis, VT Paschos
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018
292018
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
262021
Time-approximation trade-offs for inapproximable problems
É Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
262018
Treewidth with a quantifier alternation revisited
M Lampis, V Mitsou
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
252018
Structurally parameterized d-scattered set
I Katsikarelis, M Lampis, VT Paschos
Discrete Applied Mathematics, 2020
242020
Finer tight bounds for coloring on clique-width
M Lampis
SIAM Journal on Discrete Mathematics 34 (3), 1538-1558, 2020
212020
Parameterized approximation schemes using graph widths
M Lampis
International Colloquium on Automata, Languages, and Programming, 775-786, 2014
202014
Sub-exponential approximation schemes for csps: From dense to almost sparse
D Fotakis, M Lampis, VT Paschos
arXiv preprint arXiv:1507.04391, 2015
172015
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
162014
Parameterized modal satisfiability
A Achilleos, M Lampis, V Mitsou
Algorithmica 64 (1), 38-55, 2012
162012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20