![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hsiang-Chun Hsu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j11]Hong-Bin Chen, Hsiang-Chun Hsu, Cang-Wei Huang, Justie Su-Tzu Juan:
An easy-to-implement construction for (k,n)-threshold progressive visual secret sharing schemes. J. Inf. Secur. Appl. 83: 103757 (2024) - 2023
- [j10]Yen-Jen Cheng, Sen-Peng Eu
, Hsiang-Chun Hsu:
Statistics of partial permutations via Catalan matrices. Adv. Appl. Math. 143: 102451 (2023) - 2020
- [j9]Sen-Peng Eu
, Tung-Shan Fu
, Hsiang-Chun Hsu, Hsin-Chieh Liao
, Wei-Liang Sun
:
Signed mahonian identities on permutations with subsequence restrictions. J. Comb. Theory A 170 (2020) - 2018
- [j8]Sen-Peng Eu
, Tung-Shan Fu
, Hsiang-Chun Hsu, Hsin-Chieh Liao
:
Signed countings of types B and D permutations and t, q-Euler numbers. Adv. Appl. Math. 97: 1-26 (2018) - [j7]Sen-Peng Eu
, Tung-Shan Fu, Hsiang-Chun Hsu, Yu-Pei Huang:
Fixed Points of the Evacuation of Maximal Chains on Fuss Shapes. Electron. J. Comb. 25(1): 1 (2018) - [j6]Sen-Peng Eu
, Tung-Shan Fu
, Hsiang-Chun Hsu:
A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets. Graphs Comb. 34(2): 373-381 (2018) - 2016
- [j5]Hsiang-Chun Hsu, Gerard Jennhwa Chang
:
Max-Coloring of Vertex-Weighted Graphs. Graphs Comb. 32(1): 191-198 (2016) - 2014
- [j4]Hsiang-Chun Hsu, Gerard Jennhwa Chang
:
Graphs with small balanced decomposition numbers. J. Comb. Optim. 28(2): 505-510 (2014) - 2012
- [j3]Hsiang-Chun Hsu, Gerard Jennhwa Chang
:
Balanced k-decompositions of graphs. Discret. Appl. Math. 160(10-11): 1639-1642 (2012) - [j2]Gerard Jennhwa Chang
, Hsiang-Chun Hsu:
First-fit chromatic numbers of d-degenerate graphs. Discret. Math. 312(12-13): 2088-2090 (2012) - [j1]Hsiang-Chun Hsu, Gerard J. Chang
:
Parity and strong parity edge-colorings of graphs. J. Comb. Optim. 24(4): 427-436 (2012)
Conference and Workshop Papers
- 2016
- [c2]Liang-Hao Huang, Hsiang-Chun Hsu, Shan-Hsiang Shen, De-Nian Yang
, Wen-Tsuen Chen:
Multicast traffic engineering for software-defined networks. INFOCOM 2016: 1-9 - 2015
- [c1]Hong-Han Shuai
, Chih-Ya Shen, Hsiang-Chun Hsu, De-Nian Yang
, Chung-Kuang Chou
, Jihg-Hong Lin, Ming-Syan Chen
:
Revenue maximization for telecommunications company with social viral marketing. IEEE BigData 2015: 1306-1310
Informal and Other Publications
- 2020
- [i2]Hong-Bin Chen, Hsiang-Chun Hsu, Justie Su-Tzu Juan:
An Easy-to-implement Construction for (k, n)-threshold Progressive Visual Secret Sharing Schemes. CoRR abs/2002.09125 (2020) - 2015
- [i1]Shan-Hsiang Shen, Liang-Hao Huang, Hsiang-Chun Hsu, De-Nian Yang, Wen-Tsuen Chen:
Multi-Tree Multicast Traffic Engineering for Software-Defined Networks. CoRR abs/1507.08728 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-11 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint