Mihyun Kang

Affiliations:
  • Graz University of Technology, Austria


According to our database1, Mihyun Kang authored at least 66 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Longest and shortest cycles in random planar graphs.
Random Struct. Algorithms, 2022

The Sparse Parity Matrix.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Longest Paths in Random Hypergraphs.
SIAM J. Discret. Math., 2021

Large Induced Matchings in Random Graphs.
SIAM J. Discret. Math., 2021

Phase transitions from exp⁡(n1/2) to exp⁡(n2/3) in the asymptotics of banded plane partitions.
J. Comb. Theory, Ser. A, 2021

Large complete minors in random subgraphs.
Comb. Probab. Comput., 2021

2020
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees.
SIAM J. Discret. Math., 2020

Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs.
Random Struct. Algorithms, 2020

The genus of the Erdős-Rényi random graph and the fragile genus property.
Random Struct. Algorithms, 2020

Vanishing of cohomology groups of random simplicial complexes.
Random Struct. Algorithms, 2020

The Giant Component and 2-Core in Sparse Random Outerplanar Graphs.
Proceedings of the 31st International Conference on Probabilistic, 2020

Counting Cubic Maps with Large Genus.
Proceedings of the 31st International Conference on Probabilistic, 2020

2019
Core forging and local limit theorems for the <i>k</i>-core of random graphs.
J. Comb. Theory, Ser. B, 2019

The Toucher-Isolator game.
Electron. J. Comb., 2019

The Size of the Giant Component in Random Hypergraphs: a Short Proof.
Electron. J. Comb., 2019

2018
The size of the giant high-order component in random hypergraphs.
Random Struct. Algorithms, 2018

Largest Components in Random Hypergraphs.
Comb. Probab. Comput., 2018

Symmetries of Unlabelled Planar Triangulations.
Electron. J. Comb., 2018

Cubic Graphs and Related Triangulations on Orientable Surfaces.
Electron. J. Comb., 2018

Asymptotic Expansions for Sub-Critical Lagrangean Forms.
Proceedings of the 29th International Conference on Probabilistic, 2018

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
The Minimum Bisection in the Planted Bisection Model.
Theory Comput., 2017

Jigsaw percolation on random hypergraphs.
J. Appl. Probab., 2017

Evolution of the giant component in graphs on orientable surfaces.
Electron. Notes Discret. Math., 2017

Supersaturation Problem for the Bowtie.
Electron. Notes Discret. Math., 2017

Preface.
Electron. Notes Discret. Math., 2017

The evolution of random graphs on surfaces.
Electron. Notes Discret. Math., 2017

Homological connectedness of random hypergraphs.
Electron. Notes Discret. Math., 2017

Core forging and local limit theorems for the k-core of random graphs.
CoRR, 2017

Charting the Replica Symmetric Phase.
Proceedings of the Approximation, 2017

2016
Cubic Bridgeless Graphs and Braces.
Graphs Comb., 2016

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs.
Electron. J. Comb., 2016

2015
The Phase Transition in Multitype Binomial Random Graphs.
SIAM J. Discret. Math., 2015

Characterisation of symmetries of unlabelled triangulations.
Electron. Notes Discret. Math., 2015

Enumeration of cubic multigraphs on orientable surfaces.
Electron. Notes Discret. Math., 2015

Bootstrap percolation in random k-uniform hypergraphs.
Electron. Notes Discret. Math., 2015

Evolution of high-order connected components in random hypergraphs.
Electron. Notes Discret. Math., 2015

How does the core sit inside the mantle?
Electron. Notes Discret. Math., 2015

'The Asymptotic Number of Connected <i>d</i>-Uniform Hypergraphs' - CORRIGENDUM.
Comb. Probab. Comput., 2015

2014
The Asymptotic Number of Connected <i>d</i>-Uniform Hypergraphs.
Comb. Probab. Comput., 2014

Local Limit Theorems for the Giant Component of Random Hypergraphs.
Comb. Probab. Comput., 2014

2013
The Bohman-Frieze process near criticality.
Random Struct. Algorithms, 2013

On the connectivity of random graphs from addable classes.
J. Comb. Theory, Ser. B, 2013

2011
Asymptotic Study of Subcritical Graph Classes.
SIAM J. Discret. Math., 2011

Boltzmann Samplers, Pólya Theory, and Cycle Pointing.
SIAM J. Comput., 2011

Random unlabelled graphs containing few disjoint cycles.
Random Struct. Algorithms, 2011

Untangling planar graphs from a specified vertex position - Hard cases.
Discret. Appl. Math., 2011

2010
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput., 2010

The order of the giant component of random hypergraphs.
Random Struct. Algorithms, 2010

Random preorders and alignments.
Discret. Math., 2010

2009
The evolution of the min-min random graph process.
Discret. Math., 2009

2008
Generating unlabeled connected cubic planar graphs uniformly at random.
Random Struct. Algorithms, 2008

The Critical Phase for Random Graphs with a Given Degree Sequence.
Comb. Probab. Comput., 2008

Obfuscated Drawings of Planar Graphs
CoRR, 2008

A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components.
Electron. J. Comb., 2008

2007
Generating labeled planar graphs uniformly at random.
Theor. Comput. Sci., 2007

Phase transition of the minimum degree random multigraph process.
Random Struct. Algorithms, 2007

Random cubic planar graphs.
Random Struct. Algorithms, 2007

Evolution of random graph processes with degree constraints.
Electron. Notes Discret. Math., 2007

Enumeration and limit laws for series-parallel graphs.
Eur. J. Comb., 2007

Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs.
Electron. J. Comb., 2007

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

2006
The connectivity threshold for the min-degree random graph process.
Random Struct. Algorithms, 2006

Generating Outerplanar Graphs Uniformly at Random.
Comb. Probab. Comput., 2006

2005
Sampling Unlabeled Biconnected Planar Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Random walks on a finite graph with congestion points.
Appl. Math. Comput., 2004


  Loading...