Mihyun Kang DFG-Heisenberg

PD Dr. Mihyun Kang


I am a Heisenberg Fellow of Deutsche Forschungsgemeinschaft as well as a Privatdozentin of Humboldt-Universität zu Berlin.

Address:
Institut für Mathematik, MA 6-2
Technische Universität Berlin
Straße des 17. Juni 136
10623 Berlin
GERMANY

Office: MA 618
Telephone: +49 - 30 - 314 25752
Fax: +49 - 30 - 314 21269
E-Mail: kang -at- math.tu-berlin.de

Research     Publications     Teaching    CV


Research

Research Interests

Discrete Mathematics; Theoretical Computer Science; Discrete Probability Theory

In particular, Probabilistic and Analytic Combinatorics, Random Graphs, Random Maps and Graphs on a Surface, Enumeration, Random Sampling, Randomized Algorithms, Analysis of Algorithms

Research Stays

Organization of Workshops, Seminars and Schools

Professional Activities

Research Supervision

  • Alexandros Droseltis, Master Thesis "Phase transition of a d-process on random graphs", 2008 (Co-supervisor: Prof. Dr. Uwe Küchler)
  • Taral Guldahl Seierstad, Ph.D. Dissertation "The phase transition in random graphs and random graph processes", 2007 (Co-supervisor: Prof. Dr. Hans Jürgen Prömel)
  • Stefan Vigerske, Master Thesis "Asymptotic enumeration of unlabeled outerplanar graphs", 2005
  • Mike Löffler, Master Thesis "Counting and uniform generation of labeled planar structures", 2005
  • Stefan Vigerske, Bachelor Thesis "Random outerplanar graphs", 2005 (Co-supervisor: Prof. Dr. Anusch Taraz)


Publications

Papers in Journals

Papers in Conference Proceedings

  • Local Limit Theorems for the Giant Component of Random Hypergraphs. In the Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM07), LNCS 4627, pages 341-352, 2007, Springer Verlag (with Michael Behrisch and Amin Coja-Oghlan).
  • Quasi-randomness and algorithmic regularity for graphs with general degree distributions. In the Proceedings of the 34th International Colloquium on Automata, Languages and Programmnig (ICALP07), LNCS 4596, pages 789-800, 2007, Springer Verlag (with Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Vojtěch Rödl and Mathias Schacht).
  • An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. In the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA07), pages 356-365 (with Manuel Bodirsky, Éric Fusy and Stefan Vigerske).
  • 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), 493-500 .
  • On the number of series-parallel and outerplanar graphs. In the Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb05), DMTCS Proceedings Series, pages 383 - 388, 2005 (with Manuel Bodirsky, Omer Giménez and Marc Noy).
  • Sampling unlabeled biconnected planar graphs. In the Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC05), LNCS 3827, pages 593-603, 2005, Springer Verlag (with Manuel Bodirsky and Clemens Gröpl).
  • Generating labeled planar graphs uniformly at random. In the Proceedings of the Thirtieth International Colloquium on Automata, Languages and Programming (ICALP03), LNCS 2719, pages 1095-1107, 2003, Springer Verlag (with Manuel Bodirsky and Clemens Gröpl).
  • Decomposing, counting and generating unlabeled cubic planar graphs uniformly at random. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb03), ITI Series 2003-145, pages 61-66, 2003 (with Manuel Bodirsky and Clemens Gröpl).

Translation


Korean version of The proofs from THE BOOK by Martin Aigner and Günter M. Ziegler, ISBN 9788981727246, Kyowoo Publishing Co.,Ltd, Seoul, 2008 (with Youngmee Koh and Sangwook Ree).



Teaching

At Humboldt-Universität zu Berlin



last modified on 10 May 2009