公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2012 | A faster algorithm to recognize even-hole-free graphs. | Chang, Hsien-Chih; HSUEH-I LU | Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 | | | |
2022 | Finding a shortest even hole in polynomial time | Cheong H.-T; HSUEH-I LU | Journal of Graph Theory | | | |
2007 | Flow Time Minimization under Energy Constraints | Chen, Jian-Jia; Iwama, Kazuo; Kuo, Tei-Wei ; HSUEH-I LU ; TEI-WEI KUO | Asia and South Pacific Design Automation Conference | 0 | 0 | |
2006 | Game Theory at Grace Baptist Church 伍 | Lu, Hsueh-I ; 呂學一 | | | | |
2006 | Game Theory at Grace Baptist Church 參 | Lu, Hsueh-I ; 呂學一 | | | | |
2006 | Game Theory at Grace Baptist Church 壹 | Lu, Hsueh-I ; 呂學一 | | | | |
2006 | Game Theory at Grace Baptist Church 貳 | Lu, Hsueh-I ; 呂學一 | | | | |
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 | |
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, Proceedings | | | |
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 | |