Seguir
Diptapriyo Majumdar
Título
Citado por
Citado por
Año
Polynomial kernels for vertex cover parameterized by small degree modulators
D Majumdar, V Raman, S Saurabh
Theory of Computing Systems 62, 1910-1951, 2018
202018
Revisiting connected vertex cover: FPT algorithms and lossy kernels
R Krithika, D Majumdar, V Raman
Theory of Computing Systems 62, 1690-1714, 2018
192018
Parameterized pre-coloring extension and list coloring problems
G Gutin, D Majumdar, S Ordyniak, M Wahlström
SIAM Journal on Discrete Mathematics 35 (1), 575-596, 2021
122021
Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
D Majumdar, V Raman
Algorithmica 80, 2683-2724, 2018
122018
Kernels for structural parameterizations of vertex cover-case of small degree modulators
D Majumdar, V Raman, S Saurabh
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), 2015
122015
Parameterized complexity of conflict-free set cover
A Jacob, D Majumdar, V Raman
Theory of Computing Systems 65, 515-540, 2021
72021
Parameterized complexity of deletion to scattered graph classes
A Jacob, D Majumdar, V Raman
International Symposium on Parameterized and Exact Computation 180, 18:1-18:17, 2020
72020
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
72018
Structural parameterizations of feedback vertex set
D Majumdar
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
72017
On the approximate compressibility of connected vertex cover
D Majumdar, MS Ramanujan, S Saurabh
Algorithmica 82, 2902-2926, 2020
62020
FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
D Majumdar, V Raman
International Workshop on Frontiers in Algorithmics, 209-220, 2017
52017
p-edge/vertex-connected vertex cover: Parameterized and approximation algorithms
C Einarson, G Gutin, BMP Jansen, D Majumdar, M Wahlström
Journal of Computer and System Sciences 133, 23-40, 2023
42023
Structural parameterizations of dominating set variants
D Goyal, A Jacob, K Kumar, D Majumdar, V Raman
International Computer Science Symposium in Russia, 157-168, 2018
42018
Exact and Parameterized Algorithms for (ki)-Coloring
D Majumdar, R Neogi, V Raman, P Tale
Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017
42017
Deletion to scattered graph classes II-improved FPT algorithms for deletion to pairs of graph classes
A Jacob, D Majumdar, V Raman
Journal of Computer and System Sciences 136, 280-301, 2023
32023
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
32023
Valued Authorization Policy Existence Problem: Theory and Experiments
J Crampton, E Eiben, G Gutin, D Karapetyan, D Majumdar
ACM Transactions on Privacy and Security, 2022
32022
Valued authorization policy existence problem
J Crampton, E Eiben, G Gutin, D Karapetyan, D Majumdar
Proceedings of the 26th ACM Symposium on Access Control Models and …, 2021
32021
Faster FPT algorithms for deletion to pairs of graph classes
A Jacob, D Majumdar, V Raman
Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021 …, 2021
32021
Bounded and approximate strong satisfiability in workflows
J Crampton, G Gutin, D Majumdar
Proceedings of the 24th ACM Symposium on Access Control Models and …, 2019
32019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20