W. Liang

Available identifiers

zbMath Open liang.weifaWikidataQ102293017 ScholiaQ102293017MaRDI QIDQ170442

List of research outcomes

Publication	Date of Publication	Type
Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks	2024-03-06	Paper
Affinity-Aware VNF Placement in Mobile Edge Clouds via Leveraging GPUs	2022-03-24	Paper
Identifying structural hole spanners to maximally block information propagation	2021-03-16	Paper
Finding top-\(k\) influential users in social networks under the structural diversity model	2019-12-13	Paper
Permutation routing in all-optical product networks	2017-08-25	Paper
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink	2017-07-12	Paper
Approximation Algorithms for Min-Max Cycle Cover Problems	2017-05-16	Paper
Data Collection Maximization in Renewable Sensor Networks via Time-Slot Scheduling	2017-05-16	Paper
Flow equivalent trees in undirected node-edge-capacitated planar graphs	2010-01-29	Paper
Safety, domain independence and translation of complex value database queries	2009-10-30	Paper
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches	2009-01-08	Paper
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities	2008-07-10	Paper
On the minimum number of wavelengths in multicast trees in WDM networks	2005-02-23	Paper
Optimally routing LC permutations on k-extra-stage cube-type networks	2003-11-02	Paper
The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\)	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4778735	2002-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q4536968	2002-11-06	Paper
Making multiple views self-maintainable in a data warehouse	2002-07-29	Paper
Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)	2002-01-08	Paper
Very fast parallel algorithms for approximate edge coloring	2001-09-03	Paper
Materialized view selection under the maintenance time constraint	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4949878	2001-05-08	Paper
Range queries in dynamic OLAP data cubes	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4953343	2000-05-09	Paper
https://portal.mardi4nfdi.de/entity/Q4250737	1999-11-10	Paper
Finding the k most vital edges in the minimum spanning tree problem	1998-08-13	Paper
Efficient enumeration of all minimal separators in a graph	1998-07-22	Paper
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4894387	1996-11-10	Paper
Parallel algorithms for the edge-coloring and edge-coloring update problems	1996-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q4025253	1993-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q3982549	1992-06-26	Paper

Research outcomes over time

This page was built for person: W. Liang