Michael Lampis

Cited by

	All	Since 2019
Citations	1528	1063
h-index	21	18
i10-index	38	30

260

130

195

2010201120122013201420152016201720182019202020212022202320244 16 34 55 39 49 63 65 101 112 140 158 242 219 183

Public access

View all

17 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
Tesshu Hanaka 土中哲秀Kyushu UniversityVerified email at inf.kyushu-u.ac.jp
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
jerome monnotdirecteur de recherche, Lamsade, université Paris-DauphineVerified email at lamsade.dauphine.fr
Eun Jung KimKAIST, CNRSVerified email at kaist.ac.kr
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
Mathieu LiedloffProfesseur des Universités, 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
Jakub GajarskyAssistant professor, University of WarsawVerified email at mimuw.edu.pl
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Kim-Manuel KleinUniversität KielVerified email at informatik.uni-kiel.de
Nikolaos MelissinosVerified email at dauphine.eu
Hirotaka OnoNagoya University, JapanVerified email at i.nagoya-u.ac.jp
Evripidis BampisProfessor of Computer Science, Sorbonne UniversitéVerified email at lip6.fr
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	244	2011
New inapproximability bounds for TSP M Karpinski, M Lampis, R Schmied Journal of Computer and System Sciences 81 (8), 1665-1677, 2015	147	2015
Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013	112	2013
Structural parameters, tight bounds, and approximation for (k, r)-center I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 264, 90-117, 2019	57	2019
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
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	46	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	40	2011
Treewidth with a quantifier alternation revisited M Lampis, V Mitsou 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018	38	2018
Multistage matchings E Bampis, B Escoffier, M Lampis, VT Paschos 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018 …, 2018	36	2018
Model checking lower bounds for simple graphs M Lampis Logical Methods in Computer Science 10, 2014	35	2014
Structurally parameterized d-scattered set I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 308, 168-186, 2022	34	2022
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	34	2021
Parameterized approximation schemes using graph widths M Lampis International Colloquium on Automata, Languages, and Programming, 775-786, 2014	31	2014
Time-approximation trade-offs for inapproximable problems É Bonnet, M Lampis, VT Paschos Journal of Computer and System Sciences 92, 171-180, 2018	27	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	23	2022
Sub-exponential approximation schemes for csps: From dense to almost sparse D Fotakis, M Lampis, VT Paschos arXiv preprint arXiv:1507.04391, 2015	23	2015
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

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