| 14:00-14:15 | Opening |
| 14:15-15:15 | A. Vershik: Applications of the Lebesgue-Poisson-Dirichlet measure
in combinatorics,number theory and representations |
| 15:15-15:45 | Coffee Break |
| 15:45-16:15 | H. Prodinger: Old (20th century) and New
(21st century) results about Quicksort and Quickselect |
| 16:15-16:45 | V Zacharovas: Probabilistic analysis of
an exhaustive search algorithm in random graphs |
| 16:45-17:00 | Break |
| 17:00-17:30 | B. Bresar: Generalized matchings in graphs and wireless sensor
networks |
| 17:30-18:00 | M. Kovse: Covering codes in
Sierpinski
graphs
|
| |
| |
| 09:00-10:00 | M. Skoviera: Perfect matchings in cubic
graphs |
| 10:00-10:30 | Coffee Break |
| 10:30-11:00 | E. Macajova: Optimal acyclic edge-colourig
of cubic graphs
|
| 11:00-11:30 | J. Fiala: Packing coloring of trees and grids |
| 11:30-11:45 | Break |
| 11:45-12:15 | J. Mazak: Circular chromatic index of generalized
Blanuša snarks |
| 12:15-12:45 | R. Lukotka: Real flow number of generalized
Blanuša snarks |
| | |
| 12:45-14:00 | Lunch Break |
| | |
| 14:00-15:00 | J. Siran: Classification of regular maps on a
given surface
|
| 15:00-15:15 | Break |
| 15:15-16:15 | R. Nedela: Classification of regular maps
with a given underlying graph |
| 16:15-16:45 | Coffee Break |
| 16:45-17:15 | J. Karabas: Classification and enumeration of discrete group
actions on Riemann surfaces of small genera |
| 17:15-17:45 | O. Such: Cayley maps on tori |
| 17:45-18:15 | T. Madaras: On the structure of 1-planar
graphs
|
| |
| |
| 09:00-10:00 | J. Matousek: Hardness of embedding of simplicial complexes in
Rd |
| 10:00-10:30 | Coffee Break |
| 10:30-11:00 | J. Kratochvil: NP-hardness reductions based on some number
theory |
| 11:00-11:30 | L. Vena: A Removal Lemma for linear
systems |
| 11:30-11:45 | Break |
| 11:45-12:15 | W. Imrich: Distinguishing infinite graphs
|
| 12:15-12:45 | B. Krön: Cuts and trees |
| | |
| 12:45-14:00 | Lunch Break |
| | |
| 14:00-15:00 | M. Noy: On the structure of random planar graphs |
| 15:00-15:15 | Break |
| 15:15-16:15 | S. Jendrol: Rainbow colourings of plane graphs |
| 16:15-16:45 | Coffee Break |
| 16:45-17:15 | R. Cada: On some inequalities for domination number |
| 17:15-17:45 | T. Kaiser: Matroids, minors and complexes |
| 17:45-18:15 | M. Milanic: Evaluating game trees in the
priced information model |
| | |
| 19:00 | HEURIGEN EVENING (Conference Dinner) |
| |
| |
| 09:30-10:30 | C. Krattenthaler: The interaction of a gap with a free boundary
in a two dimensional dimer system |
| 10:30-11:00 | Coffee Break |
| 11:00-11:30 | H. Fleischner: One or more than one Hamiltonian cycle |
| 11:30-12:00 | L. Török: Antibandwidth of
Hamming graphs |
| 12:00-12:15 | Break |
| 12:15-12:45 | M. Hornak: Maximum weight of a connected graph of given order and size |
| 12:45-13:15 | R. Kutzelnigg: The Structure of Sparse
Random Bipartite Graphs
|
| 13:15 | Closing |
| |
| |