Alak Kumar Datta

14 papers Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Hamiltonian path in permutation graphs.
Theor. Comput. Sci.
Krishna Daripa, Alak Kumar Datta
2025 J jnl
Spanning cactus and spanning cactus extension of outerplanar graphs.
Acta Informatica
Chinmay Debnath, Alak Kumar Datta
2024 J jnl
Bottleneck Crosstalk Minimization in Two- and Three-Layer Manhattan Channel Routing.
IEEE Access
Tarak Nath Mandal, Suvarthi Sarkar, Deborupa Roy, Abhinandan Khan, Ranjan Mehera, Alak Kumar Datta, Rajat Kumar Pal
2021 — conf
Unsupervised Change Detection in Remote Sensing Images Using CNN Based Transfer Learning.
ICACDS (1)
Josephina Paul, B. Uma Shankar, Balaram Bhattacharyya, Alak Kumar Datta
2017 J jnl
Hardness of crosstalk minimization in two-layer channel routing.
Integr.
Achira Pal, Atal Chaudhuri, Rajat Kumar Pal, Alak Kumar Datta
2017 J jnl
Spanning cactus: Complexity and extensions.
Discret. Appl. Math.
Alak Kumar Datta, Chinmay Debnath
2016 J jnl
K-Terminal Reliability of d-Trapezoid Graphs.
IEEE Trans. Reliab.
Sudarshan Roy, Krishna Daripa, Alak Kumar Datta
2015 J jnl
Approximate spanning cactus.
Inf. Process. Lett.
Alak Kumar Datta
2004 J jnl
o(log4 n) time parallel maximal matching algorithm using linear number of processors.
Parallel Algorithms Appl.
Alak Kumar Datta, Ranjan K. Sen
2000 J jnl
Improved Parallel Algorithm for Maximal Matching Based on Depth-first-search.
Parallel Algorithms Appl.
Alak Kumar Datta, Ranjan K. Sen
1999 J jnl
An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs.
Inf. Process. Lett.
Alak Kumar Datta, Ranjan K. Sen
1995 J jnl
1-Approximation Algorithm for Bottleneck Disjoint Path Matching.
Inf. Process. Lett.
Alak Kumar Datta, Ranjan K. Sen
1995 J jnl
A Parallel Algorithm for Maximal Matching Based on Depth First Search.
Parallel Algorithms Appl.
Alak Kumar Datta, Ranjan K. Sen
1992 — conf
An Efficient Parallel Algorithm for Maximal Matching.
CONPAR
Alak Kumar Datta, Ranjan K. Sen