( en | de | ru )

 

Disambiguation of "Lampis, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Vertex Cover Problem Parameterized Above and Below Tight Bounds.

, , , and . Theory Comput. Syst., 48 (2): 402-410 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Bode

Le groupe international de sociétés: le système de conflit de lois en droit comparé français et allemand. HU Berlin, (2009)

Michael Liecke

Subnationale Clusterpolitik: die Biotechnologiepolitik deutscher Länder im Vergleich. Uni München, (2009)

Michael Schoierer

NS-Diktatur, Anomie und Demokratisierung Westdeutschlands. Uni Augsburg, (2007)

Michael Krug

X-ray crystallographic analysis of the archaeal transcriptional regulator TrmB and development of a graphical user interface for the monochromatic diffraction data processing software XDS. Uni Konstanz, (2009)

Michael Bernateck

Komplexes Regionales Schmerzsyndrom Typ 1 (M.Sudeck): neue Aspekte zur Symptomatologie, Pathogenese, Diagnostik und Therapie. MedH Hannover, habilitation, (2009)
 

Other publications of authors with the same name

New Results on Directed Edge Dominating Set., , , , and . MFCS, volume 117 of LIPIcs, page 67:1-67:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)Parameterized Power Vertex Cover., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 97-108. (2016)Parameterized Algorithms for Modular-Width., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 163-176. Springer, (2013)Finer Tight Bounds for Coloring on Clique-Width.. ICALP, volume 107 of LIPIcs, page 86:1-86:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Improved (In-)Approximability Bounds for d-Scattered Set., , and . J. Graph Algorithms Appl., 27 (3): 219-238 (2023)Finer Tight Bounds for Coloring on Clique-Width.. SIAM J. Discret. Math., 34 (3): 1538-1558 (2020)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse., , and . CoRR, (2015)Maximum Independent Sets in Subcubic Graphs: New Results., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 40-52. Springer, (2019)