| 2009 |
|---|
| 8 | EE | Ranjan Mehera,
Rajat K. Pal:
A Cost-Optimal Algorithm for Guard Zone Problem.
ICDCN 2009: 91-98 |
| 2006 |
|---|
| 7 | EE | Debasri Saha,
Rajat K. Pal,
Samar Sen-Sarma:
A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem.
Intelligent Information Processing 2006: 307-316 |
| 2002 |
|---|
| 6 | EE | Arpan Singha,
Rajat K. Pal:
Performance Driven Routing in Distributed Environment.
IWDC 2002: 257-267 |
| 1998 |
|---|
| 5 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal:
An algorithm for finding a non-trivial lower bound for channel routing1.
Integration 25(1): 71-84 (1998) |
| 1997 |
|---|
| 4 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal:
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing.
VLSI Design 1997: 531-533 |
| 1995 |
|---|
| 3 | EE | Rajat K. Pal,
Sudebkumar Prasant Pal,
M. M. Das,
Ajit Pal:
Computing area and wire length efficient routes for channels.
VLSI Design 1995: 196-201 |
| 2 | EE | Rajat K. Pal,
A. K. Datta,
Sudebkumar Prasant Pal,
M. M. Das,
Ajit Pal:
A general graph theoretic framework for multi-layer channel routing.
VLSI Design 1995: 202-207 |
| 1993 |
|---|
| 1 | | Rajat K. Pal,
Sudebkumar Prasant Pal,
Ajit Pal,
Alak K. Dutta:
NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic.
VLSI Design 1993: 80-83 |
