| 2009 |
|---|
| 54 | EE | D. T. Lee,
Tien-Ching Lin,
Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem.
Algorithmica 53(3): 298-313 (2009) |
| 2008 |
|---|
| 53 | EE | Chieh-Yu Chen,
Ya-Fei Hung,
Hsueh-I Lu:
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights.
Graph Drawing 2008: 67-77 |
| 52 | EE | 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: 13-23 |
| 51 | EE | Hsueh-I Lu,
Chia-Chi Yeh:
Balanced parentheses strike back.
ACM Transactions on Algorithms 4(3): (2008) |
| 2007 |
|---|
| 50 | EE | Jian-Jia Chen,
Kazuo Iwama,
Tei-Wei Kuo,
Hsueh-I Lu:
Flow Time Minimization under Energy Constraints.
ASP-DAC 2007: 866-871 |
| 49 | EE | Jia-Hao Fan,
Chun-Cheng Lin,
Hsueh-I Lu,
Hsu-Chun Yen:
Width-Optimal Visibility Representations of Plane Graphs.
ISAAC 2007: 160-171 |
| 2006 |
|---|
| 48 | EE | Maw-Shang Chang,
Ming-Tat Ko,
Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems.
SWAT 2006: 411-422 |
| 2005 |
|---|
| 47 | EE | Gen-Huey Chen,
Jin-Ju Hong,
Hsueh-I Lu:
An Optimal Algorithm for Online Square Detection.
CPM 2005: 280-287 |
| 46 | EE | Yen Hung Chen,
Hsueh-I Lu,
Chuan Yi Tang:
Disjoint Segments with Maximum Density.
International Conference on Computational Science (2) 2005: 845-850 |
| 45 | EE | Jian-Jia Chen,
Tei-Wei Kuo,
Hsueh-I Lu:
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices.
WADS 2005: 338-349 |
| 44 | EE | 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): 128-144 (2005) |
| 43 | EE | Yi-Ting Chiang,
Ching-Chi Lin,
Hsueh-I Lu:
Orderly Spanning Trees with Applications.
SIAM J. Comput. 34(4): 924-945 (2005) |
| 2004 |
|---|
| 42 | EE | 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: 475-482 |
| 41 | EE | 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: 1289-1292 |
| 40 | EE | Kuo-Liang Chung,
Hsu-Lien Huang,
Hsueh-I Lu:
Efficient region segmentation on compressed gray images using quadtree and shading representation.
Pattern Recognition 37(8): 1591-1605 (2004) |
| 39 | EE | Kai-min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem.
SIAM J. Comput. 34(2): 373-387 (2004) |
| 38 | EE | Ching-Chi Lin,
Hsueh-I Lu,
I-Fan Sun:
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer.
SIAM J. Discrete Math. 18(1): 19-29 (2004) |
| 2003 |
|---|
| 37 | EE | 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: 251-257 |
| 36 | EE | Kai-min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem.
ESA 2003: 136-147 |
| 35 | EE | Ching-Chi Lin,
Hsueh-I Lu,
I-Fan Sun:
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer.
STACS 2003: 14-25 |
| 34 | EE | 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): 38-54 (2003) |
| 33 | EE | Philip N. Klein,
Robert H. B. Netzer,
Hsueh-I Lu:
Detecting Race Conditions in Parallel Programs that Use Semaphores.
Algorithmica 35(4): 321-345 (2003) |
| 32 | EE | Ming-Yang Chen,
Hsueh-I Lu,
Hsu-Chun Yen:
On the Ramsey Numbers for Bipartite Multigraphs
CoRR cs.DM/0305006: (2003) |
| 31 | EE | Kai-min Chung,
Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem
CoRR cs.DS/0311020: (2003) |
| 30 | EE | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Compact floor-planning via orderly spanning trees.
J. Algorithms 48(2): 441-451 (2003) |
| 2002 |
|---|
| 29 | EE | Hsueh-I Lu:
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees.
COCOON 2002: 57-66 |
| 28 | EE | Ho-Lin Chen,
Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Some Applications of Orderly Spanning Trees in Graph Drawing.
Graph Drawing 2002: 332-343 |
| 27 | EE | Hsueh-I Lu:
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.
SODA 2002: 223-224 |
| 26 | EE | 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: 157-171 |
| 25 | EE | Michael H. Goldwasser,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
CoRR cs.DS/0207026: (2002) |
| 24 | EE | Philip N. Klein,
Hsueh-I Lu,
Robert H. B. Netzer:
Detecting Race Conditions in Parallel Programs that Use Semaphores
CoRR cs.DS/0208004: (2002) |
| 23 | EE | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Compact Floor-Planning via Orderly Spanning Trees
CoRR cs.DS/0210016: (2002) |
| 22 | EE | Ching-Chi Lin,
Hsueh-I Lu,
I-Fan Sun:
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
CoRR cs.DS/0212054: (2002) |
| 2001 |
|---|
| 21 | EE | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Floor-Planning via Orderly Spanning Trees.
Graph Drawing 2001: 367-377 |
| 20 | EE | Yi-Ting Chiang,
Ching-Chi Lin,
Hsueh-I Lu:
Orderly spanning trees with applications to graph encoding and graph drawing.
SODA 2001: 506-515 |
| 19 | EE | Yuyu Chen,
Ming-Yang Kao,
Hsueh-I Lu:
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
CoRR cs.CE/0102008: (2001) |
| 18 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
CoRR cs.DS/0101021: (2001) |
| 17 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
CoRR cs.DS/0101033: (2001) |
| 16 | EE | 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 cs.DS/0102005: (2001) |
| 15 | EE | Yi-Ting Chiang,
Ching-Chi Lin,
Hsueh-I Lu:
Orderly Spanning Trees with Applications
CoRR cs.DS/0102006: (2001) |
| 2000 |
|---|
| 14 | EE | Ho-Lin Chen,
Hsueh-I Lu,
Hsu-Chun Yen:
On Maximum Symmetric Subgraphs.
Graph Drawing 2000: 372-383 |
| 13 | EE | Yuyu Chen,
Ming-Yang Kao,
Hsueh-I Lu:
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets.
ISAAC 2000: 84-95 |
| 12 | | Jang-Jiin Wu,
Ren-Hung Hwang,
Hsueh-I Lu:
Multicast routing with multiple QoS constraints in ATM networks.
Inf. Sci. 124(1-4): 29-57 (2000) |
| 11 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs.
SIAM J. Comput. 30(3): 838-846 (2000) |
| 1999 |
|---|
| 10 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.
ESA 1999: 540-549 |
| 9 | EE | J.-Y. Chen,
Wen-Ben Jone,
Jinn-Shyan Wang,
Hsueh-I Lu,
T. F. Chen:
Segmented bus design for low-power systems.
IEEE Trans. VLSI Syst. 7(1): 25-29 (1999) |
| 8 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings.
SIAM J. Discrete Math. 12(3): 317-325 (1999) |
| 1998 |
|---|
| 7 | EE | 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: 118-129 |
| 6 | EE | Philip N. Klein,
Hsueh-I Lu:
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.
ISAAC 1998: 387-396 |
| 5 | | Hsueh-I Lu,
R. Ravi:
Approximating Maximum Leaf Spanning Trees in Almost Linear Time.
J. Algorithms 29(1): 132-141 (1998) |
| 1997 |
|---|
| 4 | EE | Hsueh-I Lu,
R. Ravi:
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.
ISPAN 1997: 351-356 |
| 1996 |
|---|
| 3 | | Philip N. Klein,
Hsueh-I Lu,
Robert H. B. Netzer:
Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract).
ESA 1996: 445-459 |
| 2 | EE | Philip N. Klein,
Hsueh-I Lu:
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING.
STOC 1996: 338-347 |
| 1993 |
|---|
| 1 | | Hsueh-I Lu,
Philip N. Klein,
Robert H. B. Netzer:
Detecting Race Conditions in Parallel Programs that Use One Semaphore.
WADS 1993: 471-482 |
