- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j38 |      | Feng Shan, Weifa Liang, Jun Luo, Xiaojun Shen: Network lifetime maximization for time-sensitive data gathering in wireless sensor networks. Computer Networks 57(5): 1063-1077 (2013) |
| 2012 | ||
| j37 | | Weifa Liang: Constrained Resource Optimization in Large-Scale Wireless Sensor Networks with Mobile Sinks. JCM 7(7): 494-499 (2012) |
| j36 | | Oday Jerew, Kim L. Blackmore, Weifa Liang: Mobile Base Station and Clustering to Maximize Network Lifetime in Wireless Sensor Networks. J. Electrical and Computer Engineering 2012 (2012) |
| j35 | | Weifa Liang, Yinlong Xu, Jiugen Shi, Junzhou Luo: Aggregate node placement for maximizing network lifetime in sensor networks. Wireless Communications and Mobile Computing 12(3): 219-235 (2012) |
| j34 | | Baichen Chen, Weifa Liang, Jeffrey Xu Yu: Energy-efficient skyline query optimization in wireless sensor networks. Wireless Networks 18(8): 985-1004 (2012) |
| c58 | | Zichuan Xu, Weifa Liang, Yinlong Xu: Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink. DCOSS 2012: 9-16 |
| c57 | | Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li: Finding maximal k-edge-connected subgraphs from a large graph. EDBT 2012: 480-491 |
| c56 | | Xiaojiang Ren, Weifa Liang: Delay-tolerant data gathering in energy harvesting sensor networks with a mobile sink. GLOBECOM 2012: 93-99 |
| c55 | | Xu Xu, Weifa Liang, Tim Wark, Jaein Jeong: Maximizing network lifetime via 3G gateway assignment in dual-radio sensor networks. LCN 2012: 479-486 |
| c54 | | Zichuan Xu, Weifa Liang: Collusion-resistant repeated double auctions for cooperative communications. MASS 2012: 443-447 |
| 2011 | ||
| j33 | | Weifa Liang, Baichen Chen, Jeffrey Xu Yu: Top-k query evaluation in sensor networks under query response time constraint. Inf. Sci. 181(4): 869-882 (2011) |
| c53 | | Xu Xu, Weifa Liang, Tim Wark: Data quality maximization in sensor networks with a mobile sink. DCOSS 2011: 1-8 |
| c52 | | Baichen Chen, Weifa Liang, Geyong Min: Top-k Query Evaluation in Sensor Networks with the Guaranteed Accuracy of Query Results. DEXA (1) 2011: 156-171 |
| c51 | | |
| c50 | | Wenzheng Xu, Yongmin Zhang, Weifa Liang: Overhead analysis of query localization optimization and routing. ICUIMC 2011: 109 |
| c49 | | Wei Yang, Dongsong Ban, Weifa Liang, Wenhua Dou: A Genetic Algorithm for joint resource allocation in Cooperative Cognitive Radio Networks. IWCMC 2011: 167-172 |
| c48 | | |
| c47 | | Xu Xu, Weifa Liang: Monitoring quality optimization in wireless sensor networks with a mobile sink. MSWiM 2011: 77-84 |
| 2010 | ||
| c46 | | Baichen Chen, Weifa Liang, Rui Zhou, Jeffrey Xu Yu: Energy-efficient top-k query processing in wireless sensor networks. CIKM 2010: 329-338 |
| c45 | | Weifa Liang, Jun Luo, Xu Xu: Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks. GLOBECOM 2010: 1-6 |
| c44 | | Ghalib A. Shah, Weifa Liang, Xiaojun Shen: Cross-Layer Design for QoS Support in Wireless Multimedia Sensor Networks. GLOBECOM 2010: 1-5 |
| c43 | | Wei Yang, Weifa Liang, Wenhua Dou: Energy-Aware Real-Time Opportunistic Routing for Wireless Ad Hoc Networks. GLOBECOM 2010: 1-6 |
| c42 | | Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou: Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks. IWCMC 2010: 721-725 |
| c41 | | Baichen Chen, Weifa Liang, Jeffrey Xu Yu: Online Time Interval Top-k Queries in Wireless Sensor Networks. Mobile Data Management 2010: 177-182 |
| 2009 | ||
| j32 | | Weifa Liang, Richard P. Brent, Yinlong Xu, Qingshan Wang: Minimum-energy all-to-all multicasting in wireless ad hoc networks. IEEE Transactions on Wireless Communications 8(11): 5490-5499 (2009) |
| c40 | | Baichen Chen, Weifa Liang, Jeffrey Xu Yu: Progressive skyline query evaluation and maintenance in wireless sensor networks. CIKM 2009: 1445-1448 |
| c39 | | Oday Jerew, Weifa Liang: Prolonging network lifetime through the use of mobile base station in wireless sensor networks. MoMM 2009: 170-178 |
| c38 | | Baichen Chen, Weifa Liang: Progressive Skyline Query Processing in Wireless Sensor Networks. MSN 2009: 17-24 |
| 2008 | ||
| j31 | | 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) |
| j30 | | Xiaojun Shen, Jianyu Lou, Weifa Liang, Junzhou Luo: Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches. Theor. Comput. Sci. 409(3): 477-485 (2008) |
| c37 | | Weifa Liang, Baichen Chen, Jeffrey Xu Yu: Energy-efficient skyline query processing and maintenance in sensor networks. CIKM 2008: 1471-1472 |
| c36 | | Xianchao Zhang, Weifa Liang, Guoliang Chen: Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. COCOON 2008: 577-586 |
| c35 | | Weifa Liang, Baichen Chen, Jeffrey Xu Yu: Response Time Constrained Top-k Query Evaluation in Sensor Networks. ICPADS 2008: 575-582 |
| c34 | | Yuzhen Liu, Weifa Liang: Prolonging Network Lifetime for Target Coverage in Sensor Networks. WASA 2008: 212-223 |
| c33 | | Yuzhen Liu, Weifa Liang: Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks. WWIC 2008: 201-212 |
| 2007 | ||
| j29 | | 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) |
| j28 | | Zhuoyuan Tu, Weifa Liang: Energy-Efficient Aggregate Query Evaluation in Wireless Sensor Networks. Ad Hoc & Sensor Wireless Networks 3(1): 55-75 (2007) |
| j27 | | Weifa Liang, Yuzhen Liu: Online Data Gathering for Maximizing Network Lifetime in Sensor Networks. IEEE Trans. Mob. Comput. 6(1): 2-11 (2007) |
| c32 | | Weifa Liang, Yuzhen Liu: Online broadcasting and multicasting in WDM networks with shared light splitter bank. BROADNETS 2007: 504-513 |
| c31 | | Yuzhen Liu, Weifa Liang: Online Multicasting in WDM Networks with Shared Light Splitter Bank. Networking 2007: 958-969 |
| 2006 | ||
| j26 | | Xianchao Zhang, Weifa Liang, He Jiang: Flow equivalent trees in undirected node-edge-capacitated planar graphs. Inf. Process. Lett. 100(3): 110-115 (2006) |
| j25 | | Weifa Liang: Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 5(4): 377-387 (2006) |
| j24 | | 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) |
| j23 | | 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) |
| c30 | | Arun Vishwanath, Weifa Liang: Delay Constrained Traffic Grooming in WDM Ring Networks. LCN 2006: 443-450 |
| 2005 | ||
| j22 | | Weifa Liang, Xiaojun Shen: Finding multiple routing paths in wide-area WDM networks. Computer Communications 28(7): 811-818 (2005) |
| j21 | | Yingyu Wan, Weifa Liang: On the minimum number of wavelengths in multicast trees in WDM networks. Networks 45(1): 42-48 (2005) |
| c29 | | Weifa Liang: Minimizing energy and maximizing network lifetime multicasting in wireless ad hoc networks. ICC 2005: 3375-3379 |
| c28 | | |
| c27 | | Zhuoyuan Tu, Weifa Liang: Energy-Efficient Aggregate Query Evaluation in Sensor Networks. MSN 2005: 31-41 |
| c26 | | |
| c25 | | Arun Vishwanath, Weifa Liang: On-Line Routing in WDM-TDM Switched Optical Mesh Networks. PDCAT 2005: 215-219 |
| c24 | | Weifa Liang, Yuzhen Liu, Xiaoxing Guo: On-line disjoint path routing for network capacity maximization in ad hoc networks. WCNC 2005: 2026-2031 |
| 2004 | ||
| c23 | | |
| c22 | | Weifa Liang, Yang Yuansheng: Maximizing Battery Life Routing in Wireless Ad Hoc Networks. HICSS 2004 |
| c21 | | Weifa Liang: Constructing Multiple Light Multicast Trees in WDM Optical Networks. ISPAN 2004: 482-488 |
| c20 | | Yingyu Wan, Weifa Liang: Wavelength Rerouting for On-line Multicast in WDM Networks. LCN 2004: 352-359 |
| 2003 | ||
| j20 | | 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 | ||
| c19 | | Weifa Liang, Xiaojun Shen: Finding Multiple Routing Paths in Wide-Area WDM Networks. ICPP Workshops 2002: 199-206 |
| c18 | | Weifa Liang: Constructing minimum-energy broadcast trees in wireless ad hoc networks. MobiHoc 2002: 112-122 |
| c17 |  | Weifa Liang, Jeffrey Xu Yu: Parallel Maintenance of Materialized Views on Personal Computer Clusters. IASTED PDCS 2002: 175-179 |
| 2001 | ||
| j19 | | Yijie Han, Weifa Liang, Xiaojun Shen: Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics 108(3): 227-238 (2001) |
| j18 | | 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) |
| j17 | | Weifa Liang, Hui Wang, Maria E. Orlowska: Materialized view selection under the maintenance time constraint. Data Knowl. Eng. 37(2): 203-216 (2001) |
| j16 | | 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) |
| c16 | | |
| c15 | | |
| 2000 | ||
| j15 | | Weifa Liang, Hui Wang, Maria E. Orlowska: Range queries in dynamic OLAP data cubes. Data Knowl. Eng. 34(1): 21-38 (2000) |
| j14 | | Weifa Liang, Maria E. Orlowska: Computing Multidimensional Aggregates in Parallel. Informatica (Slovenia) 24(1) (2000) |
| j13 | | Weifa Liang, Xiaojun Shen: Improved lightpath (wavelength) routing in large WDM networks. IEEE Transactions on Communications 48(9): 1571-1579 (2000) |
| j12 | | Weifa Liang, Maria E. Orlowska, Jeffrey Xu Yu: Optimizing Multiple Dimensional Queries Simultaneously in Multidimensional Databases. VLDB J. 8(3-4): 319-338 (2000) |
| c14 | | Weifa Liang, Maria E. Orlowska: Optimizing Processing of Query Subscription in an WDM Network Environment . ITCC 2000: 510-515 |
| c13 | | Weifa Liang, Chris Johnson, Jeffrey Xu Yu: Maintaining Materialized Views for Data Warehouses with Multiple Remote Sources. Web-Age Information Management 2000: 299-310 |
| 1999 | ||
| j11 | | 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) |
| j10 | | 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) |
| c12 | | Hui Wang, Maria E. Orlowska, Weifa Liang: Efficient Refreshment of Materialized Views with Multiple Sources. CIKM 1999: 375-382 |
| c11 | | Weifa Liang, Xiaojun Shen: Permutation Routing in All-Optical Product Networks. IPPS/SPDP Workshops 1999: 831-844 |
| c10 | | Weifa Liang, Brendan D. McKay: An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation. ISPAN 1999: 290-295 |
| 1998 | ||
| c9 | | Weifa Liang, George Havas: Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. CATS 1998: 37-50 |
| c8 | | Weifa Liang, George Havas, Xiaojun Shen: Improved Lightpath (Wavelength) Routing in Large WDM Networks. ICDCS 1998: 516-523 |
| c7 | | Weifa Liang, Maria E. Orlowska: Computing Multidimensional Aggregates in Parallel. ICPADS 1998: 92-99 |
| c6 | | Weifa Liang, Hong Shen: Multicasting and Broadcasting in Large WDM Networks. IPPS/SPDP 1998: 365-369 |
| 1997 | ||
| j9 | | Weifa Liang, Xiaojun Shen: Finding the k Most Vital Edges in the Minimum Spanning Tree Problem. Parallel Computing 23(13): 1889-1907 (1997) |
| j8 | | Xiaojun Shen, Weifa Liang, Qing Hu: On Embedding Between 2D Meshes of the Same Size. IEEE Trans. Computers 46(8): 880-889 (1997) |
| j7 | | Hong Shen, Weifa Liang: Efficient Enumeration of all Minimal Separators in a Graph. Theor. Comput. Sci. 180(1-2): 169-180 (1997) |
| c5 | | Weifa Liang, George Havas: NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. Euro-Par 1997: 430-439 |
| 1996 | ||
| j6 | | 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) |
| j5 | | 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) |
| j4 | | 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) |
| c4 | | |
| 1995 | ||
| j3 | | Weifa Liang: Fast Parallel Algorithms for the Approximate Edge-Coloring Problem. Inf. Process. Lett. 55(6): 333-338 (1995) |
| j2 | | Xiaojun Shen, Qing Hu, Weifa Liang: Embedding K-ary Complete Trees into Hypercubes. J. Parallel Distrib. Comput. 24(1): 100-106 (1995) |
| 1994 | ||
| j1 | | Xiaojun Shen, Qing Hu, Weifa Liang: Realization of an Arbitrary Permutation on a Hypercube. Inf. Process. Lett. 51(5): 237-243 (1994) |
| c3 | | Xiaojun Shen, Qing Hu, Weifa Liang: Efficient Embedding K-ary Complete Trees into Hypercubes. IPPS 1994: 710-714 |
| 1993 | ||
| c2 | | Xiaojun Shen, Weifa Liang: A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees. IPPS 1993: 310-317 |
| c1 | | Weifa Liang, Qing Hu, Xiaojun Shen: Embedding Between 2-D Meshes of the Same Size. SPDP 1993: 712-719 |
Colors in the list of coauthors
Last update Sat May 25 10:17:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page