Ashwin Pananjady

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 N. Safina Devi

> Home > Persons > Ashwin Pananjady

Publications

2015
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/MishraPD15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/MishraPD15
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi:
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. J. Discrete Algorithms 33: 71-80 (2015)
2013
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/MishraPD13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MishraPD13
Sounaka Mishra, Ashwin Pananjady, N. Safina Devi:
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. CoRR abs/1312.3779 (2013)

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.