Wednesday, October 13th:

Student Session - 1 (9.00-10.40)
--------------------------------
Niko Lukac and Borut Zalik.
  Efficient approach for visualization of large cosmological particle
  datasets
Danijel Žlaus and Gregor Klajnšek.
  Detection and display of visible surfaces
Endre Palatinus and Balázs Bánhelyi.
  Optimal and Reliable Covering of Planar Objects with Circles
Grigorios G. Anagnostopoulos and Pavlos S. Efraimidis.
  Bayesian Games on a Maxmin Network Router
Tine Šukljan.
  Succinct data structures for dynamic strings

Student Session - 2 (11.00-12.30)
---------------------------------
Balázs Dávid.
  Heuristics for the Multiple-Depot Vehicle Scheduling Problem
David Božič.
  An Extensible Probe Architecture for Network Protocol
András Bóta and Miklós Krész.
  A simple propagation algorithm and it's use for protein
  classification
Attila Tanyi and Benedek Nagy.
  Truth-Teller-Liar Puzzles - a Genetic Algorithm Approach


Conference opening and Invited Lecture (2.00-3.15)
--------------------------------------------------
András Recski.
  Applications of Combinatorics in Statics

Short presentations Session - 1 (3.30-4.50)
-------------------------------------------
Sandor SZABO.
  A k-cover algorithm
Jernej Vičič.
  Using Multigraphs in the Shallow Transfer Machine Translation
Andrea Huszti.
  Experiment-Based Definitions for Electronic Exam Systems
Neculae Vornicescu.
  Hamiltonian Graphs

Short presentations Session - 2 (5.05-6.05)
-------------------------------------------
Joel Ratsaby.
  Information set-distance
Amit Dutta, Masud Hasan and M. Sohel Rahman.
  Prefix transpositions on binary and ternary strings
Zoltán L. Németh.
  Model Checking of the Slotted CSMA/CA MAC Protocol of the IEEE
  802.15.4 Standard


Thursday, October 14th:

Session A (9.00 - 10.30)
------------------------
Shegufta Bakht Ahsan, Tanaeem M. Moosa, M.Sohel Rahman and Shampa Shah.
  Computing a Longest Common Subsequence of two strings when one of them
  is Run Length Encoded
Katharina A. Zweig, Emőke-Ágnes Horvát.
  How to evaluate co-occurrences of products in market-baskets from
  real-world applications
Aleksander Vesel.
  Embedding of Complete and Nearly Complete Binary Trees into
  Hypercubes

Session B (10.45-12.15)
-----------------------
György Dósa, Zsolt Tuza and Deshi Ye.
  Better bounds for the bin packing problem with LIB constraint
János Balogh and József Békési.
  A Review on Semi-on-Line Bin Packing Results
Hans Kellerer and Vitaly Strusevich.
  Minimizing Total Weighted Earliness-Tardiness on a Single Machine
  Around a Small Common Due Date: An FPTAS Using Quadratic Knapsack

Session C (2.00-3.30)
---------------------
Zoltán Ádám Mann and Anikó Szajkó.
  Determining the expected runtime of exact graph coloring
András Bóta, László Csizmadia and András Pluhár.
  Community detection and its use in Real Graphs
Viktor Árgilán, Attila Tóth, Balázs Dávid, Csaba Kemény and Gábor Pongrácz.
  Greedy heuristics for driver scheduling and rostering

Session D (3.45-4.45)
---------------------
Phan-Thuan Do and Vincent Vajnovszki.
  Generating pattern avoiding permutations by ECO
Zsolt Gazdag.
  A note on context-free grammars with rewriting restrictions