 | 2009 |
|---|
| 7 |       | Tzu-Chin Lin,
Chung-Chin Kuo,
Yong-Hsian Hsieh,
Biing-Feng Wang:
Efficient algorithms for the inverse sorting problem with bound constraints under the l INFINITY -norm and the Hamming distance.
J. Comput. Syst. Sci. 75(8): 451-464 (2009) |
| 2008 |
|---|
| 6 | | Hung-I Yu,
Tzu-Chin Lin,
Biing-Feng Wang:
Improved algorithms for the minmax-regret 1-center and 1-median problems.
ACM Transactions on Algorithms 4(3): (2008) |
| 5 | | Biing-Feng Wang,
Tzu-Chin Lin,
Chien-Hsin Lin,
Shan-Chyun Ku:
Finding the conditional location of a median path on a tree.
Inf. Comput. 206(7): 828-839 (2008) |
| 2006 |
|---|
| 4 | | Hung-I Yu,
Tzu-Chin Lin,
Biing-Feng Wang:
Improved Algorithms for the Minmax Regret 1-Median Problem.
COCOON 2006: 52-62 |
| 3 | | Tzu-Chin Lin,
Hung-I Yu,
Biing-Feng Wang:
Improved Algorithms for the Minmax-Regret 1-Center Problem.
ISAAC 2006: 537-546 |
| 2002 |
|---|
| 2 | | Tzu-Chin Lin,
Biing-Feng Wang:
Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees.
ICPADS 2002: 117-122 |
| 2001 |
|---|
| 1 | | Shan-Chyun Ku,
Chi-Jen Lu,
Biing-Feng Wang,
Tzu-Chin Lin:
Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
ISAAC 2001: 768-778 |
Data released under the ODC-BY 1.0 license — See also our legal information page