The SCEAS System
Navigation Menu

Search the dblp DataBase


Mihyun Kang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Generating Labeled Planar Graphs Uniformly at Random. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1095-1107 [Conf]
  2. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Sampling Unlabeled Biconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:593-603 [Conf]
  3. Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak
    The connectivity threshold for the min-degree random graph process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:1, pp:105-120 [Journal]
  4. Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
    Local Limit Theorems for the Giant Component of Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:341-352 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:789-800 [Conf]
  6. Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
    An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:356-365 [Conf]
  7. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
    Generating labeled planar graphs uniformly at random. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:377-386 [Journal]

  8. Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. [Citation Graph (, )][DBLP]

  9. Obfuscated Drawings of Planar Graphs [Citation Graph (, )][DBLP]

  10. Boltzmann Samplers, Pólya Theory, and Cycle Pointing [Citation Graph (, )][DBLP]

  11. Generating Outerplanar Graphs Uniformly at Random. [Citation Graph (, )][DBLP]

  12. The Critical Phase for Random Graphs with a Given Degree Sequence. [Citation Graph (, )][DBLP]

  13. The evolution of the min-min random graph process. [Citation Graph (, )][DBLP]

  14. Random preorders and alignments. [Citation Graph (, )][DBLP]

  15. Enumeration and limit laws for series-parallel graphs. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002