| | |
Tutorials:
- Artur Czumaj, Combinatorial and probabilistic techniques in property testing
- Jarosław Grytczuk, Combinatorial Nullstellensatz
- Tomasz Schoen, Probabilistic methods in combinatorial number theory
- Piotr Sankowski, Algebraic graph algorithms
Social events:
- excursion, Saturday 14:00 - 17:00
- banquet, Sunday 19:00 - ...
Program:
- October 17, Friday: arrival day
- Saturday:
- 8:00 - 8:55 breakfast
- 8:55 - 9:00 opening remarks
- 9:00 - 9:50 Tomasz Łuczak, Cycles in claw-free graphs
- 9:50 - 10:40 Stefan Felsner, Orientations of planar graphs [pdf]
- 10:40 - 11:10 coffee
- 11:10 - 12:00 Michał Morayne, Combinatorics of optimal stopping on partial orders and graphs
- 12:00- 12:50 Mariusz Woźniak, On arbitrarily vertex decomposable graphs
- 13:00 - 14:00 lunch
- 14:00 - 17:00 excursion
- 17:15 - 19:00 contributed talks
session A:
- 17:15 - 17:40 Bartłomiej Bosek, On-line chain partitioning of posets [pdf]
- 17:40 - 18:05 Marta Przyborowska, On a max-reconstruction of disconnected posets [pdf]
- 18:10 - 18:35 Tomasz Krawczyk, First fit algorithm for on-line chain partitioning problem [pdf]
- 18:35 - 19:00 Kamil Kloch, On-line dimension of semi-orders [pdf]
session B:
- 17:15 - 17:40 Zofia Miechowicz, Game chromatic number of Cartesian product graphs
- 17:40 - 18:05 Krzysztof Przesławski, Cube Tilings [pdf]
- 18:10 - 18:35 Marcin Kamiński, On the plane-width of graphs [pdf]
- 18:35 - 19:00 Sylwia Cichacz, 2-splittable and cordial graphs [pdf]
- 19:00 - 20:00 dinner
- Sunday:
- 8:00 - 9:00 breakfast
- 9:00 - 9:50 Carsten Thomassen, Orientations and spanning trees in graphs
- 9:50 - 10:40 Artur Czumaj, Testing expansion
- 10:40 - 11:10 coffee
- 11:10 - 12:00 Gyula O.H. Katona, Bounds on the largest families of subsets with forbidden subposets
- 12:00- 12:50 Shahriar Shahriari, Chain partitions of normalized matching posets
- 13:00 - 14:00 lunch
- 14:15 - 16:00 contributed talks
session A:
- 14:15 - 14:40 Izolda Gorgol, Some remarks on anti-Ramsey numbers [pdf]
- 14:40 - 15:05 Mariusz Grech, Large Totally symmetric edge-colored graphs [pdf]
- 15:10 - 15:35 Anna Fiedorowicz, Acyclic edge colourings of graphs [pdf]
- 15:35 - 16:00 Yury Person, Highly connected coloured subgraphs [pdf]
session B:
- 14:15 - 14:40 Angela Mestre, The combinatorics of connected graphs [pdf]
- 14:40 - 15:05 Przemysław Gordinowicz, The search for the smallest 3-e.c. graphs [pdf]
- 15:10 - 15:35 Ryuzo Torii, Path Transferability of Graphs [pdf]
- 15:35 - 16:00 Piotr Micek, How to eat 4/9 of a pizza [pdf]
- 16:00 - 16:30 coffee
- 16:30 - 18:15 contributed talks
session A:
- 16:30 - 16:55 Andrzej Dudek, Cliques in Steiner Systems [pdf]
- 16:55 - 17:20 Hiep Han, Dirac type theorem for loose cycles in uniform hypergraphs [pdf]
- 17:25 - 17:50 Paweł Naroski, Long cycles in 3-uniform hypergraphs
- 17:50 - 18:15 Artur Szymański, k-uniform self-complementary hypergraphs [pdf]
session B:
- 16:30 - 16:55 Vesa Linja-aho, Recent Results on the Classification of Starters [pdf]
- 16:55 - 17:20 Marcin Kozik, Algebraic tools in CSP, CSP ideas in algebra -- closer look at SD(v) varieties [pdf]
- 17:25 - 17:50 Hossein Teimoori Faal, Some Determinantal Identities for Rectangular Matrices [pdf]
- 17:50 - 18:15 Michał Tuczyński, Graceful trees conjecture
- 19:00 - ... banquet
- Monday:
- 8:00 - 9:00 breakfast
- 9:00 - 9:50 Marek Karpinski, Sampling in large matrices and approximation of CSP [pdf]
- 9:50 - 10:40 Jan Kratochvíl, Geometric representations of graphs
- 10:40 - 11:10 coffee
- 11:10 - 12:00 Hal Kierstead, Efficient packing via game coloring
- 12:00- 12:50 Jaroslav Nešetřil, Somewhere dense vs nowhere dense graphs
- 13:00 - 14:00 lunch
- 14:15 - 16:00 contributed talks
session A:
- 14:30 - 15:05 Zdzisław Skupień, Constructions of universal fractional parts of complete graphs [pdf]
- 15:10 - 15:35 Mariusz Meszka, Almost resolvable k-cycle systems [pdf]
- 15:35 - 16:00 Małgorzata Sulkowska, Best choice&GuseinZade problem for directed and undirected paths [pdf]
session B:
- 14:30 - 15:05 Wit Foryś, Modelling parallel computation - symbolic dynamics on infinite traces [pdf]
- 15:10 - 15:35 Martin Milanic, Evaluating monotone Boolean functions and game trees in the priced information model [pdf]
- 15:35 - 16:00 Bartosz Walczak, The complexity of finding minimum generating sets [pdf]
- 16:00 - 16:30 coffee
- 16:30 - 18:15 contributed talks
session A:
- 16:30 - 16:55 Jakub Przybyło, New bounds for the irregularity strength of graphs [pdf]
- 16:55 - 17:20 Wiktor Żelazny, Lucky labelings of graphs [pdf]
- 17:25 - 17:50 Sebastian Czerwiński, Graph colorings without short repetitive paths
- 17:50 - 18:15 Rafał Witkowski, The best known algorithms for frequency assignment problem in cellular network
session B:
- 16:30 - 16:55 Katarzyna Rybarczyk-Krzywdzińska, The diameter, connectivity and the giant component of uniform random intersection graph [pdf]
- 16:55 - 17:20 Krzysztof Krzywdziński, Regular Clustering in UDG in Constant Time [pdf]
- 17:25 - 17:50 Krzysztof Bryś, Minimum connected dominating sets in unit disk graphs [pdf]
- 17:50 - 18:15 Wojciech Rytter, Counting maximal repetitions in Sturmian words
- 18:30 - 19:30 dinner
- Tuesday:
- 8:00 - 9:00 breakfast
- 9:00 - 10:40 Jarosław Grytczuk, tutorial
- 10:40 - 11:10 coffee
- 11:10 - 12:50 Artur Czumaj, tutorial
- 13:00 - 14:00 lunch
- 14:15 - 16:00 Jarosław Grytczuk
- 16:00 - 16:30 coffee
- 16:30 - 18:15 Artur Czumaj
- 18:30 - 19:30 dinner
- 20:00 - 21:00 Jarosław Grytczuk
- 21:00 - 22:00 Artur Czumaj
- Wednesday:
- 8:00 - 9:00 breakfast
- 9:00 - 10:40 Tomasz Schoen, tutorial
- 10:40 - 11:10 coffee
- 11:10 - 12:50 Piotr Sankowski, tutorial
- 13:00 - 14:00 lunch
- 14:15 - 16:00 Tomasz Schoen
- 16:00 - 16:30 coffee
- 16:30 - 18:15 Piotr Sankowski
- 18:30 - 19:30 dinner
- 20:00 - 21:00 Tomasz Schoen
- 21:00 - 22:00 Piotr Sankowski
- October 23, Thursday: departure day
|
|
|
