( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
iBGP and Constrained Connectivity.

, и . APPROX-RANDOM, том 7408 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2012)

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.

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)

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)
 

Другие публикации лиц с тем же именем

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion., , и . CoRR, (2016)Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds., , , и . CoRR, (2016)Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner., , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 290-301. Springer, (2012)Matroid Secretary for Regular and Decomposable Matroids., и . SODA, стр. 108-117. SIAM, (2013)Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds., , , и . SODA, стр. 534-553. SIAM, (2017)Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion., , и . SODA, стр. 881-899. SIAM, (2017)Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks., , , , и . AISTATS, том 151 из Proceedings of Machine Learning Research, стр. 11641-11654. PMLR, (2022)Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network., , и . FSTTCS, том 122 из LIPIcs, стр. 33:1-33:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient computation of distance sketches in distributed networks., , и . SPAA, стр. 318-326. ACM, (2012)Computing Approximate PSD Factorizations., , и . APPROX-RANDOM, том 60 из LIPIcs, стр. 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)