Mihyun Kang

Mihyun Kang, Konstantinos Panagiotou: On the connectivity of random graphs from addable classes. J. Comb. Theory, Ser. B 103(2): 306-312 (2013)

Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Untangling planar graphs from a specified vertex position - Hard cases. Discrete Applied Mathematics 159(8): 789-799 (2011)

Mihyun Kang, Colin McDiarmid: Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38(1-2): 174-204 (2011)

Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011)

Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué: Asymptotic Study of Subcritical Graph Classes. SIAM J. Discrete Math. 25(4): 1615-1651 (2011)

Peter J. Cameron, Mihyun Kang, Dudley Stark: Random preorders and alignments. Discrete Mathematics 310(3): 591-603 (2010)

Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang: The order of the giant component of random hypergraphs. Random Struct. Algorithms 36(2): 149-184 (2010)

Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht: Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39(6): 2336-2362 (2010)

Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. CoRR abs/1003.4546 (2010)

Amin Coja-Oghlan, Mihyun Kang: The evolution of the min-min random graph process. Discrete Mathematics 309(13): 4527-4544 (2009)

Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova: A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components. Electr. J. Comb. 15(1) (2008)

Mihyun Kang, Taral Guldahl Seierstad: The Critical Phase for Random Graphs with a Given Degree Sequence. Combinatorics, Probability & Computing 17(1): 67-86 (2008)

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008)

Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Obfuscated Drawings of Planar Graphs. CoRR abs/0803.0858 (2008)

Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1) (2007)

Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007)

Mihyun Kang: Evolution of random graph processes with degree constraints. Electronic Notes in Discrete Mathematics 28: 493-500 (2007)

Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)

Mihyun Kang, Taral Guldahl Seierstad: Phase transition of the minimum degree random multigraph process. Random Struct. Algorithms 31(3): 330-353 (2007)

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)

Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang: Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352

Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht: Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800

Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365

Manuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006)

Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak: The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29(1): 105-120 (2006)

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603

Mihyun Kang: Random walks on a finite graph with congestion points. Applied Mathematics and Computation 153(2): 601-610 (2004)

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107