Mihyun Kang

	2011
27		Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Untangling planar graphs from a specified vertex position - Hard cases. Discrete Applied Mathematics 159(8): 789-799 (2011)
26		Mihyun Kang, Colin McDiarmid: Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38(1-2): 174-204 (2011)
25		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011)
24		Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué: Asymptotic Study of Subcritical Graph Classes. SIAM J. Discrete Math. 25(4): 1615-1651 (2011)
	2010
23		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Boltzmann Samplers, Pólya Theory, and Cycle Pointing CoRR abs/1003.4546: (2010)
22		Peter J. Cameron, Mihyun Kang, Dudley Stark: Random preorders and alignments. Discrete Mathematics 310(3): 591-603 (2010)
21		Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang: The order of the giant component of random hypergraphs. Random Struct. Algorithms 36(2): 149-184 (2010)
20		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. SIAM J. Comput. 39(6): 2336-2362 (2010)
	2009
19		Amin Coja-Oghlan, Mihyun Kang: The evolution of the min-min random graph process. Discrete Mathematics 309(13): 4527-4544 (2009)
	2008
18		Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Obfuscated Drawings of Planar Graphs CoRR abs/0803.0858: (2008)
17		Mihyun Kang, Taral Guldahl Seierstad: The Critical Phase for Random Graphs with a Given Degree Sequence. Combinatorics, Probability & Computing 17(1): 67-86 (2008)
16		Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova: A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components. Electr. J. Comb. 15(1): (2008)
15		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008)
	2007
14		Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang: Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352
13		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
12		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
11		Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske: Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electr. J. Comb. 14(1): (2007)
10		Mihyun Kang: Evolution of random graph processes with degree constraints. Electronic Notes in Discrete Mathematics 28: 493-500 (2007)
9		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)
8		Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007)
7		Mihyun Kang, Taral Guldahl Seierstad: Phase transition of the minimum degree random multigraph process. Random Struct. Algorithms 31(3): 330-353 (2007)
6		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007)
	2006
5		Manuel Bodirsky, Mihyun Kang: Generating Outerplanar Graphs Uniformly at Random. Combinatorics, Probability & Computing 15(3): 333-343 (2006)
4		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
3		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603
	2004
2		Mihyun Kang: Random walks on a finite graph with congestion points. Applied Mathematics and Computation 153(2): 601-610 (2004)
	2003
1		Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107

Coauthor Index

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

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page