Department of Computer and Information Science and Engineering,

University of Florida, Gainesville, FL

cv

My interests lie in optimization problems within complex networks, particularly problems
resulting from *network reliability*. Many such problems are NP-hard, so I am interested
in the formulation of efficient algorithms with a worst-case performance guarantee.
For approximation algorithms, efficiency is taken to mean "solvable in polynomial-time";
however, I am also interested in highly scalable algorithms capable on running on massive networks with
billions of edges and nodes. In this context, I am also interested in social networks and the propagation
or diffusion of information on them.

Here is a word cloud generated from the content of my papers:

activation algorithm approximation average clustering coefficient communication complex computation cost edge estimator exists expected external failure generalized graph greedy guarantee influence instance lemma length max model network nodes number optimal pair path performance probability problem proof propagation random removal results samples seed size social solution threshold value vertex vulnerability work

created at TagCrowd.com

- (June 2017) My paper Online set multicover algorithms for dynamic D2D communications has been published in JOCO!
- (April 2017) An extended abstract of my work Pseudo-Separation for Assessment of Structural Vulnerability of a Network is accepted to ACM SIGMETRICS 2017!
- (March 2017) My paper Vulnerability of clustering under node failure in complex networks has been published in SNAM! (link to SNAM version)
- (March 2017) Received NSF Travel grant ($1000) to IEEE INFOCOM 2017 in Atlanta, GA! There I will present my paper Scalable Bicriteria Algorithms for the Threshold Activation Problem in Online Social Networks.