@Article{BarFel89,
  author =       "R. Bar-Yehuda and J. A. Feldman and R. Y. Pinter and S. Wimer",
  title =        "Depth First Search and Dynamic Programming Algorithms
                  for Efficient CMOS Cell Generation",
  journal =      "IEEE Transactions on Computer-Aided Design of
                  Integrated Circuits and Systems",
  volume =       "8",
  number =       "7",
  year =         "1989",
  abstract =     "We describe a new algorithmic framework for
  mapping CMOS circuit diagrams into area-efficient,
    high-performance layouts in the style of one-dimensional
    transistor arrays. Using efficient search techniques
    and accurate evaluation methods, the huge solution space
    that is typical to such problems is traversed extremely
    fast, yielding designs of hand-layout quality. In addition
    to generating circuits that meet prespecified layout
    constraints in the context of a fixed target image,
    on-the-fly optimizations are performed to meet secondary
    optimization criteria. A practical dynamic programming
    routing algorithm is employed to accommodate the special
    conditions that arise in this context. This algorithm has
    been implemented and is currently used at IBM for cell
    library generation.",
}