default search action
Subhabrata Paul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A direct construction of cross z-complementary sequence sets with large set size. Cryptogr. Commun. 16(4): 767-777 (2024) - [j23]Subhabrata Paul, Kamal Santra:
Algorithmic study on 2-transitivity of graphs. Discret. Appl. Math. 358: 57-75 (2024) - [j22]Debojyoti Bhattacharya, Subhabrata Paul:
Algorithmic study on liar's vertex-edge domination problem. J. Comb. Optim. 48(3): 25 (2024) - [j21]Nishant Kumar
, Sushant K. Jha
A construction of multiple Z-complementary code sets with inter-set low correlation. Signal Process. 219: 109392 (2024) - [c7]Piyush Priyanshu, Sudhan Majhi, Subhabrata Paul:
Construction of Binary Odd Shift Complementary Pairs of All Lengths. ISIT 2024: 1753-1757 - [i16]Gobinda Ghosh, Sudhan Majhi, Subhabrata Paul:
Construction of CCC and ZCCS Through Additive Characters Over Galois Field. CoRR abs/2402.09757 (2024) - [i15]Abhishek Roy
Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes. CoRR abs/2405.01421 (2024) - 2023
- [j20]Praveen Kumar, Palash Sarkar, Sudhan Majhi
A direct construction of even length ZCPs with large ZCZ ratio. Cryptogr. Commun. 15(1): 85-94 (2023) - [j19]Gobinda Ghosh, Sudhan Majhi, Subhabrata Paul:
Construction of Optimal Binary Z-Complementary Code Sets with New Lengths Using Generalized Boolean Function. Cryptogr. Commun. 15(5): 979-993 (2023) - [j18]Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma:
Vertex-edge domination in interval and bipartite permutation graphs. Discuss. Math. Graph Theory 43(4): 947-963 (2023) - [j17]Praveen Kumar
Direct Construction of CZCS With Flexible Parameters for Channel Estimation in SM-MIMO System. IEEE Commun. Lett. 27(12): 3325-3329 (2023) - [j16]Subhabrata Paul, Kamal Santra:
Transitivity on subclasses of bipartite graphs. J. Comb. Optim. 45(1) (2023) - [j15]Praveen Kumar
A Direct Construction of Golay Complementary Pairs and Binary Complete Complementary Codes of Length Non-Power of Two. IEEE Trans. Commun. 71(3): 1352-1363 (2023) - [c6]Subhabrata Paul, Kamal Santra:
Transitivity on Subclasses of Chordal Graphs. CALDAM 2023: 391-402 - [c5]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power Lengths. ISIT 2023: 1283-1287 - [c4]Nishant Kumar
A New and Direct Construction of Asymptotically Optimal Multiple Sets of Multiple Zero-Correlation Zone Sequence Sets. ISIT 2023: 1288-1293 - [i14]Gobinda Ghosh, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Optimal 2D-ZCACS with Flexible Array Size and Large Set Size. CoRR abs/2301.02400 (2023) - [i13]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power Lengths. CoRR abs/2305.01442 (2023) - [i12]Debojyoti Bhattacharya, Subhabrata Paul:
On k-vertex-edge domination of graph. CoRR abs/2310.07452 (2023) - [i11]Debojyoti Bhattacharya, Subhabrata Paul:
Algorithmic study on liar's vertex-edge domination problem. CoRR abs/2310.07465 (2023) - 2022
- [j14]Anish Nag
Curcumin inhibits spike protein of new SARS-CoV-2 variant of concern (VOC) Omicron, an in silico study. Comput. Biol. Medicine 146: 105552 (2022) - [j13]Subhabrata Paul, Keshav Ranjan:
Results on vertex-edge and independent vertex-edge domination. J. Comb. Optim. 44(1): 303-330 (2022) - [i10]Subhabrata Paul, Kamal Santra:
Transitivity on subclasses of bipartite graphs. CoRR abs/2204.13148 (2022) - [i9]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Cross Z-Complementary Sequence Sets with Large Set Size. CoRR abs/2207.02551 (2022) - [i8]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Cross Z-Complementary Sets with Flexible Lengths and Large Zero Correlation Zone. CoRR abs/2207.11730 (2022) - [i7]Subhabrata Paul, Kamal Santra:
Transitivity on subclasses of chordal graphs. CoRR abs/2211.13931 (2022) - 2021
- [j12]Anish Nag, Subhabrata Paul
In silico study of some selective phytochemicals against a hypothetical SARS-CoV-2 spike RBD using molecular docking tools. Comput. Biol. Medicine 137: 104818 (2021) - [j11]Arijit Bishnu, Arijit Ghosh, Rogers Mathew
Grid obstacle representation of graphs. Discret. Appl. Math. 296: 39-51 (2021) - [i6]Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of GCP and Binary CCC of Length Non Power of Two. CoRR abs/2109.08567 (2021) - 2020
- [j10]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Gopinath Mishra, Subhabrata Paul:
Existence of planar support for geometric hypergraphs using elementary techniques. Discret. Math. 343(6): 111853 (2020)
2010 – 2019
- 2019
- [c3]Subhabrata Paul, Keshav Ranjan:
On Vertex-Edge and Independent Vertex-Edge Domination. COCOA 2019: 437-448 - [i5]Subhabrata Paul, Keshav Ranjan:
On vertex-edge and independent vertex-edge domination. CoRR abs/1910.03635 (2019) - 2018
- [j9]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic aspects of b-disjunctive domination in graphs. J. Comb. Optim. 36(2): 572-590 (2018) - 2017
- [j8]Arijit Bishnu, Arijit Ghosh, Subhabrata Paul:
Linear kernels for k-tuple and liar's domination in bounded genus graphs. Discret. Appl. Math. 231: 67-77 (2017) - [j7]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. SIAM J. Discret. Math. 31(3): 2138-2171 (2017) - [i4]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. CoRR abs/1708.01765 (2017) - 2016
- [j6]Arijit Bishnu, Kunal Dutta
(1, j)-set problem in graphs. Discret. Math. 339(10): 2515-2525 (2016) - 2015
- [j5]Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan:
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theor. Comput. Sci. 573: 26-42 (2015) - [c2]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic Aspects of Disjunctive Domination in Graphs. COCOON 2015: 325-336 - [c1]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. TAMC 2015: 347-358 - 2014
- [j4]B. S. Panda, Subhabrata Paul:
Hardness results and approximation algorithm for total liar's domination in graphs. J. Comb. Optim. 27(4): 643-662 (2014) - [i3]Arijit Bishnu, Kunal Dutta, Arijit Ghosh, Subhabrata Paul:
$(1, j)$-set problem in graphs. CoRR abs/1410.3091 (2014) - [i2]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of point samples in metric spaces using gap ratio. CoRR abs/1411.7819 (2014) - 2013
- [j3]B. S. Panda, Subhabrata Paul:
Liar's domination in graphs: Complexity and algorithm. Discret. Appl. Math. 161(7-8): 1085-1092 (2013) - [j2]B. S. Panda, Subhabrata Paul:
Connected Liar's domination in graphs: Complexity and Algorithms. Discret. Math. Algorithms Appl. 5(4) (2013) - [j1]B. S. Panda, Subhabrata Paul:
A linear time algorithm for liar's domination problem in proper interval graphs. Inf. Process. Lett. 113(19-21): 815-822 (2013) - [i1]Arijit Bishnu, Arijit Ghosh, Subhabrata Paul:
Parameterized complexity of k-tuple and liar's domination. CoRR abs/1309.5461 (2013)
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-22 20:13 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: