default search action
Younjin Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j17]Seonghyuk Im
, Jaehoon Kim, Younjin Kim, Hong Liu:
Crux, space constraints and subdivisions. J. Comb. Theory B 170: 82-127 (2025) - 2023
- [i1]Younjin Kim, Jihye Kwon, Hyang-Sook Lee:
On Ideal Secret-Sharing Schemes for k-homogeneous access structures. CoRR abs/2309.07479 (2023) - 2022
- [j16]Younjin Kim:
The Number of $k$-Dimensional Corner-Free Subsets of Grids. Electron. J. Comb. 29(2) (2022) - [j15]Martin Balko
Hypergraph Based Berge Hypergraphs. Graphs Comb. 38(1): 11 (2022) - 2020
- [j14]Jaehoon Kim, Younjin Kim, Hong Liu:
Tree decompositions of graphs without large bipartite holes. Random Struct. Algorithms 57(1): 150-168 (2020) - [j13]Kyung-Won Hwang, Younjin Kim, Naeem N. Sheikh:
An Erdős-Ko-Rado Type Theorem via the Polynomial Method. Symmetry 12(4): 640 (2020) - [c1]Younjin Kim, Kazutoshi Kato:
600-GHz Wave Generator Consisting of Arrayed Light Sources in Combination with Arrayed Photomixers. ECOC 2020: 1-3
2010 – 2019
- 2019
- [j12]Jaehoon Kim, Younjin Kim, Hong Liu
Two Conjectures in Ramsey-Turán Theory. SIAM J. Discret. Math. 33(1): 564-586 (2019) - 2017
- [j11]Dong Yeap Kang
On the Number of r-Matchings in a Tree. Electron. J. Comb. 24(1): 1 (2017) - [j10]Dong Yeap Kang
Sparse Spanning k-Connected Subgraphs in Tournaments. SIAM J. Discret. Math. 31(3): 2206-2227 (2017) - 2016
- [j9]Younjin Kim, Sangjune Lee, Sang-il Oum:
Dynamic coloring of graphs having no K5 minor. Discret. Appl. Math. 206: 81-89 (2016) - 2015
- [j8]Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy
Identifying codes and searching with balls in graphs. Discret. Appl. Math. 193: 39-47 (2015) - [j7]Kyung-Won Hwang, Younjin Kim:
A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials. Eur. J. Comb. 43: 289-294 (2015) - [j6]Dong Yeap Kang
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families. Eur. J. Comb. 47: 68-74 (2015) - 2013
- [j5]Zoltán Füredi, Younjin Kim:
The structure of the typical graphs of given diameter. Discret. Math. 313(2): 155-163 (2013) - [j4]Zoltán Füredi, Younjin Kim:
Cycle-Saturated Graphs with Minimum Number of Edges. J. Graph Theory 73(2): 203-215 (2013) - 2012
- [j3]János Barát
Large Bd-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26(1): 71-76 (2012) - 2011
- [j2]János Barát
Large Bd-free and union-free subfamilies. Electron. Notes Discret. Math. 38: 101-104 (2011) - [j1]Zoltán Füredi, Younjin Kim:
Minimum Ck-saturated graphs. Electron. Notes Discret. Math. 38: 505-510 (2011)
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-23 20:25 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: