Asish Mukhopadhyay

94 papers B 6Journal 49Unranked 39

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