Gaurav Kanade

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 Imran A. Pirwani

> Home > Persons > Gaurav Kanade

Publications

2012
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GibsonKKPV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GibsonKKPV12
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Clustering to Minimize the Sum of Radii. SIAM J. Comput. 41(1): 47-60 (2012)
2010
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GibsonKKPV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GibsonKKPV10
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. Algorithmica 57(3): 484-498 (2010)
2008
[c2]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/GibsonKKPV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GibsonKKPV08
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On clustering to minimize the sum of radii. SODA 2008: 819-825
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/GibsonKKPV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/GibsonKKPV08
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. SWAT 2008: 282-293

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.