Asish Mukhopadhyay

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 20

Top Topics

Multiple Alignment

Top Venues

Trans. Comput. Sci.

Discret. Math. Algorithms Appl.

Publications

Asish Mukhopadhyay, Daniel John, Srivatsan Vasudevan
Recognizing and generating unswitchable graphs. CoRR (2023)
Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay
Generating Weakly Chordal Graphs from Arbitrary Graphs. Trans. Comput. Sci. 39 (2022)
Asish Mukhopadhyay, Md. Zamilur Rahman
Algorithms for Generating Strongly Chordal Graphs. Trans. Comput. Sci. 38 (2021)
Kaushik Roy, Asish Mukhopadhyay, Gilbert Cole
Multiple alignment of structures using center of proteins. Int. J. Bioinform. Res. Appl. 17 (2) (2021)
Md. Zamilur Rahman, Asish Mukhopadhyay
Semi-dynamic algorithms for strongly chordal graphs. Discret. Math. Algorithms Appl. 13 (4) (2021)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
A separator-based method for generating weakly chordal graphs. Discret. Math. Algorithms Appl. 12 (4) (2020)
Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay
Generating Weakly Chordal Graphs from Arbitrary Graphs. CoRR (2020)
Md. Zamilur Rahman, Asish Mukhopadhyay
Semi-dynamic Algorithms for Strongly Chordal Graphs. CoRR (2020)
Md. Zamilur Rahman, Asish Mukhopadhyay
Strongly Chordal Graph Generation using Intersection Graph Characterisation. CoRR (2019)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
A separator-based method for generating weakly chordal graphs. CoRR (2019)
Kishore Kumar Varadharajan Kannan, Pijus Kumar Sarker, Amangeldy Turdaliev, Asish Mukhopadhyay, Md. Zamilur Rahman
A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model. Trans. Comput. Sci. 34 (2019)
Md. Zamilur Rahman, Udayamoorthy Navaneetha Krishnan, Cory Jeane, Asish Mukhopadhyay, Yash P. Aneja
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. Trans. Comput. Sci. 33 (2018)
Udayamoorthy Navaneetha Krishnan, Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach. ICCSA (2) (2018)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
An Algorithm for Generating Strongly Chordal Graphs. CoRR (2018)
Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. CoRR (2017)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash Pal Aneja, Cory Jean
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. ICCSA (2) (2017)
Xin Wu, Xijie Zeng, Bryan St. Amour, Asish Mukhopadhyay
Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments. CoRR (2016)
Kishore Kumar Varadharajan Kannan, Pijus Kumar Sarker, Amangeldy Turdaliev, Asish Mukhopadhyay
Point Placement in an Inexact Model with Applications. ICCSA (1) (2016)
Md. Shafiul Alam, Asish Mukhopadhyay
Algorithms for Problems on Maximum Density Segment. CALDAM (2016)
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
Linear layouts of weakly triangulated graphs. Discret. Math. Algorithms Appl. 8 (3) (2016)
Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan
Randomized Versus Deterministic Point Placement Algorithms: An Experimental Study. ICCSA (2) (2015)
Md. Shafiul Alam, Asish Mukhopadhyay
Three Paths to Point Placement. CALDAM (2015)
Kaushik Roy, Satish Chandra Panigrahi, Asish Mukhopadhyay
Multiple Alignment of Structures Using Center Of ProTeins. ISBRA (2015)
Md. Shafiul Alam, Asish Mukhopadhyay
More on Generalized Jewels and the Point Placement Problem. J. Graph Algorithms Appl. 18 (1) (2014)
Kaushik Roy, Satish Ch. Panigrahi, Asish Mukhopadhyay
Multiple alignment of structures using center of proteins. CoRR (2014)
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
Linear Layouts of Weakly Triangulated Graphs. WALCOM (2014)
Eugene Greene, Asish Mukhopadhyay
Closest-Point Queries for Complex Objects. ICCSA (2) (2014)
Asish Mukhopadhyay, Puspal Bhabak
A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees. CoRR (2014)
Satish Ch. Panigrahi, Asish Mukhopadhyay
An Eigendecomposition Method for Protein Structure Alignment. ISBRA (2014)
Asish Mukhopadhyay, Eugene Greene, Animesh Sarker, Tom Switzer
From approximate balls to approximate ellipses. J. Glob. Optim. 56 (1) (2013)
Satish Panigrahi, Md. Shafiul Alam, Asish Mukhopadhyay
An Incremental Linear Programming Based Tool for Analyzing Gene Expression Data. ICCSA (5) (2013)
Asish Mukhopadhyay, Satish Panigrahi
All-maximum and all-minimum problems under some measures. J. Discrete Algorithms 21 (2013)
Asish Mukhopadhyay, Eugene Greene
The ordinary line problem revisited. Comput. Geom. 45 (3) (2012)
Md. Shafiul Alam, Asish Mukhopadhyay
Improved upper and lower bounds for the point placement problem CoRR (2012)
Md. Shafiul Alam, Asish Mukhopadhyay
Algorithms for the Problems of Length-Constrained Heaviest Segments CoRR (2011)
Satish Panigrahi, Asish Mukhopadhyay
Some Geometric Problems on OMTSE Optoelectronic Computer. Scalable Comput. Pract. Exp. 12 (2) (2011)
Md. Shafiul Alam, Asish Mukhopadhyay
Constraint Representation for Autonomous Camera. CGVR (2010)
Asish Mukhopadhyay, Animesh Sarker, Tom Switzer
Approximate Ellipsoid in the Streaming Model. COCOA (2) (2010)
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao
Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG (2010)
Md. Shafiul Alam, Asish Mukhopadhyay
A new algorithm and improved lower bound for point placement on a line in two rounds. CCCG (2010)
Asish Mukhopadhyay, Eugene Greene, S. V. Rao
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. Int. J. Comput. Geom. Appl. 19 (6) (2009)
Prosenjit Bose, Asish Mukhopadhyay
Editorial CCCG 2005. Comput. Geom. 42 (5) (2009)
Hamid Zarrabi-Zadeh, Asish Mukhopadhyay
Streaming 1-Center with Outliers in High Dimensions. CCCG (2009)
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sarker
Generalized jewels and the point placement problem. CCCG (2009)
Robert L. Scot Drysdale, Asish Mukhopadhyay
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett. 105 (2) (2008)
Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya
On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. 105 (2) (2008)
Asish Mukhopadhyay, Augustus Das
Curve reconstruction in the presence of noise. CGIV (2007)
Asish Mukhopadhyay, Eugene Greene, S. V. Rao
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. ICCSA (1) (2007)
Asish Mukhopadhyay, Eugene Greene
On a Geometric Approach to the Segment Sum Problem and Its Generalization. CCCG (2007)
Asish Mukhopadhyay, Eugene Greene
The Ordinary Line Problem Revisited. CCCG (2007)
Asish Mukhopadhyay, Robert L. Scot Drysdale
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. CCCG (2006)
Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere
On the All-Farthest-Segments problem for a planar set of points. Inf. Process. Lett. 100 (3) (2006)
Asish Mukhopadhyay, Augustus Das
An RNG-based heuristic for curve reconstruction. ISVD (2006)
Pawel Kosicki, Asish Mukhopadhyay
Encoding Quadrilateral Meshes in 2.40 bits per Vertex. ICVGIP (2004)
Asish Mukhopadhyay
Using simplicial partitions to determine a closest point to a query line. Pattern Recognit. Lett. 24 (12) (2003)
Asish Mukhopadhyay, S. V. Rao
On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geom. Appl. 13 (3) (2003)
Pinaki Mitra, Asish Mukhopadhyay
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. ICCSA (3) (2003)
Anna Medvedeva, Asish Mukhopadhyay
An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. CCCG (2003)
Asish Mukhopadhyay, S. V. Rao
Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) (2003)
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
Computing the Closest Point to a Circle. CCCG (2003)
Asish Mukhopadhyay, Quanbin Jing
Encoding Quadrilateral Meshes. CCCG (2003)
Asish Mukhopadhyay
Using simplicial partitions to determine a closest point to a query line. CCCG (2002)
Binay K. Bhattacharya, Asish Mukhopadhyay
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG (2002)
Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan
Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23 (1) (2002)
Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS (2001)
S. V. Rao, Asish Mukhopadhyay
Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognit. 34 (11) (2001)
S. V. Rao, Asish Mukhopadhyay
Efficient Algorithms for Computing the beta-spectrum. CCCG (2000)
G. Srinivasaraghavan, Asish Mukhopadhyay
Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Asish Mukhopadhyay, S. V. Rao
Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65 (3) (2000)
Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geom. Appl. 9 (1) (1999)
Olivier Devillers, Asish Mukhopadhyay
Finding an Ordinary Conic and an Ordinary Hyperplane. Nord. J. Comput. 6 (4) (1999)
Olivier Devillers, Asish Mukhopadhyay
Finding an ordinary conic and an ordinary hyperplane CoRR (1999)
S. V. Rao, Asish Mukhopadhyay
Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC (1997)
Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu
On the Ordinary Line Problem in Computational Geometry. Nord. J. Comput. 4 (4) (1997)
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
Voronoi Diagrams for Direction-Sensitive Distances. SCG (1997)
Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20 (2) (1996)
Binay K. Bhattacharya, Asish Mukhopadhyay
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC (1995)
Andrzej Lingas, Asish Mukhopadhyay
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS (1995)
Shreesh Jadhav, Asish Mukhopadhyay
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Discret. Comput. Geom. 12 (1994)
Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert
Optimal algorithms for some intersection radius problems. Computing 52 (3) (1994)
G. Srinivasaraghavan, Asish Mukhopadhyay
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 12 (1994)
Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG (1993)
Shreesh Jadhav, Asish Mukhopadhyay
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. SCG (1993)
G. Srinivasaraghavan, Asish Mukhopadhyay
On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG (1993)
Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS (1992)
Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG (1991)
Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS (1991)
B. S. S. Pradhan, Asish Mukhopadhyay
Adaptive cell division for ray tracing. Comput. Graph. 15 (4) (1991)
Asish Mukhopadhyay
A Solution to the Polynomial Hensel Code Conversion Problem. IEEE Trans. Computers 36 (5) (1987)
Asish Mukhopadhyay
A Solution to the Polynominal Hensel-Code Conversion Problem. European Conference on Computer Algebra (2) (1985)
Asish Mukhopadhyay, Vangalur S. Alagar
Exact Computation of the Characteristic Polynomial of an Integer Matrix. AAECC (1985)