| Publication | Date of Publication | Type |
|---|
Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks
Information Sciences | 2024-03-06 | Paper |
Affinity-Aware VNF Placement in Mobile Edge Clouds via Leveraging GPUs
IEEE Transactions on Computers | 2022-03-24 | Paper |
Identifying structural hole spanners to maximally block information propagation
Information Sciences | 2021-03-16 | Paper |
Finding top-\(k\) influential users in social networks under the structural diversity model
Information Sciences | 2019-12-13 | Paper |
Permutation routing in all-optical product networks
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications | 2017-08-25 | Paper |
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
IEEE Transactions on Computers | 2017-07-12 | Paper |
Approximation Algorithms for Min-Max Cycle Cover Problems
IEEE Transactions on Computers | 2017-05-16 | Paper |
Data Collection Maximization in Renewable Sensor Networks via Time-Slot Scheduling
IEEE Transactions on Computers | 2017-05-16 | Paper |
Flow equivalent trees in undirected node-edge-capacitated planar graphs
Information Processing Letters | 2010-01-29 | Paper |
Safety, domain independence and translation of complex value database queries
Information Sciences | 2009-10-30 | Paper |
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science | 2009-01-08 | Paper |
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Lecture Notes in Computer Science | 2008-07-10 | Paper |
On the minimum number of wavelengths in multicast trees in WDM networks
Networks | 2005-02-23 | Paper |
Optimally routing LC permutations on k-extra-stage cube-type networks
IEEE Transactions on Computers | 2003-11-02 | Paper |
The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\)
Discrete Mathematics | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1832302 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1760036 (Why is no real title available?) | 2002-11-06 | Paper |
Making multiple views self-maintainable in a data warehouse
Data & Knowledge Engineering | 2002-07-29 | Paper |
Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
Discrete Applied Mathematics | 2002-01-08 | Paper |
Very fast parallel algorithms for approximate edge coloring
Discrete Applied Mathematics | 2001-09-03 | Paper |
Materialized view selection under the maintenance time constraint
Data & Knowledge Engineering | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1439499 (Why is no real title available?) | 2001-05-08 | Paper |
Range queries in dynamic OLAP data cubes
Data & Knowledge Engineering | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1444314 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1304053 (Why is no real title available?) | 1999-11-10 | Paper |
Finding the k most vital edges in the minimum spanning tree problem
Parallel Computing | 1998-08-13 | Paper |
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science | 1998-07-22 | Paper |
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 930624 (Why is no real title available?) | 1996-11-10 | Paper |
Parallel algorithms for the edge-coloring and edge-coloring update problems
Journal of Parallel and Distributed Computing | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 123468 (Why is no real title available?) | 1993-02-18 | Paper |
| scientific article; zbMATH DE number 24457 (Why is no real title available?) | 1992-06-26 | Paper |
