SofSeml2010 Invited Speakers Presentations
Foundations of Computer Science
Principles of Software Construction
Data, Knowledge, and Intelligent Systems
Web Science
SofSeml2010 Speakers Presentations
(Alphabetically Ordered)
- Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi and Michel Reniers:
A Rule Format for Unit Elements
- Antonios Antoniadis and Andrzej Lingas:
Approximability of Edge Matching Puzzles
- Maxim Babenko, Ilya Razenshteyn and Ignat Kolesnichenko:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
- David Bednárek:
R-programs: A framework for Distributing XML Structural Joins across Function Calls
- Hans L. Bodlaender and Marc Comas:
A Kernel for Convex Recoloring of Weighted Forests
- Beate Bollig:
Symbolic OBDD-based reachability analysis needs exponential space
- François Bry and Jakub Kotowski:
A Social Vision of Knowledge Representation and Reasoning
- François Bry and Klara Weiand:
Flavors of KWQL, a Keyword Query Language for a Semantic Wiki
- Silvio Capobianco:
On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl
Pseudo-distances
- Hatem Chatti, Laurent Gourves and Jerome Monnot:
On a Labeled Vehicle Routing Problem
- Pierre Courtieu, Gladys Gbedo and Olivier Pons:
Improved Matrix Interpretation
- Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Wojciech Rytter and Tomasz Walen:
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Piotr Cybula and Kazimierz Subieta:
Query Optimization through Cached Queries for Object-Oriented Query Language SBQL
- Frank de Boer and Immo Grabe:
Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
- David Duris:
Destructive Rule-Based Properties and First Order Logic
- Reza Ebrahimpour, Seyed Zeinolabedin Moussavi and Kambiz Zarei:
Improving Classification Performance with Focus on the Complex Areas
- Alan Eckhardt and Peter Vojtáš:
Learning User Preferences for 2CP-Regression for a Recommender System
- Guy Even and Moti Medina:
Parallel Randomized Load Balancing Algorithms: A Lower Bound for a More General Model
- John Fearnley, Marcin Jurdzinski and Rahul Savani:
Linear Complementarity Algorithms for Infinite Games
- Alain Finkel and Arnaud Sangnier:
Mixing Coverability and Eeachability to Analyze VASS with one Zero-Test
- Jędrzej Fulara and Krzysztof Jakubczyk:
Practically Applicable Formal Methods
- Travis Gagie, Gonzalo Navarro and Yakov Nekrich:
Fast and Compact Prefix Codes
- Robert Ganian and Petr Hliněný:
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
- Giorgio Gnecco and Marcello Sanguineti:
Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their
Approximations
- Inge Li Gørtz and Philip Bille:
Fast Arc-Annotated Subsequence Matching in Linear Space
- Alexander Grigoriev, Bert Marchal and Natalya Usotskaya:
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
- Alexander Grigoriev, Joyce Van Loon and Marc Uetz:
On the Complexity of the Highway Pricing Problem
- David Harel, Hillel Kugler, Shahar Maoz and Itai Segall:
Accelerating Smart Play-Out
- Hovhannes Harutyunyan and Shahin Kamali:
Optimum Broadcasting in Complete Weighted-Vertex Graphs
- Heikki Hyyrö, Kazuyuki Narisawa and Shunsuke Inenaga:
Dynamic Edit Distance Table under a General Weighted Cost Function
- Mikolas Janota, Goetz Botterweck, Radu Grigore and Joao P. Marques-Silva:
How and When to End Interactive Configuration Process?
- Peter Kajsa and Ľubomír Majtás:
Design Patterns Instantiation Based on Semantics and Model Transformations
- Jia Liu and Huimin Lin:
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
- Jun Liu and Mark Roantree:
OTwig: An Optimised Twig Pattern Matching Approach For XML Databases
- Violetta Lonati and Matteo Pradella:
Picture Recognizability with Automata Based on Wang Tiles
- Tamara Mchedlidze and Antonios Symvonis:
Unilateral Orientation of Mixed Graphs
- Patrick Michel and Arnd Poetzsch-Heffter:
Maintaining XML Data Integrity in Programming: An Abstract Datatype Approach
- Friedrich Otto:
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
- Elisa Pappalardo and Simone Faro:
Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String Problem
- Peter Pirkelbauer, Dechev Damian and Bjarne Stroustrup:
Source Code Rejuvenation is not Refactoring
- Günter Pirklbauer:
Empirical Evaluation of Strategies to Detect Logical Change Dependencies
- Jakub Radoszewski and Wojciech Rytter:
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
- Daniel Raible and Henning Fernau:
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
- Michal Smialek, Audris Kalnins, Elina Kalnina, Albert Ambroziewicz, Tomasz Straszak and Katharina Wolter:
Comprehensive System for Systematic Case-Based Model Reuse
- Piotr Stanczyk and Krzysztof Diks:
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) time
- Veronika Vaněková and Peter Vojtáš:
Comparison of Scoring and Order Approach in Description Logic EL(D)
- Ruben van der Zwaan:
Vertex Ranking with Capacity
- Pim van 't Hof, Marcin Kaminski, Daniel Paulusma, Stefan Szeider and Dimitrios Thilikos:
On Contracting Graphs to Fixed Pattern Graphs
- Adrien Vieilleribière and Michel de Rougemont:
Approximate Structural Consistency
- Peter Vojtek and Mária Bieliková:
Homophily of Neigborhood in Graph Relational Classifier
- Danuta Zakrzewska:
Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining
- Harald Zankl, Christian Sternagel, Dieter Hofbauer and Aart Middeldorp:
Finding and Certifying Loops
SofSeml2010 Students Presentations
(Alphabetically Ordered)