Mr Diptapriyo Majumdar

  1. 2021
  2. E-pub ahead of print

    Faster FPT Algorithms for Deletion to Pairs of Graph Classes

    Jacob, A., Majumdar, D. & Raman, V., 9 Sep 2021, (E-pub ahead of print).

    Research output: Contribution to conferencePaperpeer-review

  3. Published

    Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis

    Crampton, J., Gutin, G. & Majumdar, D., 19 Aug 2021, In: ACM Transactions on Privacy and Security. 24, 3, p. 1-22 22 p., 21.

    Research output: Contribution to journalArticlepeer-review

  4. Forthcoming

    Constrained Hitting Set Problem with Intervals

    Acharyya, A., Keikha, V., Majumdar, D. & Pandit, S., 15 Aug 2021, (Accepted/In press) The 27th International Computing and Combinatorics Conference: COCOON 2021. Springer-Verlag, (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. E-pub ahead of print

    Parameterized Pre-coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 29 Mar 2021, (E-pub ahead of print) In: SIAM Journal on Discrete Mathematics. 35, 1, p. 575-596 22 p.

    Research output: Contribution to journalArticlepeer-review

  6. Published

    Parameterized Complexity of Conflict-Free Set Cover

    Jacob, A., Majumdar, D. & Raman, V., 12 Jan 2021, In: Theory of Computing Systems. 26 p.

    Research output: Contribution to journalArticlepeer-review

  7. Forthcoming

    Valued Authorization Policy Existence Problem

    Crampton, J., Eiben, E., Gutin, G., Karapetyan, D. & Majumdar, D., 2021, (Accepted/In press) Proceedings of 26th ACM SACMAT.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  8. 2020
  9. Published

    Parameterized Complexity of Deletion to Scattered Graph Classes

    Jacob, A., Majumdar, D. & Raman, V., 4 Dec 2020, The 15th International Symposium on Parameterized and Exact Computation. LIPIcs, Vol. 180. p. 1-17 17 p. 18

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  10. Published

    On the Approximate Compressibility of Connected Vertex Cover

    Majumdar, D., Ramanujan, M. S. & Saurabh, S., 25 Apr 2020, In: Algorithmica. p. 2902-2926 25 p.

    Research output: Contribution to journalArticlepeer-review

  11. Published

    Parameterized Pre-Coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 27 Feb 2020, LIPIcs, Proceedings of STACS 2020. Vol. 154. p. 1-18 18 p. 15

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  12. 2019
  13. Published

    Tractability of König edge deletion problems

    Majumdar, D., Neogi, R., Raman, V. & Vaishali, S., 3 Dec 2019, In: Theoretical Computer Science. 796, p. 207-215 9 p.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    Parameterized Complexity of Conflict-Free Set Cover

    Jacob, A., Majumdar, D. & Raman, V., 1 Jul 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. Kucherov, G. & van Bevern, R. (eds.). Springer-Verlag, Vol. 11532 LNCS. p. 191-202 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  15. Published

    Bounded and Approximate Strong Satisfiability in Workflows

    Crampton, J., Gutin, G. & Majumdar, D., 28 May 2019, Proceedings of ACM SACMAT 2019. ACM, p. 179-184 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution