Folgen
Michael Lampis
Michael Lampis
LAMSADE, Université Paris Dauphine
Bestätigte E-Mail-Adresse bei dauphine.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Algorithmic meta-theorems for restrictions of treewidth
M Lampis
Algorithms–ESA 2010, 549-560, 2011
1902011
New inapproximability bounds for TSP
M Karpinski, M Lampis, R Schmied
Journal of Computer and System Sciences 81 (8), 1665-1677, 2015
1322015
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
792013
On the algorithmic effectiveness of digraph decompositions and complexity measures
M Lampis, G Kaouri, V Mitsou
Discrete Optimization 8 (1), 129-138, 2011
522011
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
Structural parameters, tight bounds, and approximation for (k, r)-center
I Katsikarelis, M Lampis, VT Paschos
Discrete Applied Mathematics 264, 90-117, 2019
392019
Improved inapproximability for TSP
M Lampis
Theory of Computing 10 (1), 217-236, 2014
382014
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
372011
A kernel of order 2k− clogk for vertex cover
M Lampis
Information Processing Letters 111 (23-24), 1089-1091, 2011
352011
Model checking lower bounds for simple graphs
M Lampis
Logical Methods in Computer Science 10, 2014
342014
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, 662-686, 2021
282021
Treewidth with a quantifier alternation revisited
M Lampis, V Mitsou
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
262018
Time-approximation trade-offs for inapproximable problems
É Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 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
232020
Parameterized approximation schemes using graph widths
M Lampis
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
202014
On the Parameterized Complexity of Red-Blue Points Separation
P Giannopoulos, E Bonnet, M Lampis
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 89, 8, 2017
16*2017
Sub-exponential approximation schemes for csps: From dense to almost sparse
D Fotakis, M Lampis, VT Paschos
arXiv preprint arXiv:1507.04391, 2015
162015
The computational complexity of the game of set and its theoretical applications
M Lampis, V Mitsou
LATIN 2014: Theoretical Informatics: 11th Latin American Symposium …, 2014
162014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20