Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Michail Lampis

Email : michail.lampis@dauphine.fr

Tel : 0144054050
Bureau : P622
Site Personnel: http://www.lamsade.dauphine.fr/~mlampis
Pole : Optimisation combinatoire algorithmique
Status : Maitre de conférence
Domaines de Recherche : Algorithmes, Approximation, Complexité Paramétrée

Encadrement de these de doctorat :


voir toutes les theses


Publications DFIS


Publications HAL


8 Upper Domination: Complexity and Approximation (, , , , , , , , and ), In 27th International Workshop on Combinatorial Algorithms (IWOCA), volume 9843, . [bibtex] [pdf] [doi]

7 Algorithmic Aspects of Upper Domination: A Parameterised Perspective (, , , , , , , , and ), In 11th International Conference Algorithmic Aspects in Information and Management (AAIM), volume 9778, . [bibtex] [pdf] [doi]

6 Parameterized Power Vertex Cover (, , and ), In WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Springer, volume 9941, . [bibtex] [pdf] [doi]

5 Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse (, and ), In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), . [bibtex] [pdf] [doi]

4 Time-Approximation Trade-offs for Inapproximable Problems (, and ), In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), . [bibtex] [pdf] [doi]

3 Complexity and Approximability of Parameterized MAX-CSPs (, , , and ), In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), . [bibtex] [pdf] [doi]

2 Parameterized Algorithms for Parity Games (, , , and ), In 40th International Symposium, MFCS 2015, . [bibtex] [pdf] [doi]

1 Scrabble is PSPACE-Complete (, and ), In Journal of Information Processing, volume 23, . [bibtex] [pdf] [doi]