Choongbum Lee

According to our database1, Choongbum Lee authored at least 29 papers between 2009 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers.
Comb., 2019

2018
Some advances on Sidorenko's conjecture.
J. Lond. Math. Soc., 2018

Exact Simultaneous Recovery of Locations and Structure from Known Orientations and Corrupted Point Correspondences.
Discret. Comput. Geom., 2018

2017
Ordered Ramsey numbers.
J. Comb. Theory, Ser. B, 2017

Compatible Hamilton cycles in Dirac graphs.
Comb., 2017

2016
Judicious partitions of directed graphs.
Random Struct. Algorithms, 2016

Compatible Hamilton cycles in random graphs.
Random Struct. Algorithms, 2016

Ramsey numbers of cubes versus cliques.
Comb., 2016

ShapeFit and ShapeKick for Robust, Scalable Structure from Motion.
Proceedings of the Computer Vision - ECCV 2016, 2016

2015
Number of Cliques in Graphs with a Forbidden Subdivision.
SIAM J. Discret. Math., 2015

Long paths and cycles in random subgraphs of graphs with large minimum degree.
Random Struct. Algorithms, 2015

ShapeFit: Exact location recovery from corrupted pairwise directions.
CoRR, 2015

2013
Self-Similarity of Graphs.
SIAM J. Discret. Math., 2013

Bisections of graphs.
J. Comb. Theory, Ser. B, 2013

Rainbow Turán problem for even cycles.
Eur. J. Comb., 2013

Towards a Weighted Version of the Hajnal-Szemerédi Theorem.
Comb. Probab. Comput., 2013

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.
Comb., 2013

2012
Problems in Extremal and Probabilistic Combinatorics.
PhD thesis, 2012

Dirac's theorem for random graphs.
Random Struct. Algorithms, 2012

Quasi-randomness of graph balanced cut properties.
Random Struct. Algorithms, 2012

Pancyclic subgraphs of random graphs.
J. Graph Theory, 2012

Rank-width of random graphs.
J. Graph Theory, 2012

Bandwidth theorem for random graphs.
J. Comb. Theory, Ser. B, 2012

Hamiltonicity, independence number, and pancyclicity.
Eur. J. Comb., 2012

Getting a Directed Hamilton Cycle Two Times Faster.
Comb. Probab. Comput., 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.
Comb. Probab. Comput., 2012

2010
Resilient Pancyclicity of Random and Pseudorandom Graphs.
SIAM J. Discret. Math., 2010

Maximum union-free subfamilies
CoRR, 2010

2009
On the Size of Minimal Unsatisfiable Formulas.
Electron. J. Comb., 2009


  Loading...