Mr Diptapriyo Majumdar

  1. 2020
  2. Published

    On the Approximate Compressibility of Connected Vertex Cover

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

    Research output: Contribution to journalArticle

  3. 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

  4. 2019
  5. 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 journalArticle

  6. 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

  7. 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