Diptapriyo Majumdar
VIDWAN ID: 244608

Dr Diptapriyo Majumdar

Male Doctor of Philosophy
Assistant Professor | Department of Computer Science and Engineering
Indraprastha Institute of Information Technology
Delhi
Expertise: Computer Science Theory and Methods
44 Publications
1 Projects
175 Scopus Citations
102 CrossRef
4 Years 9 Months Total Experience
Publications
44 Total
Articles
21
Chapters
5
Proceedings
18
Activity

No publication activity to display.

Scopus Scopus
175 Citations
7 h-index
CrossRef CrossRef
102 Citations
6 h-index
Google Scholar Google Scholar

Loading Scholar statistics...

Professional Recognition

Best paper award
2022
Program Committee of ACM-SACMAT 2022
Best student paper award
2021
Program Committee of ACM-SACMAT 2021
Best student paper award
2021
Program Committee of FCT 2021
UGC NET for Lectureship
2013
UGC

Community & Membership

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Personal Details

Doctor of Philosophy
2018
N/A
Master of Technology
2013
N/A
Bachelor of Technology
2011
N/A
Assistant Professor
Dec 2021 – Present
Indraprastha Institute of Information Technology | Department of Computer Science and Engineering
Engineering and Technology
Computer Science Theory and Methods

Related Profiles

Scholarly Work

Efficient Enumeration of Feasible Solutions to Combinatorial Optimization
Completed
Role: Principal Investigator Grant: SRG/2023/001592
No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Scholarly Publications

Constrained Hitting Set Problem with Intervals

Conference Paper
Year: 2021. Volume: 13025 LNCS , Pages: 604-616 .
Authors: Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit

Generalized Noise Role Mining

Conference Paper
Year: 2022. Pages: 91-102 .
Authors: Jason Crampton; Eduard Eiben; Gregory Gutin; Daniel Karapetyan; Diptapriyo Majumdar

Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms

Journal Article
Theoretical Computer Science. Year: 2024. Volume: 990 .
Authors: Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit

Faster FPT Algorithms for Deletion to Pairs of Graph Classes

Conference Paper
Year: 2021. Volume: 12867 LNCS , Pages: 314-326 .
Authors: Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman

Polynomial Kernels for Spanning Tree with Diversity Requirements

Conference Paper
Year: 2026. Volume: 376 .

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees

Conference Paper
Year: 2024. Volume: 322 .

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover

Conference Paper
Year: 2024. Volume: 322 .

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints

Conference Paper
Year: 2024. Volume: 306 .
Showing 1 to 8 of 44 publications