default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Banerjee
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- S. Banerjee 0001 — University of Bristol, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Souvik Ghosh
, Quentin Smets, S. Banerjee, Tom Schram, K. Kennes, R. Verheyen, P. Kumar, M.-E. Boulon, Benjamin Groven, H. M. Silva, Shreya Kundu, Daire Cott, Dennis Lin, P. Favia, T. Nuytten, A. Phommahaxay, Inge Asselberghs, C. De La Rosa, Gouri Sankar Kar, Steven Brems:
Integration of epitaxial monolayer MX₂ channels on 300mm wafers via Collective-Die-To-Wafer (CoD2W) transfer. VLSI Technology and Circuits 2023: 1-2- [c2]Shreya Kundu, D. H. van Doip, Tom Schram, Quentin Smets, S. Banerjee, Benjamin Groven, Daire Cott, Stefan Decoster, P. Bezard, F. Lazzarino, K. Banerjee, Souvik Ghosh, J. F. de Mamelfe, Pierre Morin, Cesar J. Lockhart de la Rosa, Inge Asselberghs, Gouri Sankar Kar:
Towards low damage and fab-compatible top-contacts in MX2 transistors using a combined synchronous pulse atomic layer etch and wet-chemical etch approach. VLSI Technology and Circuits 2023: 1-2 - [i3]S. Banerjee, S. He Yuxun, S. Konakanchi, L. Ogunfowora, S. Roy, S. Selvaras, Laia Domingo, M. Chehimi, M. Djukic, C. Johnson:
A hybrid quantum-classical fusion neural network to improve protein-ligand binding affinity predictions for drug discovery. CoRR abs/2309.03919 (2023) - 2022
- [j15]S. Banerjee, Atanu Panda, Indrajit Pandey, Parijat Bhowmick:
Parameter Estimation and Its Application on Designing Adaptive Nonlinear Model Based Control Schemes for the Time Varying System. Autom. Control. Comput. Sci. 56(4): 324-336 (2022) - [j14]Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu:
Perfect Italian domination in graphs: Complexity and algorithms. Discret. Appl. Math. 319: 271-295 (2022) - [j13]K. R. Singh, P. Das, S. Banerjee:
Nested block design as key pre-distribution in wireless sensor networks. Discret. Math. Algorithms Appl. 14(1): 2150100:1-2150100:12 (2022) - 2021
- [j12]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Perfect Italian domination in cographs. Appl. Math. Comput. 391: 125703 (2021) - [j11]Guilherme Amadio, A. Ananya, John Apostolakis, Marilena Bandieramonte, S. Banerjee, Abhijit Bhattacharyya, Calebe P. Bianchini, G. Bitzes, Philippe Canal, Federico Carminati, Oscar Roberto Chaparro-Amaro, Gabriele Cosmo, J. C. De Fine Licht, V. Drogan, Laurent Duhem, Daniel Elvira, J. Fuentes, Andrei Gheata, Mihaela Gheata, Mathieu Gravey, Ilias Goulas, Farah Hariri, Soon Yung Jun, Dmitri Konstantinov, Harphool Kumawat, J. G. Lima, Alberto Maldonado-Romo, Jesús Alberto Martínez-Castro, Pere Mato, T. Nikitina, S. Novaes, Mihály Novák, Kevin Pedro, Witold Pokorski, Alberto Ribon, Ryan Schmitz, Raman Seghal, Oksana Shadura, E. Tcherniaev, Sofia Vallecorsa, Sandro Wenzel, Y. Zhang:
GeantV. Comput. Softw. Big Sci. 5(1) (2021) - 2020
- [j10]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39(1): 90-114 (2020) - [j9]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
Algorithm and hardness results on neighborhood total domination in graphs. Theor. Comput. Sci. 840: 16-32 (2020)
2010 – 2019
- 2019
- [j8]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
The secure domination problem in cographs. Inf. Process. Lett. 145: 30-38 (2019) - [j7]S. Banerjee, J. Mark Keil, Dinabandhu Pradhan:
Perfect Roman domination in graphs. Theor. Comput. Sci. 796: 1-21 (2019) - [i2]Anupriya Jha, Dinabandhu Pradhan, S. Banerjee:
Algorithm and hardness results on neighborhood total domination in graphs. CoRR abs/1910.06423 (2019) - 2010
- [j6]Laksono Adhianto, S. Banerjee, Michael W. Fagan, Mark Krentel, Gabriel Marin, John M. Mellor-Crummey, Nathan R. Tallent:
HPCTOOLKIT: tools for performance analysis of optimized parallel programs. Concurr. Comput. Pract. Exp. 22(6): 685-701 (2010) - [i1]S. M. Joshi, S. Sanyal, S. Banerjee, S. Srikumar:
Using Grid Files for a Relational Database Management System. CoRR abs/1006.1309 (2010)
2000 – 2009
- 2008
- [j5]S. Banerjee, B. P. Mullick:
Word Sense Disambiguation and WordNet Technology. Lit. Linguistic Comput. 23(4): 505 (2008) - 2007
- [j4]S. Banerjee, Masanobu Shinozuka:
Nonlinear Static Procedure for Seismic Vulnerability Assessment of Bridges. Comput. Aided Civ. Infrastructure Eng. 22(4): 293-305 (2007) - 2005
- [j3]S. Banerjee, H. Kang, Sharmistha Bagchi-Sen, H. Raghav Rao:
Gender Divide in the Use of Internet Applications. Int. J. E Bus. Res. 1(2): 24-39 (2005) - [j2]H. Kang, Sharmistha Bagchi-Sen, H. Raghav Rao, S. Banerjee:
Internet skeptics: an analysis of intermittent users and net dropouts. IEEE Technol. Soc. Mag. 24(2): 26-31 (2005) - [c1]Chirasree Pramanik, Tarikul Islam, Hiranmay Saha, J. Bhattacharya, S. Banerjee, Sagnik Dey:
Design, Fabrication, Testing and Simulation of Porous Silicon Based Smart MEMS Pressure Sensor. VLSI Design 2005: 235-240
1990 – 1999
- 1996
- [j1]S. Banerjee, R. K. Ghosh, A. P. K. Reddy:
Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths. J. Parallel Distributed Comput. 33(2): 165-171 (1996)
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-10-18 20:28 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:
