dblp.uni-trier.dewww.uni-trier.de

Hsueh-I Lu Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
54EED. T. Lee, Tien-Ching Lin, Hsueh-I Lu: Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009)
2008
53EEChieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu: Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. Graph Drawing 2008: 67-77
52EEJian-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
51EEHsueh-I Lu, Chia-Chi Yeh: Balanced parentheses strike back. ACM Transactions on Algorithms 4(3): (2008)
2007
50EEJian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu: Flow Time Minimization under Energy Constraints. ASP-DAC 2007: 866-871
49EEJia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen: Width-Optimal Visibility Representations of Plane Graphs. ISAAC 2007: 160-171
2006
48EEMaw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu: Linear-Time Algorithms for Tree Root Problems. SWAT 2006: 411-422
2005
47EEGen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu: An Optimal Algorithm for Online Square Detection. CPM 2005: 280-287
46EEYen Hung Chen, Hsueh-I Lu, Chuan Yi Tang: Disjoint Segments with Maximum Density. International Conference on Computational Science (2) 2005: 845-850
45EEJian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu: Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. WADS 2005: 338-349
44EEMichael 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)
43EEYi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly Spanning Trees with Applications. SIAM J. Comput. 34(4): 924-945 (2005)
2004
42EEChia-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
41EEChia-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
40EEKuo-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)
39EEKai-min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM J. Comput. 34(2): 373-387 (2004)
38EEChing-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
37EETsai-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
36EEKai-min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. ESA 2003: 136-147
35EEChing-Chi Lin, Hsueh-I Lu, I-Fan Sun: Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. STACS 2003: 14-25
34EEWen-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)
33EEPhilip N. Klein, Robert H. B. Netzer, Hsueh-I Lu: Detecting Race Conditions in Parallel Programs that Use Semaphores. Algorithmica 35(4): 321-345 (2003)
32EEMing-Yang Chen, Hsueh-I Lu, Hsu-Chun Yen: On the Ramsey Numbers for Bipartite Multigraphs CoRR cs.DM/0305006: (2003)
31EEKai-min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem CoRR cs.DS/0311020: (2003)
30EEChien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Compact floor-planning via orderly spanning trees. J. Algorithms 48(2): 441-451 (2003)
2002
29EEHsueh-I Lu: Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. COCOON 2002: 57-66
28EEHo-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
27EEHsueh-I Lu: Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. SODA 2002: 223-224
26EEMichael 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
25EEMichael 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)
24EEPhilip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Detecting Race Conditions in Parallel Programs that Use Semaphores CoRR cs.DS/0208004: (2002)
23EEChien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Compact Floor-Planning via Orderly Spanning Trees CoRR cs.DS/0210016: (2002)
22EEChing-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
21EEChien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Floor-Planning via Orderly Spanning Trees. Graph Drawing 2001: 367-377
20EEYi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly spanning trees with applications to graph encoding and graph drawing. SODA 2001: 506-515
19EEYuyu Chen, Ming-Yang Kao, Hsueh-I Lu: Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets CoRR cs.CE/0102008: (2001)
18EEXin He, Ming-Yang Kao, Hsueh-I Lu: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs CoRR cs.DS/0101021: (2001)
17EEXin He, Ming-Yang Kao, Hsueh-I Lu: Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings CoRR cs.DS/0101033: (2001)
16EERichie 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)
15EEYi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly Spanning Trees with Applications CoRR cs.DS/0102006: (2001)
2000
14EEHo-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen: On Maximum Symmetric Subgraphs. Graph Drawing 2000: 372-383
13EEYuyu 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)
11EEXin 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
10EEXin He, Ming-Yang Kao, Hsueh-I Lu: A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. ESA 1999: 540-549
9EEJ.-Y. Chen, Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, Tien-Fu Chen: Segmented bus design for low-power systems. IEEE Trans. VLSI Syst. 7(1): 25-29 (1999)
8EEXin 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
7EERichie 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
6EEPhilip 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
4EEHsueh-I Lu, R. Ravi: A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. ISPAN 1997: 351-356
1996
3EEPhilip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). ESA 1996: 445-459
2EEPhilip 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

Coauthor Index

1Chia-Hung Chang [42]
2Maw-Shang Chang [48]
3Chia-Ping Chen [41]
4Chieh-Yu Chen [53]
5Chu-Song Chen [41]
6Gen-Huey Chen [47]
7Ho-Lin Chen [14] [28]
8J.-Y. Chen [9] [34]
9Jian-Jia Chen [45] [50] [52]
10Ming-Yang Chen [32]
11Tien-Fu Chen [9]
12Yen Hung Chen [46]
13Yuyu Chen [13] [19]
14Yi-Hung Chiang [42]
15Yi-Ting Chiang [15] [20] [43]
16Chien-Shun Chiou [42]
17Han-Yu Chuang [42]
18Richie Chih-Nan Chuang [7] [16]
19Kai-min Chung [31] [36] [39]
20Kuo-Liang Chung [40] [41]
21Jia-Hao Fan [49]
22Tsai-Hung Fan [37]
23Ashim Garg [7] [16]
24Michael H. Goldwasser [25] [26] [44]
25Xin He [7] [8] [10] [11] [16] [17] [18]
26Jin-Ju Hong [47]
27I. P. Hsu [34]
28Hsu-Lien Huang [40]
29Ya-Fei Hung [53]
30Ren-Hung Hwang [12]
31Kazuo Iwama [50]
32Wen-Ben Jone [9] [34]
33Cheng-Yan Kao [42]
34Ming-Yang Kao [7] [8] [10] [11] [13] [16] [17] [18] [19] [25] [26] [44]
35Philip N. Klein [1] [2] [3] [6] [24] [33]
36Ming-Tat Ko [48]
37Tei-Wei Kuo [45] [50] [52]
38D. T. Lee (Der-Tsai Lee) [54]
39Shufen Lee [37]
40Chien-Chih Liao [21] [23] [28] [30]
41Ching-Chi Lin [15] [20] [22] [35] [38] [43]
42Chun-Cheng Lin [49]
43Tien-Ching Lin [54]
44Robert H. B. Netzer [1] [3] [24] [33]
45R. Ravi [4] [5]
46I-Fan Sun [22] [35] [38]
47Chuan Yi Tang [46]
48Gregory Y. Tang [41]
49Tsung-Shan Tsou [37]
50Jinn-Shyan Wang [9] [34]
51Tsai-Cheng Wang [37]
52Jang-Jiin Wu [12]
53Chuan-Yue Yang [52]
54Adam Yao [37]
55Chia-Chi Yeh [51]
56Hsu-Chun Yen [14] [21] [23] [28] [30] [32] [49]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)