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

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

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..
 
?
3

Constrained Hitting Set Problem with Intervals:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo. - p. 604-616 , 2021
Link: https://doi.org/10.1007/..
 
?
4

Valued Authorization Policy Existence Problem:

, In: Proceedings of the 26th ACM Symposium on Access Control Models and Technologies,
Crampton, Jason ; Eiben, Eduard ; Gutin, Gregory.. - p. 83-94 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Faster FPT Algorithms for Deletion to Pairs of Graph Classe:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh - p. 314-326 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Bounded and Approximate Strong Satisfiability in Workflows:

, In: Proceedings of the 24th ACM Symposium on Access Control Models and Technologies,
Crampton, Jason ; Gutin, Gregory ; Majumdar, Diptapriyo - p. 179-184 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

Parameterized Complexity of Conflict-Free Set Cover:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh - p. 191-202 , 2019
Link: https://doi.org/10.1007/..
 
1-7