| Enumeration and limit laws for series–parallel graphs M Bodirsky, O Giménez, M Kang, M Noy European Journal of Combinatorics 28 (8), 2091-2105, 2007 | 129* | 2007 |
| Generating labeled planar graphs uniformly at random M Bodirsky, C Gröpl, M Kang Theoretical Computer Science 379 (3), 377-386, 2007 | 83* | 2007 |
| Boltzmann samplers, Pólya theory, and cycle pointing M Bodirsky, É Fusy, M Kang, S Vigerske SIAM Journal on Computing 40 (3), 721-769, 2011 | 69* | 2011 |
| Asymptotic study of subcritical graph classes M Drmota, É Fusy, M Kang, V Kraus, J Rué SIAM Journal on Discrete Mathematics 25 (4), 1615-1651, 2011 | 67 | 2011 |
| Random cubic planar graphs M Bodirsky, M Kang, M Löffler, C McDiarmid Random Structures & Algorithms 30 (1‐2), 78-94, 2007 | 59 | 2007 |
| A complete grammar for decomposing a family of graphs into 3-connected components G Chapuy, É Fusy, M Kang, B Shoilekova Electronic Journal of Combinatorics 15 (1), 148, 2008 | 53 | 2008 |
| Charting the replica symmetric phase A Coja-Oghlan, C Efthymiou, N Jaafari, M Kang, T Kapetanopoulos Communications in Mathematical Physics 359 (2), 603-698, 2018 | 48 | 2018 |
| Quasi-randomness and algorithmic regularity for graphs with general degree distributions N Alon, A Coja-Oghlan, H Hàn, M Kang, V Rödl, M Schacht SIAM Journal on Computing 39 (6), 2336-2362, 2010 | 46 | 2010 |
| The order of the giant component of random hypergraphs M Behrisch, A Coja‐Oghlan, M Kang Random Structures & Algorithms 36 (2), 149-184, 2010 | 40 | 2010 |
| Two critical periods in the evolution of random planar graphs M Kang, T Łuczak Transactions of the American Mathematical Society 364 (8), 4239-4265, 2012 | 39 | 2012 |
| Enumeration and asymptotic properties of unlabeled outerplanar graphs M Bodirsky, É Fusy, M Kang, S Vigerske Electronic Journal of Combinatorics 14 (1), 66, 2007 | 39* | 2007 |
| Generating outerplanar graphs uniformly at random M Bodirsky, M Kang Combinatorics, Probability and Computing 15 (3), 333-343, 2006 | 39 | 2006 |
| Local Limit Theorems for the Giant Component of Random Hypergraphs† M Behrisch, A Coja-Oghlan, M Kang Combinatorics, Probability and Computing 23 (3), 331-366, 2014 | 36* | 2014 |
| The critical phase for random graphs with a given degree sequence M Kang, TG Seierstad Combinatorics, Probability and Computing 17 (1), 67-86, 2008 | 36 | 2008 |
| The size of the giant high‐order component in random hypergraphs O Cooley, M Kang, C Koch Random structures & algorithms, 2018 | 34* | 2018 |
| On the connectivity of random graphs from addable classes M Kang, K Panagiotou Journal of Combinatorial Theory, Series B 103 (2), 306-312, 2013 | 23 | 2013 |
| Largest components in random hypergraphs O Cooley, M Kang, Y Person Combinatorics, Probability and Computing, 1-22, 2018 | 22 | 2018 |
| The Bohman‐Frieze process near criticality M Kang, W Perkins, J Spencer Random Structures & Algorithms 43 (2), 221-250, 2013 | 22 | 2013 |
| Untangling planar graphs from a specified vertex position—Hard cases M Kang, O Pikhurko, A Ravsky, M Schacht, O Verbitsky Discrete Applied Mathematics 159 (8), 789-799, 2011 | 21* | 2011 |
| Cubic graphs and related triangulations on orientable surfaces W Fang, K Kang, M Moßhammer, P Sprüssel Electronic Journal of Combinatorics 25, P1.30, 2018 | 17* | 2018 |
