Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuman Banerjee 0002
Person information
- affiliation: IIT Jammu, India
- affiliation (former): IIT Gandhinagar, India
- affiliation (former): IIT Kharagpur, India
Other persons with the same name
- Suman Banerjee — disambiguation page
- Suman Banerjee 0001
![[0000-0002-5548-8862]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5548-8862")
— University of Wisconsin-Madison, USA - Suman Banerjee 0003 — Indian Institute of Technology Madras, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Suman Banerjee, Bithika Pal, Maheswar Singha Mahapatra:
Combating COVID-19 by placing facilities maintaining social distancing. Expert Syst. Appl. 238(Part A): 121814 (2024)- [c26]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Regret Minimization in Billboard Advertisement under Zonal Influence Constraint. SAC 2024: 329-336 - [i30]Dildar Ali, Tejash Gupta, Suman Banerjee, Yamuna Prasad:
Influential Slot and Tag Selection in Billboard Advertisement. CoRR abs/2401.10601 (2024) - [i29]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Towards Regret Free Slot Allocation in Billboard Advertisement. CoRR abs/2401.16464 (2024) - [i28]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Minimizing Regret in Billboard Advertisement under Zonal Influence Constraint. CoRR abs/2402.01294 (2024) - [i27]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Influential Billboard Slot Selection under Zonal Influence Constraint. CoRR abs/2404.12913 (2024) - 2023
- [j13]Suman Banerjee, Bithika Pal:
A two-phase approach for enumeration of maximal (Δ , γ )-cliques of a temporal network. Soc. Netw. Anal. Min. 14(1): 54 (2023) - [j12]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940(Part): 209-221 (2023) - [c25]Dildar Ali, Ankit Kumar Bhagat, Suman Banerjee, Yamuna Prasad:
Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract). AAAI 2023: 16148-16149 - [c24]Atharva Tekawade, Suman Banerjee:
Dominance Maximization in Uncertain Graphs. ADMA (3) 2023: 231-246 - [c23]Atharva Tekawade, Suman Banerjee:
Influence Maximization with Tag Revisited: Exploiting the Bi-submodularity of the Tag-Based Influence Function. ADMA (1) 2023: 772-786 - [c22]Napendra Solanki, Shweta Jain, Suman Banerjee, Yayathi Pavan Kumar S:
Fairness Driven Efficient Algorithms for Sequenced Group Trip Planning Query Problem. AAMAS 2023: 86-94 - [c21]Atharva Tekawade, Suman Banerjee:
A Cost Effective Reliability Aware Scheduler for Task Graphs in Multi-Cloud System. COMSNETS 2023: 295-303 - [c20]Atharva Tekawade, Suman Banerjee:
WANMS: A Makespan, Energy, and Reliability Aware Scheduling Algorithm for Workflow Scheduling in Multi-processor Systems. ICDCIT 2023: 20-35 - [c19]Atharva Tekawade, Suman Banerjee:
CEDCES: A Cost Effective Deadline Constrained Evolutionary Scheduler for Task Graphs in Multi-Cloud System. SAC 2023: 42-44 - [c18]Suman Banerjee, Atharva Tekawade:
A Makespan and Energy-Aware Scheduling Algorithm for Workflows under Reliability Constraint on a Multiprocessor Platform. SAC 2023: 475-482 - [i26]Atherve Tekawade, Suman Banerjee:
Cost and Reliability Aware Scheduling of Workflows Across Multiple Clouds with Security Constraints. CoRR abs/2304.00313 (2023) - [i25]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Influential Billboard Slot Selection using Spatial Clustering and Pruned Submodularity Graph. CoRR abs/2305.08949 (2023) - [i24]Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan:
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR abs/2309.04346 (2023) - 2022
- [j11]Suman Banerjee, Bithika Pal:
An efficient updation approach for enumerating maximal (Δ, γ)-cliques of a temporal network. J. Complex Networks 10(5) (2022) - [j10]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
An approximate marginal spread computation approach for the budgeted influence maximization with delay. Computing 104(3): 657-680 (2022) - [j9]Suman Banerjee:
A survey on mining and analysis of uncertain graphs. Knowl. Inf. Syst. 64(7): 1653-1689 (2022) - [j8]Suman Banerjee, Rogers Mathew, Fahad Panolan:
Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. 66(5): 996-1018 (2022) - [j7]Suman Banerjee, Bithika Pal:
Budgeted influence and earned benefit maximization with tags in social networks. Soc. Netw. Anal. Min. 12(1): 21 (2022) - [c17]Mayank Singhal, Suman Banerjee:
Utility Driven Job Selection Problem on Road Networks. ACIIDS (Companion) 2022: 578-591 - [c16]Poonam Sharma, Suman Banerjee:
Profit Maximization Using Social Networks in Two-Phase Setting. ADMA (1) 2022: 173-184 - [c15]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Influential Billboard Slot Selection Using Pruned Submodularity Graph. ADMA (1) 2022: 216-230 - [c14]Suman Banerjee, Abhishek Dogra, Anurag Kumar Singh, Subhasis Bhattacharjee:
A Distributed Algorithm for Constructing an Independent Dominating Set. ICDCIT 2022: 79-95 - [c13]Mayank Singhal, Suman Banerjee:
Envy-Free Trip Planning in Group Trip Planning Query Problem. NBiS 2022: 212-223 - [c12]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. WALCOM 2022: 340-351 - [i23]Dildar Ali, Suman Banerjee, Yamuna Prasad:
Influential Billboard Slot Selection using Pruned Submodularity Graph. CoRR abs/2207.06631 (2022) - [i22]Poonam Sharma, Suman Banerjee:
Profit Maximization using Social Networks in Two-Phase Setting. CoRR abs/2207.07830 (2022) - [i21]Mayank Singhal, Suman Banerjee:
Utility Driven Job Selection Problem on Road Networks. CoRR abs/2207.07831 (2022) - [i20]Mayank Singhal, Suman Banerjee:
Envy\mbox{-}free Trip Planning in Group Trip Planning Query Problem. CoRR abs/2207.07836 (2022) - [i19]Atharva Tekawade, Suman Banerjee:
CEDCES: A Cost Effective Deadline Constrained Evolutionary Scheduler for Task Graphs in Multi-Cloud System. CoRR abs/2212.09163 (2022) - [i18]Atharva Tekawade, Suman Banerjee:
A Cost Effective Reliability Aware Scheduler for Task Graphs in Multi-Cloud System. CoRR abs/2212.09166 (2022) - [i17]Atharva Tekawade, Suman Banerjee:
A Makespan and Energy-Aware Scheduling Algorithm for Workflows under Reliability Constraint on a Multiprocessor Platform. CoRR abs/2212.09274 (2022) - 2021
- [j6]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Earned benefit maximization in social networks under budget constraint. Expert Syst. Appl. 169: 114346 (2021) - [j5]Suman Banerjee, Pratik Banjare, Bithika Pal, Mamata Jenamani:
A multistep priority-based ranking for top-N recommendation using social and tag information. J. Ambient Intell. Humaniz. Comput. 12(2): 2509-2525 (2021) - [j4]Suman Banerjee:
Designing and connectivity checking of implicit social networks from the user-item rating data. Multim. Tools Appl. 80(17): 26615-26635 (2021) - [c11]Mayank Singhal, Suman Banerjee:
Group Trip Planning Queries on Road Networks Using Geo-Tagged Textual Information. ADMA 2021: 243-257 - [c10]Suman Banerjee, Bithika Pal:
A Two-Phase Approach for Enumeration of Maximal $(\varDelta , \gamma )$-Cliques of a Temporal Network. DEXA (2) 2021: 346-357 - [c9]Suman Banerjee, Bithika Pal, Maheswar Singhamahapatra:
A Social Distancing-Based Facility Location Approach for Combating COVID-19. ICCSA (3) 2021: 141-156 - [c8]Suman Banerjee, Bithika Pal:
Updating Maximal $(\varDelta , \gamma )$-Cliques of a Temporal Network Efficiently. WISE (1) 2021: 485-493 - [i16]Suman Banerjee:
A Co-Operative Game Theoretic Approach for the Budgeted Influence Maximization Problem. CoRR abs/2104.06460 (2021) - [i15]Suman Banerjee, Bithika Pal:
Budgeted Influence and Earned Benefit Maximization with Tags in Social Networks. CoRR abs/2104.08504 (2021) - [i14]Suman Banerjee, Bithika Pal, Maheswar Singhamahapatra:
A Social Distancing-Based Facility Location Approach for Combating COVID-19. CoRR abs/2105.04598 (2021) - [i13]Suman Banerjee:
A Survey on Mining and Analysis of Uncertain Graphs. CoRR abs/2106.07837 (2021) - [i12]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. CoRR abs/2110.14498 (2021) - 2020
- [j3]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J. Ambient Intell. Humaniz. Comput. 11(6): 2539-2555 (2020) - [j2]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
A survey on influence maximization in a social network. Knowl. Inf. Syst. 62(9): 3417-3455 (2020) - [c7]Suman Banerjee, Bithika Pal, Mamata Jenamani:
Budgeted Influence Maximization with Tags in Social Networks. WISE (1) 2020: 141-152 - [c6]Suman Banerjee, Bithika Pal, Mamata Jenamani:
DySky: Dynamic Skyline Queries on Uncertain Graphs. WISE (1) 2020: 242-254 - [i11]Suman Banerjee:
Designing and Connectivity Checking of Implicit Social Networks from the User-Item Rating Data. CoRR abs/2004.02166 (2020) - [i10]Suman Banerjee, Bithika Pal:
DySky: Dynamic Skyline Queries on Uncertain Graphs. CoRR abs/2004.02564 (2020) - [i9]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Earned Benefit Maximization in Social Networks Under Budget Constraint. CoRR abs/2004.04003 (2020) - [i8]Suman Banerjee, Bithika Pal:
First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal $(Δ, γ)$\mbox{-}Cliques of a Temporal Network. CoRR abs/2004.05935 (2020) - [i7]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
An Approximate Marginal Spread Computation Approach for the Budgeted Influence Maximization with Delay. CoRR abs/2005.11763 (2020) - [i6]Suman Banerjee, Bithika Pal:
An Efficient Updation Approach for Enumerating Maximal (Δ, γ)-Cliques of a Temporal Network. CoRR abs/2007.04411 (2020)
2010 – 2019
- 2019
- [j1]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
ComBIM: A community-based solution approach for the Budgeted Influence Maximization Problem. Expert Syst. Appl. 125: 1-13 (2019) - [c5]Suman Banerjee, Bithika Pal:
On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network. COMAD/CODS 2019: 112-120 - [c4]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Maximizing the Earned Benefit in an Incentivized Social Networking Environment: An Integer Programming-Based Approach. COMAD/CODS 2019: 322-325 - 2018
- [c3]Bithika Pal, Suman Banerjee, Mamata Jenamani:
Threshold-Based Heuristics for Trust Inference in a Social Network. IC3 2018: 1-7 - [c2]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar, Abhinav Sirohi:
A Priority-Based Ranking Approach for Maximizing the Earned Benefit in an Incentivized Social Network. ISDA (1) 2018: 717-726 - [i5]Suman Banerjee, Bithika Pal:
On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network. CoRR abs/1804.10981 (2018) - [i4]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
A Survey on Influence Maximization in a Social Network. CoRR abs/1808.05502 (2018) - [i3]Bithika Pal, Suman Banerjee, Mamata Jenamani:
Threshold-Based Heuristics for Trust Inference in a Social Network. CoRR abs/1809.03758 (2018) - [i2]Suman Banerjee, Rogers Mathew:
An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs. CoRR abs/1812.01482 (2018) - 2017
- [c1]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Algorithms for projecting a bipartite network. IC3 2017: 1-3 - [i1]Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar:
Properties of a Projected Network of a Bipartite Network. CoRR abs/1707.00912 (2017)
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 2024-05-29 23:10 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:
