Sunday, January 9
Session 1A
9:00 AM-10:40 AM
Room: Gold Rush A
- 9:00 e-Approximate Linear Programs: New Bounds and Computation
- Daniel Bienstock, Columbia University
- 9:25 Orthogonal Graph Drawing with Constraints
- Markus Eiglsperger, Universität Tübingen, Germany; Ulrich Fößmeier, Tom Sawyer Software; and Michael Kaufmann, Universität Tübingen, Germany
- 9:50 Fast Practical Solution of Sorting by Reversals
- Alberto Caprara, Università di Bologna, Italy; Giuseppe Lancia, Università di Padova, Italy; and See Kiong Ng, Smithkline Beecham Pharmaceuticals R&D, United Kingdom
- 10:15 Commuting with Delay Prone Buses
- Mayur Datar, Stanford University; and Abhiram Ranade, Indian Institute of Technology-Bombay, India
Created 11/7/99; Last Updated 11/7/99