Soumen Maity

dblp:63/6717 · DBLP profile ↗
← Back
28ranked-venue papers
9as first author
17since 2021 · last 2026
0009-0003-4924-2246ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 3 first-author · 14 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Systems, architecture and hardware · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 2 first-author · 1 since 2021Security and privacy · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author
YearPublicationVenuePosition
2026 Parameterized Algorithms for Locally Minimal Defensive Alliance
Ajinkya Gaikwad, Soumen Maity, Saket Saurabh 0001
SOFSEM2
2026 Globally minimal defensive alliances: A parameterized perspective
Ajinkya Gaikwad, Soumen Maity
Discret. Appl. Math.2
2026 Parameterized algorithms for editing to uniform cluster graph
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
Theor. Comput. Sci.3
2025 Parameterized Algorithms for Editing to Uniform Cluster Graph
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
FCT3
2025 MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh 0001, Roohani Sharma
STACS3
2025 Parameterized complexity of locally minimal defensive alliances
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Discret. Appl. Math.2
2024 On Structural Parameterizations of the Harmless Set Problem
Ajinkya Gaikwad, Soumen Maity
Algorithmica2
2024 Offensive alliances in graphs
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.2
2023 Parameterized Complexity of the Th+1-Free Edge Deletion Problem
Ajinkya Gaikwad, Soumen Maity
FCT2
2022 Globally minimal defensive alliances
Ajinkya Gaikwad, Soumen Maity
Inf. Process. Lett.2
2022 Defensive alliances in graphs
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.2
2022 Further parameterized algorithms for the F-free edge deletion problem
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.2
2022 Parameterized complexity of satisfactory partition problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Theor. Comput. Sci.2
2021 On Structural Parameterizations of the Offensive Alliance Problem
Ajinkya Gaikwad, Soumen Maity
COCOA2
2021 The Balanced Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
SOFSEM2
2021 The Small Set Vertex Expansion Problem
Garima Agrawal, Soumen Maity
Theor. Comput. Sci.2
2021 Parameterized complexity of fair feedback vertex set problem
Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh 0001
Theor. Comput. Sci.2
2020 Parameterized Complexity of Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
COCOA2
2020 The Small Set Vertex Expansion Problem
Soumen Maity
COCOA1
2017 Mixed covering arrays on 3-uniform hypergraphs
Yasmeen Akhtar, Soumen Maity
Discret. Appl. Math.2
2007 Characterization, testing and reconfiguration of faults in mesh networks
Soumen Maity, Amiya Nayak, S. Ramsundar
Integr.1
2006 Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity
Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
SETA1
2005 Improved Test Generation Algorithms for Pair-Wise Testing
abstract
Software testing is expensive and time consuming. Given the different input parameters with multiple possible values for each parameter, performing exhaustive testing which tests all possible combinations is practically impossible. Generating an optimal test set which will effectively test the software system is therefore desired. Pair-wise testing is known for its effectiveness in different types of software testing. Pair-wise testing requires that for a given numbers of input parameters to the system, each possible combination of values for any pair of parameters be covered by at least one test case. Pair-wise testing is known for its effectiveness in different types of software testing. The problem of generating a minimum size test set for pair-wise testing is NP-complete. This paper presents new techniques for reducing the number of test cases for pair-wise testing. The paper shows an algorithm to generate test cases for 2-valued parameters and how orthogonal arrays and ordered designs may be used for deriving test cases for parameters with more than two values. Moreover, using mixed-level or asymmetric orthogonal array as tool, we present test set generation strategy for parameters with different number of values. A comparison of empirical results with previous test generation strategies "AETG" and "IPO" shows that the number of test cases generated with the proposed methodology is never higher and in some cases significantly lower than using AETG or IPO
Soumen Maity, Amiya Nayak
ISSRE1
2004 Minimum Distance between Bent and 1-Resilient Boolean Functions
Soumen Maity, Subhamoy Maitra
FSE1
2004 On characterization of catastrophic faults in two-dimensional VLSI arrays
Soumen Maity, Amiya Nayak, Bimal K. Roy
Integr.1
2004 Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
Soumen Maity, Amiya Nayak, Bimal K. Roy
Inf. Process. Lett.1
2002 On enumeration of catastrophic fault patterns
Soumen Maity, Bimal K. Roy, Amiya Nayak
Inf. Process. Lett.1
2001 Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links
Soumen Maity, Bimal K. Roy, Amiya Nayak
Integr.1