Exact Computation of the Characteristic Polynomial of an Integer Matrix. - Asish Mukhopadhyay; Vangalur S. Alagar (AAECC, 1985)

A Solution to the Polynominal Hensel-Code Conversion Problem. - Asish Mukhopadhyay (European Conference on Computer Algebra (2), 1985)

A Solution to the Polynomial Hensel Code Conversion Problem. - Asish Mukhopadhyay (IEEE Trans. Computers, 1987)

Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). - Binay K. Bhattacharya; Shreesh Jadhav; Asish Mukhopadhyay; Jean-Marc Robert 001 (SCG, 1991)

A 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 (WADS, 1991)

Adaptive cell division for ray tracing. - B. S. S. Pradhan; Asish Mukhopadhyay (Comput. Graph., 1991)

Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. - Asish Mukhopadhyay; Chanchal Kumar; Binay K. Bhattacharya (CCCG, 1993)

On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. - G. Srinivasaraghavan 001; Asish Mukhopadhyay (CCCG, 1993)

Optimal algorithms for some intersection radius problems. - Binay K. Bhattacharya; Shreesh Jadhav; Asish Mukhopadhyay; J.-M. Robert (Computing, 1994)

Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. - Shreesh Jadhav; Asish Mukhopadhyay (Discret. Comput. Geom., 1994)

A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. - G. Srinivasaraghavan 001; Asish Mukhopadhyay (Discret. Comput. Geom., 1994)

Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. - Binay K. Bhattacharya; Asish Mukhopadhyay (ISAAC, 1995)

A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. - Andrzej Lingas; Asish Mukhopadhyay (WADS, 1995)

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. - Shreesh Jadhav; Asish Mukhopadhyay; Binay K. Bhattacharya (J. Algorithms, 1996)

Voronoi Diagrams for Direction-Sensitive Distances. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Asish Mukhopadhyay; Evanthia Papadopoulou (SCG, 1997)

On the Ordinary Line Problem in Computational Geometry. - Asish Mukhopadhyay; Alok Aggrawal; Ravi Mohan Hosabettu (Nord. J. Comput., 1997)

Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. - Binay K. Bhattacharya; Asish Mukhopadhyay; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 1999)

Finding an Ordinary Conic and an Ordinary Hyperplane. - Olivier Devillers; Asish Mukhopadhyay (Nord. J. Comput., 1999)

Efficient Algorithms for Computing the beta-spectrum. - S. V. Rao 001; Asish Mukhopadhyay (CCCG, 2000)

Output-Sensitive Algorithm for Computing beta-Skeletons. - Asish Mukhopadhyay; S. V. Rao 001 (Computing, 2000)

Orthogonal Edge Visibility Graphs of Polygons with Holes. - G. Srinivasaraghavan 001; Asish Mukhopadhyay (Int. J. Comput. Geom. Appl., 2000)

Optimal Algorithms for Two-Guard Walkability of Simple Polygons. - Binay K. Bhattacharya; Asish Mukhopadhyay; Giri Narasimhan (WADS, 2001)

Fast algorithms for computing Beta-skeletons and their relatives. - S. V. Rao 001; Asish Mukhopadhyay (Pattern Recognit., 2001)

On the Minimum Perimeter Triangle Enclosing a Convex Polygon. - Binay K. Bhattacharya; Asish Mukhopadhyay (JCDCG, 2002)

Optimally computing a shortest weakly visible line segment inside a simple polygon. - Binay K. Bhattacharya; Gautam Das 001; Asish Mukhopadhyay; Giri Narasimhan (Comput. Geom., 2002)

An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. - Anna Medvedeva; Asish Mukhopadhyay (CCCG, 2003)

Computing the Closest Point to a Circle. - Pinaki Mitra; Asish Mukhopadhyay; S. V. Rao 001 (CCCG, 2003)

Encoding Quadrilateral Meshes. - Asish Mukhopadhyay; Quanbin Jing (CCCG, 2003)

Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. - Pinaki Mitra; Asish Mukhopadhyay (ICCSA (3), 2003)

Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. - Asish Mukhopadhyay; S. V. Rao 001 (ICCSA (3), 2003)

On Computing a Largest Empty Arbitrarily Oriented Rectangle. - Asish Mukhopadhyay; S. V. Rao 001 (Int. J. Comput. Geom. Appl., 2003)

Using simplicial partitions to determine a closest point to a query line. - Asish Mukhopadhyay (Pattern Recognit. Lett., 2003)

Encoding Quadrilateral Meshes in 2.40 bits per Vertex. - Pawel Kosicki; Asish Mukhopadhyay (ICVGIP, 2004)

An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. - Asish Mukhopadhyay; Robert L. Scot Drysdale (CCCG, 2006)

An RNG-based heuristic for curve reconstruction. - Asish Mukhopadhyay; Augustus Das (ISVD, 2006)

On the All-Farthest-Segments problem for a planar set of points. - Asish Mukhopadhyay; Samidh Chatterjee; Benjamin J. Lafreniere (Inf. Process. Lett., 2006)

Curve reconstruction in the presence of noise. - Asish Mukhopadhyay; Augustus Das (CGIV, 2007)

On a Geometric Approach to the Segment Sum Problem and Its Generalization. - Asish Mukhopadhyay; Eugene Greene (CCCG, 2007)

An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. - Robert L. Scot Drysdale; Asish Mukhopadhyay (Inf. Process. Lett., 2008)

On intersecting a set of parallel line segments with a convex polygon of minimum area. - Asish Mukhopadhyay; Chanchal Kumar; Eugene Greene; Binay K. Bhattacharya (Inf. Process. Lett., 2008)

Generalized jewels and the point placement problem. - Md. Shafiul Alam; Asish Mukhopadhyay; Animesh Sarker (CCCG, 2009)

Streaming 1-Center with Outliers in High Dimensions. - Hamid Zarrabi-Zadeh; Asish Mukhopadhyay (CCCG, 2009)

Editorial CCCG 2005. - Prosenjit Bose; Asish Mukhopadhyay (Comput. Geom., 2009)

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. - Asish Mukhopadhyay; Eugene Greene; S. V. Rao 001 (Int. J. Comput. Geom. Appl., 2009)

A new algorithm and improved lower bound for point placement on a line in two rounds. - Md. Shafiul Alam; Asish Mukhopadhyay (CCCG, 2010)

Computing the straight skeleton of a monotone polygon in O(n log n) time. - Gautam K. Das; Asish Mukhopadhyay; Subhas C. Nandy; Sangameswar Patil; S. V. Rao 001 (CCCG, 2010)

Constraint Representation for Autonomous Camera. - Md. Shafiul Alam; Asish Mukhopadhyay (CGVR, 2010)

Approximate Ellipsoid in the Streaming Model. - Asish Mukhopadhyay; Animesh Sarker; Tom Switzer (COCOA (2), 2010)

Algorithms for the Problems of Length-Constrained Heaviest Segments - Md. Shafiul Alam; Asish Mukhopadhyay (CoRR, 2011)

Some Geometric Problems on OMTSE Optoelectronic Computer. - Satish Panigrahi; Asish Mukhopadhyay (Scalable Comput. Pract. Exp., 2011)

The ordinary line problem revisited. - Asish Mukhopadhyay; Eugene Greene (Comput. Geom., 2012)

Improved upper and lower bounds for the point placement problem - Md. Shafiul Alam; Asish Mukhopadhyay (CoRR, 2012)

An Incremental Linear Programming Based Tool for Analyzing Gene Expression Data. - Satish Panigrahi; Md. Shafiul Alam; Asish Mukhopadhyay (ICCSA (5), 2013)

All-maximum and all-minimum problems under some measures. - Asish Mukhopadhyay; Satish Panigrahi (J. Discrete Algorithms, 2013)

From approximate balls to approximate ellipses. - Asish Mukhopadhyay; Eugene Greene; Animesh Sarker; Tom Switzer (J. Glob. Optim., 2013)

Closest-Point Queries for Complex Objects. - Eugene Greene; Asish Mukhopadhyay (ICCSA (2), 2014)

An Eigendecomposition Method for Protein Structure Alignment. - Satish Ch. Panigrahi; Asish Mukhopadhyay (ISBRA, 2014)

