Conference Timetable
Saturday January 21 |
Sunday January 22 |
Monday January 23 |
Tuesday January 24 |
Wednesday January 25 |
Thursday January 26 |
Friday January 27 |
|||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7.00-8.30 | BREAKFAST | ||||||||||||
8.30-9.00 |
Keith G. Jeffery Beyond the Horizon: Planning Future European ICT R&D |
Dimitris Plexousakis Evolving Ontology Evolution |
S. Barry Cooper How Can Nature Help Us Compute |
Student Research Forum Presentations |
Andre Schiper Group Communication: from Practice to Theory |
Departure | |||||||
9.00-9.30 | |||||||||||||
9.30-10.00 | |||||||||||||
10.00-10.30 | COFFEE BREAK | ||||||||||||
Hall A | Hall B | Hall C | Hall A | Hall B | Hall C | ||||||||
10.30-11.00 |
Sotiris Nikoletseas Model and Algorithms for Wireless Sensor Networks (Smart Dust) |
66 | 158 |
185 |
32 |
186 | 50 |
Student Research Forum Discusion |
Christian Schindelhauer Mobility in Wireless Networks |
||||
11.00-11.30 | 59 |
116 |
8 |
175 |
74 |
40 |
|||||||
11.30-12.00 | 51 |
99 |
182 |
172 | 18 |
33 |
|||||||
12.00-13.30 | Arrival | LUNCH | |||||||||||
13.30-15.30 | BREAK | EXCURSION TRIP
|
BREAK | ||||||||||
15.30-16.00 |
Georg Gottlob Monadic Queries over Tree Structured Data |
44 |
75 |
63 |
Hajnal Andreka, Istvan Nemeti New Physics and Hypercomputation |
Burkhard Monien Selfish Routing in Networks |
|||||||
16.00-16.30 | 56 |
167 |
10 |
||||||||||
16.30-17.00 | 9 |
23 |
144 |
||||||||||
17.00-17.30 | COFFEE BREAK | COFFEE BREAK | |||||||||||
Hall A | Hall B | Hall C | |||||||||||
17.30-18.00 |
Marie-Christine Rousset Somewhere in Semantic Web |
124 |
93 |
88 |
Poster Session |
149 |
7 |
24 |
|||||
18.00-18.30 | 166 |
17 | 42 |
35 |
86 |
174 |
|||||||
18.30-19.00 | 87 |
128 | 21 | 122 |
159 | 68 | |||||||
19.00-19.30 | DINNER | DINNER | DINNER | DINNER | |||||||||
19.30-20.00 | WELCOME PARTY
|
BARBECUE PARTY |
|||||||||||
20.00-.... | CONCERT |
SRF Preparation |
Invited | Foundations | Add-Hoc | XML | Semantic web | Posters | Students | Social |
The timetable in the PDF format | Instructions for presentations |
Steering Committee | Other SOFSEM Activities |
Jochen Alber and Britta Dorn and Rolf Niedermeier
A General Data Reduction Scheme for Domination in Graphs
A General Data Reduction Scheme for Domination in Graphs
Xavier Baril and Zohra Bellahsne
Incremental Method for XML View Maintenance in Case
Incremental Method for XML View Maintenance in Case
Aleksandrs Belovs
NON-INTERSECTING COMPLEXITY
NON-INTERSECTING COMPLEXITY
Marc Benkert, Joachim Gudmundsson, Herman Haverkort, Alexander Wolff
Constructing Interference-Minimal Networks
Constructing Interference-Minimal Networks
Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff
Matching points with rectangles and squares
Matching points with rectangles and squares
Bernd Borchert, Klaus Reinhardt
Searching Paths of Constant Bandwidth
Searching Paths of Constant Bandwidth
F.J. Brandenburg, S. Herrmann
Graph Searching and Search Time
Graph Searching and Search Time
Donghuo Chen, Jinzhao Wu
Reasoning about Inconsistent Concurrent Systems: A Non-Classical Temporal Logic
Reasoning about Inconsistent Concurrent Systems: A Non-Classical Temporal Logic
Manolis Christodoulakis, Costas S. Iliopoulos and Yoan Pinzon
Simple Algorithm for Sorting All the Fibonacci String Rotations
Simple Algorithm for Sorting All the Fibonacci String Rotations
Jean-Francois Culus and Marc Demange
Oriented coloring: complexity and approximation
Oriented coloring: complexity and approximation
Frank Dehne, Michael Fellows, Henning Fernau, Elena Prieto, Frances Rosamond
NONBLOCKER: parameterized algorithmics for MINIMUM DOMINATING SET
NONBLOCKER: parameterized algorithmics for MINIMUM DOMINATING SET
Ilze Dzelme
Quantum finite automata and logics
Quantum finite automata and logics
Sang Hun Eo, Suraj Pandey, Myung-Keun Kim and Hae Young Bae
FDSI-tree: A Fully Distributed Spatial Index Tree for Efficient & Power-Aware Range Queries in Sensor Networks
FDSI-tree: A Fully Distributed Spatial Index Tree for Efficient & Power-Aware Range Queries in Sensor Networks
Henning Fernau
ROMAN DOMINATION: a parameterized perspective
ROMAN DOMINATION: a parameterized perspective
Andrey Fomichev, Maxim Grinev, Sergey Kuznetsov
Sedna: A Native XML DBMS
Sedna: A Native XML DBMS
Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc and Xiaohui Zhang
Optimal memory rendezvous of anonymous mobile agents in a uni-directional ring
Optimal memory rendezvous of anonymous mobile agents in a uni-directional ring
Krzysztof Goczyla, Teresa Grabowska, Wojciech Waloszek,Michal Zawadzki
The Knowledge Cartography ? A new approach to reasoning over Description Logics ontologies
The Knowledge Cartography ? A new approach to reasoning over Description Logics ontologies
Jiong Guo and Falk Hueffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Furman Haddix and Kalyan Pydipati
Using Extensible Heterogeneous Database Transformers
Using Extensible Heterogeneous Database Transformers
Lane Hemaspaandra and Leen Torenvliet
P-Selectivity, Immunity, and the Power of One Bit
P-Selectivity, Immunity, and the Power of One Bit
Krzysztof Kaczmarski
Transparent Migration of Database Services
Transparent Migration of Database Services
Pavel Smrž, Vladimír Kadlec
How Many Dots Are Really Needed for Head-Driven Chart Parsing?
How Many Dots Are Really Needed for Head-Driven Chart Parsing?
Marcin Kik
Merging and Merge-sort in a Single Hop Radio Network
Merging and Merge-sort in a Single Hop Radio Network
Pok-Son Kim, Arne Kutzner
On Optimal and Efficient in Place Merging
On Optimal and Efficient in Place Merging
Young Ji Kim, Jae Young Lee, Yong Tae Woo
A Personalized Recommendation System Based-on PRML for E-Commerce
A Personalized Recommendation System Based-on PRML for E-Commerce
Young Kim, Sang-Ho Park, Tae-Soon Kim, Ju-Hong Lee, Sun Park
An Efficient Index Scheme for XML Databases
An Efficient Index Scheme for XML Databases
Joachim Kupke
On Separating Constant from Polynomial Ambiguity of Finite Automata (Extended Abstract)
On Separating Constant from Polynomial Ambiguity of Finite Automata (Extended Abstract)
Jaroslaw Kutylowski Filip Zagorski
Reliable Broadcasting without Collision Detection in an Automotive Scenario
Reliable Broadcasting without Collision Detection in an Automotive Scenario
Michal Lentner, Krzysztof Stencel, Kazimierz Subieta
Semi-Strong Static Type Checking of Object-Oriented Query Languages
Semi-Strong Static Type Checking of Object-Oriented Query Languages
Gines Moreno
Building a Fuzzy Transformation System
Building a Fuzzy Transformation System
Adam Niewiadomski
Automated Generating of Press Comments. Part II: Algorithms and Implementations
Automated Generating of Press Comments. Part II: Algorithms and Implementations
Jean-Pierre Norguet, Esteban Zimanyi, Ralf Steinberger
Improving Web Site Content by integrating Web Usage Mining, Web Content Mining, and Semantic Analysis
Improving Web Site Content by integrating Web Usage Mining, Web Content Mining, and Semantic Analysis
Pavel Smrz and Vit Novacek
OLE --- A New Ontology Learning Platform
OLE --- A New Ontology Learning Platform
Saeed Parsa, Vahid Khalilpoor
Automatic Distribution of Serialized Programs Using JavaSymphony Middleware
Automatic Distribution of Serialized Programs Using JavaSymphony Middleware
T. Plachetka
Unifying Framework for Message Passing
Unifying Framework for Message Passing
C. Pons
Heuristics on the Definition of UML Refinement Patterns
Heuristics on the Definition of UML Refinement Patterns
Daniel Sawitzki
The Complexity of Problems on Implicitly Represented Inputs
The Complexity of Problems on Implicitly Represented Inputs
Shaoxu Song and Chunping Li
Improved ROCK for Text Clustering using Asymmetric Proximity
Improved ROCK for Text Clustering using Asymmetric Proximity
Svetlana Strunja's-Yoshikawa, Fred Annexstein, and Kenneth Berman
Compact Encodings for All Local Path Information in Web Taxonomies with applications to WordNet
Compact Encodings for All Local Path Information in Web Taxonomies with applications to WordNet
Jukka Suomela
Computational Complexity of Relay Placement in Sensor Networks
Computational Complexity of Relay Placement in Sensor Networks
Jiri Sima, Satu Elisa Schaeffer
On the NP-Completeness of Some Graph Cluster Measures
On the NP-Completeness of Some Graph Cluster Measures
Suat Ugurlu, Nadia Erdogan
A Flexible Policy Architecture for Mobile Agents
A Flexible Policy Architecture for Mobile Agents
Eun-Jun Yoon and Kee-Young Yoo
An Improved Digital Signature with Message Recovery using Self-Certified Public Keys without Trustworthy System Authority
An Improved Digital Signature with Message Recovery using Self-Certified Public Keys without Trustworthy System Authority
Grazyna Zwozniak
Small independent edge dominating sets in graphs of maximum degree three
Small independent edge dominating sets in graphs of maximum degree three
Ondřej Šerý, Tomáš Poch, Pavel Šafrata
Level-Of-Detail in Behaviour of Virtual Humans
Level-Of-Detail in Behaviour of Virtual Humans