default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngsuman Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j13]Sucharita Biswas, Peter J. Cameron
, Angsuman Das, Hiranya Kishore Dey:
On the difference of the enhanced power graph and the power graph of a finite group. J. Comb. Theory, Ser. A 208: 105932 (2024)- 2022
- [j12]Angsuman Das:
On neighborhood graphs: Domination, coloring and other properties. Discret. Math. Algorithms Appl. 14(4): 2150133:1-2150133:13 (2022) - [j11]Angsuman Das, Hiranya Kishore Dey:
Determining Number of Kneser Graphs: Exact Values and Improved Bounds. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j10]Sucharita Biswas, Angsuman Das:
A generalization of Pappus graph. Electron. J. Graph Theory Appl. 10(1): 345 (2022) - 2021
- [j9]Angsuman Das:
Triameter of graphs. Discuss. Math. Graph Theory 41(2): 601-616 (2021) - [j8]Angsuman Das:
Connected domination value in graphs. Electron. J. Graph Theory Appl. 9(1): 113-123 (2021) - [j7]Khola Wahid, Angsuman Das, Anam Rani, Saira Amanat, Muhammad Imran, Usman Ali:
On twin preserving spanning subgraph. J. Intell. Fuzzy Syst. 40(5): 9505-9513 (2021) - 2018
- [j6]Angsuman Das, Renu C. Laskar, Nader Jafari Rad:
On α-Domination in Graphs. Graphs Comb. 34(1): 193-205 (2018) - 2017
- [j5]Angsuman Das:
Coefficient of domination in graph. Discret. Math. Algorithms Appl. 9(2): 1750018:1-1750018:12 (2017) - [j4]Angsuman Das:
Infinite graphs with finite dominating sets. Discret. Math. Algorithms Appl. 9(4): 1750053:1-1750053:9 (2017) - 2015
- [j3]Angsuman Das, Avishek Adhikari, Kouichi Sakurai:
Plaintext checkable encryption with designated checker. Adv. Math. Commun. 9(1): 37-53 (2015) - 2012
- [j2]Angsuman Das, Avishek Adhikari:
An efficient IND-CCA2 secure Paillier-based cryptosystem. Inf. Process. Lett. 112(22): 885-888 (2012) - 2010
- [j1]Angsuman Das, Avishek Adhikari:
An efficient multi-use multi-secret sharing scheme based on hash function. Appl. Math. Lett. 23(9): 993-996 (2010)
Conference and Workshop Papers
- 2020
- [c6]Angsuman Das:
Determining Number of Generalized and Double Generalized Petersen Graph. CALDAM 2020: 131-140 - 2017
- [c5]Angsuman Das, Wyatt J. Desormeaux:
Connected Fair Domination in Graphs. ICMC 2017: 96-102 - 2015
- [c4]Partha Sarathi Roy, Angsuman Das, Avishek Adhikari:
Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure. ICDCIT 2015: 278-287 - [c3]Angsuman Das, Avishek Adhikari:
Plaintext Checkable Signcryption. ICISS 2015: 324-333 - 2013
- [c2]Angsuman Das, Avishek Adhikari:
Signcryption from Randomness Recoverable PKE Revisited. ICISS 2013: 78-90 - [c1]Angsuman Das, Sabyasachi Dutta, Avishek Adhikari:
Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture. ProvSec 2013: 104-120
Informal and Other Publications
- 2011
- [i1]Angsuman Das, Avishek Adhikari:
An efficient multi-use multi-secret sharing scheme based on hash function. CoRR abs/1103.1730 (2011)
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-07 22:14 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:
