default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKuo-Hui Tsai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c9]Haw-Yun Shin, Fu-Min Hsu, Kuo-Hui Tsai, Mao-Hsu Yen:
Access popularity based wireless broadcasting mechanism. ICMLC 2014: 65-70- 2012
- [j7]Wen-Jer Chang, Yu-Teh Meng, Kuo-Hui Tsai:
AQM router design for TCP network via input constrained fuzzy control of time-delay affine Takagi-Sugeno fuzzy models. Int. J. Syst. Sci. 43(12): 2297-2313 (2012)
2000 – 2009
- 2005
- [j6]Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005) - 2001
- [j5]Kuo-Hui Tsai, Da-Wei Wang, Frank K. Hwang:
Lower bounds for wide-sense nonblocking Clos network. Theor. Comput. Sci. 261(2): 323-328 (2001) - 2000
- [c8]Maw-Sheng Horng, Kuo-Hui Tsai, Jin-Long Wang, Hsuan-Shih Lee:
Identification of fuzzy system based on gray relation. SMC 2000: 3400-3404
1990 – 1999
- 1999
- [c7]Kuo-Hui Tsai, Tompson, Janusz Rajski, Malgorzata Marek-Sadowska:
STAR-ATPG: a high speed test pattern generator for large scan designs. ITC 1999: 1021-1030 - 1998
- [c6]Kuo-Hui Tsai, Da-Wei Wang:
Lower Bounds for Wide-Sense Non-blocking Clos Network. COCOON 1998: 213-218 - 1997
- [j4]Kuo-Hui Tsai, D. T. Lee:
k Best Cuts for Circular-Arc Graphs. Algorithmica 18(2): 198-216 (1997) - [j3]Jan-Ming Ho, De-Ron Liang, Kuo-Hui Tsai:
On Multicast Routing in Clos Networks. J. Inf. Sci. Eng. 13(3): 417-429 (1997) - [c5]Kuo-Hui Tsai, Da-Wei Wang:
Optimal Algorithms for Circle Partitioning. COCOON 1997: 304-310 - 1996
- [c4]Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30 - [c3]Jan-Ming Ho, De-Ron Liang, Kuo-Hui Tsai:
On multicast routing in Clos networks. ISPAN 1996: 394-400 - 1994
- [c2]Kuo-Hui Tsai, D. T. Lee:
k-Best Cuts for Circular-Arc Graphs. ISAAC 1994: 550-558 - 1993
- [j2]Kuo-Hui Tsai, Wen-Lian Hsu:
Fast Algorithms for the Dominating Set Problem on Permutation Graphs. Algorithmica 9(6): 601-614 (1993) - 1991
- [j1]Wen-Lian Hsu, Kuo-Hui Tsai:
Linear Time Algorithms on Circular-Arc Graphs. Inf. Process. Lett. 40(3): 123-129 (1991) - 1990
- [c1]Kuo-Hui Tsai, Wen-Lian Hsu:
Fast Algorithms for the Dominating Set Problem on Permutation Graphs. SIGAL International Symposium on Algorithms 1990: 109-117
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-04-25 05:43 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:
