Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Rohit Khandekar

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 Rajiv Gandhi

> Home > Persons > Rohit Khandekar

Publications

2017
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/BhangaleGHKK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BhangaleGHKK17
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31(4): 2626-2646 (2017)
2016
[c52]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/BhangaleGHKK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/BhangaleGHKK16
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP 2016: 6:1-6:12
[i6]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/HajiaghayiBGKK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HajiaghayiBGKK16
Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. TR16 (2016)

a service of

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.