dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Shreesh Jadhav Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1996
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20(2): 244-267 (1996)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBinay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert: Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (1994)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShreesh Jadhav, Asish Mukhopadhyay: Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Discrete & Computational Geometry 12: 291-312 (1994)
1993
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShreesh Jadhav, Asish Mukhopadhyay: Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Symposium on Computational Geometry 1993: 83-90
1992
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS 1992: 92-103
1991
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBinay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert: Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). Symposium on Computational Geometry 1991: 81-88

Coauthor Index

1Binay K. Bhattacharya [1] [2] [5] [6]
2Asish Mukhopadhyay [1] [2] [3] [4] [5] [6]
3J.-M. Robert [5]
4Jean-Marc Robert [1]

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page