- Sartaj Sahni and Teofilo Gonzalez. P-complete approximation
problems. Journal of the ACM, 23(3):555-565, July 1976.
Citations.
- Teofilo Gonzalez and Sartaj Sahni. Open shop scheduling to minimize
finish time. Journal of the ACM, 23(4):665-679, October
1976.
- Teofilo Gonzalez and Sartaj Sahni. Preemptive scheduling of uniform
processor systems. Journal of the ACM, 25(1):92-101,
January 1978.
Citations.
- Teofilo F. Gonzalez and Donald B. Johnson. A new algorithm for preemptive
scheduling of trees. Journal of the ACM, 27(2):287-312,
April 1980.
Citations.
- Teofilo F. Gonzalez and Sing-Ling Lee. A linear time algorithm for
optimal routing around a rectangle. Journal of the ACM,
35(4):810-831, October 1988.
Citations.
Shortcuts: