| 2008 |
|---|
| 12 | EE | Mihyun Kang,
Oleg Pikhurko,
Alexander Ravsky,
Mathias Schacht,
Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs
CoRR abs/0803.0858: (2008) |
| 2007 |
|---|
| 11 | EE | Michael Behrisch,
Amin Coja-Oghlan,
Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs.
APPROX-RANDOM 2007: 341-352 |
| 10 | EE | Noga 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 |
| 9 | EE | Manuel Bodirsky,
Éric Fusy,
Mihyun Kang,
Stefan Vigerske:
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling.
SODA 2007: 356-365 |
| 8 | EE | Manuel Bodirsky,
Éric Fusy,
Mihyun Kang,
Stefan Vigerske:
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs.
Electr. J. Comb. 14(1): (2007) |
| 7 | EE | Manuel Bodirsky,
Omer Giménez,
Mihyun Kang,
Marc Noy:
Enumeration and limit laws for series-parallel graphs.
Eur. J. Comb. 28(8): 2091-2105 (2007) |
| 6 | EE | Manuel Bodirsky,
Mihyun Kang,
Mike Löffler,
Colin McDiarmid:
Random cubic planar graphs.
Random Struct. Algorithms 30(1-2): 78-94 (2007) |
| 5 | EE | Mihyun Kang,
Taral Guldahl Seierstad:
Phase transition of the minimum degree random multigraph process.
Random Struct. Algorithms 31(3): 330-353 (2007) |
| 4 | EE | Manuel Bodirsky,
Clemens Gröpl,
Mihyun Kang:
Generating labeled planar graphs uniformly at random.
Theor. Comput. Sci. 379(3): 377-386 (2007) |
| 2006 |
|---|
| 3 | EE | Mihyun 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 |
|---|
| 2 | EE | Manuel Bodirsky,
Clemens Gröpl,
Mihyun Kang:
Sampling Unlabeled Biconnected Planar Graphs.
ISAAC 2005: 593-603 |
| 2003 |
|---|
| 1 | EE | Manuel Bodirsky,
Clemens Gröpl,
Mihyun Kang:
Generating Labeled Planar Graphs Uniformly at Random.
ICALP 2003: 1095-1107 |
