22. November, Wednesday

20:00 - Informal "get-together" meeting (Science Hotel)

23. November, Thursday

08:00-08:45 - Registration

08:45-09:00 - Official opening

09:00-10:30 - Session 1
Chair: Gábor Galambos
József Balogh On some geometric applications of the container method
Béla Csaba Embedding graphs having Ore-degree at most five
Dezső Miklós On the vertex and edge sign balances of (hyper)graphs
István Miklós The swap Markov chain is rapidly mixing on the realizations of linearly bounded degree sequences

Coffee break

11:00-12:30 - Session 2
Chair: Andrej Brodnik
Rolf Niedermeier Fixed-parameter tractability inside P
Benedek Nagy On 5'-3' Watson-Crick finite and pushdown automata
Moritz von Looz Parallel mesh (re)partitioning with balanced k-means
Sándor Szabó Cliques and differential equations


14:00-16:00 - Session 3
Chair: József Békési
Nysret Musliu Improving the efficiency of dynamic programming on tree decompositions via machine learning
Branko Kavšek Development and evaluation of different models for predicting tourist category from texts
Csaba Raduly-Baka Discrete structures in access road design
Dries Goossens Conference scheduling: a personalized approach

Visit to the Computer Science Museum

17:30-19:00 - Session 4
Chair: Miklós Krész
József Békési From bin packing to vehicle assignment
Ulrich Pferschy Approximation of the incremental knapsack problem
Hans Kellerer Restricted assignment scheduling with resource constraints
Péter Hajnal Two geometrical applications of the semi-random method

19:30 - Conference dinner

24. November, Friday

09:00-10:30 - Session 5
Chair: János Csirik
Miklós Simonovits Why are the algorithms important in extremal graph theory?
András Frank Decreasingly-minimal optimization
György Turán Betweenness centrality profiles for trees
Gabriel Istrate On the heapability of partial orders

Coffee break

11:00-12:30 - Session 6
Chair: György Turán
Attila Sali Multi-symbol forbidden configurations
Gyula O.H. Katona An improvement on the intersecting shadow theorem
Zsolt Tuza Ramsey numbers with degree restrictions
Ervin Győri Terminal-pairability in some graphs


14:00-15:30 - Session 7
Chair: Tibor Csendes
János Balogh Online bin packing with cardinality constraints resolved
György Dósa The tight asymptotic ratio of First Fit algorithm for cardinality constrained binpacking
Tamás Kis Scheduling with non-renewable resources
Bo Chen Supplier competition with option contracts for discrete blocks of capacity

Coffee break

16:00-18:00 - Session 8
Chair: Gerhard Reinelt
Andrej Brodnik Polypeptide origami
Nebojša Gvozdenović Synchronized planning of sales territories and delivery routes in supply chain
Tibor Illés Operational research model for crew scheduling and application
Tibor Csendes When to sell the cow?
Tamás Terlaky The Inmate Assignment and Scheduling Problem and its Application in the PA Department of Corrections

18:00-18:15 - Closing

19:00 - Survivors' Dinner