Ikuti
Diptapriyo Majumdar
Judul
Dikutip oleh
Dikutip oleh
Tahun
Revisiting connected vertex cover: FPT algorithms and lossy kernels
R Krithika, D Majumdar, V Raman
Theory of Computing Systems 62, 1690-1714, 2018
222018
Polynomial kernels for vertex cover parameterized by small degree modulators
D Majumdar, V Raman, S Saurabh
Theory of Computing Systems 62, 1910-1951, 2018
212018
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
132021
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
122015
Parameterized complexity of conflict-free set cover
A Jacob, D Majumdar, V Raman
Theory of Computing Systems 65, 515-540, 2021
92021
Structural parameterizations of feedback vertex set
D Majumdar
11th International Symposium on Parameterized and Exact Computation (IPEC …, 2017
92017
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
82020
On the approximate compressibility of connected vertex cover
D Majumdar, MS Ramanujan, S Saurabh
Algorithmica 82, 2902-2926, 2020
82020
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
82018
Tight (double) exponential bounds for identification problems: Locating-dominating set and test cover
D Chakraborty, F Foucaud, D Majumdar, P Tale
arXiv preprint arXiv:2402.08346, 2024
62024
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
62018
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
52023
Generalized noise role mining
J Crampton, E Eiben, G Gutin, D Karapetyan, D Majumdar
Proceedings of the 27th ACM on Symposium on Access Control Models and …, 2022
52022
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
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
42023
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
42021
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
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
32023
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
A Jacob, D Majumdar, V Raman
Algorithms 16 (3), 144, 2023
32023
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–20