default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYunsun Nam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j11]Toshiaki Katayama, Mark D. Wilkinson
, Rutger A. Vos, Takeshi Kawashima, Shuichi Kawashima, Mitsuteru Nakao, Yasunori Yamamoto, Hong-Woo Chun, Atsuko Yamaguchi, Shin Kawano, Jan Aerts, Kiyoko F. Aoki-Kinoshita, Kazuharu Arakawa, Bruno Aranda, Raoul Jean Pierre Bonnal, José María Fernández, Takatomo Fujisawa, Paul M. K. Gordon, Naohisa Goto, Syed Haider, Todd W. Harris, Takashi Hatakeyama, Isaac Ho, Masumi Itoh, Arek Kasprzyk, Nobuhiro Kido, Young-Joo Kim, Akira R. Kinjo, Fumikazu Konishi, Yulia Kovarskaya, Gregory Von Kuster, Alberto Labarga, Vachiranee Limviphuvadh, E. Luke McCarthy, Yasukazu Nakamura, Yunsun Nam, Kozo Nishida, Kunihiro Nishimura, Tatsuya Nishizawa, Soichi Ogishima, Tom Oinn, Shinobu Okamoto, Shujiro Okuda, Keiichiro Ono, Kazuki Oshita, Keun-Joon Park, Nicholas H. Putnam, Martin Senger, Jessica Severin, Yasumasa Shigemoto, Hideaki Sugawara, James Taylor, Oswaldo Trelles, Chisato Yamasaki, Riu Yamashita, Noriyuki Satoh, Toshihisa Takagi:
The 2nd DBCLS BioHackathon: interoperable bioinformatics Web services for integrated applications. J. Biomed. Semant. 2: 4 (2011)- 2010
- [j10]Yunsun Nam:
Binding Numbers and Connected Factors. Graphs Comb. 26(6): 805-813 (2010)
2000 – 2009
- 2007
- [j9]Yunsun Nam:
Ore-type condition for the existence of connected factors. J. Graph Theory 56(3): 241-248 (2007) - 2005
- [j8]Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
On The Trees Whose 2-Step Competition Numbers Are Two. Ars Comb. 77 (2005) - 2002
- [j7]Ilwon Kang, Suh-Ryung Kim, Yangmi Shin, Yunsun Nam:
Graphs satisfying inequality Theta(G2)leq Theta(G). Discret. Math. 250(1-3): 259-264 (2002) - [j6]Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss:
Connected (g, f)-factors. J. Graph Theory 39(1): 62-75 (2002) - 2001
- [j5]David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam:
Two families of graphs that are not CCE-orientable. Ars Comb. 58 (2001) - 2000
- [j4]Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
The m-step competition graph of a digraph. Discret. Appl. Math. 105(1-3): 115-127 (2000)
1990 – 1999
- 1999
- [j3]Yunsun Nam:
Integral Matrices with Given Row and Column Sums. Ars Comb. 52 (1999) - [j2]Richard P. Anstee, Yunsun Nam:
Convexity of degree sequences. J. Graph Theory 30(2): 147-156 (1999) - 1998
- [j1]Richard P. Anstee, Yunsun Nam:
More sufficient conditions for a graph to have factors. Discret. Math. 184(1-3): 15-24 (1998)
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-05-08 21:47 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:
