| 2022 | STACS | Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. | Yung-Chung Chiu, Hsueh-I Lu |
| 2020 | STOC | Three-in-a-tree in near linear time. | Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup |
| 2012 | ISAAC | Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. | Ching-Chen Kuo, Hsueh-I Lu |
| 2012 | SODA | A faster algorithm to recognize even-hole-free graphs. | Hsien-Chih Chang, Hsueh-I Lu |
| 2011 | COCOON | Computing the Girth of a Planar Graph in Linear Time. | Hsien-Chih Chang, Hsueh-I Lu |
| 2009 | ISAAC | An Optimal Labeling for Node Connectivity. | Tai-Hsin Hsu, Hsueh-I Lu |
| 2009 | ISAAC | Minimum Cycle Bases of Weighted Outerplanar Graphs. | Tsung-Hao Liu, Hsueh-I Lu |
| 2008 | GD | Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. | Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu |
| 2008 | RTAS | Approximation Algorithms for Multiprocessor Energy-Efficient Scheduling of Periodic Real-Time Tasks with Uncertain Task Execution Time. | Jian-Jia Chen, Chuan-Yue Yang, Hsueh-I Lu, Tei-Wei Kuo |
| 2007 | ASPDAC | Flow Time Minimization under Energy Constraints. | Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu |
| 2007 | ISAAC | Width-Optimal Visibility Representations of Plane Graphs. | Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen |
| 2005 | CPM | An Optimal Algorithm for Online Square Detection. | Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu |
| 2005 | GLOBECOM | Dual power assignment for network connectivity in wireless sensor networks. | Jian-Jia Chen, Hsueh-I Lu, Tei-Wei Kuo, Chuan-Yue Yang, Ai-Chun Pang |
| 2005 | ICCS | Disjoint Segments with Maximum Density. | Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang |
| 2005 | WADS | Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. | Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu |
| 2004 | BIBE | Automatically Predicting Possible Loci of Variable Number of Tandem Repeats. | Chia-Hung Chang, Han-Yu Chuang, Yi-Hung Chiang, Chien-Shun Chiou, Hsueh-I Lu, Cheng-Yan Kao |
| 2004 | ICIP | Image set compression through minimal-cost prediction structures. | Chia-Ping Chen, Chu-Song Chen, Kuo-Liang Chung, Hsueh-I Lu, Gregory Y. Tang |
| 2003 | ESA | An Optimal Algorithm for the Maximum-Density Segment Problem. | Kai-Min Chung, Hsueh-I Lu |
| 2003 | STACS | Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. | Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun |
| 2002 | COCOON | Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. | Hsueh-I Lu |
| 2002 | GD | Some Applications of Orderly Spanning Trees in Graph Drawing. | Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen |
| 2002 | SODA | Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. | Hsueh-I Lu |
| 2002 | WABI | Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. | Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu |
| 2001 | GD | Floor-Planning via Orderly Spanning Trees. | Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen |
| 2001 | SODA | Orderly spanning trees with applications to graph encoding and graph drawing. | Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu |
| 2000 | GD | On Maximum Symmetric Subgraphs. | Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen |
| 2000 | ISAAC | Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. | Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu |
| 1999 | ESA | A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. | Xin He, Ming-Yang Kao, Hsueh-I Lu |
| 1998 | ICALP | Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. | Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu |
| 1998 | ISAAC | Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. | Philip N. Klein, Hsueh-I Lu |
| 1996 | ESA | Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). | Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer |
| 1996 | STOC | Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. | Philip N. Klein, Hsueh-I Lu |
| 1993 | WADS | Detecting Race Conditions in Parallel Programs that Use One Semaphore. | Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer |