Hsueh-I Lu

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