 | 2008 |
|---|
| 9 |       | Maharaj Mukherjee,
Kanad Chakraborty:
A Randomized Greedy Algorithm for the Pattern Fill Problem for DFM Applications.
ISQED 2008: 344-347 |
| 8 | | Maharaj Mukherjee,
Kanad Chakraborty:
A Randomized Greedy Method for Rectangular-Pattern Fill Problems.
IEEE Trans. on CAD of Integrated Circuits and Systems 27(8): 1376-1384 (2008) |
| 2006 |
|---|
| 7 | | Kanad Chakraborty,
Alexey Lvov,
Maharaj Mukherjee:
Novel algorithms for placement of rectangular covers for mask inspection in advanced lithography and other VLSI design applications.
IEEE Trans. on CAD of Integrated Circuits and Systems 25(1): 79-91 (2006) |
| 2002 |
|---|
| 6 | | Maharaj Mukherjee,
Kanad Chakraborty:
A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
Inf. Process. Lett. 83(1): 41-48 (2002) |
| 2000 |
|---|
| 5 | | Maharaj Mukherjee,
A. R. Daherkar,
R. Vattipalli:
Satisfying coplanarity constraints on points sets in three dimensions with finite precision arithmetic.
Computer-Aided Design 32(11): 663-679 (2000) |
| 1999 |
|---|
| 4 | | M. R. Ramapriya,
S. Beotra,
Maharaj Mukherjee,
R. V. Raja Kumar,
P. Dhar:
An end-connected dual bus topology for metropolitan area networks.
Computer Networks 31(5): 445-456 (1999) |
| 1997 |
|---|
| 3 | | Abheek Saha,
Maharaj Mukherjee,
P. Dhar:
Design and Implementation of a Network Service Access Point (NSAP) for OSI-Compatibility.
Computer Networks and ISDN Systems 29(3): 315-324 (1997) |
| 1991 |
|---|
| 2 | | Maharaj Mukherjee:
An efficient and simple polygon intersection algorithm.
Symposium on Solid Modeling and Applications 1991: 527 |
| 1 |  | Shashank K. Mehta,
Maharaj Mukherjee,
George Nagy:
Constrained Integer Approximation to Planar Line Intersection.
Inf. Process. Lett. 40(3): 137-139 (1991) |
