Abstract is missing.
- Open Services for Software Process Compliance EngineeringMiklós Biró. 1-6 [doi]
- Towards a Higher-Dimensional String Theory for the Modeling of Computerized SystemsDavid Janin. 7-20 [doi]
- Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract)Rastislav Královic. 21-29 [doi]
- Matching of Images of Non-planar Objects with View SynthesisDmytro Mishkin, Jiri Matas. 30-39 [doi]
- Agile Requirements Engineering: A Research PerspectiveJerzy R. Nawrocki, Miroslaw Ochodek, Jakub Jurkiewicz, Sylwia Kopczynska, Bartosz Alchimowicz. 40-51 [doi]
- Fitting Planar Graphs on Planar MapsMd. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze. 52-64 [doi]
- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded TreewidthHasna Mohsen Alqahtani, Thomas Erlebach. 65-76 [doi]
- Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree ProblemKfir Barhum. 77-88 [doi]
- On the Power of Advice and Randomization for the Disjoint Path Allocation ProblemKfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen. 89-101 [doi]
- Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001Kristian Beckers. 102-113 [doi]
- ProofBook: An Online Social Network Based on Proof-of-Work and Friend-PropagationSebastian Biedermann, Nikolaos P. Karvelas, Stefan Katzenbeisser, Thorsten Strufe, Andreas Peter. 114-125 [doi]
- Platform Independent Software Development Monitoring: Design of an ArchitectureMária Bieliková, Ivan Polásek, Michal Barla, Eduard Kuric, Karol Rástocný, Jozef Tvarozek, Peter Lacko. 126-137 [doi]
- Towards Unlocking the Full Potential of Multileaf CollimatorsGuillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette. 138-149 [doi]
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal GraphsMarin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. 150-161 [doi]
- Error-Pruning in Interface AutomataFerenc Bujtor, Walter Vogler. 162-173 [doi]
- Aspect-Driven Design of Information SystemsKarel Cemus, Tomás Cerný. 174-186 [doi]
- Exact Algorithms to Clique-Colour GraphsManfred Cochefert, Dieter Kratsch. 187-198 [doi]
- Supporting Non-functional Requirements in Services Software Development Process: An MDD ApproachValeria de Castro, Martin A. Musicante, Umberto Souza da Costa, Plácido A. Souza Neto, Genoveva Vargas-Solar. 199-210 [doi]
- Safety Contracts for Timed Reactive Components in SysMLIulia Dragomir, Iulian Ober, Christian Percebois. 211-222 [doi]
- Graph Clustering with Surprise: Complexity and Exact SolutionsTobias Fleck, Andrea Kappes, Dorothea Wagner. 223-234 [doi]
- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract)Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari. 235-245 [doi]
- Active Learning of Recursive Functions by Ultrametric AlgorithmsRusins Freivalds, Thomas Zeugmann. 246-257 [doi]
- Efficient Error-Correcting Codes for Sliding WindowsRan Gelles, Rafail Ostrovsky, Alan Roytman. 258-268 [doi]
- Integrating UML Composite Structures and fUMLAlessandro Gerlinger Romero, Klaus Schneider, Maurício Gonçalves Vieira Ferreira. 269-280 [doi]
- Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision ProcessesHugo Gimbert, Youssouf Oualhadj. 281-292 [doi]
- Bidimensionality of Geometric Intersection GraphsAlexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. 293-305 [doi]
- Attack against a Pairing Based Anonymous Authentication ProtocolLucjan Hanzlik, Kamil Kluczniak. 306-314 [doi]
- Finding Disjoint Paths in Split GraphsPinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei. 315-326 [doi]
- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip PackingKlaus Jansen, Lars Prädel. 327-338 [doi]
- A Stronger Square Conjecture on Binary WordsNatasa Jonoska, Florin Manea, Shinnosuke Seki. 339-350 [doi]
- DSL Based Platform for Business Process ManagementAudris Kalnins, Lelde Lace, Elina Kalnina, Agris Sostaks. 351-362 [doi]
- Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance ConstraintsTomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara. 363-374 [doi]
- Deterministic Verification of Integer Matrix Multiplication in Quadratic TimeIvan Korec, Jirí Wiedermann. 375-382 [doi]
- Comparison of Genetic Algorithms for Trading StrategiesPetr Kroha, Matthias Friedrich. 383-394 [doi]
- Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated MappingLukasz Krzywiecki, Przemyslaw Kubiak, Miroslaw Kutylowski. 395-406 [doi]
- An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent AgentsKaterina Ksystra, Petros S. Stefaneas, Panayiotis Frangos. 407-418 [doi]
- Parameterized Prefix Distance between Regular LanguagesMartin Kutrib, Katja Meckel, Matthias Wendlandt. 419-430 [doi]
- Ordered Restarting Automata for Picture LanguagesFrantisek Mráz, Friedrich Otto. 431-442 [doi]
- Unary NFAs with Limited NondeterminismAlexandros Palioudakis, Kai Salomaa, Selim G. Akl. 443-454 [doi]
- Recommending for Disloyal Customers with Low Consumption RateLadislav Peska, Peter Vojtás. 455-465 [doi]
- Security Constraints in Modeling of Access Control Rules for Dynamic Information SystemsAneta Poniszewska-Maranda. 466-477 [doi]
- A New Plane-Sweep Algorithm for the K-Closest-Pairs QueryGeorge Roumelis, Michael Vassilakopoulos, Antonio Corral, Yannis Manolopoulos. 478-490 [doi]
- Mastering Erosion of Software Architecture in Automotive Software Product LinesArthur Strasser, Benjamin Cool, Christoph Gernert, Christoph Knieke, Marco Körner, Dirk Niebuhr, Henrik Peters, Andreas Rausch, Oliver Brox, Stefanie Jauns-Seyfried, Hanno Jelden, Stefan Klie, Michael Krämer. 491-502 [doi]
- Shortest Unique Substrings Queries in Optimal TimeKazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 503-513 [doi]
- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free LanguagesTomoyuki Yamakami. 514-525 [doi]