Suman Banerjee
Orcid: 0000-0003-1761-5944Affiliations:
- IIT Jammu, India
- IIT Gandhinagar, India (former)
- IIT Kharagpur, India (former)
According to our database1,
Suman Banerjee
authored at least 56 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A two-phase approach for enumeration of maximal (Δ , γ )-cliques of a temporal network.
Soc. Netw. Anal. Min., December, 2024
A co-operative game theoretic approach for the budgeted influence maximization problem.
Soc. Netw. Anal. Min., December, 2024
Expert Syst. Appl., March, 2024
CoRR, 2024
Proceedings of the Web Information Systems Engineering - WISE 2024, 2024
Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing, 2024
Proceedings of the Databases Theory and Applications, 2024
Proceedings of the Databases Theory and Applications, 2024
Proceedings of the Advances in Databases and Information Systems, 2024
2023
CoRR, 2023
Influential Billboard Slot Selection using Spatial Clustering and Pruned Submodularity Graph.
CoRR, 2023
Cost and Reliability Aware Scheduling of Workflows Across Multiple Clouds with Security Constraints.
CoRR, 2023
CEDCES: A Cost Effective Deadline Constrained Evolutionary Scheduler for Task Graphs in Multi-Cloud System.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023
A Makespan and Energy-Aware Scheduling Algorithm for Workflows under Reliability Constraint on a Multiprocessor Platform.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023
WANMS: A Makespan, Energy, and Reliability Aware Scheduling Algorithm for Workflow Scheduling in Multi-processor Systems.
Proceedings of the Distributed Computing and Intelligent Technology, 2023
Proceedings of the 15th International Conference on COMmunication Systems & NETworkS, 2023
Fairness Driven Efficient Algorithms for Sequenced Group Trip Planning Query Problem.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
Proceedings of the Advanced Data Mining and Applications - 19th International Conference, 2023
Influence Maximization with Tag Revisited: Exploiting the Bi-submodularity of the Tag-Based Influence Function.
Proceedings of the Advanced Data Mining and Applications - 19th International Conference, 2023
Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
An efficient updation approach for enumerating maximal (Δ, <i>γ</i>)-cliques of a temporal network.
J. Complex Networks, August, 2022
Soc. Netw. Anal. Min., 2022
Theory Comput. Syst., 2022
An approximate marginal spread computation approach for the budgeted influence maximization with delay.
Computing, 2022
Proceedings of the Advances in Network-Based Information Systems, 2022
Proceedings of the Distributed Computing and Intelligent Technology, 2022
Proceedings of the Advanced Data Mining and Applications - 18th International Conference, 2022
Proceedings of the Advanced Data Mining and Applications - 18th International Conference, 2022
Proceedings of the Recent Challenges in Intelligent Information and Database Systems, 2022
2021
Designing and connectivity checking of implicit social networks from the user-item rating data.
Multim. Tools Appl., 2021
A multistep priority-based ranking for top-N recommendation using social and tag information.
J. Ambient Intell. Humaniz. Comput., 2021
Expert Syst. Appl., 2021
Proceedings of the Web Information Systems Engineering - WISE 2021, 2021
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
Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021
2020
Maximizing the earned benefit in an incentivized social networking environment: a community-based approach.
J. Ambient Intell. Humaniz. Comput., 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
Proceedings of the Web Information Systems Engineering - WISE 2020, 2020
Proceedings of the Web Information Systems Engineering - WISE 2020, 2020
2019
ComBIM: A community-based solution approach for the Budgeted Influence Maximization Problem.
Expert Syst. Appl., 2019
Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2019
Maximizing the Earned Benefit in an Incentivized Social Networking Environment: An Integer Programming-Based Approach.
Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2019
2018
An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs.
CoRR, 2018
A Priority-Based Ranking Approach for Maximizing the Earned Benefit in an Incentivized Social Network.
Proceedings of the Intelligent Systems Design and Applications, 2018
Proceedings of the 2018 Eleventh International Conference on Contemporary Computing, 2018
2017
Proceedings of the Tenth International Conference on Contemporary Computing, 2017