36. SOFSEM 2010: Spindleruv Mlýn, Czech Republic

Invited Talks

• Parosh Aziz Abdulla:
  Forcing Monotonicity in Parameterized Verification: From Multisets to Words. 1-15
  
• Arie van Deursen, Ali Mesbah:
  Research Issues in the Automated Testing of Ajax Applications. 16-28
  
• Theo Härder, Christian Mathis, Sebastian Bächle, Karsten Schmidt, Andreas M. Weiner:
  Essential Performance Drivers in Native XML DBMSs. 29-46
  
• Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos:
  Continuous Processing of Preference Queries in Data Streams. 47-60
  
• Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer:
  Clock Synchronization: Open Problems in Theory and Practice. 61-70
  
• Yishay Mansour:
  Regret Minimization and Job Scheduling. 71-76
  
• Oscar Nierstrasz, Tudor Gîrba:
  Lessons in Software Evolution Learned by Listening to Smalltalk. 77-95
  
• Dave Raggett:
  The Web of Things: Extending the Web into the Real World. 96-107
  
• Guus Schreiber:
  Web Science: The Digital-Heritage Case. 108-111
  
• Andy Schürr, Sebastian Oster, Florian Markert:
  Model-Driven Software Product Line Testing: An Integrated Approach. 112-131
  
• Filip Zelezný, Ondrej Kuzelka:
  Taming the Complexity of Inductive Logic Programming. 132-140
  

Regular Papers

• Luca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers:
  A Rule Format for Unit Elements. 141-152
  
• Antonios Antoniadis, Andrzej Lingas:
  Approximability of Edge Matching Puzzles. 153-164
  
• Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
  A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. 165-175
  
• David Bednárek:
  R-Programs: A Framework for Distributing XML Structural Joins across Function Calls. 176-187
  
• Philip Bille, Inge Li Gørtz:
  Fast Arc-Annotated Subsequence Matching in Linear Space. 188-199
  
• Frank S. de Boer, Immo Grabe:
  Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs. 200-211
  
• Hans L. Bodlaender, Marc Comas:
  A Kernel for Convex Recoloring of Weighted Forests. 212-223
  
• Beate Bollig:
  Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. 224-234
  
• François Bry, Jakub Kotowski:
  A Social Vision of Knowledge Representation and Reasoning. 235-246
  
• François Bry, Klara A. Weiand:
  Flavors of KWQL, a Keyword Query Language for a Semantic Wiki. 247-258
  
• Silvio Capobianco:
  On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances. 259-270
  
• Hatem Chatti, Laurent Gourvès, Jérôme Monnot:
  On a Labeled Vehicle Routing Problem. 271-282
  
• Pierre Courtieu, Gladys Gbedo, Olivier Pons:
  Improved Matrix Interpretation. 283-295
  
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
  Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. 296-307
  
• Piotr Cybula, Kazimierz Subieta:
  Query Optimization through Cached Queries for Object-Oriented Query Language SBQL. 308-320
  
• Krzysztof Diks, Piotr Stanczyk:
  Perfect Matching for Biconnected Cubic Graphs in O(n log²n) Time. 321-333
  
• David Duris:
  Destructive Rule-Based Properties and First-Order Logic. 334-345
  
• Alan Eckhardt, Peter Vojtás:
  Learning User Preferences for 2CP-Regression for a Recommender System. 346-357
  
• Guy Even, Moti Medina:
  Parallel Randomized Load Balancing: A Lower Bound for a More General Model. 358-369
  
• Simone Faro, Elisa Pappalardo:
  Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. 370-381
  
• John Fearnley, Marcin Jurdzinski, Rahul Savani:
  Linear Complementarity Algorithms for Infinite Games. 382-393
  
• Alain Finkel, Arnaud Sangnier:
  Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. 394-406
  
• Jedrzej Fulara, Krzysztof Jakubczyk:
  Practically Applicable Formal Methods. 407-418
  
• Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
  Fast and Compact Prefix Codes. 419-427
  
• Robert Ganian, Petr Hlinený:
  New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. 428-439
  
• Giorgio Gnecco, Marcello Sanguineti:
  Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations. 440-451
  
• Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
  Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. 452-464
  
• Alexander Grigoriev, Joyce van Loon, Marc Uetz:
  On the Complexity of the Highway Pricing Problem. 465-476
  
• David Harel, Hillel Kugler, Shahar Maoz, Itai Segall:
  Accelerating Smart Play-Out. 477-488
  
• Hovhannes A. Harutyunyan, Shahin Kamali:
  Optimum Broadcasting in Complete Weighted-Vertex Graphs. 489-502
  
• Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
  On Contracting Graphs to Fixed Pattern Graphs. 503-514
  
• Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
  Dynamic Edit Distance Table under a General Weighted Cost Function. 515-527
  
• Mikolás Janota, Goetz Botterweck, Radu Grigore, João P. Marques Silva:
  How to Complete an Interactive Configuration Process? 528-539
  
• Peter Kajsa, L'ubomír Majtás:
  Design Patterns Instantiation Based on Semantics and Model Transformations. 540-551
  
• Jia Liu, Huimin Lin:
  A Complete Symbolic Bisimulation for Full Applied Pi Calculus. 552-563
  
• Jun Liu, Mark Roantree:
  OTwig: An Optimised Twig Pattern Matching Approach for XML Databases. 564-575
  
• Violetta Lonati, Matteo Pradella:
  Picture Recognizability with Automata Based on Wang Tiles. 576-587
  
• Tamara Mchedlidze, Antonios Symvonis:
  Unilateral Orientation of Mixed Graphs. 588-599
  
• Patrick Michel, Arnd Poetzsch-Heffter:
  Maintaining XML Data Integrity in Programs. 600-611
  
• Seyed Zeinolabedin Moussavi, Kambiz Zarei, Reza Ebrahimpour:
  Improving Classification Performance with Focus on the Complex Areas. 612-626
  
• Friedrich Otto:
  CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. 627-638
  
• Peter Pirkelbauer, Damian Dechev, Bjarne Stroustrup:
  Source Code Rejuvenation Is Not Refactoring. 639-650
  
• Guenter Pirklbauer:
  Empirical Evaluation of Strategies to Detect Logical Change Dependencies. 651-662
  
• Jakub Radoszewski, Wojciech Rytter:
  Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. 663-671
  
• Daniel Raible, Henning Fernau:
  An Amortized Search Tree Analysis for k-Leaf Spanning Tree. 672-684
  
• Michel de Rougemont, Adrien Vieilleribière:
  Approximate Structural Consistency. 685-696
  
• Michal Smialek, Audris Kalnins, Elina Kalnina, Albert Ambroziewicz, Tomasz Straszak, Katharina Wolter:
  Comprehensive System for Systematic Case-Driven Software Reuse. 697-708
  
• Veronika Vaneková, Peter Vojtás:
  Comparison of Scoring and Order Approach in Description Logic EL(D). 709-720
  
• Peter Vojtek, Mária Bieliková:
  Homophily of Neighborhood in Graph Relational Classifier. 721-730
  
• Jan Vraný, Michal Píse:
  Multilanguage Debugger Architecture. 731-742
  
• Danuta Zakrzewska:
  Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining. 743-754
  
• Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp:
  Finding and Certifying Loops. 755-766
  
• Ruben van der Zwaan:
  Vertex Ranking with Capacity. 767-778
  

Last update Wed Feb 15 05:18:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page