default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiptapriyo Majumdar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ankush Acharyya
, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990: 114402 (2024)- [c17]Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu:
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS 2024: 16:1-16:18 - [i19]Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR abs/2402.08346 (2024) - [i18]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024) - [i17]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR abs/2405.10556 (2024) - [i16]Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi:
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. CoRR abs/2409.14209 (2024) - 2023
- [j14]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16(3): 144 (2023) - [j13]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023) - [j12]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. 136: 280-301 (2023) - [j11]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138: 103460 (2023) - [c16]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15 - [i15]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR abs/2303.02687 (2023) - [i14]Diptapriyo Majumdar:
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. CoRR abs/2308.01286 (2023) - [i13]Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan:
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR abs/2309.04346 (2023) - [i12]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR abs/2311.02708 (2023) - 2022
- [j10]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25(4): 28:1-28:32 (2022) - [c15]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Generalized Noise Role Mining. SACMAT 2022: 91-102 - [c14]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214 - [i11]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR abs/2201.03142 (2022) - [i10]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR abs/2212.00418 (2022) - 2021
- [j9]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65(3): 515-540 (2021) - [j8]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021) - [j7]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. ACM Trans. Priv. Secur. 24(3): 21:1-21:22 (2021) - [c13]Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained Hitting Set Problem with Intervals. COCOON 2021: 604-616 - [c12]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT 2021: 314-326 - [c11]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem. SACMAT 2021: 83-94 - [i9]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR abs/2104.05983 (2021) - [i8]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes I -- case of finite number of graph classes. CoRR abs/2105.04660 (2021) - [i7]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR abs/2106.05761 (2021) - 2020
- [j6]Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82(10): 2902-2926 (2020) - [c10]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC 2020: 18:1-18:17 - [c9]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS 2020: 19:1-19:18 - [i6]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR abs/2009.08158 (2020)
2010 – 2019
- 2019
- [j5]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of König edge deletion problems. Theor. Comput. Sci. 796: 207-215 (2019) - [c8]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. CSR 2019: 191-202 - [c7]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Bounded and Approximate Strong Satisfiability in Workflows. SACMAT 2019: 179-184 - [i5]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Bounded and Approximate Strong Satisfiability in Workflows. CoRR abs/1904.07234 (2019) - [i4]Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. CoRR abs/1905.03379 (2019) - [i3]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR abs/1907.12061 (2019) - 2018
- [j4]Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Algorithmica 80(9): 2683-2724 (2018) - [j3]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62(8): 1690-1714 (2018) - [j2]Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. 62(8): 1910-1951 (2018) - [j1]Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32(3): 1619-1643 (2018) - [c6]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Dominating Set Variants. CSR 2018: 157-168 - [i2]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of Konig Edge Deletion Problems. CoRR abs/1811.04560 (2018) - 2017
- [c5]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale:
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM 2017: 281-293 - [c4]Diptapriyo Majumdar, Venkatesh Raman:
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. FAW 2017: 209-220 - [i1]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR abs/1711.07872 (2017) - 2016
- [c3]Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - [c2]Diptapriyo Majumdar:
Structural Parameterizations of Feedback Vertex Set. IPEC 2016: 21:1-21:16 - 2015
- [c1]Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC 2015: 331-342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
