Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSourav Medya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Kartik Sharma, Samidha Verma, Sourav Medya, Arnab Bhattacharya, Sayan Ranu:
Task and Model Agnostic Adversarial Attack on Graph Neural Networks. AAAI 2023: 15091-15099- [c15]Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-clustering. AAMAS 2023: 2772-2774 - [c14]Zexi Huang
, Mert Kosan, Sourav Medya, Sayan Ranu, Ambuj K. Singh:
Global Counterfactual Explainer for Graph Neural Networks. WSDM 2023: 141-149 - [i23]Zhu Wang, Sourav Medya, Sathya N. Ravi:
Differentiable Outlier Detection Enable Robust Deep Multimodal Analysis. CoRR abs/2302.05608 (2023) - [i22]Jaykumar Kakkad, Jaspal Jannu, Kartik Sharma, Charu C. Aggarwal, Sourav Medya:
A Survey on Explainability of Graph Neural Networks. CoRR abs/2306.01958 (2023) - [i21]Samidha Verma, Burouj Armgaan, Sourav Medya, Sayan Ranu:
Empowering Counterfactual Reasoning over Graph Neural Networks through Inductivity. CoRR abs/2306.04835 (2023) - [i20]Mert Kosan, Samidha Verma, Burouj Armgaan, Khushbu Pahwa, Ambuj K. Singh, Sourav Medya, Sayan Ranu:
GNNX-BENCH: Unravelling the Utility of Perturbation-based GNN Explainers through In-depth Benchmarking. CoRR abs/2310.01794 (2023) - [i19]Rishi Shah, Krishnanshu Jain, Sahil Manchanda, Sourav Medya, Sayan Ranu:
NeuroCUT: A Neural Approach for Robust Graph Partitioning. CoRR abs/2310.11787 (2023) - 2022
- [j4]Sourav Medya, Arlei Silva, Ambuj K. Singh:
Approximate Algorithms for Data-Driven Influence Limitation. IEEE Trans. Knowl. Data Eng. 34(6): 2641-2652 (2022) - [c13]Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Sayan Ranu:
GREED: A Neural Framework for Learning Graph Distance Functions. NeurIPS 2022 - [c12]Sourav Medya, Mohammad Rasoolinejad, Yang Yang, Brian Uzzi:
An Exploratory Study of Stock Price Movements from Earnings Calls. WWW (Companion Volume) 2022: 20-31 - [i18]Wei Ye, Jiayi Yang, Sourav Medya, Ambuj K. Singh:
Incorporating Heterophily into Graph Neural Networks for Graph Classification. CoRR abs/2203.07678 (2022) - [i17]Sourav Medya, Mohammad Rasoolinejad, Yang Yang, Brian Uzzi:
An Exploratory Study of Stock Price Movements from Earnings Calls. CoRR abs/2203.12460 (2022) - [i16]Mert Kosan, Zexi Huang, Sourav Medya, Sayan Ranu, Ambuj K. Singh:
Global Counterfactual Explainer for Graph Neural Networks. CoRR abs/2210.11695 (2022) - 2021
- [j3]Debmalya Mandal, Sourav Medya, Brian Uzzi, Charu Aggarwal:
MetaLearning with Graph Neural Networks: Methods and Applications. SIGKDD Explor. 23(2): 13-22 (2021) - [c11]Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva:
Network Robustness via Global k-cores. AAMAS 2021: 438-446 - [c10]Kartik Sharma, Iqra Altaf Gillani, Sourav Medya, Sayan Ranu, Amitabha Bagchi:
Balance Maximization in Signed Networks via Edge Deletions. WSDM 2021: 752-760 - [i15]Debmalya Mandal, Sourav Medya, Brian Uzzi, Charu Aggarwal:
Meta-Learning with Graph Neural Networks: Methods and Applications. CoRR abs/2103.00137 (2021) - [i14]Debajyoti Kar, Sourav Medya, Debmalya Mandal, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-Clustering. CoRR abs/2109.04554 (2021) - [i13]Mert Kosan, Arlei Silva, Sourav Medya, Brian Uzzi, Ambuj K. Singh:
Event Detection on Dynamic Graphs. CoRR abs/2110.12148 (2021) - [i12]Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Sayan Ranu:
A Neural Framework for Learning Subgraph and Graph Similarity Measures. CoRR abs/2112.13143 (2021) - [i11]Kartik Sharma, Samidha Verma, Sourav Medya, Sayan Ranu, Arnab Bhattacharya:
Task and Model Agnostic Adversarial Attack on Graph Neural Networks. CoRR abs/2112.13267 (2021) - 2020
- [c9]Palash Dey, Sourav Medya:
Manipulating Node Similarity Measures in Networks. AAMAS 2020: 321-329 - [c8]Sourav Medya, Tianyi Ma, Arlei Silva, Ambuj K. Singh:
A Game Theoretic Approach For k-Core Minimization. AAMAS 2020: 1922-1924 - [c7]Sourav Medya, Tiyani Ma, Arlei Silva, Ambuj K. Singh:
A Game Theoretic Approach For Core Resilience. IJCAI 2020: 3473-3479 - [c6]Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, Ambuj K. Singh:
GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized Graphs. NeurIPS 2020 - [i10]Kartik Sharma, Iqra Altaf Gillani, Sourav Medya, Sayan Ranu, Amitabha Bagchi:
Balance Maximization in Signed Networks via Edge Deletions. CoRR abs/2010.10991 (2020) - [i9]Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva:
Network Robustness via Global k-cores. CoRR abs/2012.10036 (2020) - [i8]Yu-Wen Chen, Sourav Medya, Yi-Chun Chen:
Investigating the Ground-level Ozone Formation and Future Trend in Taiwan. CoRR abs/2012.10058 (2020)
2010 – 2019
- 2019
- [b1]Sourav Medya:
Scalable Algorithms for Network Design. University of California, Santa Barbara, USA, 2019 - [c5]Palash Dey, Sourav Medya:
Covert Networks: How Hard is It to Hide? AAMAS 2019: 628-637 - [i7]Sourav Medya, Arlei Silva, Ambuj K. Singh:
Influence Minimization Under Budget and Matroid Constraints: Extended Version. CoRR abs/1901.02156 (2019) - [i6]Sourav Medya, Tiyani Ma, Arlei Silva, Ambuj K. Singh:
K-Core Minimization: A Game Theoretic Approach. CoRR abs/1901.02166 (2019) - [i5]Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, Ambuj K. Singh:
Learning Heuristics over Large Graphs via Deep Reinforcement Learning. CoRR abs/1903.03332 (2019) - [i4]Palash Dey, Sourav Medya:
Covert Networks: How Hard is It to Hide? CoRR abs/1903.05832 (2019) - [i3]Palash Dey, Sourav Medya:
Manipulating Node Similarity Measures in Network. CoRR abs/1910.11529 (2019) - 2018
- [j2]Sourav Medya, Jithin Vachery, Sayan Ranu, Ambuj K. Singh:
Noticeable Network Delay Minimization via Node Upgrades. Proc. VLDB Endow. 11(9): 988-1001 (2018) - [j1]Sourav Medya, Petko Bogdanov, Ambuj K. Singh:
Making a Small World Smaller: Path Optimization in Networks. IEEE Trans. Knowl. Data Eng. 30(8): 1533-1546 (2018) - [c4]Sourav Medya, Arlei Silva, Ambuj K. Singh, Prithwish Basu, Ananthram Swami:
Group Centrality Maximization via Network Design. SDM 2018: 126-134 - 2017
- [c3]Sourav Medya, Ludmila Cherkasova, Ambuj K. Singh:
Predictive modeling and scalability analysis for large graph analytics. IM 2017: 63-71 - [i2]Sourav Medya, Arlei Silva, Ambuj K. Singh, Prithwish Basu, Ananthram Swami:
Maximizing Coverage Centrality via Network Design: Extended Version. CoRR abs/1702.04082 (2017) - 2016
- [c2]Sourav Medya, Petko Bogdanov, Ambuj K. Singh:
Towards Scalable Network Delay Minimization. ICDM 2016: 1083-1088 - [c1]Sourav Medya, Ludmila Cherkasova, Guilherme Magalhaes, Kivanc M. Ozonat, Chaitra Padmanabha, Jiban Sarma, Imran Sheikh:
Towards Performance and Scalability Analysis of Distributed Memory Programs on Large-Scale Clusters. ICPE 2016: 113-116 - [i1]Sourav Medya, Petko Bogdanov, Ambuj K. Singh:
Towards Scalable Network Delay Minimization. CoRR abs/1609.08228 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-28 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
