| Publication | Date of Publication | Type |
|---|
Friending
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
Black-Box and Data-Driven Computation
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems | 2021-09-30 | Paper |
Toward optimal community detection: from trees to general weighted networks
Internet Mathematics | 2021-04-26 | Paper |
Minimum budget for misinformation blocking in online social networks
Journal of Combinatorial Optimization | 2019-12-13 | Paper |
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
Journal of Global Optimization | 2019-10-01 | Paper |
Maximizing misinformation restriction within time and budget constraints
Journal of Combinatorial Optimization | 2018-05-24 | Paper |
Online set multicover algorithms for dynamic D2D communications
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
Robustness of power-law networks: its assessment and optimization
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
Catastrophic cascading failures in power networks
Theoretical Computer Science | 2015-12-11 | Paper |
Optimal packet scan against malicious attacks in smart grids
Theoretical Computer Science | 2015-12-11 | Paper |
A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Approximation algorithms for optimization problems in random power-law graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Cascading critical nodes detection with load redistribution in complex systems
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Optimal inspection points for malicious attack detection in smart grids
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Bound and exact methods for assessing link vulnerability in complex networks
Journal of Combinatorial Optimization | 2014-09-05 | Paper |
Staying safe and visible via message sharing in online social networks
Journal of Combinatorial Optimization | 2014-09-05 | Paper |
On the approximability of positive influence dominating set in social networks
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
A cutting-plane algorithm for solving a weighted influence interdiction problem
Computational Optimization and Applications | 2014-02-25 | Paper |
On Detection of Community Structure in Dynamic Social Networks
Handbook of Optimization in Complex Networks | 2012-09-28 | Paper |
Hardness complexity of optimal substructure problems on power-law graphs
Handbook of Optimization in Complex Networks | 2012-09-27 | Paper |
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science | 2012-08-13 | Paper |
Exploiting the robustness on power-law networks
Lecture Notes in Computer Science | 2011-08-17 | Paper |
| scientific article; zbMATH DE number 5899441 (Why is no real title available?) | 2011-05-24 | Paper |
On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
On approximation of dominating tree in wireless sensor networks
Optimization Letters | 2010-10-04 | Paper |
On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
Journal of Combinatorial Optimization | 2009-08-06 | Paper |
Optimization scheme for sensor coverage scheduling with bandwidth constraints
Optimization Letters | 2009-02-17 | Paper |
On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
Theoretical Computer Science | 2007-10-18 | Paper |
Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
A note on optical network with nonsplitting nodes
Journal of Combinatorial Optimization | 2006-02-08 | Paper |
An approximation for minimum multicast route in optical networks with nonsplitting nodes
Journal of Combinatorial Optimization | 2006-01-13 | Paper |
MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization
(available as arXiv preprint) | N/A | Paper |
