Bithika Pal

Orcid: 0000-0002-2177-9776

According to our database1, Bithika Pal authored at least 22 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A two-phase approach for enumeration of maximal (Δ , γ )-cliques of a temporal network.
Soc. Netw. Anal. Min., December, 2024

Combating COVID-19 by placing facilities maintaining social distancing.
Expert Syst. Appl., March, 2024

A Recursive Approach for Maximal ($\varDelta , \gamma $)-Clique Enumeration in Temporal Networks.
Proceedings of the Advances in Databases and Information Systems, 2024

2022
An efficient updation approach for enumerating maximal (Δ, <i>γ</i>)-cliques of a temporal network.
J. Complex Networks, August, 2022

Budgeted influence and earned benefit maximization with tags in social networks.
Soc. Netw. Anal. Min., 2022

A Study on the Ramanujan Graph Property of Winning Lottery Tickets.
Proceedings of the International Conference on Machine Learning, 2022

2021
A multistep priority-based ranking for top-N recommendation using social and tag information.
J. Ambient Intell. Humaniz. Comput., 2021

Updating Maximal $(\varDelta , \gamma )$-Cliques of a Temporal Network Efficiently.
Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

NIP-GCN: An Augmented Graph Convolutional Network with Node Interaction Patterns.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

A Social Distancing-Based Facility Location Approach for Combating COVID-19.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

A Two-Phase Approach for Enumeration of Maximal $(\varDelta , \gamma )$-Cliques of a Temporal Network.
Proceedings of the Database and Expert Systems Applications, 2021

2020
An Efficient Updation Approach for Enumerating Maximal (Δ, γ)-Cliques of a Temporal Network.
CoRR, 2020

First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal $(Δ, γ)$\mbox{-}Cliques of a Temporal Network.
CoRR, 2020

DySky: Dynamic Skyline Queries on Uncertain Graphs.
CoRR, 2020

DySky: Dynamic Skyline Queries on Uncertain Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2020, 2020

Budgeted Influence Maximization with Tags in Social Networks.
Proceedings of the Web Information Systems Engineering - WISE 2020, 2020

Personalized Ranking in Collaborative Filtering: Exploiting l-th Order Transitive Relations of Social Ties.
Proceedings of the CoDS-COMAD 2020: 7th ACM IKDD CoDS and 25th COMAD, 2020

2019
Trust inference using implicit influence and projected user network for item recommendation.
J. Intell. Inf. Syst., 2019

On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network.
Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2019

2018
Kernelized probabilistic matrix factorization for collaborative filtering: exploiting projected user and item graph.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Threshold-Based Heuristics for Trust Inference in a Social Network.
Proceedings of the 2018 Eleventh International Conference on Contemporary Computing, 2018

2017
Trust Inference Using Implicit Influence for Item Recommendation.
Proceedings of the 13th International Conference on Signal-Image Technology & Internet-Based Systems, 2017


  Loading...