Diptapriyo Majumdar

64 papers A* 1A 1B 11C 3Misc 4Journal 41Unranked 3
YearRankTypeTitle / Venue / Authors
2026 B conf
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree.
SOFSEM
Christian Komusiewicz, Diptapriyo Majumdar
2026 J jnl
Highly Connected Steiner Subgraph: Parameterized Algorithms and Applications to Hitting Set Problems.
SIAM J. Discret. Math.
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2026 J jnl
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
2026 J jnl
On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints.
Inf. Comput.
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2025 J jnl
Bi-objective Optimization in Role Mining.
ACM Trans. Priv. Secur.
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2025 J jnl
On the Structural Parameterizations of 2-Club with Triangle Constraints.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Raghav Sakhuja
2025 J jnl
Parameterized complexity of dominating set variants in almost cluster and split graphs.
J. Comput. Syst. Sci.
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2025 B conf
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration.
WG
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025 J jnl
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration.
CoRR
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025 — conf
Structural Parameterization of Locating-Dominating Set and Test Cover.
CIAC (1)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 B conf
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.
ISAAC
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024 J jnl
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024 J jnl
Bi-objective Optimization in Role Mining.
CoRR
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2024 J jnl
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms.
Theor. Comput. Sci.
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
2024 J jnl
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs.
CoRR
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2024 — conf
Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints.
COCOA (2)
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2024 J jnl
Structural Parameterization of Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 B conf
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
ISAAC
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 J jnl
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 B conf
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints.
MFCS
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
2023 J jnl
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci.
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
J. Comput. Syst. Sci.
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree.
CoRR
Christian Komusiewicz, Diptapriyo Majumdar
2023 J jnl
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
Algorithms
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 B conf
Finding a Highly Connected Steiner Subgraph and its Applications.
MFCS
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023 J jnl
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems.
CoRR
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023 J jnl
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.
CoRR
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2022 J jnl
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set.
CoRR
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2022 J jnl
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2022 C conf
Generalized Noise Role Mining.
SACMAT
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2022 B conf
On the Lossy Kernelization for Connected Treedepth Deletion Set.
WG
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2022 J jnl
Valued Authorization Policy Existence Problem: Theory and Experiments.
ACM Trans. Priv. Secur.
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021 Misc conf
Constrained Hitting Set Problem with Intervals.
COCOON
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
2021 J jnl
Deletion to Scattered Graph Classes I -- case of finite number of graph classes.
CoRR
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2021 B conf
Faster FPT Algorithms for Deletion to Pairs of Graph Classes.
FCT
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2021 J jnl
Parameterized Complexity of Conflict-Free Set Cover.
Theory Comput. Syst.
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2021 J jnl
Parameterized Pre-Coloring Extension and List Coloring Problems.
SIAM J. Discret. Math.
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2021 J jnl
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis.
CoRR
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2021 J jnl
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis.
ACM Trans. Priv. Secur.
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2021 C conf
Valued Authorization Policy Existence Problem.
SACMAT
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021 J jnl
Valued Authorization Policy Existence Problem: Theory and Experiments.
CoRR
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2020 J jnl
On the Approximate Compressibility of Connected Vertex Cover.
Algorithmica
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2020 B conf
Parameterized Complexity of Deletion to Scattered Graph Classes.
IPEC
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2020 A conf
Parameterized Pre-Coloring Extension and List Coloring Problems.
STACS
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2020 J jnl
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms.
CoRR
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
2019 C conf
Bounded and Approximate Strong Satisfiability in Workflows.
SACMAT
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2019 J jnl
Bounded and Approximate Strong Satisfiability in Workflows.
CoRR
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2019 J jnl
On the Approximate Compressibility of Connected Vertex Cover.
CoRR
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2019 Misc conf
Parameterized Complexity of Conflict-Free Set Cover.
CSR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2019 J jnl
Parameterized Pre-coloring Extension and List Coloring Problems.
CoRR
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2019 J jnl
Tractability of König edge deletion problems.
Theor. Comput. Sci.
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2018 J jnl
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
SIAM J. Discret. Math.
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2018 J jnl
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.
Theory Comput. Syst.
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
2018 J jnl
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
Theory Comput. Syst.
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2018 Misc conf
Structural Parameterizations of Dominating Set Variants.
CSR
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2018 J jnl
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization.
Algorithmica
Diptapriyo Majumdar, Venkatesh Raman
2018 J jnl
Tractability of Konig Edge Deletion Problems.
CoRR
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2017 — conf
Exact and Parameterized Algorithms for (k, i)-Coloring.
CALDAM
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
2017 Misc conf
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters.
FAW
Diptapriyo Majumdar, Venkatesh Raman
2017 J jnl
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
CoRR
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2016 A* conf
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
ICALP
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2016 B conf
Structural Parameterizations of Feedback Vertex Set.
IPEC
Diptapriyo Majumdar
2015 B conf
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.
IPEC
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh