Detecting Race Conditions in Parallel Programs that Use One Semaphore. - Hsueh-I Lu; Philip N. Klein; Robert H. B. Netzer (WADS, 1993)

Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). - Philip N. Klein; Hsueh-I Lu; Robert H. B. Netzer (ESA, 1996)

Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. - Philip N. Klein; Hsueh-I Lu (STOC, 1996)

A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. - Hsueh-I Lu; R. Ravi 001 (ISPAN, 1997)

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. - Richie Chih-Nan Chuang; Ashim Garg; Xin He 005; Ming-Yang Kao; Hsueh-I Lu (ICALP, 1998)

Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. - Philip N. Klein; Hsueh-I Lu (ISAAC, 1998)

Approximating Maximum Leaf Spanning Trees in Almost Linear Time. - Hsueh-I Lu; R. Ravi 001 (J. Algorithms, 1998)

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. - Xin He 005; Ming-Yang Kao; Hsueh-I Lu (SIAM J. Discret. Math., 1999)

Segmented bus design for low-power systems. - J.-Y. Chen; Wen-Ben Jone; Jinn-Shyan Wang; Hsueh-I Lu; Tien-Fu Chen (IEEE Trans. Very Large Scale Integr. Syst., 1999)

On Maximum Symmetric Subgraphs. - Ho-Lin Chen; Hsueh-I Lu; Hsu-Chun Yen (GD, 2000)

Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. - Yuyu Chen; Ming-Yang Kao; Hsueh-I Lu (ISAAC, 2000)

Multicast routing with multiple QoS constraints in ATM networks. - Jang-Jiin Wu; Ren-Hung Hwang; Hsueh-I Lu (Inf. Sci., 2000)

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. - Xin He 005; Ming-Yang Kao; Hsueh-I Lu (SIAM J. Comput., 2000)

Floor-Planning via Orderly Spanning Trees. - Chien-Chih Liao; Hsueh-I Lu; Hsu-Chun Yen (GD, 2001)

Orderly spanning trees with applications to graph encoding and graph drawing. - Yi-Ting Chiang; Ching-Chi Lin; Hsueh-I Lu (SODA, 2001)

Some Applications of Orderly Spanning Trees in Graph Drawing. - Ho-Lin Chen; Chien-Chih Liao; Hsueh-I Lu; Hsu-Chun Yen (GD, 2002)

Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. - Michael H. Goldwasser; Ming-Yang Kao; Hsueh-I Lu (WABI, 2002)

An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract. - Tsai-Hung Fan; Shufen Lee; Hsueh-I Lu; Tsung-Shan Tsou; Tsai-Cheng Wang; Adam Yao (CIAA, 2003)

Detecting Race Conditions in Parallel Programs that Use Semaphores. - Philip N. Klein; Robert H. B. Netzer; Hsueh-I Lu (Algorithmica, 2003)

On the Ramsey Numbers for Bipartite Multigraphs - Ming-Yang Chen; Hsueh-I Lu; Hsu-Chun Yen (CoRR, 2003)

Compact floor-planning via orderly spanning trees. - Chien-Chih Liao; Hsueh-I Lu; Hsu-Chun Yen (J. Algorithms, 2003)

Design theory and implementation for low-power segmented bus systems. - Wen-Ben Jone; Jinn-Shyan Wang; Hsueh-I Lu; I. P. Hsu; J.-Y. Chen (ACM Trans. Design Autom. Electr. Syst., 2003)

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 (BIBE, 2004)

Image set compression through minimal-cost prediction structures. - Chia-Ping Chen; Chu-Song Chen; Kuo-Liang Chung; Hsueh-I Lu; Gregory Y. Tang (ICIP, 2004)

Efficient region segmentation on compressed gray images using quadtree and shading representation. - Kuo-Liang Chung; Hsu-Lien Huang; Hsueh-I Lu (Pattern Recognit., 2004)

An Optimal Algorithm for the Maximum-Density Segment Problem. - Kai-Min Chung; Hsueh-I Lu (SIAM J. Comput., 2004)

Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. - Ching-Chi Lin; Hsueh-I Lu; I-Fan Sun (SIAM J. Discret. Math., 2004)

