Random walks on a finite graph with congestion points. - Mihyun Kang (Appl. Math. Comput., 2004)

Sampling Unlabeled Biconnected Planar Graphs. - Manuel Bodirsky; Clemens Gröpl; Mihyun Kang (ISAAC, 2005)

Generating Outerplanar Graphs Uniformly at Random. - Manuel Bodirsky; Mihyun Kang (Comb. Probab. Comput., 2006)

The connectivity threshold for the min-degree random graph process. - Mihyun Kang; Youngmee Koh; Sangwook Ree; Tomasz Luczak 001 (Random Struct. Algorithms, 2006)

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

Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. - Manuel Bodirsky; Éric Fusy; Mihyun Kang; Stefan Vigerske (Electron. J. Comb., 2007)

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

Evolution of random graph processes with degree constraints. - Mihyun Kang (Electron. Notes Discret. Math., 2007)

Random cubic planar graphs. - Manuel Bodirsky; Mihyun Kang; Mike Löffler; Colin McDiarmid (Random Struct. Algorithms, 2007)

Phase transition of the minimum degree random multigraph process. - Mihyun Kang; Taral Guldahl Seierstad (Random Struct. Algorithms, 2007)

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

Random planar structures and random graph processes - Mihyun Kang (2007)

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

Obfuscated Drawings of Planar Graphs - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (CoRR, 2008)

The Critical Phase for Random Graphs with a Given Degree Sequence. - Mihyun Kang; Taral Guldahl Seierstad (Comb. Probab. Comput., 2008)

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

The evolution of the min-min random graph process. - Amin Coja-Oghlan; Mihyun Kang (Discret. Math., 2009)

Random preorders and alignments. - Peter J. Cameron; Mihyun Kang; Dudley Stark (Discret. Math., 2010)

The order of the giant component of random hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Random Struct. Algorithms, 2010)

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

Untangling planar graphs from a specified vertex position - Hard cases. - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (Discret. Appl. Math., 2011)

Random unlabelled graphs containing few disjoint cycles. - Mihyun Kang; Colin McDiarmid (Random Struct. Algorithms, 2011)

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

Asymptotic Study of Subcritical Graph Classes. - Michael Drmota; Éric Fusy; Mihyun Kang; Veronika Kraus; Juanjo Rué (SIAM J. Discret. Math., 2011)

On the connectivity of random graphs from addable classes. - Mihyun Kang; Konstantinos Panagiotou (J. Comb. Theory B, 2013)

The Bohman-Frieze process near criticality. - Mihyun Kang; Will Perkins 001; Joel Spencer (Random Struct. Algorithms, 2013)

Local Limit Theorems for the Giant Component of Random Hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2014)

The Asymptotic Number of Connected d-Uniform Hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2014)

'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2015)

How does the core sit inside the mantle? - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Electron. Notes Discret. Math., 2015)

Evolution of high-order connected components in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. Notes Discret. Math., 2015)

Bootstrap percolation in random k-uniform hypergraphs. - Mihyun Kang; Christoph Koch 006; Tamás Makai (Electron. Notes Discret. Math., 2015)

Enumeration of cubic multigraphs on orientable surfaces. - Mihyun Kang; Michael Moßhammer; Philipp Sprüssel; Wenjie Fang (Electron. Notes Discret. Math., 2015)

Characterisation of symmetries of unlabelled triangulations. - Mihyun Kang; Philipp Sprüssel (Electron. Notes Discret. Math., 2015)

The Phase Transition in Multitype Binomial Random Graphs. - Mihyun Kang; Christoph Koch 006; Angélica Pachón (SIAM J. Discret. Math., 2015)

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2016)

Cubic Bridgeless Graphs and Braces. - Andrea Jiménez; Mihyun Kang; Martin Loebl (Graphs Comb., 2016)

Charting the Replica Symmetric Phase. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Nor Jaafari; Mihyun Kang; Tobias Kapetanopoulos (APPROX-RANDOM, 2017)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (CoRR, 2017)

Homological connectedness of random hypergraphs. - Oliver Cooley; Penny Haxell; Mihyun Kang; Philipp Sprüssel (Electron. Notes Discret. Math., 2017)

The evolution of random graphs on surfaces. - Chris Dowden; Mihyun Kang; Philipp Sprüssel (Electron. Notes Discret. Math., 2017)

Preface. - Michael Drmota; Mihyun Kang; Christian Krattenthaler; Jaroslav Nesetril (Electron. Notes Discret. Math., 2017)

Supersaturation Problem for the Bowtie. - Mihyun Kang; Tamás Makai; Oleg Pikhurko (Electron. Notes Discret. Math., 2017)

Evolution of the giant component in graphs on orientable surfaces. - Mihyun Kang; Michael Moßhammer; Philipp Sprüssel (Electron. Notes Discret. Math., 2017)

Jigsaw percolation on random hypergraphs. - Béla Bollobás; Oliver Cooley; Mihyun Kang; Christoph Koch 006 (J. Appl. Probab., 2017)

The Minimum Bisection in the Planted Bisection Model. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Theory Comput., 2017)

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (AofA, 2018)

Asymptotic Expansions for Sub-Critical Lagrangean Forms. - Hsien-Kuei Hwang; Mihyun Kang; Guan-Huei Duh (AofA, 2018)

Cubic Graphs and Related Triangulations on Orientable Surfaces. - Wenjie Fang; Mihyun Kang; Michael Moßhammer; Philipp Sprüssel (Electron. J. Comb., 2018)

Symmetries of Unlabelled Planar Triangulations. - Mihyun Kang; Philipp Sprüssel (Electron. J. Comb., 2018)

Largest Components in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Yury Person (Comb. Probab. Comput., 2018)

The size of the giant high-order component in random hypergraphs. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Random Struct. Algorithms, 2018)

The Size of the Giant Component in Random Hypergraphs: a Short Proof. - Oliver Cooley; Mihyun Kang; Christoph Koch 006 (Electron. J. Comb., 2019)

The Toucher-Isolator game. - Chris Dowden; Mihyun Kang; Mirjana Mikalacki; Milos Stojakovic (Electron. J. Comb., 2019)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (J. Comb. Theory B, 2019)

Counting Cubic Maps with Large Genus. - Zhicheng Gao; Mihyun Kang (AofA, 2020)

The Giant Component and 2-Core in Sparse Random Outerplanar Graphs. - Mihyun Kang; Michael Missethan (AofA, 2020)

Vanishing of cohomology groups of random simplicial complexes. - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (Random Struct. Algorithms, 2020)

The genus of the Erdős-Rényi random graph and the fragile genus property. - Chris Dowden; Mihyun Kang; Michael Krivelevich (Random Struct. Algorithms, 2020)

Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs. - Nikolaos Fountoulakis; Mihyun Kang; Tamás Makai (Random Struct. Algorithms, 2020)

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. - Oliver Cooley; Wenjie Fang; Nicola Del Giudice 001; Mihyun Kang (SIAM J. Discret. Math., 2020)

Phase transitions in graphs on orientable surfaces. - Mihyun Kang; Michael Moßhammer; Philipp Sprüssel (Random Struct. Algorithms, 2020)

Large complete minors in random subgraphs. - Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2021)

Phase transitions from exp⁡(n1/2) to exp⁡(n2/3) in the asymptotics of banded plane partitions. - Wenjie Fang; Hsien-Kuei Hwang; Mihyun Kang (J. Comb. Theory A, 2021)

Large Induced Matchings in Random Graphs. - Oliver Cooley; Nemanja Draganic; Mihyun Kang; Benny Sudakov (SIAM J. Discret. Math., 2021)

Longest Paths in Random Hypergraphs. - Oliver Cooley; Frederik Garbe; Eng Keat Hng; Mihyun Kang; Nicolás Sanhueza-Matamala; Julian Zalla (SIAM J. Discret. Math., 2021)

The Sparse Parity Matrix. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Joon Lee; Jean Bernoulli Ravelomanana (SODA, 2022)

Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. - Oliver Cooley; Nicola Del Giudice 001; Mihyun Kang; Philipp Sprüssel (Electron. J. Comb., 2022)

Loose Cores and Cycles in Random Hypergraphs. - Oliver Cooley; Mihyun Kang; Julian Zalla (Electron. J. Comb., 2022)

Concentration of maximum degree in random planar graphs. - Mihyun Kang; Michael Missethan (J. Comb. Theory B, 2022)

Longest and shortest cycles in random planar graphs. - Mihyun Kang; Michael Missethan (Random Struct. Algorithms, 2022)

Planarity and Genus of Sparse Random Bipartite Graphs. - Tuan Anh Do; Joshua Erde; Mihyun Kang (SIAM J. Discret. Math., 2022)

Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point. - Tuan Anh Do; Joshua Erde; Mihyun Kang; Michael Missethan (Electron. J. Comb., 2023)

On the Chromatic Number in the Stochastic Block Model. - Mikhail Isaev; Mihyun Kang (Electron. J. Comb., 2023)

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes. - Mihyun Kang; Michael Missethan (SIAM J. Discret. Math., 2023)

The $k$-XORSAT Threshold Revisited. - Amin Coja-Oghlan; Mihyun Kang; Lena Krieg; Maurice Rolvien (Electron. J. Comb., 2024)

Percolation on irregular high-dimensional product graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2024)

A note on the width of sparse random graphs. - Tuan Anh Do; Joshua Erde; Mihyun Kang (J. Graph Theory, 2024)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. - David Gamarnik; Mihyun Kang; Pawel Pralat (SIAM J. Discret. Math., 2024)

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb., 2024)

Belief Propagation Guided Decimation on Random k-XORSAT. - Arnab Chatterjee; Amin Coja-Oghlan; Mihyun Kang; Lena Krieg; Maurice Rolvien; Gregory B. Sorkin (ICALP, 2025)

Percolation on High-Dimensional Product Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Random Struct. Algorithms, 2025)