The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Weifa Liang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  54. Online broadcasting and multicasting in WDM networks with shared light splitter bank. [Citation Graph (, )][DBLP]


  55. Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. [Citation Graph (, )][DBLP]


  56. Energy-efficient skyline query processing and maintenance in sensor networks. [Citation Graph (, )][DBLP]


  57. Progressive skyline query evaluation and maintenance in wireless sensor networks. [Citation Graph (, )][DBLP]


  58. Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. [Citation Graph (, )][DBLP]


  59. Response Time Constrained Top-k Query Evaluation in Sensor Networks. [Citation Graph (, )][DBLP]


  60. Delay Constrained Traffic Grooming in WDM Ring Networks. [Citation Graph (, )][DBLP]


  61. Online Time Interval Top-k Queries in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  62. Progressive Skyline Query Processing in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  63. Online Multicasting in WDM Networks with Shared Light Splitter Bank. [Citation Graph (, )][DBLP]


  64. Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks. [Citation Graph (, )][DBLP]


  65. Prolonging Network Lifetime for Target Coverage in Sensor Networks. [Citation Graph (, )][DBLP]


  66. Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks. [Citation Graph (, )][DBLP]


  67. Prolonging network lifetime through the use of mobile base station in wireless sensor networks. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.026secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002