Michael Lampis

Citirano

	Sve	Od 2019.
Citati	1561	1095
H-indeks	21	19
i10-indeks	39	32

240

120

180

2010201120122013201420152016201720182019202020212022202320244 16 34 55 39 49 63 65 102 113 140 158 229 216 229

Javni pristup

Prikaži sve

17 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Valia MitsouResearch Institute on the Foundations of Computer Science (IRIF) and Paris Diderot UniversityPotvrđena adresa e-pošte na liris.cnrs.fr
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphinePotvrđena adresa e-pošte na lamsade.dauphine.fr
Rémy BelmonteUniversité Gustave EiffelPotvrđena adresa e-pošte na univ-eiffel.fr
Tesshu Hanaka 土中哲秀Kyushu UniversityPotvrđena adresa e-pošte na inf.kyushu-u.ac.jp
Yota OtachiNagoya UniversityPotvrđena adresa e-pošte na nagoya-u.jp
jerome monnotdirecteur de recherche, Lamsade, université Paris-DauphinePotvrđena adresa e-pošte na lamsade.dauphine.fr
Eun Jung KimKAIST, CNRSPotvrđena adresa e-pošte na kaist.ac.kr
Édouard BonnetENS Lyon, LIP, FrancePotvrđena adresa e-pošte na ens-lyon.fr
Klaus JansenProfessor, Computer Science, University of KielPotvrđena adresa e-pošte na informatik.uni-kiel.de
Mathieu LiedloffProfesseur des Universités, université d'OrléansPotvrđena adresa e-pošte na univ-orleans.fr
Ljiljana BrankovicProfessor in Computational Science, University of New EnglandPotvrđena adresa e-pošte na une.edu.au
Henning FernauProfessor für Informatik, Universität TrierPotvrđena adresa e-pošte na uni-trier.de
Katrin CaselHumboldt-University BerlinPotvrđena adresa e-pošte na hu-berlin.de
Jakub GajarskyAssistant professor, University of WarsawPotvrđena adresa e-pošte na mimuw.edu.pl
Sebastian OrdyniakUniversity of LeedsPotvrđena adresa e-pošte na sheffield.ac.uk
Kim-Manuel KleinUniversität KielPotvrđena adresa e-pošte na informatik.uni-kiel.de
Hirotaka OnoNagoya University, JapanPotvrđena adresa e-pošte na i.nagoya-u.ac.jp
Nikolaos MelissinosPotvrđena adresa e-pošte na dauphine.eu
Evripidis BampisProfessor of Computer Science, Sorbonne UniversitéPotvrđena adresa e-pošte na lip6.fr
Marek KarpinskiProfessor of Computer Science, University of BonnPotvrđena adresa e-pošte na cs.uni-bonn.de

Prati

Michael Lampis

LAMSADE, Université Paris Dauphine

Potvrđena adresa e-pošte na dauphine.fr - Početna stranica

Algorithms Theoretical Computer Science


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Algorithmic meta-theorems for restrictions of treewidth M Lampis Algorithms–ESA 2010, 549-560, 2011	252	2011
New inapproximability bounds for TSP M Karpinski, M Lampis, R Schmied Journal of Computer and System Sciences 81 (8), 1665-1677, 2015	150	2015
Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013	113	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	41	2011
Treewidth with a quantifier alternation revisited M Lampis, V Mitsou 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018	38	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	37	2021
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
Parameterized approximation schemes using graph widths M Lampis International Colloquium on Automata, Languages, and Programming, 775-786, 2014	32	2014
Time-approximation trade-offs for inapproximable problems É Bonnet, M Lampis, VT Paschos Journal of Computer and System Sciences 92, 171-180, 2018	28	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	24	2022
Sub-exponential approximation schemes for csps: From dense to almost sparse D Fotakis, M Lampis, VT Paschos arXiv preprint arXiv:1507.04391, 2015	24	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

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori