A. Arora, S. Galhotra, and S. Ranu, Debunking the myths of influence maximization: An in-depth benchmarking study, SIGMOD, pp.651-666, 2017.

C. Borgs, M. Brautbar, J. Chayes, and B. Lucier, Maximizing social influence in nearly optimal time, SODA, pp.946-957, 2014.

W. Chen, C. Wang, and Y. Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks, SGKDD, pp.1029-1038, 2010.

W. Chen, Y. Wang, and S. Yang, Efficient influence maximization in social networks, SIGKDD, pp.199-208, 2009.

W. Chen, Y. Yuan, and L. Zhang, Scalable Influence Maximization in Social Networks under the Linear Threshold Model, ICDM, pp.88-97, 2010.

S. Cheng, H. Shen, J. Huang, W. Chen, and X. Cheng, IMRank: influence maximization via finding self-consistent ranking, SIGIR, pp.475-484, 2014.

S. Cheng, H. Shen, J. Huang, G. Zhang, and X. Cheng, Static greedy: solving the apparent scalability-accuracy dilemma in influence maximization, 2012.

E. Cohen, D. Delling, T. Pajor, and R. F. Werneck, Sketch-based Influence Maximization and Computation: Scaling up with Guarantees, CIKM, pp.629-638, 2014.

P. Domingos and M. Richardson, Mining the network value of customers, SIGKDD, pp.57-66, 2001.

S. Galhotra, A. Arora, and S. Roy, Holistic influence maximization: Combining scalability and efficiency with opinion-aware models, SIGMOD, pp.743-758, 2016.

S. Galhotra, A. Arora, S. Virinchi, and S. Roy, ASIM: A Scalable Algorithm for Influence Maximization under the Independent Cascade Model, pp.35-36, 2015.

A. Goyal, F. Bonchi, and L. V. Lakshmanan, Learning influence probabilities in social networks, WSDM, pp.241-250, 2010.

A. Goyal, W. Lu, and L. V. Lakshmanan, CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks, pp.47-48, 2011.

A. Goyal, W. Lu, and L. V. Lakshmanan, SIMPATH: an efficient algorithm for influence maximization under the linear threshold model, ICDM, pp.211-220, 2011.

K. Jung, W. Heo, and W. Chen, Irie: Scalable and robust influence maximization in social networks, ICDM, pp.918-923, 2012.

D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, SIGKDD, pp.137-146, 2003.

J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, C. Faloutsos et al., Cost-effective outbreak detection in networks, SIGKDD, pp.420-429, 2007.

P. H. Leslie, On the Use of Matrices in Certain Population Mathematics, vol.33, pp.183-212, 1945.

Y. Li, D. Zhang, and K. L. Tan, Real-time targeted influence maximization for online advertisements, PVLDB, vol.8, issue.10, pp.1070-1081, 2015.

B. B. Mandelbrot, The fractal geometry of nature, vol.1, 1982.

N. , A. Bhattacharya, and S. , Influence maximization in large social networks: Heuristics, models and parameters, Future Gene. Comp. Syst, vol.89, pp.777-790, 2018.

G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, An analysis of approximations for maximizing submodular set functions, Mathematical Prog, vol.14, issue.1, pp.265-294, 1978.

N. Ohsaka, T. Akiba, Y. Yoshida, and K. Kawarabayashi, Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations, pp.138-144, 2014.

S. Spencer, J. O'connell, and M. Greene, The arrival of real-time bidding, 2011.

Y. Tang, Y. Shi, and X. Xiao, Influence maximization in near-linear time: A martingale approach, SIGMOD, pp.1539-1554, 2015.

Y. Tang, X. Xiao, and Y. Shi, Influence maximization: Near-optimal time complexity meets practical efficiency, SIGMOD, pp.75-86, 2014.

S. Yuan, J. Wang, and X. Zhao, Real-time Bidding for Online Advertising: Measurement and Analysis, 2013.

M. Zhang, C. Dai, C. Ding, and E. Chen, Probabilistic solutions of influence propagation on social networks, CIKM, pp.429-438, 2013.