Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links. - Soumen Maity; Bimal K. Roy; Amiya Nayak (Integr., 2001)

Construction of Cryptographically Important Boolean Functions. - Soumen Maity; Thomas Johansson 001 (INDOCRYPT, 2002)

On enumeration of catastrophic fault patterns. - Soumen Maity; Bimal K. Roy; Amiya Nayak (Inf. Process. Lett., 2002)

Reliability of VLSI Linear Arrays with Redundant Links. - Soumen Maity; Amiya Nayak; Bimal K. Roy (IWDC, 2004)

On characterization of catastrophic faults in two-dimensional VLSI arrays. - Soumen Maity; Amiya Nayak; Bimal K. Roy (Integr., 2004)

Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. - Soumen Maity; Amiya Nayak; Bimal K. Roy (Inf. Process. Lett., 2004)

Improved Test Generation Algorithms for Pair-Wise Testing. - Soumen Maity; Amiya Nayak (ISSRE, 2005)

On Reliability Analysis of Forward Loop Forward Hop Networks. - Soumen Maity; S. Ramsundar (ICDCIT, 2006)

On Fault Tolerance of Two-Dimensional Mesh Networks. - Soumen Maity; Amiya Nayak; S. Ramsundar (ICDCN, 2006)

Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. - Soumen Maity; Chrisil Arackaparambil; Kezhasono Meyase (SETA, 2006)

Characterization, testing and reconfiguration of faults in mesh networks. - Soumen Maity; Amiya Nayak; S. Ramsundar (Integr., 2007)

Permutation Polynomials modulo pn. - Rajesh P. Singh; Soumen Maity (IACR Cryptol. ePrint Arch., 2009)

Minimum Distance between Bent and 1-resilient Boolean Functions. - Soumen Maity; Subhamoy Maitra (Ars Comb., 2010)

Software Testing with Budget Constraints. - Soumen Maity (ITNG, 2012)

3-Way Software Testing with Budget Constraints. - Soumen Maity (IEICE Trans. Inf. Syst., 2012)

A New Construction of Resilient Boolean Functions with High Nonlinearity. - Soumen Maity; Chrisil Arackaparambil; Kezhasono Meyase (Ars Comb., 2013)

Improved Strength Four Covering Arrays with Three Symbols. - Soumen Maity; Yasmeen Akhtar; Reshma C. Chandrasekharan (CoRR, 2015)

Generating Test Suites with High 3-Way Coverage for Software Testing. - Yasmeen Akhtar; Soumen Maity; Reshma C. Chandrasekharan (CIT, 2016)

Mixed covering arrays on 3-uniform hypergraphs. - Yasmeen Akhtar; Soumen Maity (Discret. Appl. Math., 2017)

Covering Arrays on Product Graphs. - Yasmeen Akhtar; Soumen Maity (Graphs Comb., 2017)

Improved Strength Four Covering Arrays with Three Symbols. - Soumen Maity; Yasmeen Akhtar; Reshma C. Chandrasekharan; Charles J. Colbourn (Graphs Comb., 2018)

The Small Set Vertex Expansion Problem. - Soumen Maity (COCOA, 2020)

The Satisfactory Partition Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (CoRR, 2020)

On Structural Parameterizations of the Offensive Alliance Problem. - Ajinkya Gaikwad; Soumen Maity (COCOA, 2021)

Parameterized Complexity of Defensive and Offensive Alliances in Graphs. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (ICDCIT, 2021)

The Balanced Satisfactory Partition Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (SOFSEM, 2021)

Edge Deletion to Restrict the Size of an Epidemic. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2021)

The Harmless Set Problem. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2021)

The Small Set Vertex Expansion Problem. - Garima Agrawal; Soumen Maity (Theor. Comput. Sci., 2021)

Parameterized complexity of fair feedback vertex set problem. - Lawqueen Kanesh; Soumen Maity; Komal Muluk; Saket Saurabh 001 (Theor. Comput. Sci., 2021)

Parameterized Intractability of Defensive Alliance Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (CALDAM, 2022)

On the Harmless Set Problem Parameterized by Treewidth. - Ajinkya Gaikwad; Soumen Maity (WALCOM, 2022)

Globally Minimal Defensive Alliances: A Parameterized Perspective. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2022)

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Shuvam Kant Tripathi (CoRR, 2022)

Parameterized Complexity of Upper Edge Domination. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2022)

Parameterized Algorithms for Locally Minimal Defensive Alliance. - Ajinkya Gaikwad; Soumen Maity; Saket Saurabh 001 (CoRR, 2022)

Mixed covering arrays on graphs of small treewidth. - Soumen Maity; Charles J. Colbourn (Discret. Math. Algorithms Appl., 2022)

Globally minimal defensive alliances. - Ajinkya Gaikwad; Soumen Maity (Inf. Process. Lett., 2022)

Defensive alliances in graphs. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2022)

Further parameterized algorithms for the F-free edge deletion problem. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2022)

Parameterized complexity of satisfactory partition problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (Theor. Comput. Sci., 2022)

Parameterized Complexity of the Th+1-Free Edge Deletion Problem. - Ajinkya Gaikwad; Soumen Maity (FCT, 2023)

An Improved Exact Algorithm for Knot-Free Vertex Deletion. - Ajaykrishnan E. S; Soumen Maity; Abhishek Sahu; Saket Saurabh 001 (CoRR, 2023)

Kernelization Algorithms for the Eigenvalue Deletion Problems. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity (CoRR, 2024)

Offensive alliances in graphs. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2024)

On Structural Parameterizations of the Harmless Set Problem. - Ajinkya Gaikwad; Soumen Maity (Algorithmica, 2024)

Covering Array on the Cartesian Product of Hypergraphs. - Yasmeen Akhtar; Soumen Maity (Graphs Comb., 2024)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (STACS, 2025)

Parameterized complexity of locally minimal defensive alliances. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (Discret. Appl. Math., 2025)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (CoRR, 2025)