A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths

Lih-Yang Wang, Yen-Tai Lai, Bin-Da Liu, Ting-Chung Chang. A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths. In Michael R. Lightner, Jochen A. G. Jess, editors, Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993, Santa Clara, California, USA, November 7-11, 1993. pages 703-708, IEEE Computer Society, 1993. [doi]

@inproceedings{WangLLC93,
  title = {A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths},
  author = {Lih-Yang Wang and Yen-Tai Lai and Bin-Da Liu and Ting-Chung Chang},
  year = {1993},
  doi = {10.1145/259794.259906},
  url = {http://doi.acm.org/10.1145/259794.259906},
  tags = {rule-based, layout, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/WangLLC93},
  cites = {0},
  citedby = {0},
  pages = {703-708},
  booktitle = {Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993, Santa Clara, California, USA, November 7-11, 1993},
  editor = {Michael R. Lightner and Jochen A. G. Jess},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-4490-7},
}