Selected Publications of Hsueh-I Lu
Updated in September 2021
Selected Journal Publications
1. Hou-Teng Cheong and Hsueh-I Lu, Finding a Shortest Even Hole in Polynomial Time, Journal of Graph Theory, 2021 to appear. PDF
2. Hung-Chun Liang and Hsueh-I Lu, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths, SIAM Journal on Discrete Mathematics, 31(1):454–476, 2017. PDF 3. Hsien-Chih Chang and Hsueh-I Lu, A Faster Algorithm to Recognize Even-hole-free Graphs, Jour-
nal of Combinatorial Theory, Series B, 113:141-161, 2015. PDF
4. Hsueh-I Lu, Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits, SIAM Journal on Computing, 43(2):477–496, 2014. PDF
5. Cheng-Wei Lee and Hsueh-I Lu, Replacement Paths via Row Minima of Concise Matrices, SIAM Journal on Discrete Mathematics, 28(1):206–225, 2014. PDF
6. Hsien-Chih Chang and Hsueh-I Lu, Computing the Girth of a Planar Graph in Linear Time, SIAM Journal on Computing 42(3):1077–1094, 2013. PDF
7. Hsueh-I Lu, Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees, SIAM Journal on Discrete Mathematics 23(4):2079–2092, 2010. PDF
8. Chia-Chi Yeh and Hsueh-I Lu, Balanced Parentheses Strike Back, ACM Transactions on Algorithms, 4(3):28.1–13, 2008. PDF
9. Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu, Orderly Spanning Trees with Applications, SIAM Journal on Computing, 34(4):924–945, 2005. PDF
10. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu, Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications, Journal of Computer and System Sciences, 70(2):128–144, 2005. PDF
11. Kai-min Chung and Hsueh-I Lu, An Optimal Algorithm for the Maximum-Density Segment Prob- lem, SIAM Journal on Computing 34(2):373–387, 2004. PDF
12. Ching-Chi Lin, Hsueh-I Lu, and I-Fan Sun, Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer, SIAM Journal on Discrete Math, 18(1):19–29, 2004. PDF
13. Chien-Chih Liao, Hsueh-I Lu, and Hsu-Chun Yen, Compact Floor-Planning via Orderly Spanning Trees, Journal of Algorithms, 48(2):441–451, 2003. PDF
14. Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, I. P. Hsu, and J.-Y. Chen, Design Theory and Im- plementation for Low-Power Segmented Bus Systems, ACM Transactions on Design Automation of Electronic Systems, 8(1):38–54, 2003. PDF
1
15. Xin He, Ming-Yang Kao, and Hsueh-I Lu, A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs, SIAM Journal on Computing, 30(3):838-846, 2000. PDF
16. Xin He, Ming-Yang Kao, and Hsueh-I Lu, Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings, SIAM Journal on Discrete Math, 12(3):317–325, 1999. PDF
17. J.-Y. Chen, Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, and Tien-Fu Chen, Segmented Bus De- sign for Low-Power Systems, IEEE Transactions on VLSI Systems, 7(1):25–29, 1999. PDF
18. Hsueh-I Lu and R. Ravi, Approximating Maximum-Leaf Spanning Trees in Almost Linear Time, Journal of Algorithms, 29(1):132–141, 1998. PDF
19. H. E. L ¨u and Patrick S.P. Wang, A Comment on “A Fast Parallel Algorithm for Thinning Digital Patterns”, Communications of the ACM, 29(3):239–242, 1986. PDF
Selected Conference Publications
1. Kai-Yuan Lai, Hsueh-I Lu, and Mikkel Thorup, Three-in-a-Tree in Near Linear Time, in Proceedings of the 52nd Annual ACM Symposium on the Theory of Computing, Chicago, Illinois, USA, June 22-26, 2020, pages 12791292. PDF
2. Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, and Hsueh-I Lu, Compact En- codings of Planar Graphs via Canonical Orderings and Multiple Parentheses, in Proceedings of the 25th International Colloquium on Automata, Languages and Programming, Aalborg, Denmark, July 13–17, 1998, LNCS 1443, pages 118–129, 1998. PDF
3. Philip N. Klein and Hsueh-I Lu, Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22–24, 1996, pages 338–347, 1996.
2
