Ricky Laishram

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 13

Top Topics

Community Structure

Directed Networks

Top Venues

Publications

Danylo Honcharov, Ahmet Erdem Sariyüce, Ricky Laishram, Sucheta Soundarajan
Skeletal Cores and Graph Resilience. ECML/PKDD (3) (2023)
Ricky Laishram, Sucheta Soundarajan
On Finding and Analyzing the Backbone of the k-Core Structure of a Graph. ICDM (2022)
Ricky Laishram, Jeremy D. Wendt, Sucheta Soundarajan
MCS+: An Efficient Algorithm for Crawling the Community Structure in Multiplex Networks. ACM Trans. Knowl. Discov. Data 16 (1) (2022)
Ricky Laishram, Pegah Hozhabrierdi, Jeremy D. Wendt, Sucheta Soundarajan
NetProtect: Network Perturbations to Protect Nodes against Entry-Point Attack. WebSci (2021)
Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
-Core. SDM (2020)
Ricky Laishram, Jeremy D. Wendt, Sucheta Soundarajan
Crawling the Community Structure of Multiplex Networks. AAAI (2019)
Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
Measuring and Improving the Core Resilience of Networks. WWW (2018)
Katchaguy Areekijseree, Ricky Laishram, Sucheta Soundarajan
Guidelines for Online Network Crawling: A Study of Data Collection Approaches and Network Properties. WebSci (2018)
Ricky Laishram, Katchaguy Areekijseree, Sucheta Soundarajan
Predicted max degree sampling: Sampling in directed networks to maximize node coverage through crawling. INFOCOM Workshops (2017)
Ricky Laishram, Kishan G. Mehrotra, Chilukuri K. Mohan
Link Prediction in Social Networks with Edge Aging. ICTAI (2016)
Ricky Laishram, Vir Virander Phoha
Curie: A method for protecting SVM Classifier from Poisoning Attack. CoRR (2016)
Katchaguy Areekijseree, Ricky Laishram, Sucheta Soundarajan
Max-node sampling: An expansion-densification algorithm for data collection. IEEE BigData (2016)
Ricky Laishram, Katchaguy Areekijseree, Sucheta Soundarajan
Predicted max degree sampling: Sampling in directed networks to maximize node coverage through crawling. IEEE BigData (2016)