Soumen Maity - RankMe

66 papers A* 1A 2B 5C 5Misc 5Journal 44Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Globally minimal defensive alliances: A parameterized perspective. Discret. Appl. Math. Ajinkya Gaikwad, Soumen Maity
2026	J	`jnl`	Hardness and Tractability of T_{h+1}-Free Edge Deletion. CoRR Ajinkya Gaikwad, Soumen Maity, Leeja R
2026	B	`conf`	Parameterized Algorithms for Locally Minimal Defensive Alliance. SOFSEM Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
2025	J	`jnl`	Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms. CoRR Ajinkya Gaikwad, Hitendra Kumar, S. Padmapriya, Praneet Kumar Patra, Harsh Sanklecha, Soumen Maity
2025	J	`jnl`	MaxMin Separation Problems: FPT Algorithms for CoRR Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma
2025	A	`conf`	MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. STACS Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma
2025	B	`conf`	Parameterized Algorithms for Editing to Uniform Cluster Graph. FCT Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
2025	J	`jnl`	Parameterized complexity of locally minimal defensive alliances. Discret. Appl. Math. Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2024	J	`jnl`	Covering Array on the Cartesian Product of Hypergraphs. Graphs Comb. Yasmeen Akhtar, Soumen Maity
2024	J	`jnl`	Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
2024	J	`jnl`	Offensive alliances in graphs. Theor. Comput. Sci. Ajinkya Gaikwad, Soumen Maity
2024	J	`jnl`	On Structural Parameterizations of the Harmless Set Problem. Algorithmica Ajinkya Gaikwad, Soumen Maity
2023	J	`jnl`	An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR Ajaykrishnan E. S., Soumen Maity, Abhishek Sahu, Saket Saurabh
2023	B	`conf`	Parameterized Complexity of the FCT Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Defensive alliances in graphs. Theor. Comput. Sci. Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Further parameterized algorithms for the F-free edge deletion problem. Theor. Comput. Sci. Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Globally Minimal Defensive Alliances: A Parameterized Perspective. CoRR Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Globally minimal defensive alliances. Inf. Process. Lett. Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi
2022	J	`jnl`	Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. Soumen Maity, Charles J. Colbourn
2022	J	`jnl`	Offensive Alliances in Graphs. CoRR Ajinkya Gaikwad, Soumen Maity
2022	B	`conf`	On the Harmless Set Problem Parameterized by Treewidth. WALCOM Ajinkya Gaikwad, Soumen Maity
2022	J	`jnl`	Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
2022	J	`jnl`	Parameterized Complexity of Upper Edge Domination. CoRR Ajinkya Gaikwad, Soumen Maity
2022	—	`conf`	Parameterized Intractability of Defensive Alliance Problem. CALDAM Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2022	J	`jnl`	Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2021	J	`jnl`	Defensive Alliances in Graphs. CoRR Ajinkya Gaikwad, Soumen Maity
2021	J	`jnl`	Edge Deletion to Restrict the Size of an Epidemic. CoRR Ajinkya Gaikwad, Soumen Maity
2021	C	`conf`	On Structural Parameterizations of the Offensive Alliance Problem. COCOA Ajinkya Gaikwad, Soumen Maity
2021	J	`jnl`	On Structural Parameterizations of the Offensive Alliance Problem. CoRR Ajinkya Gaikwad, Soumen Maity
2021	Misc	`conf`	Parameterized Complexity of Defensive and Offensive Alliances in Graphs. ICDCIT Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2021	—	`conf`	Parameterized Complexity of Locally Minimal Defensive Alliances. CALDAM Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2021	J	`jnl`	Parameterized Complexity of Locally Minimal Defensive Alliances. CoRR Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2021	J	`jnl`	Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
2021	B	`conf`	The Balanced Satisfactory Partition Problem. SOFSEM Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2021	J	`jnl`	The Harmless Set Problem. CoRR Ajinkya Gaikwad, Soumen Maity
2021	J	`jnl`	The Small Set Vertex Expansion Problem. Theor. Comput. Sci. Garima Agrawal, Soumen Maity
2020	Misc	`conf`	Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
2020	C	`conf`	Parameterized Complexity of Satisfactory Partition Problem. COCOA Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2020	J	`jnl`	The Satisfactory Partition Problem. CoRR Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
2020	C	`conf`	The Small Set Vertex Expansion Problem. COCOA Soumen Maity
2018	J	`jnl`	Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn
2017	J	`jnl`	Covering Arrays on Product Graphs. Graphs Comb. Yasmeen Akhtar, Soumen Maity
2017	J	`jnl`	Mixed covering arrays on 3-uniform hypergraphs. Discret. Appl. Math. Yasmeen Akhtar, Soumen Maity
2016	C	`conf`	Generating Test Suites with High 3-Way Coverage for Software Testing. CIT Yasmeen Akhtar, Soumen Maity, Reshma C. Chandrasekharan
2015	J	`jnl`	Covering Arrays on Product Graphs. CoRR Yasmeen Akhtar, Soumen Maity
2015	J	`jnl`	Improved Strength Four Covering Arrays with Three Symbols. CoRR Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan
2015	J	`jnl`	Mixed Covering Arrays on 3-Uniform Hypergraphs. CoRR Yasmeen Akhtar, Soumen Maity
2013	J	`jnl`	A New Construction of Resilient Boolean Functions with High Nonlinearity. Ars Comb. Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
2012	J	`jnl`	3-Way Software Testing with Budget Constraints. IEICE Trans. Inf. Syst. Soumen Maity
2012	—	`conf`	Software Testing with Budget Constraints. ITNG Soumen Maity
2010	J	`jnl`	Minimum Distance between Bent and 1-resilient Boolean Functions. Ars Comb. Soumen Maity, Subhamoy Maitra
2009	J	`jnl`	Permutation Polynomials modulo p IACR Cryptol. ePrint Arch. Rajesh P. Singh, Soumen Maity
2007	J	`jnl`	Characterization, testing and reconfiguration of faults in mesh networks. Integr. Soumen Maity, Amiya Nayak, S. Ramsundar
2006	C	`conf`	Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. SETA Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
2006	Misc	`conf`	On Fault Tolerance of Two-Dimensional Mesh Networks. ICDCN Soumen Maity, Amiya Nayak, S. Ramsundar
2006	Misc	`conf`	On Reliability Analysis of Forward Loop Forward Hop Networks. ICDCIT Soumen Maity, S. Ramsundar
2005	A	`conf`	Improved Test Generation Algorithms for Pair-Wise Testing. ISSRE Soumen Maity, Amiya Nayak
2004	J	`jnl`	Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. Inf. Process. Lett. Soumen Maity, Amiya Nayak, Bimal K. Roy
2004	A*	`conf`	Minimum Distance between Bent and 1-Resilient Boolean Functions. FSE Soumen Maity, Subhamoy Maitra
2004	J	`jnl`	On characterization of catastrophic faults in two-dimensional VLSI arrays. Integr. Soumen Maity, Amiya Nayak, Bimal K. Roy
2004	—	`conf`	Reliability of VLSI Linear Arrays with Redundant Links. IWDC Soumen Maity, Amiya Nayak, Bimal K. Roy
2003	J	`jnl`	Minimum Distance between Bent and 1-resilient Boolean Functions. IACR Cryptol. ePrint Arch. Soumen Maity, Subhamoy Maitra
2002	Misc	`conf`	Construction of Cryptographically Important Boolean Functions. INDOCRYPT Soumen Maity, Thomas Johansson
2002	J	`jnl`	On enumeration of catastrophic fault patterns. Inf. Process. Lett. Soumen Maity, Bimal K. Roy, Amiya Nayak
2001	J	`jnl`	Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links. Integr. Soumen Maity, Bimal K. Roy, Amiya Nayak