Accepted Papers

Foundations of Computer Science

  •   3  Peter Kostolányi:
           Two Grammatical Equivalents of Flip-Pushdown Automata
  •   4  Alberto Bertoni, Massimiliano Goldwurm and Jianyi Lin:
           Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane
  •   5  Paweł Rzążewski, Konstanty Junosza-Szaniawski and Mathieu Liedloff:
           Fixing Improper Colorings of Graphs
  •  22  Ralf Rothenberger, Sascha Grau and Michael Rossberg:
           Dominating an s-t-Cut in a Network
  •  23  Ronald de Haan and Stefan Szeider:
           Machine Characterizations for Parameterized Complexity Classes beyond para-NP
  •  29  Ragnar Nevries and Christian Rosenke:
           Towards a Characterization of Leaf Powers by Clique Arrangements
  •  33  Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala and Mohammad Abdul Wahid:
           Local Routing in Convex Subdivisions
  •  35  Kei Uchizawa and Eiji Takimoto:
           Lower Bounds for Linear Decision Trees with Bounded Weights
  •  36  Tesshu Hanaka and Hirotaka Ono:
           A Fixed-Parameter Algorithm for Max Edge Domination   Student Research Forum 
  •  37  Valdis Ādamsons, Kārlis Jēriņš, Rihards Krišlauks, Marta Lapiņa, Andris Pakulis and Rusins Freivalds:
           Advantages of Ultrametric Counter Automata   Student Research Forum 
  •  39  Friedrich Otto:
           On Visibly Pushdown Trace Languages
  •  42  Falk Hüffner, Christian Komusiewicz and Manuel Sorge:
           Finding Highly Connected Subgraphs
  •  49  Benjamin Momège and Christian Laforest:
           Nash-Williams and Chvátal Conditions in One-Conflict Graphs
  •  59  Masaki Nakanishi:
           Quantum Pushdown Automata with a Garbage Tape
  •  60  Nelma Moreira, Giovanni Pighizzini and Rogério Reis:
           Optimal State Reductions of Automata with Partially Specified Behaviors
  •  62  Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa and Ayumi Shinohara:
           Position Heaps for Permuted Pattern Matching on Multi-Track Strings   Student Research Forum 
  •  66  Armin Fuegenschuh, Konstanty Junosza-Szaniawski, Torsten Klug, Sławomir Kwasiborski and Thomas Schlechte:
           Fastest, Average and Quantile Schedule
  •  68  Ferenc Bujtor, Sascha Fendrich, Gerald Luettgen and Walter Vogler:
           Nondeterministic Modal Interfaces
  •  71  Allan van Hulst, Michel Reniers and Wan Fokkink:
           Maximally Permissive Controlled System Synthesis for Modal Logic
  •  73  Ashley Farrugia, Leszek Gasieniec, Lukasz Kuszner and Eduardo Pacheco:
           Deterministic Rendezvous in Restricted Graphs
  •  82  Guillaume Blin, Thomas Hume, Macha Nikolski and Hayssam Soueidan:
           Algorithmic Progress on the Cross-species Conserved Active Modules Detection Problem
  •  84  Dmitry Kosolobov, Mikhail Rubinchik and Arseny Shur:
           Palk Is Linear Recognizable Online
  •  87  Marek Chrobak, Leszek Gasieniec, Thomas Gorry and Russell Martin:
           Group Search on the Line
  •  92  Maksims Dimitrijevs and Irina Scegulnaja:
           Ultrametric Automata With One Head versus Multihead Nondeterministic Automata   Student Research Forum 
  •  96  Shahin Kamali and Alejandro Lopez-Ortiz:
           Efficient Online Strategies for Renting Servers in the Cloud
  •  98  Rihards Krišlauks and Kaspars Balodis:
           On the Hierarchy Classes of Finite Ultrametric Automata
  • 101  Michal Forisek and Jakub Jančina:
           Fast Primality Testing for Integers That Fit into a Machine Word   Student Research Forum 
  • 107  Taisuke Izumi and Hiroaki Ookawa:
           Filling Logarithmic Gaps in Distributed Complexity for Global Problems
  • 109  Michael Bekos, Stephen Kobourov, Michael Kaufmann and Sankar Veeramoni:
           The Maximum k-Differential Coloring Problem
  • 111  Alessandro Aloisio and Alfredo Navarra:
           Balancing Energy Consumption for the Establishment of Multi-Interface Networks
  • 117  Jérôme Dohrau:
           Online Makespan Scheduling with Sublinear Advice
  • 121  Sana Ezouaoui and Olfa Hamdi-Larbi:
           Design, Analysis and Performance Comparison of Sparse Matrix Product Algorithms   Student Research Forum 

