Alak Kumar Datta

According to our database, Alak Kumar Datta authored at least 12 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Bottleneck Crosstalk Minimization in Two- and Three-Layer Manhattan Channel Routing.

Tarak Nath Mandal, Suvarthi Sarkar, Deborupa Roy, Abhinandan Khan, Ranjan Mehera, Alak Kumar Datta, Rajat Kumar Pal

IEEE Access, 2024

2021

Unsupervised Change Detection in Remote Sensing Images Using CNN Based Transfer Learning.

Josephina Paul, B. Uma Shankar, Balaram Bhattacharyya, Alak Kumar Datta

Proceedings of the Advances in Computing and Data Sciences - 5th International Conference, 2021

2017

Hardness of crosstalk minimization in two-layer channel routing.

Achira Pal, Atal Chaudhuri, Rajat Kumar Pal, Alak Kumar Datta

Integr., 2017

Spanning cactus: Complexity and extensions.

Alak Kumar Datta, Chinmay Debnath

Discret. Appl. Math., 2017

2016

K-Terminal Reliability of d-Trapezoid Graphs.

Sudarshan Roy, Krishna Daripa, Alak Kumar Datta

IEEE Trans. Reliab., 2016

2015

Approximate spanning cactus.

Alak Kumar Datta

Inf. Process. Lett., 2015

2004

o(log4 n) time parallel maximal matching algorithm using linear number of processors.

Alak Kumar Datta, Ranjan K. Sen

Parallel Algorithms Appl., 2004

2000

Improved Parallel Algorithm for Maximal Matching Based on Depth-first-search.

Alak Kumar Datta, Ranjan K. Sen

Parallel Algorithms Appl., 2000

1999

An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs.

Alak Kumar Datta, Ranjan K. Sen

Inf. Process. Lett., 1999

1995

A Parallel Algorithm for Maximal Matching Based on Depth First Search.

Alak Kumar Datta, Ranjan K. Sen

Parallel Algorithms Appl., 1995

1-Approximation Algorithm for Bottleneck Disjoint Path Matching.

Alak Kumar Datta, Ranjan K. Sen

Inf. Process. Lett., 1995

1992

An Efficient Parallel Algorithm for Maximal Matching.

Alak Kumar Datta, Ranjan K. Sen

Proceedings of the Parallel Processing: CONPAR 92, 1992