Asish Mukhopadhyay

发表

Computing a centerpoint of a finite planar set of points in linear time

Asish Mukhopadhyay, Shreesh Jadhav, Shreesh Jadhav, 1993, SCG '93.

Linear Layouts of Weakly Triangulated Graphs

Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, 2014, WALCOM.

Semi-dynamic Algorithms for Strongly Chordal Graphs pdf

Asish Mukhopadhyay, Md. Zamilur Rahman, 2020, ArXiv.

Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible

Asish Mukhopadhyay, Binay K. Bhattacharya, 1995, ISAAC.

On the Ordinary Line Problem in Computational Geometry

Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu, 1997, Nord. J. Comput..

Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation

Asish Mukhopadhyay, S. V. Rao, 2003, ICCSA.

GUARDING SIMPLE POLYGONS WITH SEMI-OPEN EDGE GUARDS

Asish Mukhopadhyay, Godfried T. Toussaint, Chris Drouillard, 2013 .

Computing the Closest Point to a Circle

Asish Mukhopadhyay, S. V. Rao, Pinaki Mitra, 2003, CCCG.

Some Geometric Problems on OMTSE Optoelectronic Computer

Asish Mukhopadhyay, Satish Panigrahi, 2011, Scalable Comput. Pract. Exp..

Exact Computation of the Characteristic Polynomial of an Integer Matrix

Asish Mukhopadhyay, Vangalur S. Alagar, 1985, AAECC.

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane

Asish Mukhopadhyay, Yash P. Aneja, Md. Zamilur Rahman, 2017, ICCSA.

Multiple Alignment of Structures Using Center Of ProTeins

Asish Mukhopadhyay, Kaushik Roy, Satish Panigrahi, 2014, ISBRA.

On the All-Farthest-Segments problem for a planar set of points

Asish Mukhopadhyay, Benjamin J. Lafreniere, Samidh Chatterjee, 2006, Inf. Process. Lett..

Finding an Ordinary Conic and an Ordinary Hyperplane

Asish Mukhopadhyay, Olivier Devillers, 1999, Nord. J. Comput..

Editorial CCCG 2005

Asish Mukhopadhyay, Prosenjit Bose, 2009, Comput. Geom..

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

Asish Mukhopadhyay, Shreesh Jadhav, Binay K. Bhattacharya, 1992, FSTTCS.

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area

Asish Mukhopadhyay, S. V. Rao, Eugene Greene, 2007, ICCSA.

Efficient Algorithms for Computing the beta-spectrum

Asish Mukhopadhyay, S. V. Rao, 2000, CCCG.

Orthogonal Edge Visibility Graphs of Polygons with Holes

G. Srinivasaraghavan, Asish Mukhopadhyay, A. Mukhopadhyay, 2000, Int. J. Comput. Geom. Appl..

Three Paths to Point Placement

Asish Mukhopadhyay, Md. Shafiul Alam, 2015, CALDAM.

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane

Asish Mukhopadhyay, Md. Zamilur Rahman, Yash Pal Aneja, 2017, ICCSA.

Linear layouts of weakly triangulated graphs

Asish Mukhopadhyay, Sidharth Pardeshi, Srinivas Gundlapalli, 2016, Discret. Math. Algorithms Appl..

On the Minimum Perimeter Triangle Enclosing a Convex Polygon

Asish Mukhopadhyay, Binay K. Bhattacharya, B. Bhattacharya, 2002, JCDCG.

A Linear-time Construction of the Relative Neighborhood Graph within a Histogram

Asish Mukhopadhyay, Andrzej Lingas, 1995, WADS.

Constraint Representation for Autonomous Camera

Asish Mukhopadhyay, Md. Shafiul Alam, 2010, CGVR.

A Visualization Tool to Evaluate Pairwise Protein Structure Alignment Algorithms

Asish Mukhopadhyay, Shalini Bhattacharjee, A. Mukhopadhyay, 2018, bioRxiv.

Fast Algorithms for Computing beta-Skeletons and Their Relatives

Asish Mukhopadhyay, S. V. Rao, 1997, ISAAC.

A Solution to the Polynomial Hensel Code Conversion Problem

Asish Mukhopadhyay, 1987, IEEE Transactions on Computers.

A Solution to the Polynominal Hensel-Code Conversion Problem

Asish Mukhopadhyay, 1985, European Conference on Computer Algebra.

Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions

Asish Mukhopadhyay, Pinaki Mitra, 2003, ICCSA.

Encoding Quadrilateral Meshes

Asish Mukhopadhyay, Quanbin Jing, 2003, CCCG.

Optimal algorithms for some intersection radius problems

Asish Mukhopadhyay, Shreesh Jadhav, Binay K. Bhattacharya, 2005, Computing.

Streaming 1-Center with Outliers in High Dimensions

Asish Mukhopadhyay, Hamid Zarrabi-Zadeh, A. Mukhopadhyay, 2009, CCCG.

Voronoi diagrams for direction-sensitive distances

Franz Aurenhammer, Asish Mukhopadhyay, D. T. Lee, 1997, SCG '97.

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

Asish Mukhopadhyay, Shreesh Jadhav, Binay Bhattacharya, 1996, J. Algorithms.

A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees pdf

Asish Mukhopadhyay, Puspal Bhabak, 2014, ArXiv.

Generalized jewels and the point placement problem

Asish Mukhopadhyay, Md. Shafiul Alam, Animesh Sarker, 2009, CCCG.

Computing a centerpoint of a finite planar set of points in linear time

Asish Mukhopadhyay, Shreesh Jadhav, 1994, Discret. Comput. Geom..

An RNG-based heuristic for curve reconstruction

Asish Mukhopadhyay, Augustus Das, 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs

G. Srinivasaraghavan, Asish Mukhopadhyay, 1993, CCCG.

Using simplicial partitions to determine a closest point to a query line

Asish Mukhopadhyay, 2003, Pattern Recognit. Lett..

The Ordinary Line Problem Revisited

Asish Mukhopadhyay, Eugene Greene, 2007, CCCG.

Generating Weakly Chordal Graphs from Arbitrary Graphs pdf

Asish Mukhopadhyay, Md. Zamilur Rahman, Sudiksha Khanduja, 2020, ArXiv.

Randomized Versus Deterministic Point Placement Algorithms: An Experimental Study

Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan, 2015, ICCSA.

Output-Sensitive Algorithm for Computing β-Skeletons

Asish Mukhopadhyay, S. V. Rao, 2000, Computing.

Algorithms for Problems on Maximum Density Segment

Asish Mukhopadhyay, Md. Shafiul Alam, 2016, CALDAM.

Point Placement in an Inexact Model with Applications

Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan, 2016, ICCSA.

An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon

Asish Mukhopadhyay, Anna Medvedeva, 2003, CCCG.

Encoding Quadrilateral Meshes in 2.40 bits per Vertex

Asish Mukhopadhyay, Pawel Kosicki, 2004, ICVGIP.

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments pdf

Asish Mukhopadhyay, Xin Wu, Xijie Zeng, 2016, ArXiv.

Approximate Ellipsoid in the Streaming Model

Asish Mukhopadhyay, Tom Switzer, Animesh Sarker, 2010, COCOA.

An Algorithm for Generating Strongly Chordal Graphs pdf

Asish Mukhopadhyay, Yash P. Aneja, Md. Zamilur Rahman, 2018, ArXiv.

Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon

Asish Mukhopadhyay, Godfried T. Toussaint, Binay K. Bhattacharya, 1999, Int. J. Comput. Geom. Appl..

An Eigendecomposition Method for Protein Structure Alignment

Asish Mukhopadhyay, Satish Panigrahi, A. Mukhopadhyay, 2014, ISBRA.

Optimal algorithms for some smallest intersection radius problems (extended abstract)

Asish Mukhopadhyay, Shreesh Jadhav, Binay K. Bhattacharya, 1991, SCG '91.

A separator-based method for generating weakly chordal graphs

Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja, 2020, Discret. Math. Algorithms Appl..

From approximate balls to approximate ellipses

Asish Mukhopadhyay, Eugene Greene, Tom Switzer, 2013, J. Glob. Optim..