Software & Web Engineering

  •  14  Lotte Romijn, Breanndán Ó. Nualláin and Leen Torenvliet:
           Discovering Motifs in Real-World Social Networks
  •  24  Valerio Cosentino, Massimo Tisi and Javier Luis Cánovas Izquierdo:
           A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs
  •  55  Azadeh Alebrahim:
           Performance Analysis Patterns for Requirements Analysis   Student Research Forum 
  •  77  Florian Himmler:
           Function Based Requirements Engineering and Design – Towards Efficient and Transparent Plant Engineering
  •  99  Martin Konopka and Mária Bieliková:
           Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies

Data, Information and Knowledge Engineering

  •  12  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
  •  16  Nieves R. Brisaboa, Ana Cerdeira-Pena, Veronica Gil Costa, Mauricio Marin and Oscar Pedreira:
           Efficient Similarity Search by Combining Indexing and Caching Strategies
  •  17  Seyed Amin Mirlohi Falavarjani and Gholamreza Ghassem-Sani:
           Advantages of Dependency Parsing for Free Word Order Natural Languages
  •  27  Andreas Bögl, Michael Karlinger, Michael Schrefl and Gustav Pomberger:
           Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities
  •  46  Vladimir Catão, Marcus C. Sampaio and Ulrich Schiel:
           Retrieving Documents Related to Database Queries
  •  57  Michal Holub, Ondrej Proksa and Mária Bieliková:
           Detecting Identical Entities in the Semantic Web Data
  •  83  Pavel Labath and Joachim Niehren:
           A Uniform Programming Language for Implementing XML Standards
  • 102  Martin Labaj and Mária Bieliková:
           Conducting Web Browsing Study – an Educational Scenario

Cryptography, Security, and Verification

  •   2  Maciej Zielenkiewicz, Jacek Chrząszcz and Aleksy Schubert:
           Java Loops are Mainly Polynomial
  •  48  Máté Horváth:
           Attribute-Based Encryption Optimized for Cloud Computing
  •  51  Mads Dam, Roberto Guanciale and Hamed Nemati:
           Trustworthy Virtualization of the ARMv7 Memory Subsystem
  •  53  Maciej Skorski:
           True Random Numbers Generators Secure in a Changing Environment: Improved Security Bounds
  •  54  Maciej Skorski:
           An Improved Transformation between HILL and Metric Conditional Pseudoentropy   Student Research Forum 
  •  94  Maciej Skorski:
           Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy   Student Research Forum 
  • 100  Maciej Skorski:
           Characterizations of Metric Computational Entropy   Student Research Forum 

Poster Section

  •  58  Antti Kuusisto:
           Team Semantics and Recursive Enumerability
  • 122  Kristīne Cīpola, Andris Pakulis and Rusins Freivalds:
           Experiments in complexity of probabilistic and ultrametric automata
  • 123  Ilmārs Pužulis and Rusins Freivalds:
           Frequency pushdown automata
  • 124  Anete Lāce, Muntis Rudzītis, Ēriks Gopaks and Rusins Freivalds:
           Superimposed codes and query algorithms
  • 126  Lukáš Aron and Petr Hanáček:
           Introduction to Android 5 Security
  • 127  George Feuerlicht:
           Measuring Complexity of Domain Standard Specifications using XML Schema Entropy
  • 129  Anisa Halimi, Ilir Capuni and Dorjan Hitaj:
           Towards Indestructible Molecular Robots
  • 130  Ondřej Sýkora:
           Implementing the Aho-Corasick Automata for Phonetic Search
Back to Top