Publications

 Published Articles:

1. Ajinkya Gaikwad and Soumen Maity,  Structural Parameterizations of the Harmless Set Problem, Algorithmica, Vol. 86, 1475-1511, 2024.  link.springer.com/article/10.1007/s00453-023-01199-9

2. Ajinkya Gaikwad and Soumen Maity, Offensive Alliances in Graphs, Theoretical Computer Science, Vol. 989, 114401, 2024. https://doi.org/10.1016/j.tcs.2024.114401

3. Ajinkya Gaikwad and Soumen Maity, Parameterized complexity of the T_{h+1}-Free Edge Deletion Problem, FCT 2023, Lecture Notes in Computer Science, Vol. 14292,  221-233, 2023. Link

4. Ajinkya Gaikwad and Soumen Maity, Further parameterized algorithms for the F-free edge deletion problem, Theoretical Computer Science, Vol. 933, 125-137, 2022.  Link

5. Ajinkya Gaikwad and Soumen Maity, Defensive Alliances in Graphs, Theoretical Computer Science, Vol. 928, 136 -150, 2022. Link

6. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, Theoretical Computer Science, Vol. 907, 113-127, 2022. Link

7. Ajinkya Gaikwad, Soumen Maity, Globally Minimal Defensive Alliances, Information Processing Letters, Vol. 177, 106253, 2022. Link

8. Maity, S. and Colbourn, C.J., Mixed Covering Arrays on Graph of Small Treewidth, Discrete Mathematics, Algorithms and Applications, Vol. 14, No. 01, 2150085, 2022. Link

9. Ajinkya Gaikwad and Soumen Maity, On the Harmless Set Problem Parameterized by Treewidth, WALCOM 2022, Lecture Notes in Computer Science, Vol. 13174,  227-238, 2022. Link

10. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized intractability of defensive alliance problem, CALDAM 2022, Lecture Notes in Computer Science, Vol. 13179, 279-291, 2022. Link

11. Ajinkya Gaikwad and Soumen Maity, On Structural Parameterizations of the Offensive Alliance Problem, COCOA 2021, Lecture Notes in Computer Science, Vol. 13135, 579-586, 2021. Link

12. G. Agrawal and S. Maity, The small set vertex expansion problem, Theoretical Computer Science, Vol 886. 84-93, 2021. Link

13. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, The Balanced Satisfactory Partition Problem, SOFSEM 2021, Lecture Notes in Computer Science, Vol. 12607, 322-336, 2021. Link

14. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Locally Minimal Defensive Alliance, CALDAM 2021, Lecture Notes in Computer Science, Vol. 12601, 135-148, 2021. Link

15. Kanesh, L., Maity, S., Muluk, K., and Saurabh, S., Parameterized Complexity of Fair Feedback Vertex Set Problem, Theoretical Computer Science, Vol. 867, 1-12, 2021. Link

16. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Defensive and Offensive Alliances in Graphs, ICDCIT 2021, Lecture Notes in Computer Science, Vol. 12582, 175-187, 2021. Link

17. Soumen Maity, The Small Set Vertex Expansion Problem, COCOA 2020, Lecture Notes in Computer Science, Vol. 12577, 257-269, 2020. Link

18. Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, COCOA 2020, Lecture Notes in Computer Science, Vol. 12577, 76-90, 2020.  Link

19. Kanesh, L., Maity, S., Muluk, K., and Saurabh, S., Parameterized Complexity of Fair Feedback Vertex Set Problem, Computer Science in Russia 2020, Lecture Notes in Computer Science, Vol. 12195, 250-262, 2020.  Link

20. Maity, S., Akhtar, Y., Chandrasekharan, R.C., and Colbourn, C.J., Improved strength four covering arrays with three symbols, Graphs and Combinatorics, Vol. 34, Issue 1, pp. 223-239, 2018. (pdf)

