SOFSEM 2015 := Conference Program
Legend
Saturday January 24, 2015 | |||
16:00 – 21:00 | SOFSEM 2015 Registration | ||
19:00 – 21:30 | Dinner | ||
Sunday January 25, 2015 | |||
8:45 – 9:00 Conf. Hall |
Giuseppe F. Italiano, General Chair: SOFSEM 2015 Opening Session | ||
9:00 – 10:30 Conf. Hall |
Jan van Leeuwen, Jiří Wiedermann: “What is Computation: An Epistemic Approach” chaired by Giuseppe F. Italiano |
||
10:30 – 11:00 | Coffee Break | ||
11:00 – 12:30 Conf. Hall |
Brian Fitzgerald: Two’s Company, Three’s a Crowd: A Case Study of Crowdsourcing Software Development chaired by Tiziana Margaria-Steffen |
||
12:30 – 13:30 | Lunch Break | ||
15:00 – 16:30 Conf. Hall |
Jared Saia: “Truth, Lies and Random Bits” chaired by Roger Wattenhofer |
||
16:30 – 17:00 | Coffee Break | ||
17:00 – 18:30 Conf. Hall |
Rainer Manthey: Back to the Future – Should SQL surrender to SPARQL? chaired by Jaroslav Pokorný |
||
20:00 – 21:00 Conf. Hall |
SOFSEM 2015 Welcome Dinner | ||
Monday January 26, 2015 | |||
9:00 – 10:30 Conf. Hall |
Magnús M. Halldórsson: Progress (and Lack Thereof) for Graph Coloring Approximation Problems chaired by Jan van Leeuwen |
||
10:30 – 11:00 | Coffee Break | ||
Conference Hall | Room A | Room B | |
11:00 – 11:25 |
Ragnar Nevries and Christian Rosenke: Towards a Characterization of Leaf Powers by Clique Arrangements |
Kei Uchizawa and Eiji Takimoto: Lower Bounds for Linear Decision Trees with Bounded Weights |
Valerio Cosentino, Massimo Tisi and Javier Luis Cánovas Izquierdo: A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs |
11:25 – 11:50 |
Benjamin Momège and Christian Laforest: Nash-Williams and Chvátal Conditions in One-Conflict Graphs |
Ronald de Haan and Stefan Szeider: Machine Characterizations for Parameterized Complexity Classes beyond para-NP |
Florian Himmler: Function Based Requirements Engineering and Design – Towards Efficient and Transparent Plant Engineering |
11:50 – 12:15 |
Alessandro Aloisio and Alfredo Navarra: Balancing Energy Consumption for the Establishment of Multi-Interface Networks |
Marek Chrobak, Leszek Gasieniec, Thomas Gorry and Russell Martin: Group Search on the Line |
Martin Konopka and Mária Bieliková: Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies |
chaired by Magnús M. Halldórsson | chaired by Rusins Freivalds | chaired by Tiziana Margaria-Steffen | |
12:15 – 13:30 | Lunch Break | ||
13:00 – 14:30 Conf. Hall |
Preparations for Student Research Forum (Students only) |
||
14:30 – 15:30 Conf. Hall |
Student Research Forum – Oral Presentations | ||
15:30 – 16:45 Conf. Hall |
Student Research Forum – Poster Presentations with coffee |
||
Tesshu Hanaka and Hirotaka Ono: A Fixed-Parameter Algorithm for Max Edge Domination Valdis Ādamsons, Kārlis Jēriņš, Rihards Krišlauks, Marta Lapiņa, Andris Pakulis and Rusins Freivalds: Advantages of Ultrametric Counter Automata Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa and Ayumi Shinohara: Position Heaps for Permuted Pattern Matching on Multi-Track Strings Maksims Dimitrijevs and Irina Scegulnaja: Ultrametric Automata With One Head versus Multihead Nondeterministic Automata Michal Forisek and Jakub Jančina: Fast Primality Testing for Integers That Fit into a Machine Word Sana Ezouaoui and Olfa Hamdi-Larbi: Design, Analysis and Performance Comparison of Sparse Matrix Product Algorithms Azadeh Alebrahim: Performance Analysis Patterns for Requirements Analysis Maciej Skorski: An Improved Transformation between HILL and Metric Conditional Pseudoentropy Maciej Skorski: Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy Maciej Skorski: Characterizations of Metric Computational Entropy |
|||
Chaired by Roman Špánek | |||
Conference Hall | Room A | Room B | |
16:45 – 17:10 |
Ralf Rothenberger, Sascha Grau and Michael Rossberg: Dominating an s-t-Cut in a Network |
Jérôme Dohrau: Online Makespan Scheduling with Sublinear Advice |
Michal Holub, Ondrej Proksa and Mária Bieliková: Detecting Identical Entities in the Semantic Web Data |
17:10 – 17:35 |
Falk Hüffner, Christian Komusiewicz and Manuel Sorge: Finding Highly Connected Subgraphs |
Armin Fuegenschuh, Konstanty Junosza-Szaniawski, Torsten Klug, Sławomir Kwasiborski and Thomas Schlechte: Fastest, Average and Quantile Schedule |
Martin Labaj and Mária Bieliková: Conducting Web Browsing Study – an Educational Scenario |
17:35 – 18:00 |
Alberto Bertoni, Massimiliano Goldwurm and Jianyi Lin: Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane |
Shahin Kamali and Alejandro Lopez-Ortiz: Efficient Online Strategies for Renting Servers in the Cloud |
Nieves R. Brisaboa, Ana Cerdeira-Pena, Veronica Gil Costa, Mauricio Marin and Oscar Pedreira: Efficient Similarity Search by Combining Indexing and Caching Strategies |
chaired by Piotr Sankowski | chaired by Roger Wattenhofer | chaired by Jaroslav Pokorný | |
18:00 – 18:30 | Coffee Break | ||
Conference Hall | Room A | Room B | |
18:30 – 18:55 |
Michael Bekos, Stephen Kobourov, Michael Kaufmann and Sankar Veeramoni: The Maximum k-Differential Coloring Problem |
Lotte Romijn, Breanndán Ó. Nualláin and Leen Torenvliet: Discovering Motifs in Real-World Social Networks |
Pavel Labath and Joachim Niehren: A Uniform Programming Language for Implementing XML Standards |
18:55 – 19:20 |
Paweł Rzążewski, Konstanty Junosza-Szaniawski and Mathieu Liedloff: Fixing Improper Colorings of Graphs |
Maciej Zielenkiewicz, Jacek Chrząszcz and Aleksy Schubert: Java Loops are Mainly Polynomial |
Andreas Bögl, Michael Karlinger, Michael Schrefl and Gustav Pomberger: Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities |
chaired by Magnús M. Halldórsson | chaired by Tiziana Margaria-Steffen | chaired by Barbara Catania | |
19:20 – 21:00 | Dinner | ||
Tuesday January 27, 2015 | |||
Conference Hall | Room A | Room B | |
9:00 – 9:25 |
Dmitry Kosolobov, Mikhail Rubinchik and Arseny Shur: Palk Is Linear Recognizable Online |
Ashley Farrugia, Leszek Gasieniec, Lukasz Kuszner and Eduardo Pacheco: Deterministic Rendezvous in Restricted Graphs |
Mads Dam, Roberto Guanciale and Hamed Nemati: Trustworthy Virtualization of the ARMv7 Memory Subsystem |
9:25 – 9:50 |
Nelma Moreira, Giovanni Pighizzini and Rogério Reis: Optimal State Reductions of Automata with Partially Specified Behaviors |
Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala and Mohammad Abdul Wahid: Local Routing in Convex Subdivisions |
Máté Horváth: Attribute-Based Encryption Optimized for Cloud Computing |
9:50 – 10:15 |
Rihards Krišlauks and Kaspars Balodis: On the Hierarchy Classes of Finite Ultrametric Automata |
Taisuke Izumi and Hiroaki Ookawa: Filling Logarithmic Gaps in Distributed Complexity for Global Problems |
Maciej Skorski: True Random Numbers Generators Secure in a Changing Environment: Improved Security Bounds |
chaired by Jan van Leeuwen | chaired by Jared Saia | chaired by Giuseppe F. Italiano | |
10:15 – 10:45 | Coffee Break | ||
Conference Hall | Room A | Room B | |
10:45 – 11:10 |
Peter Kostolányi: Two Grammatical Equivalents of Flip-Pushdown Automata |
Ferenc Bujtor, Sascha Fendrich, Gerald Luettgen and Walter Vogler: Nondeterministic Modal Interfaces |
Vladimir Catão, Marcus C. Sampaio and Ulrich Schiel: Retrieving Documents Related to Database Queries |
11:10 – 11:35 |
Masaki Nakanishi: Quantum Pushdown Automata with a Garbage Tape |
Allan van Hulst, Michel Reniers and Wan Fokkink: Maximally Permissive Controlled System Synthesis for Modal Logic |
Seyed Amin Mirlohi Falavarjani and Gholamreza Ghassem-Sani: Advantages of Dependency Parsing for Free Word Order Natural Languages |
11:35 – 12:00 |
Friedrich Otto: On Visibly Pushdown Trace Languages |
Guillaume Blin, Thomas Hume, Macha Nikolski and Hayssam Soueidan: Algorithmic Progress on the Cross-species Conserved Active Modules Detection Problem |
Carlos R. Valencio, Diogo L. Guimaraes, Geraldo F. D. Zafalon and Angelo C. Colombini: OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms Using Ontologies |
chaired by Jiří Wiedermann | chaired by Július Štuller | chaired by Rainer Manthey | |
12:00 – 13:30 | Lunch Break | ||
13:30 – 18:00 | Outdoor Activities | ||
18:45 | Meeting Point by the Hotel Reception | ||
19:00 – 21:00 | SOFSEM 2015 Dinner outside the Hotel | ||
Wednesday January 28, 2015 | |||
9:00 – 10:30 Conf. Hall |
Barbara Catania: Adaptively Approximate Techniques in Distributed Architectures chaired by Rainer Manthey |
||
10:30 – 11:00 | Coffee Break | ||
11:00 – 12:30 Conf. Hall |
Piotr Sankowski: Online Bipartite Matching in Offline Time chaired by Jared Saia |
||
12:30 – 13:30 | Lunch Break | ||
13:30 – 15:45 | Break | ||
15:45 – 16:15 Conf. Hall |
Poster Preparations (Poster presenters only) |
||
16:15 – 17:30 Conf. Hall |
Poster Section with coffee |
||
Antti Kuusisto: Team Semantics and Recursive Enumerability Kristīne Cīpola, Andris Pakulis and Rusins Freivalds: Experiments in complexity of probabilistic and ultrametric automata Ilmārs Pužulis and Rusins Freivalds: Frequency pushdown automata Anete Lāce, Muntis Rudzītis, Ēriks Gopaks and Rusins Freivalds: Superimposed codes and query algorithms Lukáš Aron and Petr Hanáček: Introduction to Android 5 Security George Feuerlicht: Measuring Complexity of Domain Standard Specifications using XML Schema Entropy Anisa Halimi, Ilir Capuni and Dorjan Hitaj: Towards Indestructible Molecular Robots Ondřej Sýkora: Implementing the Aho-Corasick Automata for Phonetic Search |
|||
17:30 – 19:00 Conf. Hall |
Jiří Barnat: Quo Vadis Explicit-State Model Checking chaired by Jiří Wiedermann |
||
19:00 – 19:30 Conf. Hall |
Giuseppe F. Italiano, General Chair: SOFSEM 2015 Closing Session | ||
19:30 – 21:00 | Dinner | ||
Thursday January 29, 2015 | |||
6:00 | Bus 1 leaving from the hotel | ||
9:00 | Bus 2 leaving from the hotel |