( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs.

, и . Electron. J. Comb., (2022)

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 Liecke

Subnationale Clusterpolitik: die Biotechnologiepolitik deutscher Länder im Vergleich. Uni München, (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 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)
 

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

Fast Strategies In Maker-Breaker Games Played on Random Boards., , , и . Comb. Probab. Comput., 21 (6): 897-915 (2012)Random Graphs, Geometry and Asymptotic Structure., , , и . London Mathematical Society student texts Cambridge University Press, (2016)Deciding k-colorability in expected polynomial time.. Inf. Process. Lett., 81 (1): 1-6 (2002)On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments., , и . CoRR, (2016)Bounded-Degree Spanning Trees in Randomly Perturbed Graphs., , и . SIAM J. Discret. Math., 31 (1): 155-171 (2017)On a conjecture of Tuza about packing and covering of triangles.. Discret. Math., 142 (1-3): 281-286 (1995)On smoothed k-CNF formulas and the Walksat algorithm., , , , и . SODA, стр. 451-460. SIAM, (2009)Very fast construction of bounded-degree spanning graphs via the semi-random graph process., , , и . SODA, стр. 718-737. SIAM, (2020)Regular Languages Are Testable with a Constant Number of Queries., , , и . FOCS, стр. 645-655. IEEE Computer Society, (1999)Choosability in Random Hypergraphs., и . J. Comb. Theory B, 83 (2): 241-257 (2001)