Hsueh-I Lu

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 14

Top Topics

Binary Matrices

Encoding Scheme

Top Venues

SIAM J. Discret. Math.

SIAM J. Comput.

Publications

Hsueh-I Lu
An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number. CoRR (2023)
I-Cheng Liao, Hsueh-I Lu
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. Int. J. Found. Comput. Sci. 34 (7) (2023)
I-Cheng Liao, Hsueh-I Lu
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. CoRR (2023)
Hou-Teng Cheong, Hsueh-I Lu
Finding a shortest even hole in polynomial time. J. Graph Theory 99 (3) (2022)
Yung-Chung Chiu, Hsueh-I Lu
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. STACS (2022)
Yung-Chung Chiu, Kai-Yuan Lai, Hsueh-I Lu
Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes. CoRR (2022)
Yung-Chung Chiu, Hsueh-I Lu
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths. CoRR (2021)
Hou-Teng Cheong, Hsueh-I Lu
Finding a Shortest Even Hole in Polynomial Time. CoRR (2020)
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
Three-in-a-tree in near linear time. STOC (2020)
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
Three-in-a-Tree in Near Linear Time. CoRR (2019)
Hung-Chun Liang, Hsueh-I Lu
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. SIAM J. Discret. Math. 31 (1) (2017)
Hung-Chun Liang, Hsueh-I Lu
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. CoRR (2017)
Hsien-Chih Chang, Hsueh-I Lu
A faster algorithm to recognize even-hole-free graphs. J. Comb. Theory, Ser. B 113 (2015)
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
Linear-Time Algorithms for Tree Root Problems. Algorithmica 71 (2) (2015)
Hsueh-I Lu
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits. SIAM J. Comput. 43 (2) (2014)
Cheng-Wei Lee, Hsueh-I Lu
Replacement Paths via Row Minima of Concise Matrices. SIAM J. Discret. Math. 28 (1) (2014)
Hsueh-I Lu
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits. CoRR (2014)
Hsien-Chih Chang, Hsueh-I Lu
A Faster Algorithm to Recognize Even-Hole-Free Graphs. CoRR (2013)
Cheng-Wei Lee, Hsueh-I Lu
Replacement Paths via Row Minima of Concise Matrices. CoRR (2013)
Hsien-Chih Chang, Hsueh-I Lu
Computing the Girth of a Planar Graph in Linear Time. SIAM J. Comput. 42 (3) (2013)
Ta-Wei Hung, Mu-En Wu, Hsueh-I Lu, Jan-Ming Ho
Rating Equity Funds against Return of Random Traders. SocialCom (2013)
Ching-Chen Kuo, Hsueh-I Lu
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. ISAAC (2012)
Hsien-Chih Chang, Hsueh-I Lu
A faster algorithm to recognize even-hole-free graphs. SODA (2012)
Hsien-Chih Chang, Hsueh-I Lu
Computing the Girth of a Planar Graph in Linear Time. COCOON (2011)
Bo-Yi Wang, Hsueh-I Lu
Two-dimensional homing sort. Inf. Process. Lett. 111 (21-22) (2011)
Hsien-Chih Chang, Hsueh-I Lu
Computing the Girth of a Planar Graph in Linear Time CoRR (2011)
Hsueh-I Lu
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. SIAM J. Discret. Math. 23 (4) (2010)
Tsung-Hao Liu, Hsueh-I Lu
Minimum cycle bases of weighted outerplanar graphs. Inf. Process. Lett. 110 (21) (2010)
Tai-Hsin Hsu, Hsueh-I Lu
An Optimal Labeling for Node Connectivity. ISAAC (2009)
Tsung-Hao Liu, Hsueh-I Lu
Minimum Cycle Bases of Weighted Outerplanar Graphs. ISAAC (2009)
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
Visibility representations of four-connected plane graphs with near optimal heights. Comput. Geom. 42 (9) (2009)
D. T. Lee, Tien-Ching Lin, Hsueh-I Lu
Fast Algorithms for the Density Finding Problem. Algorithmica 53 (3) (2009)
Jian-Jia Chen, Chuan-Yue Yang, Hsueh-I Lu, Tei-Wei Kuo
Approximation Algorithms for Multiprocessor Energy-Efficient Scheduling of Periodic Real-Time Tasks with Uncertain Task Execution Time. IEEE Real-Time and Embedded Technology and Applications Symposium (2008)
Hsueh-I Lu, Chia-Chi Yeh
Balanced parentheses strike back. ACM Trans. Algorithms 4 (3) (2008)
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. Graph Drawing (2008)
Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen
Width-Optimal Visibility Representations of Plane Graphs. ISAAC (2007)
Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu
Flow Time Minimization under Energy Constraints. ASP-DAC (2007)
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
Linear-Time Algorithms for Tree Root Problems. SWAT (2006)
Jian-Jia Chen, Hsueh-I Lu, Tei-Wei Kuo, Chuan-Yue Yang, Ai-Chun Pang
Dual power assignment for network connectivity in wireless sensor networks. GLOBECOM (2005)
Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
Orderly Spanning Trees with Applications. SIAM J. Comput. 34 (4) (2005)
Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
An Optimal Algorithm for Online Square Detection. CPM (2005)
Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang
Disjoint Segments with Maximum Density. International Conference on Computational Science (2) (2005)
Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. WADS (2005)
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci. 70 (2) (2005)
Kai-Min Chung, Hsueh-I Lu
An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM J. Comput. 34 (2) (2004)
Chia-Hung Chang, Han-Yu Chuang, Yi-Hung Chiang, Chien-Shun Chiou, Hsueh-I Lu, Cheng-Yan Kao
Automatically Predicting Possible Loci of Variable Number of Tandem Repeats. BIBE (2004)
Kuo-Liang Chung, Hsu-Lien Huang, Hsueh-I Lu
Efficient region segmentation on compressed gray images using quadtree and shading representation. Pattern Recognit. 37 (8) (2004)
Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. SIAM J. Discret. Math. 18 (1) (2004)
Chia-Ping Chen, Chu-Song Chen, Kuo-Liang Chung, Hsueh-I Lu, Gregory Y. Tang
Image set compression through minimal-cost prediction structures. ICIP (2004)
Ming-Yang Chen, Hsueh-I Lu, Hsu-Chun Yen
On the Ramsey Numbers for Bipartite Multigraphs CoRR (2003)
Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu
Detecting Race Conditions in Parallel Programs that Use Semaphores. Algorithmica 35 (4) (2003)
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Compact floor-planning via orderly spanning trees. J. Algorithms 48 (2) (2003)
Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, I. P. Hsu, J.-Y. Chen
Design theory and implementation for low-power segmented bus systems. ACM Trans. Design Autom. Electr. Syst. 8 (1) (2003)
Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract. CIAA (2003)
Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. STACS (2003)
Kai-Min Chung, Hsueh-I Lu
An Optimal Algorithm for the Maximum-Density Segment Problem. ESA (2003)
Kai-Min Chung, Hsueh-I Lu
An Optimal Algorithm for the Maximum-Density Segment Problem CoRR (2003)
Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Some Applications of Orderly Spanning Trees in Graph Drawing. Graph Drawing (2002)
Hsueh-I Lu
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. SODA (2002)
Hsueh-I Lu
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. COCOON (2002)
Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer CoRR (2002)
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Compact Floor-Planning via Orderly Spanning Trees CoRR (2002)
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications CoRR (2002)
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. WABI (2002)
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
Detecting Race Conditions in Parallel Programs that Use Semaphores CoRR (2002)
Xin He, Ming-Yang Kao, Hsueh-I Lu
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs CoRR (2001)
Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets CoRR (2001)
Xin He, Ming-Yang Kao, Hsueh-I Lu
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings CoRR (2001)
Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses CoRR (2001)
Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
Orderly spanning trees with applications to graph encoding and graph drawing. SODA (2001)
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
Floor-Planning via Orderly Spanning Trees. Graph Drawing (2001)
Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
Orderly Spanning Trees with Applications CoRR (2001)
Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. ISAAC (2000)
Xin He, Ming-Yang Kao, Hsueh-I Lu
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. SIAM J. Comput. 30 (3) (2000)
Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen
On Maximum Symmetric Subgraphs. Graph Drawing (2000)
Jang-Jiin Wu, Ren-Hung Hwang, Hsueh-I Lu
Multicast routing with multiple QoS constraints in ATM networks. Inf. Sci. 124 (1-4) (2000)
J.-Y. Chen, Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, Tien-Fu Chen
Segmented bus design for low-power systems. IEEE Trans. Very Large Scale Integr. Syst. 7 (1) (1999)
Xin He, Ming-Yang Kao, Hsueh-I Lu
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. SIAM J. Discret. Math. 12 (3) (1999)
Xin He, Ming-Yang Kao, Hsueh-I Lu
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. ESA (1999)
Philip N. Klein, Hsueh-I Lu
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ISAAC (1998)
Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. ICALP (1998)
Hsueh-I Lu, R. Ravi
Approximating Maximum Leaf Spanning Trees in Almost Linear Time. J. Algorithms 29 (1) (1998)
Hsueh-I Lu, R. Ravi
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. ISPAN (1997)
Philip N. Klein, Hsueh-I Lu
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. STOC (1996)
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). ESA (1996)
Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer
Detecting Race Conditions in Parallel Programs that Use One Semaphore. WADS (1993)