Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Sheng-Chyang Liaw

dblp:31/6256 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 since 2021Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 100%
Computer networks
1 paper
Routing and switching · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network
multistage interconnection network		 0.022003
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability · IEEE Trans. Commun. 2003
On nonblocking multicast three-stage Clos networks · IEEE/ACM Trans. Netw. 2000
Interconnection networks and networks-on-chip › multicast
multicast network		 0.012003
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability · IEEE Trans. Commun. 2003
Interconnection networks and networks-on-chip
nonblocking networks		 0.012003
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability · IEEE Trans. Commun. 2003
Interconnection networks and networks-on-chip › nonblocking networks
strictly nonblocking networks		 0.012003
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability · IEEE Trans. Commun. 2003
Routing and switching › switching networks › multistage interconnection network
clos network		 0.012000
On nonblocking multicast three-stage Clos networks · IEEE/ACM Trans. Netw. 2000
Routing and switching › switching networks
multicast switching		 0.012000
On nonblocking multicast three-stage Clos networks · IEEE/ACM Trans. Netw. 2000
Routing and switching › switching networks
nonblocking conditions		 0.012000
On nonblocking multicast three-stage Clos networks · IEEE/ACM Trans. Netw. 2000
Routing and switching
switching networks		 0.012000
On nonblocking multicast three-stage Clos networks · IEEE/ACM Trans. Netw. 2000

Methods — techniques the papers use, named apart from their topics

combinatorial analysis · 0.1
YearPublicationVenuePosition
2023 [1,2]-dimension of graphs
Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Yi-Xuan Lin
 Discret. Appl. Math.4
2022 Transferable domination number of graphs
Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Zhishi Pan
 Discret. Appl. Math.5
2021 L(p, q)-labelings of subdivisions of graphs
Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Sheng-Chyang Liaw
 Discret. Appl. Math.5
2016 All-to-all broadcast problems on Cartesian product graphs
Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Jen-Chun Ling
 Theor. Comput. Sci.4
2007 Distance-two labelings of digraphs
Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw
 Discret. Appl. Math.4
2003 Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability
abstract
F.K. Hwang and S.C. Liaw (see IEEE/ACM Trans. Networking, vol.8, p.535-9, 2000) introduced a new nonblocking requirement for 2-cast traffic which imposes different requirements on different types of coexisting calls. The requirement is strictly nonblocking for point-to-point calls among the 2-cast traffic, and is rearrangeable for genuine 2-cast calls. We generalize the 2-cast calls to multicast calls and give a sufficient condition for such networks when the number of multicast calls is upper bounded.
Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong
 IEEE Trans. Commun.2
2002 k-Subdomination in graphs
Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
 Discret. Appl. Math.2
2000 On nonblocking multicast three-stage Clos networks
abstract
We give necessary and sufficient conditions for strictly nonblocking three-stage Clos (1953) networks with two types of multicast traffic. Then, we extend the results to other models where the routing is under certain restrictions. Finally, we compare our results with existing literature to mark the differences and similarities.
Frank K. Hwang, Sheng-Chyang Liaw
 IEEE/ACM Trans. Netw.2