A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees. - Asish Mukhopadhyay; Puspal Bhabak (CoRR, 2014)

More on Generalized Jewels and the Point Placement Problem. - Md. Shafiul Alam; Asish Mukhopadhyay (J. Graph Algorithms Appl., 2014)

Three Paths to Point Placement. - Md. Shafiul Alam; Asish Mukhopadhyay (CALDAM, 2015)

Randomized Versus Deterministic Point Placement Algorithms: An Experimental Study. - Asish Mukhopadhyay; Pijus Kumar Sarker; Kishore Kumar Varadharajan Kannan (ICCSA (2), 2015)

Multiple Alignment of Structures Using Center Of ProTeins. - Kaushik Roy 006; Satish Chandra Panigrahi; Asish Mukhopadhyay (ISBRA, 2015)

Algorithms for Problems on Maximum Density Segment. - Md. Shafiul Alam; Asish Mukhopadhyay (CALDAM, 2016)

Point Placement in an Inexact Model with Applications. - Kishore Kumar Varadharajan Kannan; Pijus Kumar Sarker; Amangeldy Turdaliev; Asish Mukhopadhyay (ICCSA (1), 2016)

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments. - Xin Wu; Xijie Zeng; Bryan St. Amour; Asish Mukhopadhyay (CoRR, 2016)

Linear layouts of weakly triangulated graphs. - Asish Mukhopadhyay; S. V. Rao 001; Sidharth Pardeshi; Srinivas Gundlapalli (Discret. Math. Algorithms Appl., 2016)

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. - Md. Zamilur Rahman; Asish Mukhopadhyay; Yash Pal Aneja; Cory Jean (ICCSA (2), 2017)

A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. - Yash P. Aneja; Asish Mukhopadhyay; Md. Zamilur Rahman (CoRR, 2017)

Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach. - Udayamoorthy Navaneetha Krishnan; Md. Zamilur Rahman; Asish Mukhopadhyay; Yash P. Aneja (ICCSA (2), 2018)

An Algorithm for Generating Strongly Chordal Graphs. - Md. Zamilur Rahman; Asish Mukhopadhyay; Yash P. Aneja (CoRR, 2018)

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. - Md. Zamilur Rahman; Udayamoorthy Navaneetha Krishnan; Cory Jeane; Asish Mukhopadhyay; Yash P. Aneja (Trans. Comput. Sci., 2018)

Strongly Chordal Graph Generation using Intersection Graph Characterisation. - Md. Zamilur Rahman; Asish Mukhopadhyay (CoRR, 2019)

A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model. - Kishore Kumar Varadharajan Kannan; Pijus Kumar Sarker; Amangeldy Turdaliev; Asish Mukhopadhyay; Md. Zamilur Rahman (Trans. Comput. Sci., 2019)

A separator-based method for generating weakly chordal graphs. - Md. Zamilur Rahman; Asish Mukhopadhyay; Yash P. Aneja (Discret. Math. Algorithms Appl., 2020)

Semi-dynamic algorithms for strongly chordal graphs. - Md. Zamilur Rahman; Asish Mukhopadhyay (Discret. Math. Algorithms Appl., 2021)

Multiple alignment of structures using center of proteins. - Kaushik Roy 006; Asish Mukhopadhyay; Gilbert Cole (Int. J. Bioinform. Res. Appl., 2021)

Algorithms for Generating Strongly Chordal Graphs. - Asish Mukhopadhyay; Md. Zamilur Rahman (Trans. Comput. Sci., 2021)

Generating Weakly Chordal Graphs from Arbitrary Graphs. - Sudiksha Khanduja; Aayushi Srivastava; Md. Zamilur Rahman; Asish Mukhopadhyay (Trans. Comput. Sci., 2022)

Recognizing and generating unswitchable graphs. - Asish Mukhopadhyay; Daniel John; Srivatsan Vasudevan (CoRR, 2023)

On generating k-factorable graphic sequences with connected (resp.no connected) k-factors. - Asish Mukhopadhyay; Daniel John; Lucas Sarweh (CoRR, 2024)

A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences. - Asish Mukhopadhyay; Daniel John (Discret. Math. Algorithms Appl., 2024)