Michael Lampis

Cited by

	All	Since 2018
Citations	1211	853
h-index	17	15
i10-index	31	24

260

130

195

2009201020112012201320142015201620172018201920202021202220233 5 15 32 54 42 49 64 65 98 110 143 175 253 66

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Valia MitsouResearch Institute on the Foundations of Computer Science (IRIF) and Paris Diderot UniversityVerified email at liris.cnrs.fr
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphineVerified email at lamsade.dauphine.fr
Rémy BelmonteUniversité Gustave EiffelVerified email at univ-eiffel.fr
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Tesshu Hanaka 土中哲秀Kyushu UniversityVerified email at inf.kyushu-u.ac.jp
Eun Jung KimLAMSADEVerified email at dauphine.fr
jerome monnotdirecteur de recherche, Lamsade, université Paris-DauphineVerified email at lamsade.dauphine.fr
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
Mathieu Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Ljiljana BrankovicProfessor in Computational Science, University of New EnglandVerified email at une.edu.au
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Katrin CaselHumboldt-University BerlinVerified email at hu-berlin.de
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Kim-Manuel KleinUniversität KielVerified email at informatik.uni-kiel.de
Jakub GajarskyAssistant professor, University of WarsawVerified email at mimuw.edu.pl
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Evripidis BampisProfessor of Computer Science, Sorbonne UniversitéVerified email at lip6.fr
Florian SikoraLAMSADE, Université Paris-DauphineVerified email at dauphine.fr
Nikolaos MelissinosVerified email at dauphine.eu
Marek KarpinskiProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de

Michael Lampis

LAMSADE, Université Paris Dauphine

Verified email at dauphine.fr - Homepage

Algorithms Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Algorithmic meta-theorems for restrictions of treewidth M Lampis Algorithms–ESA 2010, 549-560, 2011	197	2011
New inapproximability bounds for TSP M Karpinski, M Lampis, R Schmied Journal of Computer and System Sciences 81 (8), 1665-1677, 2015	132	2015
Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013	83	2013
On the algorithmic effectiveness of digraph decompositions and complexity measures M Lampis, G Kaouri, V Mitsou Discrete Optimization 8 (1), 129-138, 2011	52	2011
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	50*	2018
Structural parameters, tight bounds, and approximation for (k, r)-center I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 264, 90-117, 2019	44	2019
Improved inapproximability for TSP M Lampis Theory of Computing 10 (1), 217-236, 2014	38	2014
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	37	2011
A kernel of order 2k− clogk for vertex cover M Lampis Information Processing Letters 111 (23-24), 1089-1091, 2011	36	2011
Model checking lower bounds for simple graphs M Lampis Logical Methods in Computer Science 10, 2014	34	2014
Multistage matchings E Bampis, B Escoffier, M Lampis, VT Paschos 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018	31	2018
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	29	2021
Finer tight bounds for coloring on clique-width M Lampis SIAM Journal on Discrete Mathematics 34 (3), 1538-1558, 2020	26	2020
Time-approximation trade-offs for inapproximable problems É Bonnet, M Lampis, VT Paschos Journal of Computer and System Sciences 92, 171-180, 2018	26	2018
Treewidth with a quantifier alternation revisited M Lampis, V Mitsou 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018	26	2018
Structurally parameterized d-scattered set I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 308, 168-186, 2022	25	2022
Parameterized approximation schemes using graph widths M Lampis Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014	20	2014
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	16	2015
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	16	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors