The MathNet Korea
Information Center for Mathematical Science

국내수학자

Information Center for Mathematical Science

국외수학자

강미현
이름 강미현 영어이름 Kang, Mihyun
이메일 mailkang@math.tugraz.at 소속기관 Graz University of Technology
home First hitting times of simple random walks on graphs with congestion points. Int. J. Math. Math. Sci. (2003), Vol , Pages 1911-1922
home Generating labeled planar graphs uniformly at random. Lecture Notes in Comput. Sci. (2003), Vol , Pages 1095-1107
home Random walks on a finite graph with congestion points. Appl. Math. Comput. (2004), Vol 153, Pages 601-610
home Efficiency test of pseudorandom number generators using random walks. J. Comput. Appl. Math. (2005), Vol 174, Pages 165-177
home Maximum $K_{r+1}$-free graphs which are not $r$-partite. Mat. Stud. (2005), Vol 24, Pages 12-20
home Sampling unlabeled biconnected planar graphs. Lecture Notes in Comput. Sci. (2005), Vol , Pages 593-603
home A direct decomposition of 3-connected planar graphs. Sém. Lothar. Combin. (2005/07), Vol 54A, Pages 15
home Generating outerplanar graphs uniformly at random. Combin. Probab. Comput. (2006), Vol 15, Pages 333-343
home The connectivity threshold for the min-degree random graph process. Random Structures Algorithms (2006), Vol 29, Pages 105-120
home Asymptotic enumeration of series-parallel graphs. Ciencias (Valladolid) (2006), Vol , Pages 155-162
home Random cubic planar graphs. Random Structures Algorithms (2007), Vol 30, Pages 78-94
home Generating labeled planar graphs uniformly at random. Theoret. Comput. Sci. (2007), Vol 379, Pages 377-386
home Evolution of random graph processes with degree constraints. Electron. Notes Discrete Math. (2007), Vol , Pages 493-500
home Phase transition of the minimum degree random multigraph process. Random Structures Algorithms (2007), Vol 31, Pages 330-353
home Enumeration and asymptotic properties of unlabeled outerplanar graphs. Electron. J. Combin. (2007), Vol 14, Pages 24
home Enumeration and limit laws for series-parallel graphs. European J. Combin. (2007), Vol 28, Pages 2091-2105
home Quasi-randomness and algorithmic regularity for graphs with general degree distributions. Lecture Notes in Comput. Sci. (2007), Vol , Pages 789-800
home An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007), Vol , Pages 356-365
home The critical phase for random graphs with a given degree sequence. Combin. Probab. Comput. (2008), Vol 17, Pages 67-86
home Generating unlabeled connected cubic planar graphs uniformly at random. Random Structures Algorithms (2008), Vol 32, Pages 157-180
home A complete grammar for decomposing a family of graphs into 3-connected components. Electron. J. Combin. (2008), Vol 15, Pages 39
home The enumeration of planar graphs via Wick's theorem. Adv. Math. (2009), Vol 221, Pages 1703-1724
home The evolution of the min-min random graph process. Discrete Math. (2009), Vol 309, Pages 4527-4544
home Random preorders and alignments. Discrete Math. (2010), Vol 310, Pages 591-603
home The order of the giant component of random hypergraphs. Random Structures Algorithms (2010), Vol 36, Pages 149-184
home Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM J. Comput. (2010), Vol 39, Pages 2336-2362
home Random unlabelled graphs containing few disjoint cycles. Random Structures Algorithms (2011), Vol 38, Pages 174-204
home Untangling planar graphs from a specified vertex position—hard cases. Discrete Appl. Math. (2011), Vol 159, Pages 789-799
home The asymptotic number of connected d -uniform hypergraphs. Combin. Probab. Comput. (2014), Vol 23, Pages 367–385
home Local limit theorems for the giant component of random hypergraphs. Combin. Probab. Comput. (2014), Vol 23, Pages 331–366
home Directed cycle double covers: hexagon graphs. The Seventh European Conference on Combinatorics, Graph Theory and Applications, 147–151 CRM Series (2013), Vol 16, Pages
home The Bohman-Frieze process near criticality. Random Structures Algorithms (2013), Vol 43, Pages 221–250
home On the connectivity of random graphs from addable classes. J. Combin. Theory Ser. B (2013), Vol 103, Pages 306–312
home Two critical periods in the evolution of random planar graphs. Trans. Amer. Math. Soc. (2012), Vol 364, Pages 4239–4265
home Asymptotic study of subcritical graph classes. SIAM J. Discrete Math. (2011), Vol 25, Pages 1615–1651
home Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput. (2011), Vol 40, Pages 721–769
home On the connectivity threshold of Achlioptas processes. Combin. Probab. Comput. (2014), Vol 5, Pages 291–304
home `The asymptotic number of connected d -uniform hypergraphs' Combin. Probab. Comput. (2015), Vol 24, Pages 373–375
home Erratum to "The Bohman-Frieze process near criticality'' Random Structures Algorithms (2015), Vol 46, Pages 801
home The phase transition in multitype binomial random graphs. SIAM J. Discrete Math. (2015), Vol 29, Pages 1042-1064
home Properties of stochastic Kronecker graphs. J. Comb. (2015), Vol 6, Pages 395-432
home The minimum bisection in the planted bisection model. LIPIcs. Leibniz Int. Proc. Inform. (2015), Vol 40, Pages 710-725