• Publications
  • Influence
Profit maximization for multiple products in online social networks
TLDR
We investigate a Profit Maximization with Multiple Adoptions (PM2A) problem, which aims at maximizing the overall profit across all products. Expand
  • 38
  • 6
Rate alteration attacks in smart grid
TLDR
We define a novel problem of rate alteration attacks in the Smart Grid and show the hardness of the problem and inapproximability. Expand
  • 21
  • 2
  • PDF
Scalable bicriteria algorithms for the threshold activation problem in online social networks
TLDR
We consider the Threshold Activation Problem (TAP): given social network G and positive threshold T, find a minimum-size seed set that can trigger expected activation of at least T. Expand
  • 17
  • 2
  • PDF
An Approximately Optimal Bot for Non-Submodular Social Reconnaissance
TLDR
We address this limitation with a novel curvature based technique, showing that an adaptive greedy bot is approximately optimal within a factor of 1 - 1/e1/δ ~0.165. Expand
  • 3
  • 2
Recoloring the Colored de Bruijn Graph
TLDR
We show that finding the minimum number of colors needed for recoloring is not only NP-hard but also, difficult to approximate within a reasonable factor. Expand
  • 8
  • 1
Price Modification Attack and Protection Scheme in Smart Grid
TLDR
In this paper, we study the problem of price modification attack (PMA) through fabrication of price messages, which induces changes in load profiles of individual users. Expand
  • 12
  • 1
  • PDF
Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time
  • A. Kuhnle
  • Computer Science, Mathematics
  • NeurIPS
  • 1 February 2019
TLDR
A deterministic approximation algorithm is presented for the maximization of non-monotone submodular functions over a ground set of size $n$ subject to cardinality constraint $k$. Expand
  • 10
  • 1
  • PDF
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
  • A. Kuhnle
  • Computer Science, Mathematics
  • ArXiv
  • 3 September 2020
TLDR
We study parallelizable algorithms for maximization of a submodular function, not necessarily monotone, with respect to a cardinality constraint $k$. Expand
  • 2
  • 1
  • PDF
Space-Efficient and Dynamic Caching for D2D Networks of Heterogeneous Users
TLDR
We propose a dynamic approach to cellular device caching where files are cached or uncached dynamically as file popularity evolves Dynamic caching motivates a space-efficient optimization problem Minimum File Placement. Expand
  • 2
  • 1
Multiplex Influence Maximization in Online Social Networks With Heterogeneous Diffusion Models
TLDR
We study the influence maximization problem on a multiplex, with each layer endowed with its own model of influence diffusion. Expand
  • 23
  • PDF
...
1
2
3
4
5
...