default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeesung Shin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]JiSun Huh, Sangwook Kim, Seunghyun Seo, Heesung Shin:
Bijections on pattern avoiding inversion sequences and related objects. Adv. Appl. Math. 161: 102771 (2024)- 2023
- [j13]Seunghyun Seo, Heesung Shin
:
On Delannoy paths without peaks and valleys. Discret. Math. 346(7): 113399 (2023)
2010 – 2019
- 2017
- [j12]Sen-Peng Eu, Seunghyun Seo, Heesung Shin:
Enumerations of vertices among all rooted ordered trees with levels and degrees. Discret. Math. 340(9): 2123-2129 (2017) - 2016
- [j11]Heesung Shin, Jiang Zeng:
Symmetric unimodal expansions of excedances in colored permutations. Eur. J. Comb. 52: 174-196 (2016) - 2014
- [j10]Jang Soo Kim, Seunghyun Seo, Heesung Shin:
Annular noncrossing permutations and minimal transitive factorizations. J. Comb. Theory A 124: 251-262 (2014) - 2012
- [j9]Seunghyun Seo, Heesung Shin:
On the enumeration of rooted trees with fixed size of maximal decreasing trees. Discret. Math. 312(2): 419-426 (2012) - [j8]Heesung Shin, Jiang Zeng:
The symmetric and unimodal expansion of Eulerian polynomials via continued fractions. Eur. J. Comb. 33(2): 111-127 (2012) - 2011
- [j7]Sohyun Hwang, Sangwoo Kim, Heesung Shin, Doheon Lee:
Context-dependent transcriptional regulations between signal transduction pathways. BMC Bioinform. 12: 19 (2011) - [j6]Yoann Gelineau, Heesung Shin, Jiang Zeng:
Bijections for Entringer families. Eur. J. Comb. 32(1): 100-115 (2011) - [j5]Heesung Shin, Jiang Zeng:
A bijective enumeration of labeled trees with given indegree sequence. J. Comb. Theory A 118(1): 115-128 (2011) - 2010
- [j4]Heesung Shin, Jiang Zeng:
An involution for symmetry of hook length and part length of pointed partitions. Discret. Math. 310(10-11): 1633-1639 (2010) - [j3]Heesung Shin, Jiang Zeng:
The q-tangent and q-secant numbers via continued fractions. Eur. J. Comb. 31(7): 1689-1705 (2010)
2000 – 2009
- 2007
- [j2]Seunghyun Seo, Heesung Shin:
A generalized enumeration of labeled trees and reverse Prüfer algorithm. J. Comb. Theory A 114(7): 1357-1361 (2007) - 2004
- [j1]Manwon Cho, Dongsu Kim, Seunghyun Seo, Heesung Shin:
Colored Prüfer Codes for k-Edge Colored Trees. Electron. J. Comb. 11(1) (2004)
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-09-28 01:30 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:
