Publications

Extended abstracts in peer-reviewed conference proceedings

• Oliver Cooley, Mihyun Kang, and Oleg Pikhurko, On a question of Vera T. Sos about size forcing of graphons (extended abstract), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.

• Oliver Cooley, Mihyun Kang, and Julian Zalla, Loose cores and cycles in random hypergraphs (extended abstract), Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.

• Tuan Anh Do, Joshua Erde, and Mihyun Kang , Component behaviour of random bipartite graphs, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.

• Chris Dowden, Mihyun Kang, Mirjana Mikalacki, and Milos Stojakovic, The game of Toucher and Isolator, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.

• Mihyun Kang and Michael Missethan, Cut vertices in random planar graphs, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), CRM Research Perspectives, Springer.

• Mihyun Kang and Michael Missethan, The giant component and 2-core in sparse random outerplanar graphs, In the Proceedings of the 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), Leibniz International Proceedings in Informatics 159 (2020), pp. 4:1-4:17. https://doi.org/10.4230/LIPIcs.AofA.2020.18. arxiv.org/abs/2004.13319

• Jason Gao and Mihyun Kang, Counting cubic maps with large genus, In the Proceedings of the 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), Leibniz International Proceedings in Informatics 159 (2020), pp. 3:1-3:14. https://doi.org/10.4230/LIPIcs.AofA.2020.13.

• Oliver Cooley, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel, Cohomology groups of non-uniform random simplicial complexes, In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019), Acta Math. Univ. Comenianae Vol. LXXXVIII, 3 (2019), pp. 553-560. http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1288/693

• Chris Dowden, Mihyun Kang, Michael Moßhammer, and Philipp Sprüssel, The evolution of random graphs on surfaces of non-constant genus, In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019), Acta Math. Univ. Comenianae Vol. LXXXVIII, 3 (2019), pp. 631-636. http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1206

• Oliver Cooley, Wenjie Fang, Nicola Del Giudice, and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, In the Proceedings of Analytic Algorithmics and Combinatorics (ANALCO), SIAM 2019, pp. 111-118. https://doi.org/10.1137/1.9781611975505.12.

• Oliver Cooley, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel, Vanishing of cohomology groups of random simplicial complexes, In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Leibniz International Proceedings in Informatics 110 (2018), pp. 7:1-7:14. https://doi.org/10.4230/LIPIcs.AofA.2018.7.

• Chris Dowden, Mihyun Kang, and Michael Krivelevich, The genus of the Erdos-Renyi random graph and the fragile genus property, In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Leibniz International Proceedings in Informatics 110 (2018), pp. 17:1-17:13. https://doi.org/10.4230/LIPIcs.AofA.2018.17.

• Hsien-Kuei Hwang, Mihyun Kang, and Guan-Huei Duh, Asymptotic expansions for sub-critical Lagrangean forms, In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Leibniz International Proceedings in Informatics 110 (2018), pp. 29:1-29:13. https://doi.org/10.4230/LIPIcs.AofA.2018.29.

• Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, and Tobias Kapetanopoulos, Charting the replica symmetric phase. In the Proceedings of the 21th International Workshop on Randomization and Computation (RANDOM 2017), Leibniz International Proceedings in Informatics 81 (2017), pp. 40:1-40:17. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.40.

• Chris Dowden, Mihyun Kang, and Philipp Sprüssel, The evolution of random graphs on surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics 61 (2017), pp. 367-373. https://doi.org/10.1016/j.endm.2017.06.061.

• Oliver Cooley, Penny Haxell, Mihyun Kang, and Philipp Sprüssel, Homological connectedness of random hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics 61 (2017), pp. 279-285. https://doi.org/10.1016/j.endm.2017.06.049.

• Mihyun Kang, Tamas Makai, and Oleg Pikhurko, Supersaturation Problem for the Bowtie. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics 61 (2017), pp. 679-685. https://doi.org/10.1016/j.endm.2017.07.023.

• Mihyun Kang, Michael Moßhammer, and Philipp Sprüssel, Evolution of the giant component in graphs on orientable surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics 61 (2017), pp. 687-693. https://doi.org/10.1016/j.endm.2017.07.024.

• Mihyun Kang and Tamas Makai, Bootstrap percolation on G(n,p) revisited. In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2016), pp. 1-12. http://arxiv.org/pdf/1605.02995v1.pdf.
• Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, The minimum bisection in the planted bisection model. In the Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015), Leibniz International Proceedings in Informatics 40 (2015), pp. 710-725. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.710

• Mihyun Kang and Philipp Sprüssel, Charaterisation of symmetries of unlabelled triangulations. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics (2015), pp.587-594. https://doi.org/10.1016/j.endm.2015.06.080.

• Wenjie Fang, Mihyun Kang, Michael Moßhammer, and Philipp Sprüssel, Enumeration of cubic multigraphs on orientable surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics (2015), pp. 603-610. https://doi.org/10.1016/j.endm.2015.06.082.

• Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, How does the core sit inside the mantle?. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics (2015), pp. 489-496. https://doi.org/10.1016/j.endm.2015.06.068.

• Mihyun Kang, Christoph Koch, and Tamas Makai, Bootstrap percolation in random k-uniform hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics (2015), pp. 595-601. https://doi.org/10.1016/j.endm.2015.06.081.

• Oliver Cooley, Mihyun Kang, and Christoph Koch, Evolution of high-order connected components in random hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), Electronic Notes in Discrete Mathematics (2015), pp. 569-575. https://doi.org/10.1016/j.endm.2015.06.077.

• Mihyun Kang, Angelica Pachon, and Pablo Rodriguez, Connectivity for a modified binomial random graph by agglomeration. In the Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2014), DMTCS proc. BA, 2014, pp. 217-228.

• Andrea Jiménez, Mihyun Kang, and Martin Loebl, Directed cycle double covers: hexagon graphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), CRM Series 16 (2013), pp. 147-151.

• Michael Behrisch, Amin Coja-Oghlan, and Mihyun Kang, Local Limit Theorems for the Giant Component of Random Hypergraphs. In the Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM 2007), LNCS 4627, pp. 341-352, 2007, Springer Verlag.

• Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtěch Rödl, and Mathias Schacht, Quasi-randomness and algorithmic regularity for graphs with general degree distributions. In the Proceedings of the 34th International Colloquium on Automata, Languages and Programmnig (ICALP 2007), LNCS 4596, 2007, pp. 789-800, Springer Verlag.

• Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske, An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. In the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 356-365, 2007, ACM.

• Mihyun Kang, Evolution of random graph processes with degree constraints. In the Proceedings of the Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (2006). Electronic Notes in Discrete Mathematics 28 (2007), pp. 493-500 .

• Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy, On the number of series-parallel and outerplanar graphs. In the Proceedings of European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), DMTCS Proceedings Series, 2005, pp. 383-388.

• Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang, Sampling unlabeled biconnected planar graphs. In the Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), LNCS 3827, pp. 593-603, 2005, Springer Verlag.

• Manuel Bodirsky, Clemens Gröpl, and Mihyun kang, Generating labeled planar graphs uniformly at random. In the Proceedings of the Thirtieth International Colloquium on Automata, Languages and Programming (ICALP 2003), LNCS 2719, pp. 1095-1107, 2003, Springer Verlag.

• Manuel Bodirsky, Clemens Gröpl, and Mihyun kang, Decomposing, counting and generating unlabeled cubic planar graphs uniformly at random. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), ITI Series 2003-145, pp. 61-66, 2003.

Miscellaneous

last updated in June 2021