Alak Kumar Datta

Visva-Bharati University — India

Engineering · Physical Sciences

6h-index131citations30works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

VLSI and FPGA Design Techniques(12), Advanced Graph Theory Research(10), Interconnection Networks and Systems(9), Complexity and Algorithms in Graphs(6), VLSI and Analog Circuit Testing(5)

Publications30 total

Spanning cactus and spanning cactus extension of outerplanar graphs
Acta Informatica·2025
Hamiltonian path in permutation graphs
Theoretical Computer Science·2025
Bottleneck Crosstalk Minimisation in Two- and Three-Layer Manhattan Channel Routing
IEEE Access·2024Open Access
Spanning Cactus Existence, Optimization and Extension in Windmill Graphs
Algorithms for intelligent systems·2023· 1 cited
Minimum Spanning Cactus on Halin Graphs
SSRN Electronic Journal·2022Open Access
Unsupervised Change Detection in Remote Sensing Images Using CNN Based Transfer Learning
Communications in computer and information science·2021· 5 cited
A Short Note on Spanning Cactus Problem of Petersen Graph
Learning and analytics in intelligent systems·2020· 3 cited
Spanning Cactus Existence in a Three-Dimensional (3 X3 X3) Grid
SSRN Electronic Journal·2020· 3 citedOpen Access
Matching formulation of the Staff Transfer Problem: meta-heuristic approaches
OPSEARCH·2019· 5 cited
Spanning cactus: Complexity and extensions
Discrete Applied Mathematics·2017· 6 cited
Hardness of crosstalk minimization in two-layer channel routing
Integration·2016· 5 cited
<inline-formula> <tex-math notation="LaTeX">$K$</tex-math> </inline-formula>-Terminal Reliability of <inline-formula> <tex-math notation="LaTeX">$d$</tex-math> </inline-formula>-Trapezoid Graphs
IEEE Transactions on Reliability·2016· 3 cited
Approximate spanning cactus
Information Processing Letters·2015· 5 cited
A Review on Crosstalk Avoidance and Minimization in VLSI Systems
2015
Two Algorithms for Minimizing Crosstalk in Two-Layer Channel Routing
2014· 5 cited
Yet an efficient algorithm for computing reduced area VLSI channel routing solutions with floating terminals
2011
A graph based algorithm to minimize total wire length in VLSI channel routing
2011· 9 cited
Algorithms for Generating Random Channel Instances for Channel Routing Problem
International Journal of Applied Research on Information Technology and Computing·2010· 1 citedOpen Access
Generation of random channel specifications for channel routing problem
2008
Algorithms for high performance two-layer channel routing
2007· 7 cited
page 1 of 2Next →

Frequent Co-authors

Rajat Kumar Pal(12), Amrita Pal(10), Tarak Nath Mandal(9), Chinmay Debnath(6), Atal Chaudhuri(5), Ranjan Sen(4), Debojit Kundu(4), Abhinandan Khan(3), Krishna Daripa(3), Sujata Pal(2), Swagata Saha Sau(2), R.K. Sen(2), Monidipa Das(1), Anil Kumar Pal(1), Sriyankar Acharyya(1), Sap Abap(1), Josephina Paul(1), B. Uma Shankar(1), Balaram Bhattacharyya(1), Sudarshan Roy(1)