21. Akhtar, Y. and Maity, S., Mixed covering arrays on 3-uniform hypergraphs, Discrete Applied Mathematics, Vol. 232, pp. 8-22, 2017. (pdf) 

22. Akhtar, Y. and Maity, S., Covering Arrays on Product Graphs, Graphs and Combinatorics, Vol. 33, Issue 4, pp. 635-652, 2017. (pdf)

23. Akhtar, Y., Chandrasekharan, R.C., and Maity, S. Generating Test Suites with High 3-Way Coverage for Software Testing, Proc. IEEE International Conference on Computer and Information Technology, IEEE Computer Society, pp. 10-17, 2016. (pdf)

24. Akhtar, Y., Maity, S., Chandrashekharan, R.C., Covering Arrays of Strength Four and Software Testing, Book Name: Mathematics and Computing, Springer Proceedings in Mathematics and Statistics, Vol. 139, pp. 391-398, 2015.

25. Maity, S., Arackaparambil, C. and Meyase, K., A new construction of resilient Boolean functions with high nonlinearity, Ars Combinatoria, Vol. 109, 2013, pp. 171-192. (pdf)

26. Maity, S., 3-Way Software Testing with Budget Constraints, IEICE Trans. Information & Systems, Vol. E95-D, No. 9, pp. 2227-2231, 2012. (pdf)

27. Yasmeen and Maity, S., Mixed covering arrays on hypergraphs, Communications in Computers and Information Science, Vol. 305,  pp. 327-338, 2012. (pdf)

28. Maity, S., Software testing with budget constraints, Proc. 9th IEEE International Conference on Information Technology New Generation (ITNG12), pp. 258-268, 2012. (pdf)

29. Maity, S., 3-Way software testing with budget constraints (Fast Abstract), Proc. 22nd IEEE International Symposium on Software Reliability Engineering (ISSRE 2011), Hiroshima, Japan.

30. Maity, S. and Maitra, S., Minimum distance between bent and 1-resilient Boolean functions, Ars Combinatoria, Vol. 97, pp. 351-375, 2010. (pdf)

31. Maity, S., A test generation algorithm for 3-way software testing (Fast Abstract), Proc. 20th IEEE International Symposium on Software Reliability Engineering, 2009. (pdf)

32. Maity, S. and Nayak, A. and Ramsundar, S., Characterization, testing and reconfiguration of faults in mesh networks, INTEGRATION, the VLSI Journal, Vol. 40, pp. 525-535, 2007. (pdf)

33. Maity, S., Chrisil Arackaparambil and Kezhasono Meyase, Constructions of cryptographically significant Boolean functions, Congressus Numerantium, Vol. 181, pp. 151-163, 2006. (pdf)

34. Maity, S., Chrisil Arackaparambil and Meyase, K., Construction of 1-resilient Boolean functions with very good nonlinearity, Sequences and Their Applications (SETA 2006), Lecture Notes in Computer Science, Vol 4086, Springer-Verlag, Vol. 4086, pp. 417-431, 2006. 

35. Maity, S. and Nayak, A. and Ramsundar, S., On fault tolerance of two-dimensional mesh networks, In International Conference on Distributed Computing and Networking - ICDCN 2006, Lecture Notes in Computer Science, Springer-Verlag, Vol. 4308, pp. 442-453, 2006. (pdf)

36. Maity, S. and Ramsundar, S., On reliability analysis of forward loop forward hop networks, In International Conference on Distributed Computing and Internet Technology (ICDCIT 2006), Lecture Notes in Computer Science, Springer-Verlag, Vol. 4317, pp. 136-144, 2006. (pdf)

37. Maity, S., Nayak, A., Improved test generation algorithms for pair-wise testing, Proc. 16th IEEE International Symposium on Software Reliability Engineering (ISSRE05), pp. 235-244, 2005. (pdf)

