Thursday 10. october 2013
 8:00  - 9:00 Registration
  Algorithms - Applications (Student sessions I) [3 talks (15+5)]
 9:00  - 9:20 Nándor Németh: An Algorithm for Recognition of Position Repetition in Chess
 9:20  - 9:40 Simon Mezgec: Traffic Sign Symbol Recognition with the D2
 9:40  - 10:00 Balázs Dávid: A model and heuristic for the multiple depot bus rescheduling problem
 10:00  - 10:15 Break
  Algorithms - Efficiency (Student Session II) [3 talks (15+5)]
 10:15  - 10:35 Monika Vigula: Efficient algorithms solving subgraph isomorphism problem in cheminformatics
 10:35  - 10:55 Pavel Veselý: Competitiveness of Fit Algorithms for Black and White Bin Packing
 10:55  - 11:15 Marko Grgurovič: Adaptive Algorithms For Dynamic Programming With Applications to Bioinformatics
 11:15  - 11:30 Break
  Algorithms - Data structures (Student Session III) [3 talks (15+5)]
 11:30  - 11:50 Andrej Bukošek: A system for parallel execution of data-flow graphs
 11:50  - 12:10 Matevž Jekovec: Theoretical aspects of ERa, the fastest practical suffix tree construction algorithm
 12:10  - 12:30 Tine Šukljan: Comparison between a cache-oblivious range query data structure and a quadtree
 12:30  - 14:00 Lunch
 14:00  - 14:15 Opening
 14:15  - 15:15 Invited lecture (prof. Silvano Martello: Two-Dimensional Packing Problems in Telecommunications)
 15:15  - 15:30 Break
  Algorithms - Software (Student Session IV) [3 talks (15+5)]
 15:30  - 15:50 Tatyana Kandryukova: On numerical simulation of filtration gas combustion processes on the shared memory machines
 15:50  - 16:10 András Németh: Processable Erlang Data in C++
 16:10  - 16:30 Gergely Suba: A new method for transforming algorithm into VHDL by starting from a Haskell functional language description
 17:00  - 19:30 Business meeting

 

Friday 11. october 2013
  Integer and Discrete Programming (Regular talks I) [4 talks (20min + 5min)]
 9:00  - 9:25 Ulrich Pferschy and Rostislav Staněk: Using Pure Integer Solutions to Solve the Travelling Salesman Problem
 9:25  - 9:50 Achim Hildenbrandt, Gerhard Reinelt and Olga Heismann: Integer Programming Models for the Target Visitation Problem
 9:50  - 10:15 Attila Toth, Timo Knuutila and Olli Nevalainen: Machine configuration and workload balancing for multi-product PCB assembly
 10:15  - 10:40 József Békési, Gábor Galambos, Michael Jung, Marcus Oswald and Gerhard Reinelt: Exact Algorithms for the General Coupled Task Scheduling Problem
 10:40  - 10:50 Break
  Algorithms and Complexity (Regular talks II) [4 talks (20min + 5min)]
 10:50  - 11:15 Domen Mongus and Borut Žalik: Detection of ground in point-clouds generated from stereo-pair images
 11:15  - 11:40 Ekaterina Berveno, Alexander Kalinkin and Yuri Laevsky: Simulation of two-phase fluid filtration with nonuniform media clusters
 11:40  - 12:05 Jurij Mihelič: Enumerating algebraic expressions generated by context-free grammars
 12:05  - 12:30 Alexander Gilbers: Barrier Resilience of Visibility Polygons
 12:30  - 14:00 Lunch
  Graph Theory (Regular talks III) [4 talks (20min + 5min)]
 14:00  - 14:25 Elmar Langetepe, Andreas Lenerz and Bernd Brüggemann: Strategic deployment in graphs
 14:25  - 14:50 Olga Heismann and Ralf Borndörfer: The Random Hypergraph Assignment Problem
 14:50  - 15:15 Vincenzo Currò, Vincenzo Cutello and Salvatore Mario Nolassi: The Roman Domination Problem on Grid Graphs
 15:15  - 15:40 Stefan Wiesberg and Gerhard Reinelt: Relaxations in Practical Clustering and Blockmodeling
 15:40  - 16:00 Break
  Signal and Image Processing (Regular talks IV) [4 talks (20min + 5min)]
 16:00  - 16:25 Peter Rogelj: Estimation of cervix cancer spatial distribution for brachytherapy applicator analysis
 16:25  - 16:50 Shruti Sehgal and Garima Vyas: Recognition of Repeating Segment from an Audio Using Vector Quantization and K-means algorithm
 16:50  - 17:15 Gašper Fele-žorž: A Faster Algorithm for Calculating the Sample Entropy
 17:15  - 17:20 Closing