dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Jia Jie Liu Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJia 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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYen-Ju Chen, Jia Jie Liu, Yue-Li Wang: An Optimal Rotation Distance Set. Comput. J. 54(5): 824-830 (2011)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChien-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)
2008
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuan-Shieng Huang, Jia Jie Liu, Yue-Li Wang: Sequence Alignment Algorithms for Run-Length-Encoded Strings. COCOON 2008: 319-330
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJia 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. Complexity 24(2): 173-184 (2008)
2007
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJia 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

1Yen-Ju Chen [5] [6]
2Guan-Shieng Huang [1] [3]
3Richard C. T. Lee (Richard Chia-Tung Lee) [1] [2]
4Chien-Hung Lin [4]
5Yue-Li Wang [1] [2] [3] [4] [5]
6William Chung-Kung Yen [4] [6]

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page