| 2008 |
|---|
| 56 | EE | Yuzhen Liu,
Weifa Liang:
Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks.
WWIC 2008: 201-212 |
| 55 | EE | Hong-Cheu Liu,
Jeffrey Xu Yu,
Weifa Liang:
Safety, domain independence and translation of complex value database queries.
Inf. Sci. 178(12): 2507-2533 (2008) |
| 2007 |
|---|
| 54 | EE | Yuzhen Liu,
Weifa Liang:
Online Multicasting in WDM Networks with Shared Light Splitter Bank.
Networking 2007: 958-969 |
| 53 | EE | Weifa Liang,
Yuzhen Liu:
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks.
Ad Hoc Networks 5(2): 272-285 (2007) |
| 52 | EE | Weifa Liang,
Yuzhen Liu:
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks.
IEEE Trans. Mob. Comput. 6(1): 2-11 (2007) |
| 2006 |
|---|
| 51 | EE | Weifa Liang:
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks.
IEEE Trans. Mob. Comput. 5(4): 377-387 (2006) |
| 50 | EE | Weifa Liang,
Xiaoxing Guo:
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks.
IEEE Trans. Mob. Comput. 5(9): 1215-1227 (2006) |
| 49 | EE | Weifa Liang,
Xiaojun Shen:
A general approach for all-to-all routing in multihop WDM optical networks.
IEEE/ACM Trans. Netw. 14(4): 914-923 (2006) |
| 48 | EE | Xianchao Zhang,
Weifa Liang,
He Jiang:
Flow equivalent trees in undirected node-edge-capacitated planar graphs.
Inf. Process. Lett. 100(3): 110-115 (2006) |
| 2005 |
|---|
| 47 | EE | Yuzhen Liu,
Weifa Liang:
Approximate Coverage in Wireless Sensor Networks.
LCN 2005: 68-75 |
| 46 | EE | Zhuoyuan Tu,
Weifa Liang:
Energy-Efficient Aggregate Query Evaluation in Sensor Networks.
MSN 2005: 31-41 |
| 45 | EE | Yingyu Wan,
Weifa Liang:
Wavelength Rerouting in Survivable WDM Networks.
NETWORKING 2005: 431-442 |
| 44 | EE | Arun Vishwanath,
Weifa Liang:
On-Line Routing in WDM-TDM Switched Optical Mesh Networks.
PDCAT 2005: 215-219 |
| 43 | EE | Weifa Liang,
Xiaojun Shen:
Finding multiple routing paths in wide-area WDM networks.
Computer Communications 28(7): 811-818 (2005) |
| 42 | EE | Yingyu Wan,
Weifa Liang:
On the minimum number of wavelengths in multicast trees in WDM networks.
Networks 45(1): 42-48 (2005) |
| 2004 |
|---|
| 41 | EE | Hong-Cheu Liu,
Weifa Liang:
Safe Web Queries.
APWeb 2004: 677-686 |
| 40 | EE | Weifa Liang,
Yang Yuansheng:
Maximizing Battery Life Routing in Wireless Ad Hoc Networks.
HICSS 2004 |
| 39 | EE | Weifa Liang:
Constructing Multiple Light Multicast Trees in WDM Optical Networks.
ISPAN 2004: 482-488 |
| 38 | EE | Yingyu Wan,
Weifa Liang:
Wavelength Rerouting for On-line Multicast in WDM Networks.
LCN 2004: 352-359 |
| 2003 |
|---|
| 37 | EE | Yang Yuansheng,
Weifa Liang:
The minimum number of vertices with girth 6 and degree set D={r, m}.
Discrete Mathematics 269(1-3): 249-258 (2003) |
| 2002 |
|---|
| 36 | | Weifa Liang,
Jeffrey Xu Yu:
Parallel Maintenance of Materialized Views on Personal Computer Clusters.
IASTED PDCS 2002: 175-179 |
| 35 | EE | Weifa Liang,
Xiaojun Shen:
Finding Multiple Routing Paths in Wide-Area WDM Networks.
ICPP Workshops 2002: 199-206 |
| 34 | EE | Weifa Liang:
Constructing minimum-energy broadcast trees in wireless ad hoc networks.
MobiHoc 2002: 112-122 |
| 2001 |
|---|
| 33 | | Weifa Liang:
Robust Routing in Wide-Area WDM Networks.
IPDPS 2001: 15 |
| 32 | EE | Weifa Liang,
Jeffrey Xu Yu:
Revisit on View Maintenance in Data Warehouses.
WAIM 2001: 203-211 |
| 31 | EE | Weifa Liang,
Hui Wang,
Maria E. Orlowska:
Materialized view selection under the maintenance time constraint.
Data Knowl. Eng. 37(2): 203-216 (2001) |
| 30 | | Yijie Han,
Weifa Liang,
Xiaojun Shen:
Very fast parallel algorithms for approximate edge coloring.
Discrete Applied Mathematics 108(3): 227-238 (2001) |
| 29 | | Weifa Liang:
Finding the k most vital edges with respect to minimum spanning trees for fixed k.
Discrete Applied Mathematics 113(2-3): 319-327 (2001) |
| 28 | EE | Weifa Liang,
Richard P. Brent,
Hong Shen:
Fully Dynamic Maintenance of k-Connectivity in Parallel.
IEEE Trans. Parallel Distrib. Syst. 12(8): 846-864 (2001) |
| 2000 |
|---|
| 27 | EE | Weifa Liang,
Maria E. Orlowska:
Optimizing Processing of Query Subscription in an WDM Network Environment .
ITCC 2000: 510-515 |
| 26 | EE | Weifa Liang,
Chris Johnson,
Jeffrey Xu Yu:
Maintaining Materialized Views for Data Warehouses with Multiple Remote Sources.
Web-Age Information Management 2000: 299-310 |
| 25 | EE | Weifa Liang,
Hui Wang,
Maria E. Orlowska:
Range queries in dynamic OLAP data cubes.
Data Knowl. Eng. 34(1): 21-38 (2000) |
| 24 | | Weifa Liang,
Maria E. Orlowska:
Computing Multidimensional Aggregates in Parallel.
Informatica (Slovenia) 24(1): (2000) |
| 23 | EE | Weifa Liang,
Maria E. Orlowska,
Jeffrey Xu Yu:
Optimizing Multiple Dimensional Queries Simultaneously in Multidimensional Databases.
VLDB J. 8(3-4): 319-338 (2000) |
| 1999 |
|---|
| 22 | EE | Hui Wang,
Maria E. Orlowska,
Weifa Liang:
Efficient Refreshment of Materialized Views with Multiple Sources.
CIKM 1999: 375-382 |
| 21 | | Weifa Liang,
Xiaojun Shen:
Permutation Routing in All-Optical Product Networks.
IPPS/SPDP Workshops 1999: 831-844 |
| 20 | EE | Weifa Liang,
Brendan D. McKay:
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation.
ISPAN 1999: 290-295 |
| 19 | EE | Weifa Liang,
Hui Li,
Hui Wang,
Maria E. Orlowska:
Making Multiple Views Self-Maintainable in a Data Warehouse.
Data Knowl. Eng. 30(2): 121-134 (1999) |
| 18 | | Hong Shen,
Weifa Liang,
Joseph Kee-Yin Ng:
Efficient Computation Of Frequent Itemsets In A Subcollection Of Multiple Set Families.
Informatica (Slovenia) 23(4): (1999) |
| 1998 |
|---|
| 17 | EE | Weifa Liang,
George Havas,
Xiaojun Shen:
Improved Lightpath (Wavelength) Routing in Large WDM Networks.
ICDCS 1998: 516-523 |
| 16 | EE | Weifa Liang,
Maria E. Orlowska:
Computing Multidimensional Aggregates in Parallel.
ICPADS 1998: 92-99 |
| 15 | EE | Weifa Liang,
Hong Shen:
Multicasting and Broadcasting in Large WDM Networks.
IPPS/SPDP 1998: 365-369 |
| 1997 |
|---|
| 14 | | Weifa Liang,
George Havas:
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.
Euro-Par 1997: 430-439 |
| 13 | | Xiaojun Shen,
Weifa Liang,
Qing Hu:
On Embedding Between 2D Meshes of the Same Size.
IEEE Trans. Computers 46(8): 880-889 (1997) |
| 12 | | Weifa Liang,
Xiaojun Shen:
Finding the k Most Vital Edges in the Minimum Spanning Tree Problem.
Parallel Computing 23(13): 1889-1907 (1997) |
| 11 | EE | Hong Shen,
Weifa Liang:
Efficient Enumeration of all Minimal Separators in a Graph.
Theor. Comput. Sci. 180(1-2): 169-180 (1997) |
| 1996 |
|---|
| 10 | EE | Weifa Liang,
Richard P. Brent:
Constructing the Spanners of Graphs in Parallel.
IPPS 1996: 206-210 |
| 9 | | Qing Hu,
Xiaojun Shen,
Weifa Liang:
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks.
IEEE Trans. Computers 45(1): 97-103 (1996) |
| 8 | EE | Weifa Liang,
Brendan D. McKay,
Hong Shen:
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems.
Inf. Process. Lett. 58(3): 149-155 (1996) |
| 7 | | Weifa Liang,
Xiaojun Shen,
Qing Hu:
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems.
J. Parallel Distrib. Comput. 32(1): 66-73 (1996) |
| 1995 |
|---|
| 6 | EE | Weifa Liang:
Fast Parallel Algorithms for the Approximate Edge-Coloring Problem.
Inf. Process. Lett. 55(6): 333-338 (1995) |
| 5 | | Xiaojun Shen,
Qing Hu,
Weifa Liang:
Embedding K-ary Complete Trees into Hypercubes.
J. Parallel Distrib. Comput. 24(1): 100-106 (1995) |
| 1994 |
|---|
| 4 | | Xiaojun Shen,
Qing Hu,
Weifa Liang:
Efficient Embedding K-ary Complete Trees into Hypercubes.
IPPS 1994: 710-714 |
| 3 | | Xiaojun Shen,
Qing Hu,
Weifa Liang:
Realization of an Arbitrary Permutation on a Hypercube.
Inf. Process. Lett. 51(5): 237-243 (1994) |
| 1993 |
|---|
| 2 | | Xiaojun Shen,
Weifa Liang:
A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees.
IPPS 1993: 310-317 |
| 1 | | Weifa Liang,
Qing Hu,
Xiaojun Shen:
Embedding Between 2-D Meshes of the Same Size.
SPDP 1993: 712-719 |
