| Saturday, January 19 |
 |
| 14:00 | - | 22:00 |
|
| Sunday, January 20 |
|
| Invited Talks |
| 8:20 | - | 8:30 | (A) Opening |
| 8:30 | - | 10:00 | (A) | Wolfgang Thomas (Aachen, Germany)
Optimizing Winning Strategies in Regular Infinite Games | |
|
| 10:00 | - | 10:30 | Coffee Break |
|
| 10:30 | - | 12:00 | (A) | Nataša Jonoska (Tampa/Florida, USA, with Gregory L. McColm)
Describing Self-Assembly of Nanostructures | |
|
| 12:00 | - | 13:30 | Lunch |
|
| 15:30 | - | 17:00 | (A) | Yoram Ofek (Trento, Italy, with Mariano Ceccato and Paolo Tonella)
Remote Entrusting by Run-Time Software Authentication | |
|
| 17:00 | - | 17:30 | Coffee Break |
|
| 17:30 | - | 19:00 | (A) | Ahmad-Reza Sadeghi (Bochum, Germany)
Trusted Computing—State of the Art and Challenges | |
| Evening |
| 19:30 | + | |
|
| Monday, January 21 |
|
| Invited Talk |
| 8:30 | - | 10:00 | (A) | Peter Dolog (Aalborg, Denmark)
Designing Adaptive Web Applications | |
|
| 10:00 | - | 10:30 | Coffee Break |
|
| Contributed Talks |
| 10:30 | - | 10:55 | (A | - Foundations): Nieves Brisaboa, Oscar Pedreira, Diego Seco (A Coruña, Spain), Roberto Solar, and Roberto Uribe (Punta Arenas, Chile)
Clustering based similarity search in metric spaces with sparse spatial centers | |
| (B | - Security): Feng Cheng and Christoph Meinel (Potsdam, Germany)
Strong authentication over lock-keeper | |
| (C | - Foundations): Antti Siirtola (Oulu, Finland) and Michal Valenta (Prague, Czech Republic)
Verifying parameterized taDOM+ lock managers | |
| (D | - Nature): Sebastian Dörn (Ulm, Germany) and Thomas Thierauf (Aalen, Germany)
The quantum complexity of group testing | |
| 11:00 | - | 11:25 | (A | - Foundations): Stefan Dobrev (Ottawa/ON, Canada), Rastislav Královič, and Dana Pardubská (Bratislava, Slovakia)
How much information about the future is needed ? | |
| (B | - Security): Dušan Bernát (Bratislava, Slovakia)
Domain name system as a memory and communication medium | |
| (C | - Foundations): Cezara Dragoi and Gheorghe Stefanescu (Bucharest, Romania)
On compiling structured interactive programs with registers and voices | |
| (D | - Nature): Andris Ambainis and Alexander Rivosh (Riga, Latvia)
Quantum random walks with multiple or moving marked locations | |
| 11:30 | - | 11:55 | (A | - Foundations): Wataru Matsubara (Sendai, Japan), Shunsuke Inenaga (Fukuoka, Japan), Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, and Kazuo Hashimoto (Sendai, Japan)
Computing longest common substring and all palindromes from compressed strings | |
| (B | - Security): Matej Košík (Bratislava, Slovakia)
Taming of Pict | |
| (C | - Foundations): Radim Nedbal (Prague, Czech Republic)
Algebraic optimization of relational queries with various kinds of preferences | |
| (D | - Nature): Diego de Falco and Dario Tamascelli (Milano, Italy)
Quantum walks: a Markovian perspective | |
|
| 12:00 | - | 13:30 | Lunch |
|
| 15:30 | - | 15:55 | (A | - Foundations): Andreas Spillner (Norwich, United Kingdom) and Alexander Wolff (Eindhoven, the Netherlands)
Untangling a planar graph | |
| (B | - Web Tech): Radovan Šesták and Jan Lánský (Prague, Czech Republic)
Compression of concatenated web pages using XBW | |
| (C | - Foundations): Michael J. Burrell, James H. Andrews, and Mark Daley (London/ON, Canada)
A useful bounded resource functional language | |
| 16:00 | - | 16:25 | (A | - Foundations): Marián Lekavý and Pavol Návrat (Bratislava, Slovakia)
Extension of rescheduling based on minimal graph cut | |
| (B | - Web Tech): Przemysław Skibiński (Wrocław, Poland), Jakub Swacha (Szczecin, Poland), and Szymon Grabowski (Łódź, Poland)
A highly efficient XML compression scheme for the web | |
| (C | - Foundations): Julien Bernet and David Janin (Bordeaux, France)
From asynchronous to synchronous specifications for distributed program synthesis | |
| 16:30 | - | 16:55 | (A | - Foundations): Lech Duraj and Grzegorz Gutowski (Kraków, Poland)
Optimal orientation on-line | |
| (B | - Web Tech): Khadija Abied Ali and Jaroslav Pokorný (Prague, Czech Republic)
3D_XML: a three-dimensional XML-based model | |
| (C | - Foundations): Julien Cristau (Paris, France) and Florian Horn (Aachen, Germany)
On reachability games of ordinal length | |
|
| 17:00 | - | 17:30 | Coffee Break |
|
| 17:30 | - | 17:55 | (A | - Foundations): Astrid Rakow (Oldenburg, Germany)
Slicing Petri nets with an application to workflow verification | |
| (B | - Web Tech): Michal Tvarožek, Michal Barla, György Frivolt, Marek Tomša, and Mária Bieliková (Bratislava, Slovakia)
Improving semantic search via integrated personalized faceted and visual graph navigation | |
| (C | - Foundations): Neža Mramor-Kosta (Ljubljana, Slovenia) and Eva Trenklerová (Košice, Slovakia)
Basic sets in the digital plane | |
| 18:00 | - | 18:25 | (A | - Foundations): Adam Koprowski and Hans Zantema (Eindhoven, the Netherlands)
Certification of proving termination of term rewriting by matrix interpretations | |
| (B | - Web Tech): Miloš Kudělka, Václav Snášel, Ondřej Lehečka (Ostrava, Czech Republic), Eyas El-Qawasmeh (Irbid, Jordan), and Jaroslav Pokorný (Prague, Czech Republic)
Web pages reordering and clustering based on web patterns | |
| (C | - Foundations): Claudia Nuccio and Emanuele Rodaro (Milano, Italy)
Mortality problem for 2x2 integer matrices | |
| 18:30 | - | 18:55 | (A | - Foundations): Fabio Alessi and Paula Severi (Udine, Italy)
Recursive domain equations of filter models | |
| (B | - Web Tech): György Frivolt, Ján Suchal, Richard Veselý, Peter Vojtek, Oto Vozár, and Mária Bieliková (Bratislava, Slovakia)
Creation, population and preprocessing of experimental data sets for evaluation of applications for the semantic web | |
| (C | - Foundations): Bogusław Cyganek (Kraków, Poland)
An algorithm for computation of the scene geometry by the log-polar area matching around salient points | |
| Evening |
| 20:00 | + | |
|
| Tuesday, January 22 |
|
| Student Research Forum |
|
| 9:00 | - | 10:30 | (A) SRF Presentations |
| 10:30 | - | 12:00 | (A) SRF Posters |
|
| 12:00 | - | 13:00 | Lunch |
|
|
| Afternoon |
| 13:00 | + | |
|
| Evening |
| 20:00 | + | |
|
| Wednesday, January 23 |
|
| Invited Talk |
| 8:30 | - | 10:00 | (A) | Martin Džbor (Milton Keynes, United Kingdom)
Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web, and Vice-Versa | |
|
| 10:00 | - | 10:30 | Coffee Break |
|
| Contributed Talks |
| 10:30 | - | 10:55 | (A | - Foundations): Costas S. Iliopoulos and Mohammad Sohel Rahman (London, United Kingdom)
A new model to solve the swap matching problem and efficient algorithms for short patterns | |
| (B | - Security): Peishun Wang, Huaxiong Wang, and Josef Pieprzyk (Sydney/NSW, Australia)
Threshold privacy preserving keyword searches | |
| (C | - Web Tech): Hyun Woong Shin (Suwon, South Korea), Eduard Hovy, and Dennis McLeod (Los Angeles/CA, USA)
The dynamic web presentations with a generality model on the news domain | |
| 11:00 | - | 11:25 | (A | - Foundations): Jurek Czyzowicz (Gatineau/QC, Canada), Stefan Dobrev (Bratislava, Slovakia), Evangelos Kranakis (Ottawa/ON, Canada), and Danny Krizanc (Middletown/CT, USA)
The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring | |
| (B | - Security): Marek Klonowski, Przemysław Kubiak, and Mirosław Kutyłowski (Wrocław, Poland)
Practical deniable encryption | |
| (C | - Web Tech): Jiří Dokulil (Prague, Czech Republic) and Jana Katreniaková (Bratislava, Slovakia)
Visual exploration of RDF data | |
| 11:30 | - | 11:55 | (A | - Foundations): Christian Gunia (Freiburg, Germany)
Energy-efficient windows scheduling | |
| (B | - Security): Jacek Cichoń, Mirosław Kutyłowski, and Bogdan Węglorz (Wrocław, Poland)
Short ballot assumption and threeballot voting protocol | |
| (C | - Web Tech): Piotr Kalita, Igor Podolak, Adam Roman, and Bartosz Bierkowski (Kraków, Poland)
Algorithm for intelligent prediction of requests in business systems | |
|
| 12:00 | - | 13:30 | Lunch |
|
| 15:30 | - | 15:55 | (A | - Foundations): Mila Majster-Cederbaum and Christoph Minnameier (Mannheim, Germany)
Deriving complexity results for interaction systems from 1-safe Petri nets | |
| (B | - Security): Jordi Pont-Tuset, Pau Medrano-Gracia (Barcelona, Spain), Jordi Nin (Bellaterra, Spain), Josep-L. Larriba-Pey, and Victor Muntés-Mulero (Barcelona, Spain)
ONN the use of neural networks for data privacy | |
| (C | - Web Tech): Przemysław Kazienko and Katarzyna Musiał (Wrocław, Poland)
Mining personal social features in the community of email users | |
| 16:00 | - | 16:25 | (A | - Foundations): Beate Bollig, Niko Range, and Ingo Wegener (Dortmund, Germany)
Exact OBDD bounds for some fundamental functions | |
| (B | - Security): Shoichi Morimoto (Tokyo, Japan), Shinjiro Shigematsu, Yuichi Goto, and Jingde Cheng (Saitama, Japan)
Classification, formalization and verification of security functional requirements | |
| (C | - Web Tech): Marek Klonowski and Tomasz Strumiński (Wrocław, Poland)
Proofs of communication and its application for fighting spam | |
| 16:30 | - | 16:55 | (A | - Foundations): Holger Petersen (Stuttgart, Germany)
Element distinctness and sorting on one-tape off-line Turing machines | |
| (B | - Nature): Camelia-M. Pintea, Camelia Chira, Dan Dumitrescu (Cluj-Napoca, Romania), and Petrica Claudiu Pop (Baia-Mare, Romania)
A sensitive metaheuristic for solving a large optimization problem | |
| (C | - Foundations): Peter Gaži and Branislav Rovan (Bratislava, Slovakia)
Assisted problem solving and decompositions of finite automata | |
|
| 17:00 | - | 17:30 | Coffee Break |
|
| 17:30 | - | 17:55 | (A | - Foundations): Holger Petersen (Stuttgart, Germany)
Improved bounds for range mode and range median queries | |
| (B | - Nature): Marek Krętowski (Białystok, Poland)
A memetic algorithm for global induction of decision trees | |
| (C | - Foundations): Paul Bell (Turku, Finland) and Igor Potapov (Liverpool, United Kingdom)
Periodic and infinite traces in matrix semigroups | |
| 18:00 | - | 18:25 | (A | - Foundations): Vikraman Arvind and Pushkar Joglekar (Chennai, India)
Algorithmic problems for metrics on permutation groups | |
| (B | - Nature): Jacek Dąbrowski (Gdańsk, Poland)
Parallel immune system for graph coloring | |
| (C | - Foundations): Adam Roman and Wit Foryś (Kraków, Poland)
Lower bound for the length of synchronizing words in partially-synchronizing automata | |
| 18:30 | - | 18:55 | (A | - Foundations): Bruno Escoffier, Jérôme Monnot, and Olivier Spanjaard (Paris, France)
Some tractable instances of interval data minmax regret problems: bounded distance from triviality | |
| (B | - Nature): Věra Kůrková (Prague, Czech Republic) and Marcello Sanguineti (Genova, Italy)
Geometric rates of approximation by neural networks | |
| (C | - Foundations): Frank G. Radmacher (Aachen, Germany)
An automata theoretic approach to rational tree relations | |
| Evening |
| 20:00 | + | |
|
| Thursday, January 24 |
|
| Invited Talks |
| 8:30 | - | 10:00 | (A) | Andris Ambainis (Waterloo/Ontario, Canada)
Quantum Random Walks—New Method for Designing Quantum Algorithms | |
|
| 10:00 | - | 10:30 | Coffee Break |
|
| 10:30 | - | 12:00 | (A) | Juraj Hromkovič (Zürich, Switzerland, with Hans-Joachim Böckenhauer, Tobias Mömke, and Peter Widmayer)
On the Hardness of Reoptimization | |
|
| 12:00 | - | 13:30 | Lunch |
|
| 15:30 | - | 17:00 | (A) | Jarkko Kari (Turku, Finland)
Undecidability of the Tiling Problem | |
|
| 17:00 | - | 17:30 | Coffee Break |
|
| 17:30 | - | 19:00 | (A) | Peter Brusilovsky (Pittsburgh/Pennsylvania, USA)
Social Information Access: The Other Side of the Social Web | |
| Evening |
| 19:30 | + | |
|
