The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rajat K. Pal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arpan Singha, Rajat K. Pal
    Performance Driven Routing in Distributed Environment. [Citation Graph (0, 0)][DBLP]
    IWDC, 2002, pp:257-267 [Conf]
  2. Rajat K. Pal, A. K. Datta, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
    A general graph theoretic framework for multi-layer channel routing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1995, pp:202-207 [Conf]
  3. Rajat K. Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
    Computing area and wire length efficient routes for channels. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1995, pp:196-201 [Conf]
  4. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal
    An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1997, pp:531-533 [Conf]
  5. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta
    NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1993, pp:80-83 [Conf]
  6. Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal
    An algorithm for finding a non-trivial lower bound for channel routing1. [Citation Graph (0, 0)][DBLP]
    Integration, 1998, v:25, n:1, pp:71-84 [Journal]

  7. A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem. [Citation Graph (, )][DBLP]


  8. A Cost-Optimal Algorithm for Guard Zone Problem. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002