Diptapriyo Majumdar

Orcid: 0000-0003-2677-4648

According to our database1, Diptapriyo Majumdar authored at least 34 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Bi-objective Optimization in Role Mining.
CoRR, 2024

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

2023
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci., December, 2023

<i>p</i>-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.
J. Comput. Syst. Sci., May, 2023

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
Algorithms, March, 2023

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
J. Comput. Syst. Sci., 2023

Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems.
CoRR, 2023

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.
CoRR, 2023

Enumeration Kernelizations of Polynomial Size for Cuts of Bounded Degree.
CoRR, 2023

Finding a Highly Connected Steiner Subgraph and its Applications.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Valued Authorization Policy Existence Problem: Theory and Experiments.
ACM Trans. Priv. Secur., 2022

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set.
CoRR, 2022

On the Lossy Kernelization for Connected Treedepth Deletion Set.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Generalized Noise Role Mining.
Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

2021
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis.
ACM Trans. Priv. Secur., 2021

Parameterized Pre-Coloring Extension and List Coloring Problems.
SIAM J. Discret. Math., 2021

Parameterized Complexity of Conflict-Free Set Cover.
Theory Comput. Syst., 2021

Valued Authorization Policy Existence Problem.
Proceedings of the SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies, 2021

Faster FPT Algorithms for Deletion to Pairs of Graph Classes.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Constrained Hitting Set Problem with Intervals.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms.
CoRR, 2020

On the Approximate Compressibility of Connected Vertex Cover.
Algorithmica, 2020

Parameterized Complexity of Deletion to Scattered Graph Classes.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
Tractability of König edge deletion problems.
Theor. Comput. Sci., 2019

Bounded and Approximate Strong Satisfiability in Workflows.
Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, 2019

2018
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
SIAM J. Discret. Math., 2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.
Theory Comput. Syst., 2018

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
Theory Comput. Syst., 2018

Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization.
Algorithmica, 2018

Structural Parameterizations of Dominating Set Variants.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Exact and Parameterized Algorithms for (k, i)-Coloring.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Structural Parameterizations of Feedback Vertex Set.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015


  Loading...