default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoumen Maity
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Harmless Set Problem. Algorithmica 86(5): 1475-1511 (2024)- [j20]Yasmeen Akhtar
, Soumen Maity:
Covering Array on the Cartesian Product of Hypergraphs. Graphs Comb. 40(4): 87 (2024) - [j19]Ajinkya Gaikwad, Soumen Maity:
Offensive alliances in graphs. Theor. Comput. Sci. 989: 114401 (2024) - [i18]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity:
Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR abs/2404.10023 (2024) - 2023
- [c19]Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. FCT 2023: 221-233 - [i17]Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh:
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR abs/2303.10866 (2023) - 2022
- [j18]Soumen Maity, Charles J. Colbourn:
Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. 14(1): 2150085:1-2150085:15 (2022) - [j17]Ajinkya Gaikwad, Soumen Maity:
Globally minimal defensive alliances. Inf. Process. Lett. 177: 106253 (2022) - [j16]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. 907: 113-127 (2022) - [j15]Ajinkya Gaikwad, Soumen Maity:
Defensive alliances in graphs. Theor. Comput. Sci. 928: 136-150 (2022) - [j14]Ajinkya Gaikwad, Soumen Maity:
Further parameterized algorithms for the F-free edge deletion problem. Theor. Comput. Sci. 933: 125-137 (2022) - [c18]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Intractability of Defensive Alliance Problem. CALDAM 2022: 279-291 - [c17]Ajinkya Gaikwad, Soumen Maity:
On the Harmless Set Problem Parameterized by Treewidth. WALCOM 2022: 227-238 - [i16]Ajinkya Gaikwad, Soumen Maity:
Globally Minimal Defensive Alliances: A Parameterized Perspective. CoRR abs/2202.02010 (2022) - [i15]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi:
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR abs/2208.01953 (2022) - [i14]Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of Upper Edge Domination. CoRR abs/2208.02522 (2022) - [i13]Ajinkya Gaikwad, Soumen Maity:
Offensive Alliances in Graphs. CoRR abs/2208.02992 (2022) - [i12]Ajinkya Gaikwad, Soumen Maity, Saket Saurabh:
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR abs/2208.03491 (2022) - 2021
- [j13]Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh:
Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867: 1-12 (2021) - [j12]Garima Agrawal, Soumen Maity:
The Small Set Vertex Expansion Problem. Theor. Comput. Sci. 886: 84-93 (2021) - [c16]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Locally Minimal Defensive Alliances. CALDAM 2021: 135-148 - [c15]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. COCOA 2021: 579-586 - [c14]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Defensive and Offensive Alliances in Graphs. ICDCIT 2021: 175-187 - [c13]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Balanced Satisfactory Partition Problem. SOFSEM 2021: 322-336 - [i11]Ajinkya Gaikwad, Soumen Maity:
Edge Deletion to Restrict the Size of an Epidemic. CoRR abs/2102.06068 (2021) - [i10]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Locally Minimal Defensive Alliances. CoRR abs/2105.10742 (2021) - [i9]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. CoRR abs/2110.15757 (2021) - [i8]Ajinkya Gaikwad, Soumen Maity:
Defensive Alliances in Graphs. CoRR abs/2111.05545 (2021) - [i7]Ajinkya Gaikwad, Soumen Maity:
The Harmless Set Problem. CoRR abs/2111.06267 (2021) - 2020
- [c12]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Satisfactory Partition Problem. COCOA 2020: 76-90 - [c11]Soumen Maity:
The Small Set Vertex Expansion Problem. COCOA 2020: 257-269 - [c10]Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh:
Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR 2020: 250-262 - [i6]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Satisfactory Partition Problem. CoRR abs/2007.14339 (2020)
2010 – 2019
- 2018
- [j11]Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn:
Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. 34(1): 223-239 (2018) - 2017
- [j10]Yasmeen Akhtar, Soumen Maity:
Mixed covering arrays on 3-uniform hypergraphs. Discret. Appl. Math. 232: 8-22 (2017) - [j9]Yasmeen Akhtar, Soumen Maity:
Covering Arrays on Product Graphs. Graphs Comb. 33(4): 635-652 (2017) - 2016
- [c9]Yasmeen Akhtar, Soumen Maity, Reshma C. Chandrasekharan:
Generating Test Suites with High 3-Way Coverage for Software Testing. CIT 2016: 10-17 - 2015
- [i5]Yasmeen Akhtar, Soumen Maity:
Mixed Covering Arrays on 3-Uniform Hypergraphs. CoRR abs/1508.07393 (2015) - [i4]Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan:
Improved Strength Four Covering Arrays with Three Symbols. CoRR abs/1509.03547 (2015) - [i3]Yasmeen Akhtar, Soumen Maity:
Covering Arrays on Product Graphs. CoRR abs/1512.06966 (2015) - 2013
- [j8]Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase:
A New Construction of Resilient Boolean Functions with High Nonlinearity. Ars Comb. 109: 171-192 (2013) - 2012
- [j7]Soumen Maity:
3-Way Software Testing with Budget Constraints. IEICE Trans. Inf. Syst. 95-D(9): 2227-2231 (2012) - [c8]Soumen Maity:
Software Testing with Budget Constraints. ITNG 2012: 258-262 - 2010
- [j6]Soumen Maity, Subhamoy Maitra:
Minimum Distance between Bent and 1-resilient Boolean Functions. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [i2]Rajesh P. Singh, Soumen Maity:
Permutation Polynomials modulo pn. IACR Cryptol. ePrint Arch. 2009: 393 (2009) - 2007
- [j5]Soumen Maity, Amiya Nayak, S. Ramsundar:
Characterization, testing and reconfiguration of faults in mesh networks. Integr. 40(4): 525-535 (2007) - 2006
- [c7]Soumen Maity, S. Ramsundar:
On Reliability Analysis of Forward Loop Forward Hop Networks. ICDCIT 2006: 136-144 - [c6]Soumen Maity, Amiya Nayak, S. Ramsundar:
On Fault Tolerance of Two-Dimensional Mesh Networks. ICDCN 2006: 442-453 - [c5]Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase:
Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. SETA 2006: 417-431 - 2005
- [c4]Soumen Maity, Amiya Nayak:
Improved Test Generation Algorithms for Pair-Wise Testing. ISSRE 2005: 235-244 - 2004
- [j4]Soumen Maity, Amiya Nayak, Bimal K. Roy:
On characterization of catastrophic faults in two-dimensional VLSI arrays. Integr. 38(2): 267-281 (2004) - [j3]Soumen Maity, Amiya Nayak, Bimal K. Roy:
Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. Inf. Process. Lett. 92(4): 189-197 (2004) - [c3]Soumen Maity, Subhamoy Maitra:
Minimum Distance between Bent and 1-Resilient Boolean Functions. FSE 2004: 143-160 - [c2]Soumen Maity, Amiya Nayak, Bimal K. Roy:
Reliability of VLSI Linear Arrays with Redundant Links. IWDC 2004: 326-337 - 2003
- [i1]Soumen Maity, Subhamoy Maitra:
Minimum Distance between Bent and 1-resilient Boolean Functions. IACR Cryptol. ePrint Arch. 2003: 133 (2003) - 2002
- [j2]Soumen Maity, Bimal K. Roy, Amiya Nayak:
On enumeration of catastrophic fault patterns. Inf. Process. Lett. 81(4): 209-212 (2002) - [c1]Soumen Maity, Thomas Johansson:
Construction of Cryptographically Important Boolean Functions. INDOCRYPT 2002: 234-245 - 2001
- [j1]Soumen Maity, Bimal K. Roy, Amiya Nayak:
Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links. Integr. 30(2): 157-168 (2001)
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 2025-01-09 13:07 CET 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:
