Edited Proceedings
Coedited with Dr. Prosenjit Bose a special issue of a selection of papers from the
17th Canadian Conference on Computational Geometry that will appear in Computational Geometry: Theory and Applications , Vol. 42, No. 5, July 2009.
Book Chapter
Satish Ch. Panigrahi, Md. Shafiul Alam and Asish Mukhopadhyay, Feature selection and analysis of gene
expression data using lowdimensional
linear programming, to appear in Emerging Trends in Computational Biology, Bioinformatics and Systems Biology 
Algorithms and Software Tools edited by Prof. QuocNam Tran and Prof. Hamid R. Arabnia, published by ELSEVIER Inc.
Journal/Conference publications and Technical Reports
Computational Geometry

Visibility
Journals

Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay and Giri Narasimhan. Optimally
computing a shortest weakly visible line segment inside a simple polygon.
Computational Geometry: Theory and Applications, 23(1), pages 129, July 2002.

G.Srinivasaraghavan and Asish Mukhopadhyay. Edge visibility graphs of orthogonal polygons with holes. International Journal of Computational Geometry and
Applications, 10(1), pages 79102, 2000

Binay K. Bhattacharya and Asish Mukhopadhyay and Godfried T.Toussaint.
Computing a shortest weakly externally visible line
segment for a simple polygon. International Journal of Computational Geometry and Applications, 9(1), pages 8196, 1999.

G. Srinivasaraghavan and A. Mukhopadhyay. A new necesssary condition for the vertex
visibility graphs of simple polygons. Discrete and Computational
Geometry, 12(1), pages 6582, 1994 .
Conferences

Binay K. Bhattacharya and Asish Mukhopadhyay. Computing in linear time an internal line segment from which a simple polygon is weakly internally visible. In Proceedings of ISAAC, LNCS 1004, pages 2231, Cairns, Australia, 1995 .
 Binay K. Bhattacharya, Asish Mukhopadhyay and Giri Narasimhan. Two guard walkability of simple polygons. In Proceedings
of the 7th International Conference on Algorithms and Data Structures (WADS), LNCS 2125, Rhode Island, USA, 2001 .
 Asish Mukhopadhyay, Chris Drouillard and Godfried Toussaint. Guarding simple polygons with semiopen edge guards.
In Proceedings of The Third International Conference on Digital Information Processing and
Communications (ICDIPC2013), Dubai, UAE, 30 Jan. 2013  1 Feb. 2013, pages 417422
.

Proximity Graphs
Journals

S. V. Rao and Asish Mukhopadhyay. Fast Algorithms for computing betaskeletons and their
relatives. Pattern Recognition, 34, pages 21632172, 2001 .

Asish Mukhopadhyay and S. V. Rao. Outputsensitive algorithm for computing
betaskeletons. Computing, 65, pages 285289, 2000 .
Conferences

Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil and S. V. Rao. Computing the straight skeleton of a monotone polygon in O(n log n) time. Accepted for presentation to Canadian Conference on Computational Geometry, 911 August, 2010 .

S. V. Rao and Asish Mukhopadhyay. Efficient algorithms for computing the betaspectrum. In Proceedings of the Canadian
Conference on Computational Geometry, New Brunswick, pages 9197, August 2000 .

S. V. Rao and Asish Mukhopadhyay. Betaskeletons in higher dimensions.
In Proceedings of the First Indian Conference on Computer Vision, Graphics and Image Processing, New Delhi, pp 402407,
December 1998 .

Andrzej Lingas and Asish Mukhopadhyay. A lineartime construction of the relative neighbourhood graph within a histogram.
The 4th International Workshop on Algorithms and Data Structures (WADS), LNCS 955, pages. 228238, Springer, 1618 August 1995 .

Optimization problems
Combinatorial Geometry
Journals

Asish Mukhopadhyay and Eugene Greene. The ordinary line problem revisited.
In Computational Geometry: Theory and Applications, Vol. 45, pages 127130, 2012.
 Asish Mukhopadhyay, Alok Agrawal and Ravi Mohan Hosabettu. On the ordinary line problem in computational geometry.
Nordic Journal of Computing, 4, pages 330341, 1997.
 Olivier Devillers and Asish Mukhopadhyay. Finding an ordinary conic and
an ordinary hyperplane. Nordic Journal of Computing, 6(4), pages 462468, 1999.
 Shreesh Jadhav and Asish Mukhopadhyay. Computing a centerpoint of a finite planar set of points in
linear time. Discrete and Comp. Geometry, 12(3), pp 291312, 1994.
Reports
 Asish Mukhopadhyay. Computing the incidences of m points and n conics in the plane. Technical Report, School of Computer Science, University of Windsor, Canada.
Biogeometry
Journals
 Md. Shafiul Alam and Asish Mukhopadhyay. More on generalized jewels and the point placement problem.
In Journal of Graph Algorithms and Applications , Volume 18, Number 1, pages 133  173 (40 pages);
DOI: 10.7155/jga.00317
 Asish Mukhopadhyay, Pijus K. Sarker, Kishore Kumar V. Kannan. Point Placement
Algorithms: An Experimental Study. In International Journal of Experimental
Algorithms, Vol. 6, No. 1, pages 114.
Conferences and Reports

Asish Mukhopadhyay and Pijus K. Sarker: Randomized versus deterministic point placement algorithms: an experimental study.
Accepted for presentation to ICCSA 2015, Banff, Alberta, 22 June, 2015  25 June, 2015. Proceedings to appear in
Springer's Lecture Notes in Computer Science series.

Kaushik Roy, Satish Ch. Panigrahi, Asish Mukhopadhyay: Multiple alignment of structures using center of proteins.
CoRR abs/1412.8093 (2014), accepted for presentation in the main track (Track 1) of ISBRA 2015, 07 June  10 June, 2015, Old Dominion University, Norfolk, Virginia;
proceedings to be published in Springer's Lecture Notes
in Computer Science series.

Md. Shafiul Alam and Asish Mukhopadhyay. Three paths to point placement.
In Proceedings of the Conference on Algorithms and Discrete Applied Mathematics (CALDAM) ,
LNCS 8959, pages 3344, held at the Indian Institute of Technology, Kanpur, India, 08 Feb.  10 Feb. 2015.

Satish Panigrahi and Asish Mukhopadhyay. An eigendecomposition method for protein structure
alignment.
In Proceedings of the International Symposium on Bioinformatics Research and Applications (ISBRA 2014)
held in Zhangjiajie, China, June 28  June 30, 2014 (acceptance rate 40%)[Invited to a special issue of IEEE/ACM
Transactions on Bioinformatics and Computational Biology],pages 2437, LNCS ISBN 9783319081700.

Satish Panigrahi, Md. Shafiul Alam, and Asish Mukhopadhyay. A new profiling tool for gene expression data.
Poster presentation at Conference on Informatics and Integrative Biology , 14 December  16 December 2011 (CIIB2011) Kolkata, India. poster; an extended version appeared in the Proceedings of ICCSA(5), Vietnam, pages 4864, LNCS 7975, 2013.

Puspal Bhabak and Asish Mukhopadhyay. Improved Approximation algorithms for agreement forests on k phylogenetic trees.
Oral presentation at Conference on Informatics and Integrative Biology , 14 December  16 December 2011 (CIIB2011) Kolkata, India. talk
 Md. Shafiul Alam, Satish Panigrahi, Puspal Bhabak and Asish Mukhopadhyay.
Multigene linear separabiliy of gene expression data in linear time . In Short Abstracts Collection, pages 5154,
6th International Symposium on Bioinformatics Research and Applications (ISBRA 10) , University of Connecticut, USA,
May 2326, 2010. pdf .
 Md. Shafiul Alam, Asish Mukhopadhyay and Animesh Sarker. Generalized jewels and the point placement problem.
In Proceedings of the 21st Canadian Conference on Computational Geometry, pages 4548, UBC, Vancouver, August 1719, 2009. pdf
 Md. Shafiul Alam and Asish Mukhopadhyay. More on generalized jewels and the point placement problem.
Technical Report, School of Computer Science, University of Windsor, September 2009.
 Md. Shafiul Alam and Asish Mukhopadhyay. A new algorithm and improved lower bound for point placement on a line in
2 rounds. In Proceedings of the 22nd Canadian Conference on Computational Geometry , Winnipeg, Manitoba,
911 August, 2010. pdf
 Md. Shafiul Alam and Asish Mukhopadhyay. Improved upper and lower bounds for the point placement problem. Technical Report, School of Computer Science, University of Windsor, No. 10004, March 2010. Accepted as a poster paper to Workshop on Algorithms in Bioinformatics (WABI 2010) , 810 September, University of Liverpool, England. Also archived as
arXiv.org:1210.3833
 Md. Shafiul Alam and Asish Mukhopadhyay. A linear time geometric algorithm for the segment density problem.
In Abstracts of the Fall Workshop on Computational Geometry, Stony Brook University, Stony Brook, USA, 2930 October, 2010.
 Md. Shafiul Alam and Asish Mukhopadhyay. Algorithms for the problems of lengthconstrained heaviest segments,
August 2011, arXiv.org:1108.4972. Accepted for presentation at
CALDAM 2016, Trivandrum, India, 18 Feb. 2106  20 Feb., 2016 (acceptance rate 33%).
 Md. Shafiul Alam and Asish Mukhopadhyay. Optimal Algorithms for Some Sum and Density Problems of a Sequence, Accepted for
presentation to the 21st Fall Workshop on Computational Geometry, 45 November 2011, CCNY, New York City, New York.
 Kishore Kumar Varadharajan Kannan, Pijus K. Sarker, Amangeldy Turdaliev and Asish Mukhopadhyay.
The point placement problem in an inexact model with applications. In Procceedings of ISSCA 2016, Beijing, China, 4 July 2016  7 July 2016.
LNCS 9786, pages 8496 (Best paper award).
Applications of Computational Geometry in Computer Graphics

Curve and Surface Reconstruction

Asish Mukhopadhyay, Harshit Rathod, Chong Wang and Bryan St. Amour, Certifying curve reconstruction algorithms, In Proceedings of the 26th EuroCG Workshop on Computational Geometry, pages 225228 ,
Dortmund, Germany, March 2224, 2010.

Asish Mukhopadhyay and Augustus Das, Curve reconstruction in the presence of noise, in Proceedings of
Computer Graphics, Imaging and Visualization, pp 177182, held at Bangkok, Thailand
15  17 August, 2007

Asish Mukhopadhyay and Augustus Das, An RNGbased heuristic for curve reconstruction, in Proceedings of the International Symposium on Voronoi Diagram 2006, Banff, Canada, 25 July, 2006, pages 246251, (revised version) pdf

Gunjan Jha, Sanjay Agarwal and Asish Mukhopadhyay, Surface Reconstruction from Contours: Improvements to the BarequetSharir heuristic, in Proceedings of CSI97, Ahmedabad, India, 1997.

Vishal Goenka, Deepak Kumar, Nabanjan Das and Asish Mukhopadhyay,
Surface Reconstruction from Parallel Planar Contours,
in Proceedings of CSI96, Bangalore, pp 441  444, 1996.

Geometric Compression
 Encoding Quadrilateral Meshes in 2.40 bits per vertex, Pawel Kosicki, Asish Mukhopadhyay, in Proceedings of ICVGIP 2004 (acceptance
rate 30%), Kolkata, India, Dec 1618, 2004 .
 Quanbin Jing, Asish Mukhopadhyay, Linear time compression and decompression of 3d quad mesh on
vertex and oppositeedge table, Manuscript, June 2002.
 Asish Mukhopadhyay, Quanbin Jing, Encoding quadrilateral meshes, accepted to
the Fifteenth Canadian Conference on Computational Geometry, halifax, Nova Scotia, 2003.
May 2003. Compressed PDF File
Computer Graphics
 B. S. S. Pradhan and A. Mukhopadhyay, Adaptive cell division for raytracing, Computers and Graphics, Vol. 15, No. 4, pp 549552, 1991 .
Miscellaneous
Journals

Asish Mukhopadhyay, S.V. Rao, Sidharth Pardeshi and Srinivas Gundlapalli, Linear Layouts of Weakly Triangulated Graphs,
In Discrete Mathematics, Algorithms and Applications, Vol. 8, No. 2 , World Scientific, 2016

Satish Panigrahi and Asish Mukhopadhyay. Some geometric problems on OMTSE optoelectronic computer. In Scalable Computing: Practice and Experience
Vol. 12, pages 275282, 2011.

Asish Mukhopadhyay, 2x2 matrixmultiplication revisited, in Journal of the Indian Institute of Science ,
Bangalore 64(B)(1983),105107.
 Asish Mukhopadhyay, A solution to the polynomial Henselcode problem, IEEE Transactions on Computers, VC36, pp 634637, 1987 .
Conferences and Reports

M. S. Alam and Asish Mukhopadhyay. Constraint Representation for Autonomous Camera. Accepted to the 2010 International Conference on
Computer Graphics and Virtual Reality (CGVR'10) , Las Vegas, Nevada, USA, 12 July  15 July, 2010.
 Asish Mukhopadhyay and V.S.Alagar, Exact computation of the characteristic polynomial of an
integer matrix, Annual Conference on Computer Algebra, Algebraic
Algorithms, Symbolic Computation and ErrorCorrecting Codes,
Grenoble, France, 1985, pp 316324, LNCS V229.

Asish Mukhopadhyay, S.V. Rao, Sidharth Pardeshi and Srinivas Gundlapalli, Linear Layouts of Weakly Triangulated Graphs,
Presented at the International Workshop on Algorithms and Computation (WALCOM 2014) , Indian Institute of Technology, Chennai, 13 Feb., 2014  15 Feb., 2014;
Proceedings published in the LNCS series, Volume 8344, pages 322  336.