Table of Contents

• Forcing Monotonicity in Parameterized Verification: From Multisets to WordsParosh Aziz Abdulla. 1-15 [doi]
• Research Issues in the Automated Testing of Ajax ApplicationsArie van Deursen, Ali Mesbah. 16-28 [doi]
• Essential Performance Drivers in Native XML DBMSsTheo Härder, Christian Mathis, Sebastian Bächle, Karsten Schmidt 0002, Andreas M. Weiner. 29-46 [doi]
• Continuous Processing of Preference Queries in Data StreamsMaria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos. 47-60 [doi]
• Clock Synchronization: Open Problems in Theory and PracticeChristoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer. 61-70 [doi]
• Regret Minimization and Job SchedulingYishay Mansour. 71-76 [doi]
• Lessons in Software Evolution Learned by Listening to SmalltalkOscar Nierstrasz, Tudor Gîrba. 77-95 [doi]
• The Web of Things: Extending the Web into the Real WorldDave Raggett. 96-107 [doi]
• Web Science: The Digital-Heritage CaseGuus Schreiber. 108-111 [doi]
• Model-Driven Software Product Line Testing: An Integrated Approachandy-schürr, Sebastian Oster, Florian Markert. 112-131 [doi]
• Taming the Complexity of Inductive Logic ProgrammingFilip Zelezný, Ondrej Kuzelka. 132-140 [doi]
• A Rule Format for Unit ElementsLuca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers. 141-152 [doi]
• Approximability of Edge Matching PuzzlesAntonios Antoniadis, Andrzej Lingas. 153-164 [doi]
• A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian NetworksMaxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn. 165-175 [doi]
• R-Programs: A Framework for Distributing XML Structural Joins across Function CallsDavid Bednárek. 176-187 [doi]
• Fast Arc-Annotated Subsequence Matching in Linear SpacePhilip Bille, Inge Li Gørtz. 188-199 [doi]
• Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-GraphsFrank S. de Boer, Immo Grabe. 200-211 [doi]
• A Kernel for Convex Recoloring of Weighted ForestsHans L. Bodlaender, Marc Comas. 212-223 [doi]
• Symbolic OBDD-Based Reachability Analysis Needs Exponential SpaceBeate Bollig. 224-234 [doi]
• A Social Vision of Knowledge Representation and ReasoningFrançois Bry, Jakub Kotowski. 235-246 [doi]
• Flavors of KWQL, a Keyword Query Language for a Semantic WikiFrançois Bry, Klara A. Weiand. 247-258 [doi]
• On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distancesSilvio Capobianco. 259-270 [doi]
• On a Labeled Vehicle Routing ProblemHatem Chatti, Laurent Gourvès, Jérôme Monnot. 271-282 [doi]
• Improved Matrix InterpretationPierre Courtieu, Gladys Gbedo, Olivier Pons. 283-295 [doi]
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix ArraysMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen. 296-307 [doi]
• Query Optimization through Cached Queries for Object-Oriented Query Language SBQLPiotr Cybula, Kazimierz Subieta. 308-320 [doi]
• Perfect Matching for Biconnected Cubic Graphs in ::::O::::(::::n:::: log:::2:::::::n::::) TimeKrzysztof Diks, Piotr Stanczyk. 321-333 [doi]
• Destructive Rule-Based Properties and First-Order LogicDavid Duris. 334-345 [doi]
• Learning User Preferences for 2CP-Regression for a Recommender SystemAlan Eckhardt, Peter Vojtás. 346-357 [doi]
• Parallel Randomized Load Balancing: A Lower Bound for a More General ModelGuy Even, Moti Medina. 358-369 [doi]
• Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String ProblemSimone Faro, Elisa Pappalardo. 370-381 [doi]
• Linear Complementarity Algorithms for Infinite GamesJohn Fearnley, Marcin Jurdzinski, Rahul Savani. 382-393 [doi]
• Mixing Coverability and Reachability to Analyze VASS with One Zero-TestAlain Finkel, Arnaud Sangnier. 394-406 [doi]
• Practically Applicable Formal MethodsJedrzej Fulara, Krzysztof Jakubczyk. 407-418 [doi]
• Fast and Compact Prefix CodesTravis Gagie, Gonzalo Navarro, Yakov Nekrich. 419-427 [doi]
• New Results on the Complexity of Oriented Colouring on Restricted Digraph ClassesRobert Ganian, Petr Hlinený. 428-439 [doi]
• Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their ApproximationsGiorgio Gnecco, Marcello Sanguineti. 440-451 [doi]
• Algorithms for the Minimum Edge Cover of H-Subgraphs of a GraphAlexander Grigoriev, Bert Marchal, Natalya Usotskaya. 452-464 [doi]
• On the Complexity of the Highway Pricing ProblemAlexander Grigoriev, Joyce van Loon, Marc Uetz. 465-476 [doi]
• Accelerating Smart Play-OutDavid Harel, Hillel Kugler, Shahar Maoz, Itai Segall. 477-488 [doi]
• Optimum Broadcasting in Complete Weighted-Vertex GraphsHovhannes A. Harutyunyan, Shahin Kamali. 489-502 [doi]
• On Contracting Graphs to Fixed Pattern GraphsPim van t Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos. 503-514 [doi]
• Dynamic Edit Distance Table under a General Weighted Cost FunctionHeikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga. 515-527 [doi]
• How to Complete an Interactive Configuration Process?Mikolás Janota, Goetz Botterweck, Radu Grigore, João P. Marques Silva. 528-539 [doi]
• Design Patterns Instantiation Based on Semantics and Model TransformationsPeter Kajsa, L ubomír Majtás. 540-551 [doi]
• A Complete Symbolic Bisimulation for Full Applied Pi CalculusJia Liu, Huimin Lin. 552-563 [doi]
• OTwig: An Optimised Twig Pattern Matching Approach for XML DatabasesJun Liu, Mark Roantree. 564-575 [doi]
• Picture Recognizability with Automata Based on Wang TilesVioletta Lonati, Matteo Pradella. 576-587 [doi]
• Unilateral Orientation of Mixed GraphsTamara Mchedlidze, Antonios Symvonis. 588-599 [doi]
• Maintaining XML Data Integrity in ProgramsPatrick Michel, Arnd Poetzsch-Heffter. 600-611 [doi]
• Improving Classification Performance with Focus on the Complex AreasSeyed Zeinolabedin Moussavi, Kambiz Zarei, Reza Ebrahimpour. 612-626 [doi]
• CD-Systems of Restarting Automata Governed by Explicit Enable and Disable ConditionsFriedrich Otto. 627-638 [doi]
• Source Code Rejuvenation Is Not RefactoringPeter Pirkelbauer, Damian Dechev, Bjarne Stroustrup. 639-650 [doi]
• Empirical Evaluation of Strategies to Detect Logical Change DependenciesGuenter Pirklbauer. 651-662 [doi]
• Efficient Testing of Equivalence of Words in a Free Idempotent SemigroupJakub Radoszewski, Wojciech Rytter. 663-671 [doi]
• An Amortized Search Tree Analysis for ::::k::::-Leaf Spanning TreeDaniel Raible, Henning Fernau. 672-684 [doi]
• Approximate Structural ConsistencyMichel de Rougemont, Adrien Vieilleribière. 685-696 [doi]
• Comprehensive System for Systematic Case-Driven Software ReuseMichal Smialek, Audris Kalnins, Elina Kalnina, Albert Ambroziewicz, Tomasz Straszak, Katharina Wolter. 697-708 [doi]
• Comparison of Scoring and Order Approach in Description Logic ::::EL::::(::::D::::)Veronika Vaneková, Peter Vojtás. 709-720 [doi]
• Homophily of Neighborhood in Graph Relational ClassifierPeter Vojtek, Mária Bieliková. 721-730 [doi]
• Multilanguage Debugger ArchitectureJan Vraný, Michal Píse. 731-742 [doi]
• Student Groups Modeling by Integrating Cluster Representation and Association Rules MiningDanuta Zakrzewska. 743-754 [doi]
• Finding and Certifying LoopsHarald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp. 755-766 [doi]
• Vertex Ranking with CapacityRuben van der Zwaan. 767-778 [doi]