Publications


Doctoral Dissertation

  • Establishing Alternate Routes in Networks and Routes Between Polygons in 2D Space
         Amit M. Bhosle.
         December 10th, 2008, Department of Computer Science, University of California, Santa Barbara.
         Teofilo F. Gonzalez (Ph.D. Committee Chair)


    Journal Publications

  • Exact and Approximation Algorithms for Finding the Optimal Bridge Connecting Two Simple Polygons
        Amit M. Bhosle, Teofilo F. Gonzalez
        Internaltional Journal of Computational Geometry and Applications Vol. 15, No. 6, pp 609-630, 2005. Eds. D.T. Lee, J.S.B. Mitchell
        Also, Technical Report, UC Santa Barbara, UCSB-TR-CS-2003-36.

        [Bibtex] [Abstract]
        The IJCGA has seen an increased impact factor since this issue, and is providing free downloads of this issue's papers for a limited time: [Journal Version (PDF)]

  • On the Difficulty of Some Shortest Path Problems
        John Hershberger , Subhash Suri, Amit M. Bhosle
        ACM Transactions on Algorithms, Vol. 3(1), 2007

  • Algorithms for Single Link Failure Recovery and Related Problems
         Amit M. Bhosle, Teofilo F. Gonzalez
         Journal of Graph Algorithms and Applications Vol.8, No. 3, pp 275-294, 2004. Eds. Roberto Tamassia, Ioannis G. Tollis
         Also, Technical Report, UC Santa Barbara, UCSB-TR-CS-2003-35.

        [Abstract] [Full Version (PDF)] [BibTex]

  • Improved Algorithms for Replacement Paths Problems in Restricted Graphs.
          Amit M. Bhosle
          Operations Research Letters Volume 33, Issue 5, 2005, pp 459-466 DOI: 10.1016/j.orl.2004.08.008
          Featured in the Top25 Hottest Articles
          [Abstract] [PDF] [BibTex]


    Conference Publications

  • Finding Optimal Geodesic Bridges Connecting Two Simple Polygons
          Amit M. Bhosle, Teofilo F. Gonzalez
          CCCG 2011: 23rd Annual Canadian Conference on Computational Geometry
          Aug 10-12, 2011, Toronto, Canada.

  • Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
          Amit M. Bhosle, Teofilo F. Gonzalez   (To be submitted)

  • Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
          Amit M. Bhosle, Teofilo F. Gonzalez
          20th IASTED International Conference on Parallel and Distributed Computing and Systems
          November 16-18, 2008, Orlando, FL, USA

          [Bibtex] [Abstract] [Full Version (PDF)]

  • Replacement Paths for Pairs of Shortest Path Edges in Directed Graphs.
          Amit M. Bhosle, Teofilo F. Gonzalez
          16th IASTED International Conference on Parallel and Distributed Computing and Systems
          November 09-11, 2004, MIT, Cambridge, MA, USA

        [Abstract] [Conference Version] [BibTex]

  • Efficient Algorithms for Single Link Failure Recovery and its Applications to ATM Networks
              Amit M. Bhosle, Teofilo F. Gonzalez
         15th IASTED International Conference on Parallel and Distributed Computing and Systems
          November 03-05, 2003, Marina del Rey, CA, USA

        [Abstract] [Conference Version] [BibTex] [Talk at PDCS03 by Teo]

  • On the Difficulty of Some Shortest Path Problems
          John Hershberger , Subhash Suri, Amit M. Bhosle
          STACS '03: 20th International Symposium on Theoretical Aspects of Computer Science 27 Feb - 01 March 2003, Berlin, Germany

          [Abstract] [Full Version] [BibTex] [Talk at STACS03]

  • Optimal Assignment of High Threshold Voltage for Synthesizing Dual Threshold CMOS Circuits
          Nikhil Tripathi, Amit M. Bhosle, Debasis Samanta, Ajit Pal. In
          14th IEEE International Conference on VLSI Design, Jan. 03-07, 2001, Bangalore, India.

        [Abstract] [pdf] [BibTex]



      Permission to make digital or hard copies of these papers for personal or classroom use is granted provided that copies are not made or distributed for profit or direct commercial advantage.