- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c34 |      | Ching-Chen Kuo, Hsueh-I Lu: Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. ISAAC 2012: 24-33 |
| c33 | | Hsien-Chih Chang, Hsueh-I Lu: A faster algorithm to recognize even-hole-free graphs. SODA 2012: 1286-1297 |
| 2011 | ||
| j19 | | Bo-Yi Wang, Hsueh-I Lu: Two-dimensional homing sort. Inf. Process. Lett. 111(21-22): 1067-1071 (2011) |
| c32 | | Hsien-Chih Chang, Hsueh-I Lu: Computing the Girth of a Planar Graph in Linear Time. COCOON 2011: 225-236 |
| i12 | | Hsien-Chih Chang, Hsueh-I Lu: Computing the Girth of a Planar Graph in Linear Time. CoRR abs/1104.4892 (2011) |
| 2010 | ||
| j18 | | Tsung-Hao Liu, Hsueh-I Lu: Minimum cycle bases of weighted outerplanar graphs. Inf. Process. Lett. 110(21): 970-974 (2010) |
| j17 | | Hsueh-I Lu: Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. SIAM J. Discrete Math. 23(4): 2079-2092 (2010) |
| 2009 | ||
| j16 | | D. T. Lee, Tien-Ching Lin, Hsueh-I Lu: Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009) |
| j15 | | Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu: Visibility representations of four-connected plane graphs with near optimal heights. Comput. Geom. 42(9): 865-872 (2009) |
| c31 | | |
| c30 | | |
| 2008 | ||
| j14 | | Hsueh-I Lu, Chia-Chi Yeh: Balanced parentheses strike back. ACM Transactions on Algorithms 4(3) (2008) |
| c29 | | 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 |
| c28 | | 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 |
| 2007 | ||
| c27 | | Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu: Flow Time Minimization under Energy Constraints. ASP-DAC 2007: 866-871 |
| c26 | | Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen: Width-Optimal Visibility Representations of Plane Graphs. ISAAC 2007: 160-171 |
| 2006 | ||
| c25 | | Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu: Linear-Time Algorithms for Tree Root Problems. SWAT 2006: 411-422 |
| 2005 | ||
| j13 | | 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) |
| j12 | | Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly Spanning Trees with Applications. SIAM J. Comput. 34(4): 924-945 (2005) |
| c24 | | Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu: An Optimal Algorithm for Online Square Detection. CPM 2005: 280-287 |
| c23 | | 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: 5 |
| c22 | | Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang: Disjoint Segments with Maximum Density. International Conference on Computational Science (2) 2005: 845-850 |
| c21 | | Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu: Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. WADS 2005: 338-349 |
| 2004 | ||
| j11 | | 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) |
| j10 | | Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM J. Comput. 34(2): 373-387 (2004) |
| j9 | | 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) |
| c20 | | 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 |
| c19 | | 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 |
| 2003 | ||
| j8 | | 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) |
| j7 | | Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Compact floor-planning via orderly spanning trees. J. Algorithms 48(2): 441-451 (2003) |
| j6 | | 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) |
| c18 | | Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. ESA 2003: 136-147 |
| c17 | | Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun: Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. STACS 2003: 14-25 |
| c16 | | 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 |
| i11 | | Ming-Yang Chen, Hsueh-I Lu, Hsu-Chun Yen: On the Ramsey Numbers for Bipartite Multigraphs. CoRR cs.DM/0305006 (2003) |
| i10 | | Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. CoRR cs.DS/0311020 (2003) |
| 2002 | ||
| c15 | | Hsueh-I Lu: Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. COCOON 2002: 57-66 |
| c14 | | 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 |
| c13 | | Hsueh-I Lu: Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. SODA 2002: 223-224 |
| c12 | | 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 |
| i9 | | 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) |
| i8 | | Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Detecting Race Conditions in Parallel Programs that Use Semaphores. CoRR cs.DS/0208004 (2002) |
| i7 | | Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Compact Floor-Planning via Orderly Spanning Trees. CoRR cs.DS/0210016 (2002) |
| i6 | | 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 | ||
| c11 | | Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen: Floor-Planning via Orderly Spanning Trees. Graph Drawing 2001: 367-377 |
| c10 | | Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly spanning trees with applications to graph encoding and graph drawing. SODA 2001: 506-515 |
| i5 | | Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu: Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. CoRR cs.CE/0102008 (2001) |
| i4 | | Xin He, Ming-Yang Kao, Hsueh-I Lu: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. CoRR cs.DS/0101021 (2001) |
| i3 | | Xin He, Ming-Yang Kao, Hsueh-I Lu: Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. CoRR cs.DS/0101033 (2001) |
| i2 | | 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) |
| i1 | | Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu: Orderly Spanning Trees with Applications. CoRR cs.DS/0102006 (2001) |
| 2000 | ||
| j5 | | 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) |
| j4 | | 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) |
| c9 | | |
| c8 | | Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu: Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. ISAAC 2000: 84-95 |
| 1999 | ||
| j3 | | 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) |
| j2 | | J.-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) |
| c7 | | Xin He, Ming-Yang Kao, Hsueh-I Lu: A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. ESA 1999: 540-549 |
| 1998 | ||
| j1 | | Hsueh-I Lu, R. Ravi: Approximating Maximum Leaf Spanning Trees in Almost Linear Time. J. Algorithms 29(1): 132-141 (1998) |
| c6 | | 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 |
| c5 | | Philip N. Klein, Hsueh-I Lu: Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ISAAC 1998: 387-396 |
| 1997 | ||
| c4 | | Hsueh-I Lu, R. Ravi: A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. ISPAN 1997: 351-356 |
| 1996 | ||
| c3 | | Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer: Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). ESA 1996: 445-459 |
| c2 | | Philip N. Klein, Hsueh-I Lu: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. STOC 1996: 338-347 |
| 1993 | ||
| c1 | | Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer: Detecting Race Conditions in Parallel Programs that Use One Semaphore. WADS 1993: 471-482 |
Colors in the list of coauthors
Last update Sat May 25 10:46:25 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page