Sunday March 18, 2001
8:30-9:20	Invited Talk: Shortest paths, resistance, and the energy of convex sets László Lovász
	Clique Graphs I	Network Flows
9:30-10:00	(#010) F. Larrión, V. Neumann-Lara, M. Pizaña  Clique Divergent Clockwork Graphs and Partial Orders	(#036) J. Cohen A Graph Partitioning Scheme and Applications  to Fault Tolerant Computing
10:00-10:30	(#040) M. Gutierrez, J. Meidanis The Clique Operator, Set Families,  and Their Properties	(#032) C. Bornstein, A. Ribeiro, A. Lucena Maximizing flow under Special Nonnegative Lower Bounds on Arc Flows
10:30-11:00	Coffee-break
	Integer Programming	Data Structures
11:00-11:30	(#069) I. Díaz, P. Zabala A Polyhedral Approach for Graph Coloring	(#059) P. Poblete, A. Viola The Effect of Deletions on Different Insertion Disciplines for Hash Tables
11:30-12:00	(#057) L. Motta, L. Ochi, C. Martinhon Reduction Rules for the Covering Tour Problem	(#039) E. Laber, L. Nogueira Fast Searching in Trees
12:00-12:30	(#033) A. Lucena, M. Resende Generating Lower Bounds for the Prize Collecting Steiner Problem in Graphs	(#018) L. Lins, S. Lins, S. Melo Symmetry Robust Memory Management of Multidimensional Arrays
12:30-14:00	Lunch
14:00-14:50	Invited Talk: Square-Free Perfect Graphs Gérard Cornuéjols
	Perfect Graphs		Scheduling
15:00-15:30	(#073) R. Hayward, W. Lenhart Perfectly Orderable P4 Composition		(#054) M. Dawande, S. Kumar, C. Sriskandarajah Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms
15:30-16:00	(#072) R. Sampaio, C. Sales On the Complexity of Finding Even Pairs in Planar Perfect Graphs		(#070) A. Goldman, C. Rapine Scheduling with Duplication on m Processors with Small Communication Delays
16:00-16:30	(#041) P. Hell, S. Klein, F. Protti, L. Nogueira On Generalized Split Graphs		(#064) M. Campêlo, R. Corrêa, N. Maculan, F. Protti ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors
16:30-17:00	Coffee-break
17:00-17:50	Invited Talk: The Sylvester-Gallai Theorem and Metric Spaces Vasek Chvátal