Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSangjune Lee
Person information
- affiliation: Kyung Hee University, Seoul, Republic of Korea
- affiliation (former): Duksung Women's University, Department of Mathematics, Seoul, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Sang June Lee, Jun Seok Oh:
On zero-sum free sequences contained in random subsets of finite cyclic groups. Discret. Appl. Math. 330: 118-127 (2023)- 2021
- [j14]Taejung Park
, Hyunjoo Song, Sang June Lee:
Detecting and Recovering Integer Data Manipulated by Multiplication With a Nonintegral Real Number and a Rounding Operation. IEEE Access 9: 57149-57164 (2021) - [j13]Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl:
On strong Sidon sets of integers. J. Comb. Theory, Ser. A 183: 105490 (2021) - 2020
- [j12]Sang June Lee, Hanno Lefmann:
On the independence number of non-uniform uncrowded hypergraphs. Discret. Math. 343(9): 111964 (2020)
2010 – 2019
- 2019
- [j11]Sang June Lee, Mark H. Siggers, Norihide Tokushige:
AK-type stability theorems on cross t-intersecting families. Eur. J. Comb. 82 (2019) - 2018
- [j10]Jeong Han Kim, Sang June Lee, Joohan Na:
On the total variation distance between the binomial random graph and the random intersection graph. Random Struct. Algorithms 52(4): 662-679 (2018) - [j9]Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl:
Infinite Sidon Sets Contained in Sparse Random Sets of Integers. SIAM J. Discret. Math. 32(1): 410-449 (2018) - 2017
- [j8]Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. Discret. Appl. Math. 216: 627-645 (2017) - 2016
- [j7]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Comb. Probab. Comput. 25(1): 108-129 (2016) - [j6]Younjin Kim, Sangjune Lee, Sang-il Oum:
Dynamic coloring of graphs having no K5 minor. Discret. Appl. Math. 206: 81-89 (2016) - [j5]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory, Ser. A 142: 44-76 (2016) - 2015
- [j4]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms 46(1): 1-25 (2015) - 2014
- [j3]Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory, Ser. A 128: 207-249 (2014) - [j2]Jeong Han Kim, Sangjune Lee:
Universality of Random Graphs for Graphs of Maximum Degree Two. SIAM J. Discret. Math. 28(3): 1467-1478 (2014) - 2013
- [j1]Seog-Jin Kim, Sangjune Lee, Won-Jin Park:
Dynamic coloring and list dynamic coloring of planar graphs. Discret. Appl. Math. 161(13-14): 2207-2212 (2013) - 2011
- [c1]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl:
The maximum size of a Sidon set contained in a sparse random set of integers. SODA 2011: 159-171
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 2023-09-27 22:42 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:
