Preprints
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions, submitted for publication, 2007, 21 pages (with ). Extended abstract appeared in the Proceedings of ICALP 2007.
- A complete grammar for decomposing a family of graphs into 3-connected components, submitted for publication, 2007, 12 pages (with ).
- The order of the giant component of random hypergraphs, submitted for publication, 2007, 28 pages (with ).
- Local limit theorems and the number of connected hypergraphs, submitted for publication, 2007, 24 pages (with ).
- The evolution of the min-min random graph process, submitted for publication, 2007, 20 pages (with ).
- The enumeration of planar graphs via Wick's theorem, submitted for publication, 2006, 23 pages (with ).
- On the logical complexity of convex polygon dissections, Archiv der Mathematik, 2006, 26 pages (with ).
Journal Papers
- Random preorders and alignments, Discrete Mathematics, accepted for publication, 24 pages (with ).
- Generating unlabeled connected cubic planar graphs uniformly at random, Random Structures and Algorithms 34 (2008), 157-180 (with ).
- The critical phase for random graphs with a given degree sequence, Combinatorics, Probability and Computing 17 (2008), 67-86 (with ).
- Enumeration and limit laws of series-parallel graphs, European Journal of Combinatorics 28 (2007), 2091-2105 (with ).
- Enumeration and asymptotic properties of unlabeled outerplanar graphs, Electronic Journal of Combinatorics 14 (2007), #R66, 24 pages (with ).
- The phase transition of the minimum degree random multi-graph process, Random Structures and Algorithms 31 (2007), 330-353 (with ).
- Generating labeled planar graphs uniformly at random, Theoretical Computer Science 379 (2007), 377-386 (with ).
- A direct decomposition of 3-connected planar graphs, Séminaire Lotharingien de Combinatoire 54A (2007), Article B54 Ak, 15 pages (with ).
- Random cubic planar graphs, Random Structures and Algorithms 30 (2007), 78-94 (with ).
- Generating outerplanar graphs uniformly at random, Combinatorics, Probability and Computing 15 (2006), 333-343 (with ).
- The connectivity threshold for the min-degree random graph process, Random Structures and Algorithms 29 (2006), 105-120 (with ).
- Maximum K_r+1-free graphs which are not r-partite, Mat. Studii 24 (2005), 12-20 (with ).
- Random walks on finite graphs with congestion points, Applied Mathematics and Computation 153 (2004), 601-610.
- Efficiency test of pseudorandom number generators using random walks, Journal of Computational and Applied Mathematics 174 (2004), 165-177.
- First hitting times of simple random walks on graphs with congestion points, International Journal of Mathematics and Mathematical Sciences 30 (2003), 1911-1922.
Conference Papers
- Local Limit Theorems for the Giant Component of Random Hypergraphs. In the Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM07) (with ). Journal version submitted for publication.
- 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 ). Journal version submitted for publication.
- 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 ).
- 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 ). Journal version appeared in European Journal of Combinatorics 28 (2007), 2091-2105.
- 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 ).
- 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 ). Journal version appeared in Theoretical Computer Science 379 (2007), 377-386.
- 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 ). Journal version appeared in Random Structures and Algorithms 34 (2008), 157-180.
Habilitation Thesis
- Random Planar Structures and Random Graph Processes, Habilitationsschrift, Humboldt-Universität zu Berlin, Institut für Informatik, 2007, 222 pages.
Translation
- Korean version of The proofs from THE BOOK by Martin Aigner and Günter M. Ziegler, Kyowoosa publisher, Seoul, March 2008 (with Youngmee Koh and Sangwook Ree).
