Soumen Maity

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 40

Top Topics

Parameterized Complexity

Global Constraints

Top Venues

Theor. Comput. Sci.

Publications

Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR (2024)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Harmless Set Problem. Algorithmica 86 (5) (2024)
Ajinkya Gaikwad, Soumen Maity
Offensive alliances in graphs. Theor. Comput. Sci. 989 (2024)
Yasmeen Akhtar, Soumen Maity
Covering Array on the Cartesian Product of Hypergraphs. Graphs Comb. 40 (4) (2024)
Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR (2023)
Ajinkya Gaikwad, Soumen Maity
-Free Edge Deletion Problem. FCT (2023)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. 907 (2022)
Ajinkya Gaikwad, Soumen Maity
On the Harmless Set Problem Parameterized by Treewidth. WALCOM (2022)
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Offensive Alliances in Graphs. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Defensive alliances in graphs. Theor. Comput. Sci. 928 (2022)
Ajinkya Gaikwad, Soumen Maity
Parameterized Complexity of Upper Edge Domination. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Globally minimal defensive alliances. Inf. Process. Lett. 177 (2022)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Intractability of Defensive Alliance Problem. CALDAM (2022)
Ajinkya Gaikwad, Soumen Maity
Globally Minimal Defensive Alliances: A Parameterized Perspective. CoRR (2022)
Soumen Maity, Charles J. Colbourn
Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. 14 (1) (2022)
Ajinkya Gaikwad, Soumen Maity
Further parameterized algorithms for the F-free edge deletion problem. Theor. Comput. Sci. 933 (2022)
Ajinkya Gaikwad, Soumen Maity
Edge Deletion to Restrict the Size of an Epidemic. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Offensive Alliance Problem. COCOA (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Balanced Satisfactory Partition Problem. SOFSEM (2021)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Offensive Alliance Problem. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity
Defensive Alliances in Graphs. CoRR (2021)
Garima Agrawal, Soumen Maity
The Small Set Vertex Expansion Problem. Theor. Comput. Sci. 886 (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Locally Minimal Defensive Alliances. CALDAM (2021)
Ajinkya Gaikwad, Soumen Maity
The Harmless Set Problem. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Locally Minimal Defensive Alliances. CoRR (2021)
Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867 (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Defensive and Offensive Alliances in Graphs. ICDCIT (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Satisfactory Partition Problem. COCOA (2020)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Satisfactory Partition Problem. CoRR (2020)
Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR (2020)
Soumen Maity
The Small Set Vertex Expansion Problem. COCOA (2020)
Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn
Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. 34 (1) (2018)
Yasmeen Akhtar, Soumen Maity
Covering Arrays on Product Graphs. Graphs Comb. 33 (4) (2017)
Yasmeen Akhtar, Soumen Maity
Mixed covering arrays on 3-uniform hypergraphs. Discret. Appl. Math. 232 (2017)
Yasmeen Akhtar, Soumen Maity, Reshma C. Chandrasekharan
Generating Test Suites with High 3-Way Coverage for Software Testing. CIT (2016)
Yasmeen Akhtar, Soumen Maity
Mixed Covering Arrays on 3-Uniform Hypergraphs. CoRR (2015)
Yasmeen Akhtar, Soumen Maity
Covering Arrays on Product Graphs. CoRR (2015)
Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan
Improved Strength Four Covering Arrays with Three Symbols. CoRR (2015)
Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
A New Construction of Resilient Boolean Functions with High Nonlinearity. Ars Comb. 109 (2013)
Soumen Maity
Software Testing with Budget Constraints. ITNG (2012)
Soumen Maity
3-Way Software Testing with Budget Constraints. IEICE Trans. Inf. Syst. (9) (2012)
Soumen Maity, Subhamoy Maitra
Minimum Distance between Bent and 1-resilient Boolean Functions. Ars Comb. 97 (2010)
Rajesh P. Singh, Soumen Maity
. IACR Cryptol. ePrint Arch. 2009 (2009)
Soumen Maity, Amiya Nayak, S. Ramsundar
Characterization, testing and reconfiguration of faults in mesh networks. Integr. 40 (4) (2007)
Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. SETA (2006)
Soumen Maity, S. Ramsundar
On Reliability Analysis of Forward Loop Forward Hop Networks. ICDCIT (2006)
Soumen Maity, Amiya Nayak, S. Ramsundar
On Fault Tolerance of Two-Dimensional Mesh Networks. ICDCN (2006)
Soumen Maity, Amiya Nayak
Improved Test Generation Algorithms for Pair-Wise Testing. ISSRE (2005)
Soumen Maity, Amiya Nayak, Bimal K. Roy
Reliability of VLSI Linear Arrays with Redundant Links. IWDC (2004)
Soumen Maity, Amiya Nayak, Bimal K. Roy
On characterization of catastrophic faults in two-dimensional VLSI arrays. Integr. 38 (2) (2004)
Soumen Maity, Subhamoy Maitra
Minimum Distance between Bent and 1-Resilient Boolean Functions. FSE (2004)
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) (2004)
Soumen Maity, Subhamoy Maitra
Minimum Distance between Bent and 1-resilient Boolean Functions. IACR Cryptol. ePrint Arch. 2003 (2003)
Soumen Maity, Bimal K. Roy, Amiya Nayak
On enumeration of catastrophic fault patterns. Inf. Process. Lett. 81 (4) (2002)
Soumen Maity, Thomas Johansson
Construction of Cryptographically Important Boolean Functions. INDOCRYPT (2002)
Soumen Maity, Bimal K. Roy, Amiya Nayak
Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links. Integr. 30 (2) (2001)