Name
Affiliation
Papers
MIHYUN KANG
Humboldt-Universität zu Berlin, Germany (e-mail: bodirsky@informatik.hu-berlin.de, kang@informatik.hu-berlin.de)
61
Collaborators
Citations 
PageRank 
83
163
29.18
Referers 
Referees 
References 
191
354
380
Search Limit
100354
Title
Citations
PageRank
Year
Planarity and Genus of Sparse Random Bipartite Graphs00.342022
Phase transition in cohomology groups of non-uniform random simplicial complexes00.342022
The Sparse Parity Matrix00.342022
Longest and shortest cycles in random planar graphs00.342022
Concentration of maximum degree in random planar graphs00.342022
Loose Cores and Cycles in Random Hypergraphs.00.342022
LONGEST PATHS IN RANDOM HYPERGRAPHS00.342021
Large Induced Matchings In Random Graphs00.342021
Subcritical Random Hypergraphs, High-Order Components, And Hypertrees00.342020
Vanishing of cohomology groups of random simplicial complexes00.342020
The genus of the Erdős‐Rényi random graph and the fragile genus property00.342020
Supersaturation problem for the bowtie00.342020
Subcritical random hypergraphs, high-order components, and hypertrees.00.342019
Core forging and local limit theorems for the -core of random graphs.00.342019
Symmetries of Unlabelled Planar Triangulations.10.352018
The size of the giant high-order component in random hypergraphs.10.392018
Cubic Graphs and Related Triangulations on Orientable Surfaces.00.342018
Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).00.342018
The evolution of random graphs on surfaces.00.342018
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property.00.342018
Asymptotic Expansions for Sub-Critical Lagrangean Forms.00.342018
Evolution of the giant component in graphs on orientable surfaces.00.342017
Supersaturation Problem for the Bowtie.00.342017
Charting the replica symmetric phase.00.342017
Jigsaw percolation on random hypergraphs.00.342017
Homological connectedness of random hypergraphs.00.342017
Threshold and hitting time for high-order connectedness in random hypergraphs30.582016
Cubic Bridgeless Graphs and Braces.00.342016
Enumeration of cubic multigraphs on orientable surfaces10.432015
The Phase Transition in Multitype Binomial Random Graphs00.342015
Bootstrap percolation in random k -uniform hypergraphs00.342015
The minimum bisection in the planted bisection model10.362015
Evolution of high-order connected components in random hypergraphs10.352015
Characterisation of symmetries of unlabelled triangulations00.342015
'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM.10.402015
The Asymptotic Number of Connected d-Uniform Hypergraphs.00.342014
On the connectivity of random graphs from addable classes70.682013
The Bohman-Frieze process near criticality.40.482013
Random unlabelled graphs containing few disjoint cycles30.472011
Asymptotic Study of Subcritical Graph Classes80.622011
Boltzmann Samplers, Pólya Theory, and Cycle Pointing111.042011
Random preorders and alignments00.342010
The order of the giant component of random hypergraphs70.732010
Fabrication of a stepped shape tip using a self-descending phenomena of meniscus00.342009
The evolution of the min-min random graph process00.342009
Generating unlabeled connected cubic planar graphs uniformly at random20.422008
Obfuscated Drawings of Planar Graphs40.572008
A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components151.052008
Random cubic planar graphs151.232007
Evolution of random graph processes with degree constraints10.362007
  • 1
  • 2