| Publication | Date of Publication | Type |
|---|
Influence analysis: A survey of the state-of-the-art
Mathematical Foundations of Computing | 2022-03-07 | Paper |
On the complexity and approximability of repair position selection problem
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
| How hard is completeness reasoning for conjunctive queries? | 2021-04-21 | Paper |
Parameterized complexity of completeness reasoning for conjunctive queries
Theoretical Computer Science | 2021-04-08 | Paper |
Triangle edge deletion on planar glasses-free RGB-digraphs
Theoretical Computer Science | 2019-08-09 | Paper |
Vertex cover in conflict graphs
Theoretical Computer Science | 2019-06-25 | Paper |
SEF view deletion under bounded condition
Theoretical Computer Science | 2018-12-05 | Paper |
| Repair position selection for inconsistent data | 2018-02-26 | Paper |
On the complexity of bounded deletion propagation
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Efficient respondents selection for biased survey using homophily-high social relation graph
Discrete Mathematics, Algorithms and Applications | 2016-12-14 | Paper |
(, )-monitoring for event detection in wireless sensor networks
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Approximate event detection over multi-modal sensing data
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Minimum-latency aggregation scheduling in wireless sensor network
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Neighborhood-based uncertainty generation in social networks
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Computing an effective decision making group of a society using social network analysis
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Continuous data aggregation and capacity in probabilistic wireless sensor networks
Journal of Parallel and Distributed Computing | 2014-04-02 | Paper |
A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Generating uncertain networks based on historical network snapshots
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
A framework of distributed indexing and data dissemination in large scale wireless sensor networks
Optimization Letters | 2010-10-04 | Paper |
Efficient distributed algorithms for topology control problem with shortest path constraints
Discrete Mathematics, Algorithms and Applications | 2010-03-11 | Paper |
DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS
Discrete Mathematics, Algorithms and Applications | 2009-11-19 | Paper |
Design and analysis of a self-tuning feedback controller for the internet
Computer Networks | 2009-10-28 | Paper |
Optimization scheme for sensor coverage scheduling with bandwidth constraints
Optimization Letters | 2009-02-17 | Paper |
Designing k-coverage schedules in wireless sensor networks
Journal of Combinatorial Optimization | 2008-05-13 | Paper |
On error-tolerant DNA screening
Discrete Applied Mathematics | 2006-08-14 | Paper |
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science | 2006-03-24 | Paper |
A note on optical network with nonsplitting nodes
Journal of Combinatorial Optimization | 2006-02-08 | Paper |
| scientific article; zbMATH DE number 2209521 (Why is no real title available?) | 2005-09-28 | Paper |
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science | 2005-02-09 | Paper |
Efficient aggregation algorithms on very large compressed data warehouses
Journal of Computer Science and Technology | 2001-10-01 | Paper |
Spaces of (OP) type and spectral operators
Journal of Harbin Institute of Technology | 2001-09-20 | Paper |
