Articles with public access mandates - Diptapriyo MajumdarLearn more
Not available anywhere: 2
On the lossy kernelization for connected treedepth deletion set
E Eiben, D Majumdar, MS Ramanujan
International Workshop on Graph-Theoretic Concepts in Computer Science, 201-214, 2022
Mandates: UK Engineering and Physical Sciences Research Council
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms
A Acharyya, V Keikha, D Majumdar, S Pandit
Theoretical Computer Science 990, 114402, 2024
Mandates: Department of Science & Technology, India
Available somewhere: 5
Kernelization of cycle packing with relaxed disjointness constraints
A Agrawal, D Lokshtanov, D Majumdar, AE Mouawad, S Saurabh
SIAM Journal on Discrete Mathematics 32 (3), 1619-1643, 2018
Mandates: European Commission
Deletion to Scattered Graph Classes I -- case of finite number of graph classes
A Jacob, JJH Kroon, D Majumdar, V Raman
Journal of Computer and System Sciences 138, 2023
Mandates: European Commission
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
A Jacob, D Majumdar, V Raman
Algorithms 16 (3), 144, 2023
Mandates: European Commission
Finding a highly connected Steiner subgraph and its applications
E Eiben, D Majumdar, MS Ramanujan
Leibniz International Proceedings in Informatics (LIPIcs) 272, 45, 2023
Mandates: UK Engineering and Physical Sciences Research Council
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints
S Bandopadhyay, A Banik, D Majumdar, A Sahu
49th International Symposium on Mathematical Foundations of Computer Science …, 2024
Mandates: Department of Science & Technology, India
Publication and funding information is determined automatically by a computer program