General Time

Sunday

Monday

Tuesday

Wednesday

Thursday

Friday

Saturday

8:30 - 9:15

B. Alspach

D. Corneil

8:30 – 9:00

D. Kral

F. Roberts

M. Rosenfeld

E

X

C

U

R

S

I

O

N

9:00

|

??

9:05 – 9:35

B. LaRose

9:20-9:50

P. Horak

J. Huang

9:40 –10:10

T. Feder

G. Hahn

J. Bang-Jensen

9:55-10:25

T. Brown

J. Kratochvil

10:15-10:45

A. Bulatov

G. Gutin

R. Brewster

break

break

break

break

break

10:45-11:30

A. Rosa

J. Szwarcfiter

11:00-11:45

D. Kirkpatrick

N. Sauer

G. Tardos

11:50-12:20

L. Gargano

11:35-12:05

R. Anstee

F. Protti

12:25-12:55

J. Peters

L. Stacho

C. Tardif

12:10-12:40

J. Montellano

W. Hochstaettler

Whale Watching

2:30 – 6:00

M. Yamashita

I. Rosenberg

lunch

lunch

lunch

lunch

14:30-15:15

H. Fleischner

B. Mohar

X. Zhu

14:30-15:00

S. Klein

15:05-15:35

L. Nogueira

15:20-15:50

I. Hartman

M. Nielsen

L. Goddyn

15:45-16:15

P. Nejedly

15:55-16:25

E. Mendelson

R. Naserasr

J. Gimbel

16:20-16:50

G. MacGillivray

break

break

break

break

16:45-17:30

Re

gis

tra

tion

16:45-17:15

V. Jungic

16:45-17:15

C. Loten

G. Sabidussi

17:20-17:50

S. Kavousian

17:35-18:05

17:20-18:05

J. Nesetril

F. Comellas

Cash Bar 6:05PM

BANQUET.7 PM

B. Alspach

Why my computer is called Walecki

R. Anstee

Error Theorems for Matching Theory

J. Bang-Jensen

Problems and conjectures in tournament-like digraphs

R. Brewster

The construction of edge switching homomorphism invariant cores

T. Brown

Bounds for van der Waerden functions involving 3-term arithmetic progressions

A. Bulatov

CSPs with k-duality

F. Comellas

Recursive clique-trees as models for complex networks

D.G. Corneil

Graph searching with emphasis on Lexicographic Breadth First Search (LBFS)

H. Fleischner

Reducing an arbitrary (planar) fullerene to a dodekahedron

T. Feder

Constraint satisfaction: a personal perspective

L. Gargano

Generalizations of set cover with applications

J. Gimbel

Remarks on the metric and partition dimension of a graph (joint work with G. Chappell and Chris Hartman)

L. Goddyn

Packing group-nonvanishing A-paths

G. Gutin

Dichotomy for the minimum cost homomorphism problem to undirected graphs

I. Hartman

Proof of Berge’s strong path partition conjecture for k=2

W. Hochstättler

The Hungarian method in a mixed matching market

P. Horak

On Golomb-Welsh conjecture

J. Huang

A Brooks-type Theorem for the Pair-list Colouring

(joint work with Feder and Hell)

V. Jungic

When Hell was young: The resurrection of retracts

S. Kavousian

An examination of students' (mis)understandings of elementary combinatorial structures

D. Kirkpatrick

Some forgotten (g,f)-factor results

S. Klein

Joint results with Pavol Hell on partition problems

D. Kral

Locally consistent constraint satisfaction problems (joint work with Manuel Bodirsky, Zdenek Dvorak and Ondrej Pangrac)

J. Kratochvil

Locally injective homomorphism and constraint satisfaction

B. Larose

A characterization of first-order definable CSP's (joint work with C. Loten and C. Tardif)

C. Loten

Near unanimity functions and tree duals

G. MacGillivray

Circular colourings of hypergraphs

E. Mendelhson

When systems collide: Intersections of designs of different orders

J. Montellano

On conjectures of Frankl and El-Zahar

R. Naserasr

Complexity of the homomorphism problem for planar graphs (join work with P. Hell and C. Tardif)

M. Nielsen

Partitioning the detour order and circumference of graphs and digraphs

P. Nejedly

Distance-constrained labelings of series-parallel graphs

L. Nogueira

Joint results with Pavol Hell on chordal partition problems

F. Protti

The Helly property and its generalizations

J. Peters

Communication in radio networks

F. Roberts

Competition graphs of semiorders

A. Rosa

Steiner almost self-complementary graphs

I. G. Rosenberg

Homomorphisms of hyperalgebras

M. Rosenfeld

Colo(u)ring problems, old and new

G. Sabidussi

The pre-hull number of graphs

N. Sauer

Chromatic numbers and homomorphisms of large girth hypergraphs

L. Stacho

Acyclic H-colorings of random graphs for small semicomplete graphs H               

J.L. Szwarcfiter

Characterizations and recognition algorithms for circular-arc graphs and subclasses of it: a survey ( joint work with Min Chih Lin )

C. Tardif

Majority functions on duals of paths (joint work with C. Loten)

G. Tardos

Local chromatic number of quadrangulation of surfaces

M. Yamashita

Random walks on finite graph using local degree information (joint work with S. Ikeda and I Kubo)

X. Zhu

Fractional chromatic number of triangle free cubic graphs