On the Size of Minimal Unsatisfiable Formulas. - Choongbum Lee (Electron. J. Comb., 2009)

Maximum union-free subfamilies - Jacob Fox; Choongbum Lee; Benny Sudakov (CoRR, 2010)

Resilient Pancyclicity of Random and Pseudorandom Graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (SIAM J. Discret. Math., 2010)

Corrádi and Hajnal's Theorem for Sparse Random Graphs. - József Balogh; Choongbum Lee; Wojciech Samotij (Comb. Probab. Comput., 2012)

Getting a Directed Hamilton Cycle Two Times Faster. - Choongbum Lee; Benny Sudakov; Dan Vilenchik (Comb. Probab. Comput., 2012)

Hamiltonicity, independence number, and pancyclicity. - Choongbum Lee; Benny Sudakov (Eur. J. Comb., 2012)

Bandwidth theorem for random graphs. - Hao Huang 005; Choongbum Lee; Benny Sudakov (J. Comb. Theory B, 2012)

Rank-width of random graphs. - Choongbum Lee; Joonkyung Lee; Sang-il Oum (J. Graph Theory, 2012)

Pancyclic subgraphs of random graphs. - Choongbum Lee; Wojciech Samotij (J. Graph Theory, 2012)

Quasi-randomness of graph balanced cut properties. - Hao Huang 005; Choongbum Lee (Random Struct. Algorithms, 2012)

Dirac's theorem for random graphs. - Choongbum Lee; Benny Sudakov (Random Struct. Algorithms, 2012)

Problems in Extremal and Probabilistic Combinatorics. - Choongbum Lee (2012)

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. - Jacob Fox; Choongbum Lee; Benny Sudakov (Comb., 2013)

Towards a Weighted Version of the Hajnal-Szemerédi Theorem. - József Balogh; Graeme Kemkes; Choongbum Lee; Stephen J. Young (Comb. Probab. Comput., 2013)

Rainbow Turán problem for even cycles. - Shagnik Das; Choongbum Lee; Benny Sudakov (Eur. J. Comb., 2013)

Bisections of graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (J. Comb. Theory B, 2013)

Self-Similarity of Graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (SIAM J. Discret. Math., 2013)

ShapeFit: Exact location recovery from corrupted pairwise directions. - Paul Hand; Choongbum Lee; Vladislav Voroninski (CoRR, 2015)

Long paths and cycles in random subgraphs of graphs with large minimum degree. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Random Struct. Algorithms, 2015)

Number of Cliques in Graphs with a Forbidden Subdivision. - Choongbum Lee; Sang-il Oum (SIAM J. Discret. Math., 2015)

ShapeFit and ShapeKick for Robust, Scalable Structure from Motion. - Thomas A. Goldstein; Paul Hand; Choongbum Lee; Vladislav Voroninski; Stefano Soatto (ECCV (7), 2016)

Ramsey numbers of cubes versus cliques. - David Conlon; Jacob Fox; Choongbum Lee; Benny Sudakov (Comb., 2016)

Compatible Hamilton cycles in random graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Random Struct. Algorithms, 2016)

Judicious partitions of directed graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2016)

Compatible Hamilton cycles in Dirac graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Comb., 2017)

Ordered Ramsey numbers. - David Conlon; Jacob Fox; Choongbum Lee; Benny Sudakov (J. Comb. Theory B, 2017)

Exact Simultaneous Recovery of Locations and Structure from Known Orientations and Corrupted Point Correspondences. - Paul Hand; Choongbum Lee; Vladislav Voroninski (Discret. Comput. Geom., 2018)

Some advances on Sidorenko's conjecture. - David Conlon; Jeong Han Kim; Choongbum Lee; Joonkyung Lee (J. Lond. Math. Soc., 2018)

The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers. - Choongbum Lee; Brandon Tran (Comb., 2019)