DIMATIA and ITI presents

HOMONOLO'02 - Workshop on graph homomorphisms and geometric methods

Nova Louka, December 2 - 6, 2002

Kick-off workshop of DIMATIA-DIMACS-Renyi project supported by NSF

The workshop on graph homomorphisms continues the tradition started at Nova Louka in late fall 2000. The workshop will be devoted to structural properties, algebraic aspects as well as on computational complexity of graph colorings, graph homomorphisms and related problems like cycle covers and discrete geometry.

So far the following speakers agreed to deliver invited lectures:

Jaroslav Nesetril (Prague) - TBA,
Jiri Matousek (Prague) - "Geometric lower bounds for graph invariants".
David Galvin (U.S.A.) - "Counting H-colourings of a regular, bipartite graph"

Contributed talks include (but are not limited to) DIMATIA postdocs and guests:

Manuel Bodirsky (Berlin, Prague) - "Surjective Homomorphism Problems",
Tamas Kiraly (Budapest) - "Some new results on the edge-connectivity of (hyper)graphs"

The workshop starts on Monday December 2 at 2 pm. The official program will end on Friday December 6 after lunch.

Pictures from the workshop

Pictures from HOMONOLO´02 wokshop are available here.

Travel instructions

The lodge Samalova chata at Nova Louka is located in the center of one of the nicest Bohemian hilliness Jizerske hory, located in the north part of Czech Republic (close tou the Polish and German borders).

The easiest way by car to Nova Louka is through Liberec (speedway E35 north from Prague), then to Bedrichov (see map) and the finally to Nova Louka. Behind Bedrichov the road is closed for public, however hotel guests are allowed to drive in.

Mapa

A shuttle bus from Prague to Nova Louka and back is be arranged. The bus leaves from Nadrazi Holesovice at 9:00am, the meeting point is at the subway exit closer to the train daparture hall.

October 2002 webista@kam.mff.cuni.cz