Diptapriyo Majumdar

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with M. S. Ramanujan 0001

> Home > Persons > Diptapriyo Majumdar

Publications

2023
[c16]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/EibenM023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/EibenM023
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15
[i12]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2311-02708
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2311-02708
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
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/EibenMR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/EibenMR22
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214
[i10]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2212-00418
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2212-00418
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR abs/2212.00418 (2022)
2020
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/MajumdarRS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/MajumdarRS20
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82(10): 2902-2926 (2020)
2019
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1905-03379
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-03379
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. CoRR abs/1905.03379 (2019)

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.