Monday March 19, 2001

8:30-9:20

Invited Talk:
The Triangles in Graphs and Directed graphs
Adrian Bondy

 

Graph Approximation Algorithms

Distributed Algorithms

9:30-10:00

(#012) L. Faria, C. Figueiredo, C. Mendonça

On the Complexity of the Approximation of Nonplanarity Parameters for Cubic Graphs

(#009) E. Laber, L. Holanda

On Asymmetric Communication Protocols

10:00-10:30

(#035) B. Doerr, A. Srivastav

Multi-Color Discrepancies

(#053) L. Penso, V. Barbosa

A Distributed Algorithm for k-dominating Sets

10:30-11:00

Coffee-break

 

Clique Graphs II

Discrete Algorithms

11:00-11:30

(#008) M. Pizaña

Distances and Diameters on Iterated Clique Graphs

(#055) A. Sa, P. Carvalho

Color Quantization by Pairwise Clustering Using a Reduced Graph

11:30-12:00

(#052) L. Alcón, M. Gutierrez

Clique Planar Graphs

(#011) V. Dias, G. Fonseca, C. Figueiredo, J. Szwarcfiter

Stable Marriages with Restricted Pairs

12:00-12:30

(#068) A. Bondy, G. Durán, M. Lin, J. Szwarcfiter

A Sufficient Condition for Self-Clique Graphs

(#038) D. Jacobs, C. Machado, V. Trevisan

An O(n2) Algorithm  for the Characteristic Polynomial of a Tree

12:30-14:00

Lunch

14:00-14:50

Invited Talk:
Tries and Concentration
Luc Devroye

 

Graph Colourings

Enumerative Combinatorics

15:00-15:30

(#076) M. Valencia-Pabon

Revisiting Tucker's Algorithm to Color Circular-Arc Graphs

(#017) Z. Gao, J. Wang

Exact Enumeration of Rooted 3-connected Triangular Maps
 on the Projective Plane

15:30-16:00

(#013) S. Dantas, S. Gravier, F. Maffray, B. Mohar

Extremal Graphs for the List-Coloring Version of a Theorem of Nordhaus and Gaddum

(#049) B. Uchôa, C. Pimentel

Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels

16:00-16:30

(#067) V. Vu

Some Recent Results on List Coloring

(#051) F. Müller, M. Camozzato, O. Araújo

Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem

16:30-17:00

(#028) V. Ravelomanana, L. Thimonier

Asymptotic Enumeration of Cographs