公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2004 | Image set compression through minimal-cost prediction structures. | Chen, Chia-Ping; Chen, Chu-Song; Chung, Kuo-Liang; Lu, Hsueh-I; Tang, Gregory Y.; HSUEH-I LU | Proceedings of the 2004 International Conference on Image Processing, ICIP 2004, Singapore, October 24-27, 2004 | | | |
2010 | Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees | Lu, Hsueh-I | SIAM Journal on Discrete Mathematics | 2 | 3 | |
2002 | Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. | HSUEH-I LU | Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings | | | |
2003 | Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. | Lin, Ching-Chi; Sun, I-Fan; HSUEH-I LU | STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings | 0 | 0 | |
2004 | Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer | Lin, C.-C.; Lu, Hsueh-I ; Sun, I-F. | SIAM Journal on Discrete Mathematics | 28 | 21 | |
2005 | Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications | Goldwasser, Michael H.; Kao, Ming-Yang; Lu, Hsueh-I | Journal of Computer and System Sciences | 35 | 29 | |
2006 | Linear-time algorithms for tree root problems | Chang, Maw-Shang; Ko, Ming-Tat; HSUEH-I LU | Algorithm Theory - Swat 2006, Proceedings | | | |
2015 | Linear-Time Algorithms for Tree Root Problems | Chang, M.-S.; Ko, M.-T.; HSUEH-I LU | Algorithmica | | | |
2006 | Linear-Time Algorithms for Tree Root Problems. | Chang, Maw-Shang; Ko, Ming-Tat; HSUEH-I LU | Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings | | | |
2002 | Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. | HSUEH-I LU | Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA. | | | |
1999 | Linear-time succinct encodings of planar graphs via canonical orderings | He, X.; Kao, M.-Y.; HSUEH-I LU | SIAM Journal on Discrete Mathematics | | | |
2014 | LineCP-time compression of bounded-genus graphs into information- theoretically optimal number of bits | HSUEH-I LU | SIAM Journal on Computing | 0 | 0 | |
2017 | Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths | Liang, H.-C.; HSUEH-I LU | SIAM Journal on Discrete Mathematics | 3 | 2 | |
2010 | Minimum cycle bases of weighted outerplanar graphs | TSUNG-HAO LIU ; HSUEH-I LU | Information Processing Letters | 3 | 1 | |
2009 | Minimum cycle bases of weighted outerplanar graphs | TSUNG-HAO LIU ; HSUEH-I LU | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 1 | 0 | |
2000 | Multicast routing with multiple QoS constraints in ATM networks | Wu, J.-J.; Hwang, R.-H.; HSUEH-I LU | Information sciences | | | |
2000 | On Maximum Symmetric Subgraphs. | Chen, Ho-Lin; Lu, Hsueh-I; HSU-CHUN YEN ; HSUEH-I LU | Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings | | | |
2004 | An optimal algorithm for identifying a maximum-density segment | 呂學一 | | | | |
2003 | An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract. | Fan, Tsai-Hung; Lee, Shufen; Lu, Hsueh-I; Tsou, Tsung-Shan; Wang, Tsai-Cheng; Yao, Adam; HSUEH-I LU | Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings | | | |
2005 | An Optimal Algorithm for Online Square Detection | Chen, Gen-Huey ; Hong, Jin-Ju; Lu, Hsueh-I | | | | |