default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAsish Mukhopadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Asish Mukhopadhyay, Daniel John:
A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences. Discret. Math. Algorithms Appl. 16(5): 2350056:1-2350056:8 (2024)- [i14]Asish Mukhopadhyay, Daniel John, Lucas Sarweh:
On generating k-factorable graphic sequences with connected (resp.no connected) k-factors. CoRR abs/2410.18999 (2024) - 2023
- [i13]Asish Mukhopadhyay, Daniel John, Srivatsan Vasudevan:
Recognizing and generating unswitchable graphs. CoRR abs/2304.12381 (2023) - 2022
- [j33]Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay:
Generating Weakly Chordal Graphs from Arbitrary Graphs. Trans. Comput. Sci. 39: 71-84 (2022) - 2021
- [j32]Md. Zamilur Rahman, Asish Mukhopadhyay:
Semi-dynamic algorithms for strongly chordal graphs. Discret. Math. Algorithms Appl. 13(4): 2150049:1-2150049:42 (2021) - [j31]Kaushik Roy, Asish Mukhopadhyay, Gilbert Cole:
Multiple alignment of structures using center of proteins. Int. J. Bioinform. Res. Appl. 17(2): 135-157 (2021) - [j30]Asish Mukhopadhyay, Md. Zamilur Rahman:
Algorithms for Generating Strongly Chordal Graphs. Trans. Comput. Sci. 38: 54-75 (2021) - 2020
- [j29]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. Discret. Math. Algorithms Appl. 12(4): 2050039:1-2050039:16 (2020) - [i12]Md. Zamilur Rahman, Asish Mukhopadhyay:
Semi-dynamic Algorithms for Strongly Chordal Graphs. CoRR abs/2002.07207 (2020) - [i11]Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay:
Generating Weakly Chordal Graphs from Arbitrary Graphs. CoRR abs/2003.13786 (2020)
2010 – 2019
- 2019
- [j28]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: 44-63 (2019) - [i10]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. CoRR abs/1906.01056 (2019) - [i9]Md. Zamilur Rahman, Asish Mukhopadhyay:
Strongly Chordal Graph Generation using Intersection Graph Characterisation. CoRR abs/1909.02545 (2019) - 2018
- [j27]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: 97-114 (2018) - [c45]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: 412-424 - [i8]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
An Algorithm for Generating Strongly Chordal Graphs. CoRR abs/1804.09019 (2018) - 2017
- [c44]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: 494-508 - [i7]Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman:
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. CoRR abs/1705.09643 (2017) - 2016
- [j26]Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
Linear layouts of weakly triangulated graphs. Discret. Math. Algorithms Appl. 8(3): 1650038:1-1650038:21 (2016) - [c43]Md. Shafiul Alam, Asish Mukhopadhyay:
Algorithms for Problems on Maximum Density Segment. CALDAM 2016: 14-25 - [c42]Kishore Kumar Varadharajan Kannan, Pijus Kumar Sarker, Amangeldy Turdaliev, Asish Mukhopadhyay:
Point Placement in an Inexact Model with Applications. ICCSA (1) 2016: 84-96 - [i6]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 abs/1609.01662 (2016) - 2015
- [c41]Md. Shafiul Alam, Asish Mukhopadhyay:
Three Paths to Point Placement. CALDAM 2015: 33-44 - [c40]Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan:
Randomized Versus Deterministic Point Placement Algorithms: An Experimental Study. ICCSA (2) 2015: 185-196 - [c39]Kaushik Roy, Satish Chandra Panigrahi, Asish Mukhopadhyay:
Multiple Alignment of Structures Using Center Of ProTeins. ISBRA 2015: 284-296 - 2014
- [j25]Md. Shafiul Alam, Asish Mukhopadhyay:
More on Generalized Jewels and the Point Placement Problem. J. Graph Algorithms Appl. 18(1): 133-173 (2014) - [c38]Eugene Greene, Asish Mukhopadhyay:
Closest-Point Queries for Complex Objects. ICCSA (2) 2014: 368-380 - [c37]Satish Ch. Panigrahi, Asish Mukhopadhyay:
An Eigendecomposition Method for Protein Structure Alignment. ISBRA 2014: 24-37 - [c36]Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
Linear Layouts of Weakly Triangulated Graphs. WALCOM 2014: 322-336 - [i5]Asish Mukhopadhyay, Puspal Bhabak:
A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees. CoRR abs/1407.7125 (2014) - [i4]Kaushik Roy, Satish Ch. Panigrahi, Asish Mukhopadhyay:
Multiple alignment of structures using center of proteins. CoRR abs/1412.8093 (2014) - 2013
- [j24]Asish Mukhopadhyay, Satish Panigrahi:
All-maximum and all-minimum problems under some measures. J. Discrete Algorithms 21: 18-31 (2013) - [j23]Asish Mukhopadhyay, Eugene Greene, Animesh Sarker, Tom Switzer:
From approximate balls to approximate ellipses. J. Glob. Optim. 56(1): 27-42 (2013) - [c35]Satish Panigrahi, Md. Shafiul Alam, Asish Mukhopadhyay:
An Incremental Linear Programming Based Tool for Analyzing Gene Expression Data. ICCSA (5) 2013: 48-64 - 2012
- [j22]Asish Mukhopadhyay, Eugene Greene:
The ordinary line problem revisited. Comput. Geom. 45(3): 127-130 (2012) - [i3]Md. Shafiul Alam, Asish Mukhopadhyay:
Improved upper and lower bounds for the point placement problem. CoRR abs/1210.3833 (2012) - 2011
- [j21]Satish Panigrahi, Asish Mukhopadhyay:
Some Geometric Problems on OMTSE Optoelectronic Computer. Scalable Comput. Pract. Exp. 12(2) (2011) - [i2]Md. Shafiul Alam, Asish Mukhopadhyay:
Algorithms for the Problems of Length-Constrained Heaviest Segments. CoRR abs/1108.4972 (2011) - 2010
- [c34]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: 207-210 - [c33]Md. Shafiul Alam, Asish Mukhopadhyay:
A new algorithm and improved lower bound for point placement on a line in two rounds. CCCG 2010: 229-232 - [c32]Md. Shafiul Alam, Asish Mukhopadhyay:
Constraint Representation for Autonomous Camera. CGVR 2010: 17-21 - [c31]Asish Mukhopadhyay, Animesh Sarker, Tom Switzer:
Approximate Ellipsoid in the Streaming Model. COCOA (2) 2010: 401-413
2000 – 2009
- 2009
- [j20]Prosenjit Bose
, Asish Mukhopadhyay:
Editorial CCCG 2005. Comput. Geom. 42(5): 363 (2009) - [j19]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): 557-577 (2009) - [c30]Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sarker:
Generalized jewels and the point placement problem. CCCG 2009: 45-48 - [c29]Hamid Zarrabi-Zadeh, Asish Mukhopadhyay:
Streaming 1-Center with Outliers in High Dimensions. CCCG 2009: 83-86 - 2008
- [j18]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): 47-51 (2008) - [j17]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): 58-64 (2008) - 2007
- [c28]Asish Mukhopadhyay, Augustus Das:
Curve reconstruction in the presence of noise. CGIV 2007: 177-182 - [c27]Asish Mukhopadhyay, Eugene Greene:
The Ordinary Line Problem Revisited. CCCG 2007: 61-64 - [c26]Asish Mukhopadhyay, Eugene Greene:
On a Geometric Approach to the Segment Sum Problem and Its Generalization. CCCG 2007: 265-268 - [c25]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: 41-54 - 2006
- [j16]Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere:
On the All-Farthest-Segments problem for a planar set of points. Inf. Process. Lett. 100(3): 120-123 (2006) - [c24]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 - [c23]Asish Mukhopadhyay, Augustus Das:
An RNG-based heuristic for curve reconstruction. ISVD 2006: 246-251 - 2004
- [c22]Pawel Kosicki, Asish Mukhopadhyay:
Encoding Quadrilateral Meshes in 2.40 bits per Vertex. ICVGIP 2004: 89-94 - 2003
- [j15]Asish Mukhopadhyay, S. V. Rao:
On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geom. Appl. 13(3): 257-271 (2003) - [j14]Asish Mukhopadhyay:
Using simplicial partitions to determine a closest point to a query line. Pattern Recognit. Lett. 24(12): 1915-1920 (2003) - [c21]Anna Medvedeva, Asish Mukhopadhyay:
An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. CCCG 2003: 25-28 - [c20]Asish Mukhopadhyay, Quanbin Jing:
Encoding Quadrilateral Meshes. CCCG 2003: 60-63 - [c19]Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao:
Computing the Closest Point to a Circle. CCCG 2003: 132-135 - [c18]Pinaki Mitra, Asish Mukhopadhyay:
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. ICCSA (3) 2003: 787-796 - [c17]Asish Mukhopadhyay, S. V. Rao:
Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) 2003: 797-806 - 2002
- [j13]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): 1-29 (2002) - [c16]Asish Mukhopadhyay:
Using simplicial partitions to determine a closest point to a query line. CCCG 2002: 10-12 - [c15]Binay K. Bhattacharya, Asish Mukhopadhyay:
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96 - 2001
- [j12]S. V. Rao, Asish Mukhopadhyay:
Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognit. 34(11): 2163-2172 (2001) - [c14]Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan:
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449 - 2000
- [j11]Asish Mukhopadhyay, S. V. Rao:
Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65(3): 285-289 (2000) - [j10]G. Srinivasaraghavan, Asish Mukhopadhyay:
Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geom. Appl. 10(1): 79-102 (2000) - [c13]S. V. Rao, Asish Mukhopadhyay:
Efficient Algorithms for Computing the beta-spectrum. CCCG 2000
1990 – 1999
- 1999
- [j9]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): 81-96 (1999) - [j8]Olivier Devillers, Asish Mukhopadhyay:
Finding an Ordinary Conic and an Ordinary Hyperplane. Nord. J. Comput. 6(4): 462-468 (1999) - [i1]Olivier Devillers, Asish Mukhopadhyay:
Finding an ordinary conic and an ordinary hyperplane. CoRR cs.CG/9909017 (1999) - 1997
- [j7]Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu:
On the Ordinary Line Problem in Computational Geometry. Nord. J. Comput. 4(4): 330-341 (1997) - [c12]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances. SCG 1997: 418-420 - [c11]S. V. Rao, Asish Mukhopadhyay:
Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383 - 1996
- [j6]Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20(2): 244-267 (1996) - 1995
- [c10]Binay K. Bhattacharya, Asish Mukhopadhyay:
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31 - [c9]Andrzej Lingas, Asish Mukhopadhyay:
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238 - 1994
- [j5]Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert:
Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (1994) - [j4]G. Srinivasaraghavan, Asish Mukhopadhyay:
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 12: 65-82 (1994) - [j3]Shreesh Jadhav, Asish Mukhopadhyay:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Discret. Comput. Geom. 12: 291-312 (1994) - 1993
- [c8]Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya:
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG 1993: 169-174 - [c7]G. Srinivasaraghavan, Asish Mukhopadhyay:
On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG 1993: 315-320 - [c6]Shreesh Jadhav, Asish Mukhopadhyay:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. SCG 1993: 83-90 - 1992
- [c5]Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS 1992: 92-103 - 1991
- [j2]B. S. S. Pradhan, Asish Mukhopadhyay:
Adaptive cell division for ray tracing. Comput. Graph. 15(4): 549-552 (1991) - [c4]Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG 1991: 81-88 - [c3]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: 412-424
1980 – 1989
- 1987
- [j1]Asish Mukhopadhyay:
A Solution to the Polynomial Hensel Code Conversion Problem. IEEE Trans. Computers 36(5): 634-637 (1987) - 1985
- [c2]Asish Mukhopadhyay, Vangalur S. Alagar:
Exact Computation of the Characteristic Polynomial of an Integer Matrix. AAECC 1985: 316-324 - [c1]Asish Mukhopadhyay:
A Solution to the Polynominal Hensel-Code Conversion Problem. European Conference on Computer Algebra (2) 1985: 327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
