| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Floor-Planning via Orderly Spanning Trees.
|
Yen, Hsu-Chun; Lu, Hsueh-I; Liao, Chien-Chih; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets.
|
Chen, Yuyu; Kao, Ming-Yang; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.
|
He, Xin; Kao, Ming-Yang; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses.
|
HSUEH-I LU; Kao, Ming-Yang; Lu, Hsueh-I; He, Xin; Garg, Ashim; Chuang, Richie Chih-Nan |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.
|
Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
An Optimal Algorithm for the Maximum-Density Segment Problem.
|
HSUEH-I LU; Chung, Kai-Min; Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer.
|
Sun, I-Fan; HSUEH-I LU; Lu, Hsueh-I; Lin, Ching-Chi |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract.
|
Wang, Tsai-Cheng; Yao, Adam; HSUEH-I LU; Tsou, Tsung-Shan; Fan, Tsai-Hung; Lee, Shufen; Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
Some Applications of Orderly Spanning Trees in Graph Drawing.
|
Chen, Ho-Lin; Liao, Chien-Chih; Lu, Hsueh-I; Yen, Hsu-Chun; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:43Z |
Automatically Predicting Possible Loci of Variable Number of Tandem Repeats.
|
Chang, Chia-Hung; Chuang, Han-Yu; Chiang, Yi-Hung; Chiou, Chien-Shun; Lu, Hsueh-I; Kao, Cheng-Yan; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:43Z |
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer.
|
HSUEH-I LU; Sun, I-Fan; Lin, Ching-Chi; Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:43Z |
Image set compression through minimal-cost prediction structures.
|
Chen, Chia-Ping; Tang, Gregory Y.; HSUEH-I LU; Chen, Chu-Song; Chung, Kuo-Liang; Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:42Z |
Dual power assignment for network connectivity in wireless sensor networks.
|
Chen, Jian-Jia; Lu, Hsueh-I; Kuo, Tei-Wei; Yang, Chuan-Yue; Pang, Ai-Chun; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:42Z |
Linear-Time Algorithms for Tree Root Problems.
|
Chang, Maw-Shang; Ko, Ming-Tat; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:42Z |
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices.
|
Chen, Jian-Jia; Kuo, Tei-Wei; Lu, Hsueh-I; HSUEH-I LU; Chen, Jian-Jia;Kuo, Tei-Wei;Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:41Z |
Flow Time Minimization under Energy Constraints.
|
Chen, Jian-Jia;Iwama, Kazuo;Kuo, Tei-Wei;Lu, Hsueh-I; Chen, Jian-Jia; Iwama, Kazuo; Kuo, Tei-Wei; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:41Z |
Minimum Cycle Bases of Weighted Outerplanar Graphs.
|
Liu, Tsung-Hao;Lu, Hsueh-I; Liu, Tsung-Hao; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Visibility representations of four-connected plane graphs with near optimal heights
|
Lu, Hsueh-I.; Hung, Ya-Fei; Chen, Chieh-Yu;Hung, Ya-Fei;Lu, Hsueh-I.; Chen, Chieh-Yu; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Linear-time algorithms for tree root problems
|
Chang, Maw-Shang; Ko, Ming-Tat; Lu, Hsueh-I.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Computing the Girth of a Planar Graph in Linear Time.
|
Chang, Hsien-Chih;Lu, Hsueh-I; Chang, Hsien-Chih; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Rating Equity Funds against Return of Random Traders.
|
Wu, Mu-En; Lu, Hsueh-I; Ho, Jan-Ming; HSUEH-I LU; Hung, Ta-Wei; Hung, Ta-Wei;Wu, Mu-En;Lu, Hsueh-I;Ho, Jan-Ming |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors.
|
Kuo, Ching-Chen; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
A faster algorithm to recognize even-hole-free graphs.
|
HSUEH-I LU; Chang, Hsien-Chih; Lu, Hsueh-I |
| 臺大學術典藏 |
2020-05-04T07:56:39Z |
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
|
Lu, Hsueh-I.; Lu, Hsueh-I.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:39Z |
Computing the Girth of a Planar Graph in Linear Time
|
Chang, Hsien-Chih; Chang, Hsien-Chih;Lu, Hsueh-I.; Lu, Hsueh-I.; HSUEH-I LU |