An Optimal Algorithm for Online Square Detection. - Gen-Huey Chen; Jin-Ju Hong; Hsueh-I Lu (CPM, 2005)

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 (GLOBECOM, 2005)

Disjoint Segments with Maximum Density. - Yen Hung Chen; Hsueh-I Lu; Chuan Yi Tang (International Conference on Computational Science (2), 2005)

Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. - Jian-Jia Chen; Tei-Wei Kuo; Hsueh-I Lu (WADS, 2005)

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. - Michael H. Goldwasser; Ming-Yang Kao; Hsueh-I Lu (J. Comput. Syst. Sci., 2005)

Orderly Spanning Trees with Applications. - Yi-Ting Chiang; Ching-Chi Lin; Hsueh-I Lu (SIAM J. Comput., 2005)

Flow Time Minimization under Energy Constraints. - Jian-Jia Chen; Kazuo Iwama; Tei-Wei Kuo; Hsueh-I Lu (ASP-DAC, 2007)

Width-Optimal Visibility Representations of Plane Graphs. - Jia-Hao Fan; Chun-Cheng Lin; Hsueh-I Lu; Hsu-Chun Yen (ISAAC, 2007)

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 (IEEE Real-Time and Embedded Technology and Applications Symposium, 2008)

Balanced parentheses strike back. - Hsueh-I Lu; Chia-Chi Yeh (ACM Trans. Algorithms, 2008)

An Optimal Labeling for Node Connectivity. - Tai-Hsin Hsu; Hsueh-I Lu (ISAAC, 2009)

Fast Algorithms for the Density Finding Problem. - D. T. Lee; Tien-Ching Lin; Hsueh-I Lu (Algorithmica, 2009)

Visibility representations of four-connected plane graphs with near optimal heights. - Chieh-Yu Chen; Ya-Fei Hung; Hsueh-I Lu (Comput. Geom., 2009)

Minimum cycle bases of weighted outerplanar graphs. - Tsung-Hao Liu; Hsueh-I Lu (Inf. Process. Lett., 2010)

Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. - Hsueh-I Lu (SIAM J. Discret. Math., 2010)

Two-dimensional homing sort. - Bo-Yi Wang; Hsueh-I Lu (Inf. Process. Lett., 2011)

Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. - Ching-Chen Kuo; Hsueh-I Lu (ISAAC, 2012)

Rating Equity Funds against Return of Random Traders. - Ta-Wei Hung; Mu-En Wu; Hsueh-I Lu; Jan-Ming Ho (SocialCom, 2013)

Computing the Girth of a Planar Graph in Linear Time. - Hsien-Chih Chang; Hsueh-I Lu (SIAM J. Comput., 2013)

Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits. - Hsueh-I Lu (SIAM J. Comput., 2014)

Replacement Paths via Row Minima of Concise Matrices. - Cheng-Wei Lee 002; Hsueh-I Lu (SIAM J. Discret. Math., 2014)

Linear-Time Algorithms for Tree Root Problems. - Maw-Shang Chang; Ming-Tat Ko; Hsueh-I Lu (Algorithmica, 2015)

A faster algorithm to recognize even-hole-free graphs. - Hsien-Chih Chang; Hsueh-I Lu (J. Comb. Theory B, 2015)

Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. - Hung-Chun Liang; Hsueh-I Lu (SIAM J. Discret. Math., 2017)

Three-in-a-tree in near linear time. - Kai-Yuan Lai 001; Hsueh-I Lu; Mikkel Thorup (STOC, 2020)

Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes. - Yung-Chung Chiu 001; Kai-Yuan Lai 001; Hsueh-I Lu (CoRR, 2022)

Finding a shortest even hole in polynomial time. - Hou-Teng Cheong; Hsueh-I Lu (J. Graph Theory, 2022)

An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number. - Hsueh-I Lu (CoRR, 2023)

A Simple 2-Approximation for Maximum-Leaf Spanning Tree. - I-Cheng Liao; Hsueh-I Lu (Int. J. Found. Comput. Sci., 2023)

Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths. - Yung-Chung Chiu 001; Hsueh-I Lu (Inf. Comput., 2024)