E-LIB Suche - Ergebnisse für: Majumdar, Diptapriyo

1

Constrained hitting set problem with intervals: Hardness, F..:

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
Theoretical Computer Science. 990 (2024) - p. 114402 , 2024

2

Deletion to scattered graph classes I - Case of finite numb..:

Jacob, Ashwin ; de Kroon, Jari J.H. ; Majumdar, Diptapriyo.
Journal of Computer and System Sciences. 138 (2023) - p. 103460 , 2023

Link: https://doi.org/10.1016/..

3

Expansion Lemma—Variations and Applications to Polynomial-T..:

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
Algorithms. 16 (2023) 3 - p. 144 , 2023

Link: https://doi.org/10.3390/..

4

p-Edge/vertex-connected vertex cover: Parameterized and app..:

Einarson, Carl ; Gutin, Gregory ; Jansen, Bart M.P...
Journal of Computer and System Sciences. 133 (2023) - p. 23-40 , 2023

Link: https://doi.org/10.1016/..

5

Deletion to scattered graph classes II - improved FPT algor..:

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
Journal of Computer and System Sciences. 136 (2023) - p. 280-301 , 2023

Link: https://doi.org/10.1016/..

6

Valued Authorization Policy Existence Problem: Theory and E..:

Crampton, Jason ; Eiben, Eduard ; Gutin, Gregory..
ACM Transactions on Privacy and Security. 25 (2022) 4 - p. 1-32 , 2022

Link: https://doi.org/10.1145/..

7

Parameterized Complexity of Conflict-Free Set Cover:

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
Theory of Computing Systems. 65 (2021) 3 - p. 515-540 , 2021

Link: https://doi.org/10.1007/..

8

Towards Better Understanding of User Authorization Query Pr..:

Crampton, Jason ; Gutin, Gregory Z. ; Majumdar, Diptapriyo
ACM Transactions on Privacy and Security (TOPS). 24 (2021) 3 - p. 1-22 , 2021

Link: https://dl.acm.org/doi/1..

9

Towards Better Understanding of User Authorization Query Pr..:

Crampton, Jason ; Gutin, Gregory Z. ; Majumdar, Diptapriyo
ACM Transactions on Privacy and Security. 24 (2021) 3 - p. 1-22 , 2021

Link: https://doi.org/10.1145/..

10

Parameterized Pre-Coloring Extension and List Coloring Prob..:

Gutin, Gregory ; Majumdar, Diptapriyo ; Ordyniak, Sebastian.
SIAM Journal on Discrete Mathematics. 35 (2021) 1 - p. 575-596 , 2021

Link: https://doi.org/10.1137/..

11

On the Approximate Compressibility of Connected Vertex Cove:

Majumdar, Diptapriyo ; Ramanujan, M. S. ; Saurabh, Saket
Algorithmica. 82 (2020) 10 - p. 2902-2926 , 2020

Link: https://doi.org/10.1007/..

12

Tractability of König edge deletion problems:

Majumdar, Diptapriyo ; Neogi, Rian ; Raman, Venkatesh.
Theoretical Computer Science. 796 (2019) - p. 207-215 , 2019

Link: https://doi.org/10.1016/..

13

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy..:

Krithika, R. ; Majumdar, Diptapriyo ; Raman, Venkatesh
Theory of Computing Systems. 62 (2018) 8 - p. 1690-1714 , 2018

Link: https://doi.org/10.1007/..

14

Kernelization of Cycle Packing with Relaxed Disjointness Co..:

Agrawal, Akanksha ; Lokshtanov, Daniel ; Majumdar, Diptapriyo..
SIAM Journal on Discrete Mathematics. 32 (2018) 3 - p. 1619-1643 , 2018

Link: https://doi.org/10.1137/..

15

Structural Parameterizations of Undirected Feedback Vertex ..:

Majumdar, Diptapriyo ; Raman, Venkatesh
Algorithmica. 80 (2018) 9 - p. 2683-2724 , 2018

Link: https://doi.org/10.1007/..