Maharaj Mukherjee - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2008

A Randomized Greedy Algorithm for the Pattern Fill Problem for DFM ApplicationsMaharaj Mukherjee, Kanad Chakraborty. isqed 2008: 344-347 [doi]

A Randomized Greedy Method for Rectangular-Pattern Fill ProblemsMaharaj Mukherjee, Kanad Chakraborty. tcad, 27(8):1376-1384, 2008. [doi]

2006

Novel algorithms for placement of rectangular covers for mask inspection in advanced lithography and other VLSI design applicationsKanad Chakraborty, Alexey Lvov, Maharaj Mukherjee. tcad, 25(1):79-91, 2006. [doi]

2002

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automationMaharaj Mukherjee, Kanad Chakraborty. ipl, 83(1):41-48, 2002. [doi]

2000

Satisfying coplanarity constraints on points sets in three dimensions with finite precision arithmeticMaharaj Mukherjee, A. R. Daherkar, R. Vattipalli. cad, 32(11):663-679, 2000. [doi]

1999

An end-connected dual bus topology for metropolitan area networksM. R. Ramapriya, S. Beotra, Maharaj Mukherjee, R. V. Raja Kumar, P. Dhar. cn, 31(5):445-456, 1999. [doi]

1997

Design and Implementation of a Network Service Access Point (NSAP) for OSI-CompatibilityAbheek Saha, Maharaj Mukherjee, P. Dhar. cn, 29(3):315-324, 1997. [doi]

1996

A novel approach to represent 3-D isothetic scenes using XYZ treesMaharaj Mukherjee, Srinibas Vemuri. In ICIP (2). 1996: 333-336 [doi]

1993

Collinearity Constraints on Geometric FiguresMaharaj Mukherjee, George Nagy. ifip5-10 1993: 115-125 [doi]

1991

Constrained Integer Approximation to Planar Line IntersectionShashank K. Mehta, Maharaj Mukherjee, George Nagy. ipl, 40(3):137-139, 1991.

An efficient and simple polygon intersection algorithmMaharaj Mukherjee. wm 1991: 527 [doi]

Sign in or sign up to see more results.

runs on WebDSL