Saturday March 17, 2001

8:30-9:00

Opening Session

9:00-9:50

Invited Talk:
The FISH Machine at Bletchley Park
William Tutte 

9:50-10:20

Coffee-break

 

Graph Theory

Approximation Algorithms

10:20-10:50

(#077) S. Ceroi, F. Havet
Trees with three leaves are (n+1)-unavoidable

(#074) G. Calinescu, C. Fernandes
Multicuts in Unweighted digraphs with Bounded Degree and Bounded Tree-Width 

10:50-11:20

(#014) F. Fomin, M. Matamala, E. Prisner, I. Rapaport
Bilateral Orientation and Domination 

(#045) F. Miyazawa, Y. Kohayakawa, P. Raghavan, Y. Wakabayashi 
Multidimensional Cube Packing 

11:20-11:50

(#019) A. Morgana, C. Mello, G. Sontacchi
An algorithm for 1-bend embeddings of planar graphs in the Two-dimensional Grid

(#061) M. Dawande, J. Kalagnanam, J. Sethuraman 
Variable Sized Bin Packing With Color Constraints

11:50-12:20

(#046) C. Silva, R. Dahab 
Tutte's 3-flow Conjecture and Matchings in Bipartite Graphs

(#021) A. Baltz, T. Schoen, A. Srivastav 
Probabilistic Analysis of Bipartite Traveling Salesman Problems

12:20-14:00

Lunch

14:00-14:50

Invited Talk:
List Colouring Via the Probabilisitc Method
Bruce Reed

 

Cartesian Products

Combinatorial Biology

15:00-15:30

(#043) T. Hasunuma 
Independent Spanning Cycle-Rooted Trees  in the Cartesian Product of Digraphs

(#023) J. Jansson 
On the Complexity of Inferring Rooted Evolutionary Trees 

15:30-16:00

(#022) A. Anta, T. Leighton, J. Presa 
Containment Properties of
Product and Power Graphs 

(#062) S. Adi, C. Ferreira 
DNA Fragments Assembly Programs: a Comparative Study

16:00-16:30

Coffee-break

 

Combinatorial Designs

Combinatorial Optimization

16:30-17:00

(#026) V. Grolmusz 
Constructive upper bound for intersecting set systems 

(#063) J. Lage, R. Assunção, E. Reis 
A Minimal Spanning Tree  Algorithm Applied to Spatial Cluster Analysis

17:00-17:30

(#034) J. Kim 
Nearly Optimal Partial Steiner Systems 

(#060) M. Aragão, E. Uchoa, R. Werneck 
Dual heuristics on the exact solution  of Large Steiner Problems

17:30-18:00

(#030) C. Moreira, Y. Kohayakawa 
Bounds for optimal coverings 

(#042) M. Campêlo, C. Bornstein 
ADD/DROP Procedures for the Capacitated  Plant Location Problem