| A general graph theoretic framework for multi-layer channel routing RK Pal, AK Datta, SP Pal, MM Das, A Pal Proceedings of the 8th International Conference on VLSI Design, 202-207, 1995 | 28 | 1995 |
| Resolving horizontal constraints and minimizing net wire length for multi-layer channel routing RK Pal, AK Datta, SP Pal, A Pal Proceedings of TENCON'93. IEEE Region 10 International Conference on …, 1993 | 28 | 1993 |
| 1-approximation algorithm for bottleneck disjoint path matching AK Datta, RK Sen Information processing letters 55 (1), 41-44, 1995 | 12 | 1995 |
| NP-completeness of multi-layer no-dogleg channel routing and an efficient heuristic RK Pal, SP Pal, A Pal, AK Dutta The Sixth International Conference on VLSI Design, 80, 81, 82, 83-80, 81, 82, 83, 1993 | 10 | 1993 |
| Application of graphs in computing reduced area VLSI channel routing solutions A Pal, AK Khan, SS Sau, AK Datta, RK Pal, A Chaudhuri Proc. of International Conference on Computing and Systems (ICCS-2010), 249-256, 2010 | 9 | 2010 |
| Hardness of crosstalk minimization in two-layer channel routing A Pal, A Chaudhuri, RK Pal, AK Datta Integration 56, 139-147, 2017 | 8 | 2017 |
| Algorithms for reducing crosstalk in two-layer channel routing A Pal, D Kundu, AK Datta, TN Mandal, RK Pal Vidyasagar University, Midnapore, West-Bengal, India, 2006 | 8 | 2006 |
| Spanning Catus: Complexity and Extensions AK Datta, C Debnath Discrete Applied Mathematics, 2017 | 7 | 2017 |
| Approximate spanning cactus AK Datta Information Processing Letters 115 (11), 828-832, 2015 | 7 | 2015 |
| Graphs-The Tool to Visualize the Problems in VLSI Channel Routing A Pal, TN Mandal, S Saha Sau, AK Datta, RK Pal, A Chaudhuri Assam University Journal of Science and Technology 7 (2), 73-83, 2011 | 7 | 2011 |
| Resolving horizontal constraints and minimizing net wire length for VHV channel routing RK Pal, AK Datta, SP Pal, A Pal Department of Computer Science and Engineering, IIT, Kharagpur, 1992 | 7 | 1992 |
| Matching formulation of the Staff Transfer Problem: meta-heuristic approaches S Acharyya, AK Datta Opsearch 57, 629-668, 2020 | 6 | 2020 |
| A graph based algorithm to minimize total wire length in VLSI channel routing SS Sau, A Pal, TN Mandal, AK Datta, RK Pal, A Chaudhuri 2011 IEEE International Conference on Computer Science and Automation …, 2011 | 6 | 2011 |
| o(log4 n) time parallel maximal matching algorithm using linear number of processors A Kumar Datta, R Kumar Sen Parallel Algorithms and Applications 19 (1), 19-32, 2004 | 6 | 2004 |
| An efficient scheme to solve two problems for two-terminal series parallel graphs AK Datta, RK Sen Information processing letters 71 (1), 9-15, 1999 | 6 | 1999 |
| A short note on spanning cactus problem of Petersen graph C Debnath, AK Datta Intelligent Techniques and Applications in Science and Technology …, 2020 | 5 | 2020 |
| Two algorithms for minimizing crosstalk in two-layer channel routing A Pal, TN Mandal, A Khan, RK Pal, AK Datta, A Chaudhuri IJETTCS 3 (6), 194-204, 2014 | 5 | 2014 |
| Spanning cactus existence in a three-dimensional (3 x3 x3) grid C Debnath, AK Datta Proceedings of the international conference on innovative computing …, 2020 | 4 | 2020 |
| Histological Patterns of Ovarian Neoplasms –A Five Year Experience in North-East India S Manasi, B Alpana, D Abhijit International Journal of Medical and Dental Sciences, 1576-1581, 2018 | 4 | 2018 |
| An efficient parallel algorithm for maximal matching AK Datta, RK Sen International Conference on Vector and Parallel Processing, 813-814, 1992 | 4 | 1992 |
