Mr Diptapriyo Majumdar
Research interests
My research lies in Parameteriezd Complexity and Kernelization on graph theoretic problems. In addition to that, I am also interested in parameterized algorithms in access control of information security.
Personal profile
Link to my personal homepage is here.
Educational background
- PhD in Theoretical Computer Science
August 2013 to October 2018
The Institute of Mathematical Sciences, Chenai, India - M.Tech in Computer Science
July 2011 to July 2013
Indian Statistical Institute, Kolkata, India - B.Tech in Computer Science and Engineering
August 2007 to May 2011
Kalyani Government Engineering College, India
(affiliated to West Bengal University of Technology, India)
Affiliations
- Postdoctoral Research Assistant
January 2019 to Present
Royal Holloway, University of London
Egham, Surrey, United Kingdom
- E-pub ahead of print
Constrained Hitting Set Problem with Intervals
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- E-pub ahead of print
Faster FPT Algorithms for Deletion to Pairs of Graph Classes
Research output: Contribution to conference › Paper › peer-review
- Published
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis
Research output: Contribution to journal › Article › peer-review
University of Warwick
Activity: Visiting an external institution › Visiting an external academic institution
Best paper award at the 26th ACM Symposium on Access Control Models and Technologies (SACMAT 2021)
Prize: Prize (including medals and awards)
ID: 33063235