Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Majumdar, Diptapriyo
57  Ergebnisse:
Personensuche X
?
1

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

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
Theoretical Computer Science.  990 (2024)  - p. 114402 , 2024
Link: https://doi.org/10.1016/..
 
?
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

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/..
 
?
5

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/..
 
?
6

Highly Connected Steiner Subgraph -- Parameterized Algorith..:

Eiben, Eduard ; Majumdar, Diptapriyo ; Ramanujan, M. S
http://arxiv.org/abs/2311.02708.  , 2023
Link: http://arxiv.org/abs/231..
 
?
7

Shortest Path with Positive Disjunctive Constraints -- a Pa..:

Bandopadhyay, Susobhan ; Banerjee, Suman ; Majumdar, Diptapriyo.
http://arxiv.org/abs/2309.04346.  , 2023
Link: http://arxiv.org/abs/230..
 
?
8

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

Ashwin Jacob ; Diptapriyo Majumdar ; Venkatesh Raman
Analysis of Algorithms and Complexity Theory.  , 2023
Link: https://doi.org/10.3390/..
 
?
9

Expansion Lemma -- Variations and Applications to Polynomia..:

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
http://arxiv.org/abs/2303.02687.  , 2023
Link: http://arxiv.org/abs/230..
 
?
10

Polynomial-delay Enumeration Kernelizations for Cuts of Bou..:

Majumdar, Diptapriyo ; Ramanujan, M. S
http://arxiv.org/abs/2308.01286.  , 2023
Link: http://arxiv.org/abs/230..
 
?
11

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

Ashwin Jacob ; Diptapriyo Majumdar ; Venkatesh Raman
https://www.mdpi.com/1999-4893/16/3/144.  , 2023
Link: https://doi.org/10.3390/..
 
?
12

On the Lossy Kernelization for Connected Treedepth Deletion..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Eiben, Eduard ; Majumdar, Diptapriyo ; Ramanujan, M. S. - p. 201-214 , 2022
Link: https://doi.org/10.1007/..
 
?
13

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/..
 
?
14

Generalized Noise Role Mining:

, In: Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies,
Crampton, Jason ; Eiben, Eduard ; Gutin, Gregory.. - p. 91-102 , 2022
Link: https://dl.acm.org/doi/1..
 
?
15

Deletion to Scattered Graph Classes II -- Improved FPT Algo..:

Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
http://arxiv.org/abs/2201.03142.  , 2022
Link: http://arxiv.org/abs/220..
 
1-15