default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Kuo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Jing-Ho Yan:
n-fold L(2, 1)-labelings of Cartesian product of paths and cycles. J. Comb. Optim. 47(3): 48 (2024)- 2023
- [j28]Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Yi-Xuan Lin:
[1,2]-dimension of graphs. Discret. Appl. Math. 337: 232-245 (2023) - 2022
- [j27]Fei-Huang Chang, Ma-Lian Chia, David Kuo, Wen Deng, Sheng-Chyang Liaw, Zhishi Pan:
Transferable domination number of graphs. Discret. Appl. Math. 313: 135-146 (2022) - 2021
- [j26]Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Sheng-Chyang Liaw:
L(p, q)-labelings of subdivisions of graphs. Discret. Appl. Math. 291: 264-270 (2021)
2010 – 2019
- 2017
- [j25]Yi Zhong, Theofanis Karaletsos, Philipp Drewe, Vipin T. Sreedharan, David Kuo
, Kamini Singh, Hans-Guido Wendel, Gunnar Rätsch:
RiboDiff: detecting changes of mRNA translation efficiency from ribosome footprints. Bioinform. 33(1): 139-141 (2017) - 2016
- [j24]Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Jen-Chun Ling:
All-to-all broadcast problems on Cartesian product graphs. Theor. Comput. Sci. 609: 262-271 (2016) - 2015
- [j23]Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Meng-Hsuan Tsai:
L(2, 1)-labelings of subdivisions of graphs. Discret. Math. 338(2): 248-255 (2015) - 2014
- [j22]Fei-Huang Chang, Young-Ming Chen, Ma-Lian Chia, David Kuo, Ming-fen Yu:
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model. Discret. Appl. Math. 173: 28-34 (2014) - [j21]Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan:
Bandwidth sums of block graphs and cacti. J. Comb. Optim. 27(4): 679-687 (2014) - [j20]Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw, Jing-Ho Yan:
F3-domination problem of graphs. J. Comb. Optim. 28(2): 400-413 (2014) - 2013
- [j19]Gerard Jennhwa Chang, Chan-Wei Chang, David Kuo, Sheung-Hung Poon:
Algorithmic aspect of stratified domination in graphs. Inf. Process. Lett. 113(22-24): 861-865 (2013) - [j18]Ma-Lian Chia, David Kuo, Jing-Ho Yan, Siou-Ru Yang:
(p, q)-total labeling of complete graphs. J. Comb. Optim. 25(4): 543-561 (2013) - 2012
- [j17]Chan-Wei Chang, Ma-Lian Chia, Cheng-Ju Hsu, David Kuo, Li-Ling Lai, Fu-Hsing Wang:
Global defensive alliances of trees and Cartesian product of paths and cycles. Discret. Appl. Math. 160(4-5): 479-487 (2012) - [j16]Ma-Lian Chia, Huei-Ni Hsu, David Kuo, Sheng-Chyang Liaw, Zi-teng Xu:
The game L(d, 1)-labeling problem of graphs. Discret. Math. 312(20): 3037-3045 (2012) - 2011
- [j15]David Kuo, Daniel Wong, Jerry Gao, Lee Chang:
A 2D Barcode Validation System for Mobile Commerce. Int. J. Handheld Comput. Res. 2(2): 1-19 (2011) - 2010
- [j14]Chan-Wei Chang, David Kuo, Hsing-Ching Lin:
Ranking numbers of graphs. Inf. Process. Lett. 110(16): 711-716 (2010) - [c2]David Kuo, Daniel Wong, Jerry Gao, Lee Chang:
A 2D Barcode Validation System for Mobile Commerce. GPC 2010: 150-161
2000 – 2009
- 2009
- [j13]Yi-Ting Chen, Ma-Lian Chia, David Kuo:
L(p, q)-labeling of digraphs. Discret. Appl. Math. 157(8): 1750-1759 (2009) - 2008
- [j12]David Kuo, Jing-Ho Yan:
The profile of the Cartesian product of graphs. Discret. Appl. Math. 156(15): 2835-2845 (2008) - [j11]Hsun-Wen Chang, Huang-Wei Chou, David Kuo, Chun-Liang Lin:
Labeling graphs with two distance constraints. Discret. Math. 308(23): 5645-5655 (2008) - 2007
- [j10]Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw:
Distance-two labelings of digraphs. Discret. Appl. Math. 155(8): 1007-1013 (2007) - [j9]Ma-Lian Chia, David Kuo, Mei-Feng Tung:
The multiple originator broadcasting problem in graphs. Discret. Appl. Math. 155(10): 1188-1199 (2007) - 2005
- [j8]Mei-Ju Chen, David Kuo, Jing-Ho Yan:
The bandwidth sum of join and composition of graphs. Discret. Math. 290(2/3): 145-163 (2005) - [c1]Francisco H. Imai, David Kuo, Ricardo J. Motta:
Design of a Framework for HDR Sequence Rendering Evaluation. CIC 2005: 14-19 - 2004
- [j7]David Kuo, Jing-Ho Yan:
On L(2, 1)-labelings of Cartesian products of paths and cycles. Discret. Math. 283(1-3): 137-144 (2004) - 2000
- [j6]Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh:
On L(d, 1)-labelings of graphs. Discret. Math. 220(1-3): 57-66 (2000)
1990 – 1999
- 1999
- [j5]Sheng-Chyang Liaw, David Kuo, Gerard J. Chang:
Integral Sum Numbers of Graphs. Ars Comb. 54 (1999) - 1997
- [j4]David Kuo, Gerard J. Chang, Y. H. Harris Kwong:
Cordial labeling of mKn. Discret. Math. 169(1-3): 121-131 (1997) - [j3]Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. J. Graph Theory 26(2): 111-117 (1997) - 1996
- [j2]Gerard J. Chang, David Kuo:
The L(2, 1)-Labeling Problem on Graphs. SIAM J. Discret. Math. 9(2): 309-316 (1996) - 1994
- [j1]David Kuo, Gerard J. Chang:
The Profile Minimization Problem in Trees. SIAM J. Comput. 23(1): 71-81 (1994)
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:54 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:
