| 5 | Klaus Jansen: |
| | A Fast Approximation Scheme for the Multiple Knapsack Problem |
| 9 | Jiří Šíma and Stanislav Žák: |
| | A Sufficient Condition for Sets Hitting the Class for Read-Once Branching Programs of Width 3 |
| 14 | Panagiotis Cheilaris, Balázs Keszegh and Dömötör Pálvölgyi: |
| | Unique-maximum and Conflict-free Coloring for Hypergraphs and Trees |
| 16 | Peter Damaschke and Azam Sheikh Muhammad: |
| | Randomized Group Testing Both Query-Optimal And Minimal Adaptive |
| 17 | Johannes Ebbing and Peter Lohmann: |
| | Complexity of Model Checking for Modal Dependence Logic |
| 24 | Anna Gál and Jing-Tang Jang: |
| | A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators |
| 41 | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi and Florian Sikora: |
| | Complexity Insights of the Minimum Duplication Problem |
| 43 | Jean-François Couturier, Pinar Heggernes, Pim Van 'T Hof and Dieter Kratsch: |
| | Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration |
| 44 | Jun Yan: |
| | Complete Problem for Perfect Zero-Knowledge Quantum Proof |
| 45 | Ilir Çapuni and Gács Péter: |
| | A Turing Machine Resisting Isolated Bursts of Faults |
| 50 | Lila Kari, Steffen Kopecki and Shinnosuke Seki: |
| | Iterated Hairpin Completions of Non-crossing Words |
| 54 | Emmanuel Filiot and Frédéric Servais: |
| | Visibly Pushdown Transducers with Look-Ahead |
| 56 | Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez and Anna Ingólfsdóttir: |
| | The Equational Theory of Weak Complete Simulation Semantics over BCCSP |
| 60 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda: |
| | Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts |
| 66 | Turlough Neary and Damien Woods: |
| | The Complexity of Small Universal Turing Machines: A Survey |
| 73 | Maciej Gazda and Tim A. C. Willemse: |
| | Consistent Consequence for Boolean Equation Systems |
| 74 | Sacha Krug: |
| | On the Approximation Ratio of the Path Matching Christofides Algorithm |
| 81 | Giovanna Janet Lavado and Giovanni Pighizzini: |
| | Parikh's Theorem and Descriptional Complexity |
| 93 | Chenyi Zhang and Jun Pang: |
| | An Algorithm for Probabilistic Alternating Simulation |
| 98 | Ondrej Čepek, Petr Kučera and Václav Vlček: |
| | Properties of SLUR Formulae |
| 122 | Ömer Eǧecioǧlu, Oscar Ibarra and Nicholas Tran: |
| | Multitape NFA: Weak Synchronization of the Input Heads |
| 123 | Petr Golovach, Daniel Paulusma and Jian Song: |
| | 4-Coloring H-Free Graphs When H Is Small |
| 130 | Andrzej Lingas and Dzmitry Sledneu: |
| | A Combinatorial Algorithm for All-pairs Shortest Paths in Directed Vertex-weighted Graphs with Applications to Disc Graphs |
| 138 | Konstanty Junosza-Szaniawski and Michał Tuczyński: |
| | Counting Maximal Independent Sets in Subcubic Graphs. |
| 22 | Peter Kajsa and Pavol Návrat: |
| | Design Pattern Support Based on Source Code Annotations and Feature Models |
| 25 | Martin Jačala and Jozef Tvarožek: |
| | Named Entity Disambiguation Based on Explicit Semantics |
| 37 | Tomáš Černý, Slávka Jaroměřská, Petr Praus, Luboš Matl and Michael J. Donahoo: |
| | Towards a Smart, Self-scaling Cooperative Web Cache |
| 59 | Elina Kalnina, Audris Kalnins, Agris Sostaks, Edgars Celms and Janis Iraids: |
| | Tree Based Domain-Specific Mapping Languages |
| 89 | Dries Vanoverberghe, Jonathan de Halleux, Nikolai Tillmann and Frank Piessens: |
| | State Coverage: Software Validation Metrics beyond Code Coverage |
| 112 | Tomáš Majer and Marián Šimko: |
| | Leveraging Microblogs for Resource Ranking |
| 124 | Jaroslav Škrabálek, Petr Kunc and Tomáš Pitner: |
| | Inner Architecture of a Social Networking System |
| 127 | Prabhu Shankar Kaliappan and Hartmut König: |
| | On the Formalization of UML Activities for Component-Based Protocol Design Specifications |
| 135 | Tadeusz Kobus and Paweł T. Wojciechowski: |
| | RESTGroups for Resilient Web Services |
| 7 | Jacek Mańdziuk and Maciej Świechowski: |
| | Generic Heuristic Approach to General Game Playing |
| 12 | Jiří Iša, Zuzana Reitermanová and Ondřej Sýkora: |
| | Cost-sensitive Classification with Unconstrained Influence Diagrams |
| 20 | Petr Jarušek and Radek Pelánek: |
| | Modeling and Predicting Students Problem Solving Times |
| 102 | Iulia Nica and Franz Wotawa: |
| | The SiMoL: Modeling Language for Simulation and (Re-)Configuration |
| 111 | Roman Barták, Con Sheahan and Ann Sheahan: |
| | MAK€ – A System for Modeling, Optimizing, and Analyzing Production in Small and Medium Enterprises |
| 126 | Lucas Bordeaux and Joao Marques-Silva: |
| | Knowledge Compilation with Empowerment |
| 4 | Martin Lackner, Reinhard Pichler, Stefan Rümmele and Stefan Woltran: |
| | Multicut on Graphs of Bounded Clique-width (Withdrawn) |
| 15 | Fuyuan Zhang, Flemming Nielson and Hanne Riis Nielson: |
| | Fixpoints vs. Moore Families |
| 18 | Robert Ganian: |
| | Using Neighborhood Diversity to Solve Hard Problems |
| 49 | Michalis Christou, Maxime Crochemore and Costas Iliopoulos: |
| | Quasiperiodicities in Fibonacci Strings |
| 65 | Marina I. Maslennikova: |
| | Reset Complexity of Ideal Languages |
| 82 | Daniel Reidenbach and Markus Schmid: |
| | Automata with Modulo Counters and Nondeterministic Counter Bounds (Withdrawn) |
| 88 | Kaspars Balodis, Anda Berina, Gleb Borovitsky, Rusins Freivalds, Ginta Garkaje, Vladimirs Kacs, Jānis Kalējs, Ilja Kucevalovs, Janis Rocans and Madars Virza: |
| | Probabilistic and Frequency Finite-State Transducers |
