default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJia Jie Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Yun-Hao Zou, Jia Jie Liu
, Shun-Chieh Chang, Chiun-Chieh Hsu:
The co-secure domination in proper interval graphs. Discret. Appl. Math. 311: 68-71 (2022)
2010 – 2019
- 2019
- [j18]Yun-Hao Zou, Jia Jie Liu, Chiun-Chieh Hsu, Yue-Li Wang:
A simple algorithm for secure domination in proper interval graphs. Discret. Appl. Math. 260: 289-293 (2019) - 2017
- [j17]Jia Jie Liu, Shun-Chieh Chang, Chiou-Jiun Lin:
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs. Theory Comput. Syst. 61(3): 893-906 (2017) - 2016
- [j16]Jia Jie Liu, Cheng-Ju Hsu, Chien-Hung Lin:
Computing Global Secure Set on Trees. Comput. J. 59(5): 616-629 (2016) - [j15]Shun-Chieh Chang, Jia Jie Liu, Yue-Li Wang:
The Outer-connected Domination Number of Sierpiński-like Graphs. Theory Comput. Syst. 58(2): 345-356 (2016) - [j14]Shun-Chieh Chang, William Chung-Kung Yen, Yue-Li Wang, Jia Jie Liu:
The connected p-median problem on block graphs. Optim. Lett. 10(6): 1191-1201 (2016) - 2015
- [j13]Chih-En Kuo, Yue-Li Wang, Jia Jie Liu, Ming-Tat Ko:
Resequencing a Set of Strings Based on a Target String. Algorithmica 72(2): 430-449 (2015) - [j12]Jia Jie Liu, Yue-Li Wang, Yu-shan Chiu:
Constrained Longest Common Subsequences with Run-Length-Encoded Strings. Comput. J. 58(5): 1074-1084 (2015) - [j11]Chiou-Jiun Lin, Jia Jie Liu, Yue-Li Wang:
Finding outer-connected dominating sets in interval graphs. Inf. Process. Lett. 115(12): 917-922 (2015) - [j10]Jia Jie Liu, Cindy Tzu-Hsin Wang, Yue-Li Wang, William Chung-Kung Yen:
The hub number of co-comparability graphs. Theor. Comput. Sci. 570: 15-21 (2015) - 2014
- [j9]Wen-Yin Huang, Jia Jie Liu, Jou-Ming Chang, Ro-Yu Wu:
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1187-1191 (2014) - [j8]Jia Jie Liu, Yue-Li Wang:
Hamiltonian cycles in hypercubes with faulty edges. Inf. Sci. 256: 225-233 (2014) - [c2]Shun-Chieh Chang, Jia Jie Liu, Yue-Li Wang:
The Weighted Independent Domination Problem in Series-Parallel Graphs. ICS 2014: 77-84 - 2013
- [j7]Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang:
Global Strong Defensive Alliances of Sierpiński-Like Graphs. Theory Comput. Syst. 53(3): 365-385 (2013) - 2012
- [j6]Yue-Li Wang, Cheng-Ju Hsu, Jia Jie Liu, Ming-Tat Ko, Fu-Hsing Wang:
A New Subclass of Integer Linear Programming Problems and Its Applications. IEEE Trans. Computers 61(12): 1813-1822 (2012) - 2011
- [j5]Yen-Ju Chen, Jia Jie Liu, Yue-Li Wang:
An Optimal Rotation Distance Set. Comput. J. 54(5): 824-830 (2011) - [j4]Jia Jie Liu, William Chung-Kung Yen, Yen-Ju Chen:
An Optimal Algorithm for Untangling Binary Trees via Rotations. Comput. J. 54(11): 1838-1844 (2011) - [j3]Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen:
The Hub Number of Sierpiński-Like Graphs. Theory Comput. Syst. 49(3): 588-600 (2011)
2000 – 2009
- 2008
- [j2]Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee:
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complex. 24(2): 173-184 (2008) - [c1]Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang:
Sequence Alignment Algorithms for Run-Length-Encoded Strings. COCOON 2008: 319-330 - 2007
- [j1]Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee:
Edit distance for a run-length-encoded string and an uncompressed string. Inf. Process. Lett. 105(1): 12-16 (2007)
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-24 22:56 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:
