Asish Mukhopadhyay
Affiliations: | Computer Science | University of Windsor, Windsor, Canada |
Area:
Computer Science, Bioinformatics BiologyGoogle:
"Asish Mukhopadhyay"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Mukhopadhyay A, Rao SV, Pardeshi S, et al. (2016) Linear layouts of weakly triangulated graphs Discrete Mathematics, Algorithms and Applications. 8: 1650038 |
Alam MS, Mukhopadhyay A. (2014) More on Generalized Jewels and the Point Placement Problem Journal of Graph Algorithms and Applications. 18: 133-173 |
Mukhopadhyay A, Panigrahi SC. (2013) All-maximum and all-minimum problems under some measures Journal of Discrete Algorithms. 21: 18-31 |
Mukhopadhyay A, Greene E, Sarker A, et al. (2013) From approximate balls to approximate ellipses Journal of Global Optimization. 56: 27-42 |
Mukhopadhyay A, Greene E. (2012) The ordinary line problem revisited Computational Geometry: Theory and Applications. 45: 127-130 |
Panigrahi S, Mukhopadhyay A. (2011) Some Geometric Problems on OMTSE Optoelectronic Computer Scalable Computing: Practice and Experience. 12: 275-282 |
Mukhopadhyay A, Greene E, Rao SV. (2009) On Intersecting A Set Of Isothetic Line Segments With A Convex Polygon Of Minimum Area International Journal of Computational Geometry and Applications. 19: 557-577 |
Mukhopadhyay A, Kumar C, Greene E, et al. (2008) On intersecting a set of parallel line segments with a convex polygon of minimum area Information Processing Letters. 105: 58-64 |
Drysdale RLS, Mukhopadhyay A. (2008) An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points Information Processing Letters. 105: 47-51 |
Mukhopadhyay A, Chatterjee S, Lafreniere B. (2006) On the all-farthest-segments problem for a planar set of points Information Processing Letters. 100: 120-123 |