dblp.uni-trier.dewww.uni-trier.de

Mihyun Kang Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
17EEMihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Obfuscated Drawings of Planar Graphs CoRR abs/0803.0858: (2008)
16EEMihyun Kang, Taral Guldahl Seierstad: The Critical Phase for Random Graphs with a Given Degree Sequence. Combinatorics, Probability & Computing 17(1): 67-86 (2008)
15EEManuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008)
2007
14EEMichael Behrisch, Amin Coja-Oghlan, Mihyun Kang: Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352
13EENoga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht: Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800
12EEManuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365
11EEManuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1): (2007)
10EEMihyun Kang: Evolution of random graph processes with degree constraints. Electronic Notes in Discrete Mathematics 28: 493-500 (2007)
9EEManuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy: Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007)
8EEManuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)
7EEMihyun Kang, Taral Guldahl Seierstad: Phase transition of the minimum degree random multigraph process. Random Struct. Algorithms 31(3): 330-353 (2007)
6EEManuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)
2006
5EEManuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006)
4EEMihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak: The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29(1): 105-120 (2006)
2005
3EEManuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603
2004
2EEMihyun Kang: Random walks on a finite graph with congestion points. Applied Mathematics and Computation 153(2): 601-610 (2004)
2003
1EEManuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107

Coauthor Index

1Noga Alon [13]
2Michael Behrisch [14]
3Manuel Bodirsky [1] [3] [5] [6] [8] [9] [11] [12] [15]
4Amin Coja-Oghlan [13] [14]
5Éric Fusy [11] [12]
6Omer Giménez [9]
7Clemens Gröpl [1] [3] [6] [15]
8Hiêp Hàn [13]
9Youngmee Koh [4]
10Mike Löffler [8]
11Tomasz Luczak [4]
12Colin McDiarmid (Colin J. H. McDiarmid) [8]
13Marc Noy [9]
14Oleg Pikhurko [17]
15Alexander Ravsky [17]
16Sangwook Ree [4]
17Vojtech Rödl [13]
18Mathias Schacht [13] [17]
19Taral Guldahl Seierstad [7] [16]
20Oleg Verbitsky [17]
21Stefan Vigerske [11] [12]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)