| Year |
Citation |
Score |
| 2016 |
Mukhopadhyay A, Rao SV, Pardeshi S, Gundlapalli S. Linear layouts of weakly triangulated graphs Discrete Mathematics, Algorithms and Applications. 8: 1650038. DOI: 10.1142/S1793830916500385 |
0.304 |
|
| 2014 |
Alam MS, Mukhopadhyay A. More on Generalized Jewels and the Point Placement Problem Journal of Graph Algorithms and Applications. 18: 133-173. DOI: 10.7155/Jgaa.00317 |
0.459 |
|
| 2013 |
Mukhopadhyay A, Panigrahi SC. All-maximum and all-minimum problems under some measures Journal of Discrete Algorithms. 21: 18-31. DOI: 10.1016/J.Jda.2013.03.008 |
0.581 |
|
| 2013 |
Mukhopadhyay A, Greene E, Sarker A, Switzer T. From approximate balls to approximate ellipses Journal of Global Optimization. 56: 27-42. DOI: 10.1007/S10898-012-9932-1 |
0.381 |
|
| 2012 |
Mukhopadhyay A, Greene E. The ordinary line problem revisited Computational Geometry: Theory and Applications. 45: 127-130. DOI: 10.1016/J.Comgeo.2011.10.003 |
0.436 |
|
| 2011 |
Panigrahi S, Mukhopadhyay A. Some Geometric Problems on OMTSE Optoelectronic Computer Scalable Computing: Practice and Experience. 12: 275-282. DOI: 10.12694/Scpe.V12I2.720 |
0.59 |
|
| 2009 |
Mukhopadhyay A, Greene E, Rao SV. 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. DOI: 10.1142/S021819590900312X |
0.397 |
|
| 2008 |
Mukhopadhyay A, Kumar C, Greene E, Bhattacharya B. On intersecting a set of parallel line segments with a convex polygon of minimum area Information Processing Letters. 105: 58-64. DOI: 10.1016/J.Ipl.2007.08.029 |
0.377 |
|
| 2008 |
Drysdale RLS, Mukhopadhyay A. An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points Information Processing Letters. 105: 47-51. DOI: 10.1016/J.Ipl.2007.08.004 |
0.466 |
|
| 2006 |
Mukhopadhyay A, Chatterjee S, Lafreniere B. On the all-farthest-segments problem for a planar set of points Information Processing Letters. 100: 120-123. DOI: 10.1016/J.Ipl.2006.06.015 |
0.472 |
|
| 2003 |
Mukhopadhyay A, Rao SV. On Computing a Largest Empty Arbitrarily Oriented Rectangle International Journal of Computational Geometry and Applications. 13: 257-271. DOI: 10.1142/S0218195903001153 |
0.4 |
|
| 2003 |
Mukhopadhyay A. Using simplicial partitions to determine a closest point to a query line Pattern Recognition Letters. 24: 1915-1920. DOI: 10.1016/S0167-8655(03)00018-7 |
0.301 |
|
| 2002 |
Bhattacharya BK, Das G, Mukhopadhyay A, Narasimhan G. Optimally computing a shortest weakly visible line segment inside a simple polygon Computational Geometry: Theory and Applications. 23: 1-29. DOI: 10.1016/S0925-7721(01)00058-X |
0.41 |
|
| 2001 |
Rao SV, Mukhopadhyay A. Fast algorithms for computing β-skeletons and their relatives Pattern Recognition. 34: 2163-2172. DOI: 10.1016/S0031-3203(00)00144-8 |
0.376 |
|
| 1999 |
Bhattacharya BK, Mukhopadhyay A, Toussaint GT. Computing a shortest weakly externally visible line segment for a simple polygon International Journal of Computational Geometry and Applications. 9: 81-96. DOI: 10.1142/S0218195999000078 |
0.463 |
|
| 1996 |
Jadhav S, Mukhopadhyay A, Bhattacharya B. An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons Journal of Algorithms. 20: 244-267. DOI: 10.1006/Jagm.1996.0013 |
0.387 |
|
| 1994 |
Jadhav S, Mukhopadhyay A. Computing a centerpoint of a finite planar set of points in linear time Discrete and Computational Geometry. 12: 291-312. DOI: 10.1007/Bf02574382 |
0.397 |
|
| 1994 |
Bhattacharya BK, Jadhav S, Mukhopadhyay A, Robert J-. Optimal algorithms for some intersection radius problems Computing. 52: 269-279. DOI: 10.1007/Bf02246508 |
0.392 |
|
| 1985 |
Mukhopadhyay A, Alagar VS. Exact Computation of the Characteristic Polynomial of an Integer Matrix Applicable Algebra in Engineering, Communication and Computing. 316-324. DOI: 10.1007/3-540-16776-5_735 |
0.331 |
|
| 1980 |
Mukhopadhyay A. A fast algorithm for the longest-common-subsequence problem Information Sciences. 20: 69-82. DOI: 10.1016/0020-0255(80)90025-0 |
0.373 |
|
| Show low-probability matches. |