The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hsueh-I Lu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    BIBE, 2004, pp:475-482 [Conf]
  2. Hsueh-I Lu
    Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:57-66 [Conf]
  3. Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
    An Optimal Algorithm for Online Square Detection. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:280-287 [Conf]
  4. Kai-min Chung, Hsueh-I Lu
    An Optimal Algorithm for the Maximum-Density Segment Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:136-147 [Conf]
  5. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:540-549 [Conf]
  6. Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
    Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:445-459 [Conf]
  7. Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Some Applications of Orderly Spanning Trees in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:332-343 [Conf]
  8. Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen
    On Maximum Symmetric Subgraphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:372-383 [Conf]
  9. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Floor-Planning via Orderly Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:367-377 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:118-129 [Conf]
  11. Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang
    Disjoint Segments with Maximum Density. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:845-850 [Conf]
  12. Chia-Ping Chen, Chu-Song Chen, Kuo-Liang Chung, Hsueh-I Lu, Gregory Y. Tang
    Image set compression through minimal-cost prediction structures. [Citation Graph (0, 0)][DBLP]
    ICIP, 2004, pp:1289-1292 [Conf]
  13. Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
    Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:84-95 [Conf]
  14. Philip N. Klein, Hsueh-I Lu
    Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:387-396 [Conf]
  15. Hsueh-I Lu, R. Ravi
    A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:351-356 [Conf]
  16. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
    Orderly spanning trees with applications to graph encoding and graph drawing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:506-515 [Conf]
  17. Hsueh-I Lu
    Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:223-224 [Conf]
  18. Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
    Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:14-25 [Conf]
  19. Philip N. Klein, Hsueh-I Lu
    Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:338-347 [Conf]
  20. Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
    Linear-Time Algorithms for Tree Root Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:411-422 [Conf]
  21. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:157-171 [Conf]
  22. Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
    Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:338-349 [Conf]
  23. Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer
    Detecting Race Conditions in Parallel Programs that Use One Semaphore. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:471-482 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:251-257 [Conf]
  25. Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu
    Detecting Race Conditions in Parallel Programs that Use Semaphores. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:4, pp:321-345 [Journal]
  26. Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
    Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  27. Ming-Yang Chen, Hsueh-I Lu, Hsu-Chun Yen
    On the Ramsey Numbers for Bipartite Multigraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  29. Xin He, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  30. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  31. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
    Orderly Spanning Trees with Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  32. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  33. Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
    Detecting Race Conditions in Parallel Programs that Use Semaphores [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  34. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Compact Floor-Planning via Orderly Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  35. Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
    Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. Kai-min Chung, Hsueh-I Lu
    An Optimal Algorithm for the Maximum-Density Segment Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  37. Jang-Jiin Wu, Ren-Hung Hwang, Hsueh-I Lu
    Multicast routing with multiple QoS constraints in ATM networks. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2000, v:124, n:1-4, pp:29-57 [Journal]
  38. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Compact floor-planning via orderly spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:441-451 [Journal]
  39. Hsueh-I Lu, R. Ravi
    Approximating Maximum Leaf Spanning Trees in Almost Linear Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:132-141 [Journal]
  40. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:128-144 [Journal]
  41. Kuo-Liang Chung, Hsu-Lien Huang, Hsueh-I Lu
    Efficient region segmentation on compressed gray images using quadtree and shading representation. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2004, v:37, n:8, pp:1591-1605 [Journal]
  42. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
    Orderly Spanning Trees with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:924-945 [Journal]
  43. Kai-min Chung, Hsueh-I Lu
    An Optimal Algorithm for the Maximum-Density Segment Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:373-387 [Journal]
  44. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:838-846 [Journal]
  45. Xin He, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:317-325 [Journal]
  46. Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun
    Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:19-29 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2003, v:8, n:1, pp:38-54 [Journal]
  48. J.-Y. Chen, Wen-Ben Jone, Jinn-Shyan Wang, Hsueh-I Lu, T. F. Chen
    Segmented bus design for low-power systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 1999, v:7, n:1, pp:25-29 [Journal]

  49. Flow Time Minimization under Energy Constraints. [Citation Graph (, )][DBLP]


  50. Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. [Citation Graph (, )][DBLP]


  51. Width-Optimal Visibility Representations of Plane Graphs. [Citation Graph (, )][DBLP]


  52. An Optimal Labeling for Node Connectivity. [Citation Graph (, )][DBLP]


  53. Approximation Algorithms for Multiprocessor Energy-Efficient Scheduling of Periodic Real-Time Tasks with Uncertain Task Execution Time. [Citation Graph (, )][DBLP]


  54. Fast Algorithms for the Density Finding Problem. [Citation Graph (, )][DBLP]


  55. Visibility representations of four-connected plane graphs with near optimal heights. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002