38. Maity, S. and Maitra, S., Minimum distance between bent and 1-resilient Boolean functions, Fast Software Encryption -FSE 2004, Lecture Notes in Computer Science, Springer-Verlag, Vol. 3017 pp. 143-160, 2004.

39. Maity, S. and Nayak, A. and Roy, B., Reliability of VLSI linear arrays with redundant links, The International Workshop on Distributed Computing (IWDC 2004), Lecture Notes in Computer Science, Springer-Verlag, Vol. 3326,  pp. 324-335, 2004. (pdf)

40. Maity, S., Nayak, A. and Roy, B., On characterization of catastrophic faults in two-dimensional VLSI arrays, INTEGRATION, The VLSI Journal, Vol. 38, pp. 267-281, 2004.

41. Maity, S., Nayak, A. and Roy, B., Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links, Information Processing Letters, Vol. 92 (4),  pp. 189-197, 2004. (pdf)

42. Maity, S., Nayak, A., Zaman, M., Srivastava, A. and Goel, N., An improved test generating algorithm for pair-wise testing (Fast Abstract), Proc. 14th IEEE International Symposium on Software Reliability Engineering (ISSRE 2003), Colorado, Denver, USA, 2003. (pdf)

43. Maity, S. and Johansson, T., Constructions of cryptographically important Boolean functions, INDOCRYPT 2002, Lecture Notes in Computer Sci., Springer-Verlag, Vol. 2551, pp. 234-245, 2002. (pdf)

44. Maity, S., Roy, B. K. and Nayak, A., Enumerating catastrophic fault patterns in VLSI arrays with both uni and bidirectional links, INTEGRATION, The VLSI Journal, Vol. 30 (2), pp. 157-168, 2001. (pdf)

45. Maity, S., Dutta, T. K. and Roy, B. K., Construction and efficiency of some repeated measurements designs, Journal of the Indian Statist. Assoc., Vol. 39 (2), pp. 137-160, 2001.

46. Maity, S. Roy, B. K. and Nayak, A., Identification of optimal link redundancy for which a given fault pattern is catastrophic in VLSI linear arrays, Congressus Numerantium, Vol. 151,  pp. 41-52, 2001.

47. Maity, S. and Roy, B. K., Construction of some classes of optimal repeated measurements designs, Cal. Statist. Assoc. Bull., Vol. 50, Nos. 197-198, pp. 33-42, 2000.

48. Maity, S., Roy, B. K. and Nayak, A., On enumeration of catastrophic fault patterns, Information Processing Letters, Vol. 81(4), pp. 209-212, 2002. 

Submitted Articles:

49. Parameterized Complexity of Locally Minimal Defensive Alliances (with Ajinkya Gaikwad and Shuvam Kant Tripathi), Discrete Applied Mathematics (revised version submitted in Feb 2023)  https://arxiv.org/abs/2105.10742

50. Covering Array on the Cartesian Product of Hypergraphs (with Yasmeen Akhtar), Graphs and Combinatorics (revised version submitted) 2023.

51. An Improved  Exact Algorithm for Knot-Free Vertex Deletion (with Ajaykrishnan ES, Abhishek Sahu and Saket Saurabh) submitted 2023. http://arxiv.org/abs/2303.10866

52. Globally Minimal Defensive Alliance: A Parameterized Perspective (with Ajinkya Gaikwad), Submitted 2022. https://arxiv.org/abs/2202.02010

53. Maximum Minimal Feedback Vertex Set: A Parameterized Perspective (with Ajinkya Gaikwad, Hitendra Kumar, Saket Saurabh, Shuvam Kant Tripath), Submitted 2022,  http://arxiv.org/abs/2208.01953

54. Parameterized Complexity of Upper Edge Domination (with Ajinkya Gaikwad), Submitted 2022. http://arxiv.org/abs/2208.02522

55. Parameterized Algorithms for Locally Minimal Defensive Alliance (with Ajinkya Gaikwad and Saket Saurabh), Submitted 2023. http://arxiv.org/abs/2208.03491