default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWoong Kook
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Woong Kook, Kang-Ju Lee:
Simplicial Kirchhoff index of random complexes. Adv. Appl. Math. 159: 102733 (2024)- 2023
- [i1]Chankyu Joung, Mijin Kim, Taejin Paik, Seong-Ho Kong, Seung-Young Oh, Won Kyeong Jeon, Jae-hu Jeon, Joong-Sik Hong, Wan-Joong Kim, Woong Kook, Myung-Jin Cha, Otto van Koert:
An Arrhythmia Classification-Guided Segmentation Model for Electrocardiogram Delineation. CoRR abs/2304.06237 (2023)
2010 – 2019
- 2019
- [j15]Hyung Sun Kim, Changwoo Yi, Yongkang Kim, Uhnmee Park, Woong Kook, Bermseok Oh, Hyuk Kim, Taesung Park:
Topological data analysis can extract sub-groups with high incidence rates of Type 2 diabetes. Int. J. Data Min. Bioinform. 22(1): 44-60 (2019) - 2018
- [j14]Woong Kook
, Kang-Ju Lee:
Simplicial networks and effective resistance. Adv. Appl. Math. 100: 71-86 (2018) - [j13]Woong Kook, Kang-Ju Lee:
Möbius coinvariants and bipartite edge-rooted forests. Eur. J. Comb. 71: 180-193 (2018) - [j12]Ghodratollah Aalipour, Art M. Duval, Woong Kook, Kang-Ju Lee, Jeremy L. Martin:
A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes. J. Comb. Theory A 158: 362-386 (2018) - [c2]Hyung Sun Kim, Changwoo Yi, Yongkang Kim, Uhnmee Park, Woong Kook, Hyuk Kim, Taesung Park:
Topological data analysis can extract subgroups with high incidence rates of Type 2 diabetes. BIBM 2018: 1758 - 2016
- [j11]Woong Kook, Kang-Ju Lee:
A formula for simplicial tree-numbers of matroid complexes. Eur. J. Comb. 53: 59-65 (2016) - 2014
- [j10]Hyuk Kim, Woong Kook:
Logarithmic Tree-Numbers for Acyclic Complexes. Electron. J. Comb. 21(1): 1 (2014) - [j9]Seung Kyoon Shin, Woong Kook:
Can knowledge be more accessible in a virtual network?: Collective dynamics of knowledge transfer in a virtual knowledge organization network. Decis. Support Syst. 59: 180-189 (2014) - 2012
- [j8]Woong Kook:
A multicomplex of partially edge-rooted forests. Eur. J. Comb. 33(4): 505-509 (2012) - 2011
- [j7]Woong Kook:
Combinatorial Green's function of a graph and applications to networks. Adv. Appl. Math. 46(1-4): 417-423 (2011) - [j6]Woong Kook:
The h-vector of coned graphs. Appl. Math. Lett. 24(4): 528-532 (2011) - 2010
- [c1]Seung Kyoon Shin, Woong Kook:
Knowledge Transfer in a Multiple Virtual Communities Network. HICSS 2010: 1-10
2000 – 2009
- 2007
- [j5]Woong Kook:
Edge-rooted forests and the alpha-invariant of cone graphs. Discret. Appl. Math. 155(8): 1071-1075 (2007) - [j4]Woong Kook:
The homology of the cycle matroid of a coned graph. Eur. J. Comb. 28(3): 734-741 (2007) - 2005
- [j3]Woong Kook:
A new formula for an evaluation of the Tutte polynomial of a matroid. Discret. Math. 300(1-3): 235-238 (2005) - 2004
- [j2]Woong Kook:
Recurrence relations for the spectrum polynomial of a matroid. Discret. Appl. Math. 143(1-3): 312-317 (2004)
1990 – 1999
- 1999
- [j1]Woong Kook, Victor Reiner, Dennis Stanton:
A Convolution Formula for the Tutte Polynomial. J. Comb. Theory B 76(2): 297-300 (1999)
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 2025-01-20 23:01 CET 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:
