Skip to content

Asish Mukhopadhyay

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

16

Venues

5

Active years

1991–2018

Best venue rank

C

Where they publish

Papers

16 indexed papers, newest first.

YearVenueTitleAuthors
2018ICCSAMolecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach.Udayamoorthy Navaneetha Krishnan, Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
2017ICCSAA Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane.Md. Zamilur Rahman, Asish Mukhopadhyay, Yash Pal Aneja, Cory Jean
2016ICCSAPoint Placement in an Inexact Model with Applications.Kishore Kumar Varadharajan Kannan, Pijus Kumar Sarker, Amangeldy Turdaliev, Asish Mukhopadhyay
2015ICCSARandomized Versus Deterministic Point Placement Algorithms: An Experimental Study.Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan
2014ICCSAClosest-Point Queries for Complex Objects.Eugene Greene, Asish Mukhopadhyay
2014WALCOMLinear Layouts of Weakly Triangulated Graphs.Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
2013ICCSAAn Incremental Linear Programming Based Tool for Analyzing Gene Expression Data.Satish Panigrahi, Md. Shafiul Alam, Asish Mukhopadhyay
2010COCOAApproximate Ellipsoid in the Streaming Model.Asish Mukhopadhyay, Animesh Sarker, Tom Switzer
2007ICCSAOn Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.Asish Mukhopadhyay, Eugene Greene, S. V. Rao
2003ICCSAComputing a Closest Point to a Query Hyperplane in Three and Higher Dimensions.Pinaki Mitra, Asish Mukhopadhyay
2003ICCSAComputing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation.Asish Mukhopadhyay, S. V. Rao
2001WADSOptimal Algorithms for Two-Guard Walkability of Simple Polygons.Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
1997ISAACFast Algorithms for Computing beta-Skeletons and Their Relatives.S. V. Rao, Asish Mukhopadhyay
1995ISAACComputing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible.Binay K. Bhattacharya, Asish Mukhopadhyay
1995WADSA Linear-time Construction of the Relative Neighborhood Graph within a Histogram.Andrzej Lingas, Asish Mukhopadhyay
1991WADSA Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible.Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint