Ranjan Mehera

Orcid: 0000-0002-3702-2911

According to our database1, Ranjan Mehera authored at least 9 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bottleneck Crosstalk Minimization in Two- and Three-Layer Manhattan Channel Routing.
IEEE Access, 2024

2023
Brain Tumour Segmentation Using S-Net and SA-Net.
IEEE Access, 2023

2022
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph.
Theor. Comput. Sci., 2022

2019
Bottleneck Crosstalk Minimization in Three-Layer Channel Routing.
Proceedings of the Advanced Computing and Systems for Security, 2019

2016
A Divide-and-Conquer Algorithm for All Spanning Tree Generation.
Proceedings of the Advanced Computing and Systems for Security, 2016

2015
A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping.
Proceedings of the 19th International Symposium on VLSI Design and Test, 2015

An Algorithm to Solve 3D Guard Zone Computation Problem.
Proceedings of the Advanced Computing and Systems for Security - ACSS 2015, 2015

2014
A 2D Guard Zone Computation Algorithm for Reassignment of Subcircuits to Minimize the Overall Chip Area.
Proceedings of the Applied Computation and Security Systems - ACSS 2014, 2014

2009
A Cost-Optimal Algorithm for Guard Zone Problem.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009


  Loading...