default search action
Choongbum Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j25]Choongbum Lee, Brandon Tran:
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers. Comb. 39(2): 355-376 (2019) - 2018
- [j24]Paul Hand, Choongbum Lee, Vladislav Voroninski:
Exact Simultaneous Recovery of Locations and Structure from Known Orientations and Corrupted Point Correspondences. Discret. Comput. Geom. 59(2): 413-450 (2018) - [j23]David Conlon
, Jeong Han Kim, Choongbum Lee, Joonkyung Lee:
Some advances on Sidorenko's conjecture. J. Lond. Math. Soc. 98(3): 593-608 (2018) - 2017
- [j22]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in Dirac graphs. Comb. 37(4): 697-732 (2017) - [j21]David Conlon
Ordered Ramsey numbers. J. Comb. Theory B 122: 353-383 (2017) - 2016
- [j20]David Conlon
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - [j19]Choongbum Lee, Po-Shen Loh
Judicious partitions of directed graphs. Random Struct. Algorithms 48(1): 147-170 (2016) - [j18]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49(3): 533-557 (2016) - [c1]Thomas A. Goldstein, Paul Hand, Choongbum Lee, Vladislav Voroninski, Stefano Soatto:
ShapeFit and ShapeKick for Robust, Scalable Structure from Motion. ECCV (7) 2016: 289-304 - [i6]Thomas A. Goldstein, Paul Hand, Choongbum Lee, Vladislav Voroninski, Stefano Soatto:
ShapeFit and ShapeKick for Robust, Scalable Structure from Motion. CoRR abs/1608.02165 (2016) - 2015
- [j17]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46(2): 320-345 (2015) - [j16]Choongbum Lee, Sang-il Oum:
Number of Cliques in Graphs with a Forbidden Subdivision. SIAM J. Discret. Math. 29(4): 1999-2005 (2015) - [i5]Paul Hand, Choongbum Lee, Vladislav Voroninski:
ShapeFit: Exact location recovery from corrupted pairwise directions. CoRR abs/1506.01437 (2015) - [i4]Paul Hand, Choongbum Lee, Vladislav Voroninski:
Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences. CoRR abs/1509.05064 (2015) - 2013
- [j15]Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. 33(2): 181-197 (2013) - [j14]József Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young
Towards a Weighted Version of the Hajnal-Szemerédi Theorem. Comb. Probab. Comput. 22(3): 346-350 (2013) - [j13]Shagnik Das
Rainbow Turán problem for even cycles. Eur. J. Comb. 34(5): 905-915 (2013) - [j12]Choongbum Lee, Po-Shen Loh
Bisections of graphs. J. Comb. Theory B 103(5): 599-629 (2013) - [j11]Choongbum Lee, Po-Shen Loh
Self-Similarity of Graphs. SIAM J. Discret. Math. 27(2): 959-972 (2013) - 2012
- [b1]Choongbum Lee:
Problems in Extremal and Probabilistic Combinatorics. University of California, Los Angeles, USA, 2012 - [j10]József Balogh, Choongbum Lee, Wojciech Samotij:
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21(1-2): 23-55 (2012) - [j9]Choongbum Lee, Benny Sudakov, Dan Vilenchik:
Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. 21(5): 773-801 (2012) - [j8]Choongbum Lee, Benny Sudakov:
Hamiltonicity, independence number, and pancyclicity. Eur. J. Comb. 33(4): 449-457 (2012) - [j7]Hao Huang, Choongbum Lee, Benny Sudakov:
Bandwidth theorem for random graphs. J. Comb. Theory B 102(1): 14-37 (2012) - [j6]Choongbum Lee, Joonkyung Lee, Sang-il Oum:
Rank-width of random graphs. J. Graph Theory 70(3): 339-347 (2012) - [j5]Choongbum Lee, Wojciech Samotij:
Pancyclic subgraphs of random graphs. J. Graph Theory 71(2): 142-158 (2012) - [j4]Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. Random Struct. Algorithms 41(1): 124-145 (2012) - [j3]Choongbum Lee, Benny Sudakov:
Dirac's theorem for random graphs. Random Struct. Algorithms 41(3): 293-305 (2012) - 2011
- [i3]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. CoRR abs/1109.3180 (2011) - 2010
- [j2]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Resilient Pancyclicity of Random and Pseudorandom Graphs. SIAM J. Discret. Math. 24(1): 1-16 (2010) - [i2]Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. CoRR abs/1009.2307 (2010) - [i1]Jacob Fox, Choongbum Lee, Benny Sudakov:
Maximum union-free subfamilies. CoRR abs/1012.3127 (2010)
2000 – 2009
- 2009
- [j1]Choongbum Lee:
On the Size of Minimal Unsatisfiable Formulas. Electron. J. Comb. 16(1) (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: