Diptapriyo Majumdar

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 50

Top Topics

Parameterized Complexity

Top Venues

J. Comput. Syst. Sci.

Publications

Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR (2024)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Bi-objective Optimization in Role Mining. CoRR (2024)
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990 (2024)
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS (2024)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR (2024)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR (2023)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133 (2023)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR (2023)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. 136 (2023)
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR (2023)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16 (3) (2023)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS (2023)
Lawqueen Kanesh, Diptapriyo Majumdar, M. S. Ramanujan
Polynomial-delay Enumeration Kernelizations for Cuts of Bounded Degree. CoRR (2023)
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138 (2023)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25 (4) (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR (2022)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Generalized Noise Role Mining. SACMAT (2022)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG (2022)
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
Constrained Hitting Set Problem with Intervals. COCOON (2021)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. CoRR (2021)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65 (3) (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. SACMAT (2021)
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes. CoRR (2021)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT (2021)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. ACM Trans. Priv. Secur. 24 (3) (2021)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35 (1) (2021)
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82 (10) (2020)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR (2020)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS (2020)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC (2020)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Bounded and Approximate Strong Satisfiability in Workflows. SACMAT (2019)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR (2019)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Bounded and Approximate Strong Satisfiability in Workflows. CoRR (2019)
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
On the Approximate Compressibility of Connected Vertex Cover. CoRR (2019)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Conflict-Free Set Cover. CSR (2019)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
Tractability of König edge deletion problems. Theor. Comput. Sci. 796 (2019)
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
Structural Parameterizations of Dominating Set Variants. CSR (2018)
Diptapriyo Majumdar, Venkatesh Raman
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Algorithmica 80 (9) (2018)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62 (8) (2018)
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. 62 (8) (2018)
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32 (3) (2018)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
Tractability of Konig Edge Deletion Problems. CoRR (2018)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM (2017)
Diptapriyo Majumdar, Venkatesh Raman
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. FAW (2017)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR (2017)
Diptapriyo Majumdar
Structural Parameterizations of Feedback Vertex Set. IPEC (2016)
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP (2016)
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC (2015)