Rationale of risk taking

Asish Mukhopadhyay, 2002 .

On a Geometric Approach to the Segment Sum Problem and Its Generalization

Asish Mukhopadhyay, Eugene Greene, A. Mukhopadhyay, 2007, CCCG.

All-maximum and all-minimum problems under some measures

Asish Mukhopadhyay, Satish Panigrahi, 2013, J. Discrete Algorithms.

An Incremental Linear Programming Based Tool for Analyzing Gene Expression Data

Asish Mukhopadhyay, Md. Shafiul Alam, Satish Panigrahi, 2013, ICCSA.

Improved upper and lower bounds for the point placement problem pdf

Asish Mukhopadhyay, Md. Shafiul Alam, 2012, ArXiv.

A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible

Asish Mukhopadhyay, Godfried T. Toussaint, Binay K. Bhattacharya, 1991, WADS.

Journal of Graph Algorithms and Applications More on Generalized Jewels and the Point Placement Problem

Asish Mukhopadhyay, Md. Shafiul Alam, Md. Shafiul Alam, 2022 .

Curve reconstruction in the presence of noise

Asish Mukhopadhyay, Augustus Das, A. Mukhopadhyay, 2007, Computer Graphics, Imaging and Visualisation (CGIV 2007).

Fast algorithms for computing Beta-skeletons and their relatives

Asish Mukhopadhyay, S. V. Rao, 2001, Pattern Recognit..

Optimal Algorithms for Two-Guard Walkability of Simple Polygons

Asish Mukhopadhyay, Giri Narasimhan, Binay K. Bhattacharya, 2001, WADS.

Computing the straight skeleton of a monotone polygon in O(n log n) time

Asish Mukhopadhyay, Subhas C. Nandy, S. V. Rao, 2010, CCCG.

A new algorithm and improved lower bound for point placement on a line in two rounds

Asish Mukhopadhyay, Md. Shafiul Alam, 2010, CCCG.

Adaptive cell division for ray tracing

Asish Mukhopadhyay, B. S. S. Pradhan, A. Mukhopadhyay, 1991, Comput. Graph..

Optimally computing a shortest weakly visible line segment inside a simple polygon

Asish Mukhopadhyay, Giri Narasimhan, Gautam Das, 2002, Comput. Geom..

On intersecting a set of parallel line segments with a convex polygon of minimum area

Asish Mukhopadhyay, Binay K. Bhattacharya, Eugene Greene, 2008, Inf. Process. Lett..

Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments

Asish Mukhopadhyay, Binay K. Bhattacharya, Chanchal Kumar, 1993, CCCG.

Closest-Point Queries for Complex Objects

Asish Mukhopadhyay, Eugene Greene, 2014, ICCSA.

Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach

Asish Mukhopadhyay, Yash P. Aneja, Md. Zamilur Rahman, 2018, ICCSA.

Algorithms for the Problems of Length-Constrained Heaviest Segments pdf

Asish Mukhopadhyay, Md. Shafiul Alam, Md. Shafiul Alam, 2011, ArXiv.

On Computing a Largest Empty Arbitrarily Oriented Rectangle

Asish Mukhopadhyay, S. V. Rao, 2003, Int. J. Comput. Geom. Appl..

A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem pdf

Asish Mukhopadhyay, Yash P. Aneja, Md. Zamilur Rahman, 2017, ArXiv.

An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points

Asish Mukhopadhyay, Robert L. Scot Drysdale, 2006, CCCG.

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area

Asish Mukhopadhyay, S. V. Rao, Eugene Greene, 2009, Int. J. Comput. Geom. Appl..

Multiple alignment of structures using center of proteins

Asish Mukhopadhyay, Kaushik Roy, Gilbert Cole, 2021, Int. J. Bioinform. Res. Appl..

Multiple alignment of structures using center of proteins

Asish Mukhopadhyay, Kaushik Roy, Gilbert Cole, 2021 .

Algorithms for Generating Strongly Chordal Graphs

Asish Mukhopadhyay, Md. Zamilur Rahman, A. Mukhopadhyay, 2021, Trans. Comput. Sci..