31. SOFSEM 2005: Liptovský Ján, Slovakia

Invited Talks

• Hans L. Bodlaender:
  Discovering Treewidth. 1-16
  
• Emmanuel Cecchet:
  From Research Prototypes to Industrial Strength Open Source Products - The ObjectWeb Experience. 17-27
  
• Faith Ellen Fich:
  How Hard Is It to Take a Snapshot?. 28-37
  
• Maurizio Lenzerini:
  Logical Foundations for Data Integration. 38-40
  
• Petra Mutzel:
  Recent Advances in Graph Drawing. 41
  
• Hans-Jörg Schek:
  The Hyperdatabase Network - New Middleware for Searching and Maintaining the Information Space. 42-46
  
• Thomas Seidmann:
  Architecture of a Business Framework for the .NET Platform and Open Source Environments. 47-52
  
• László A. Székely:
  Progress on Crossing Number Problems. 53-61
  

Full Contributed Papers

• Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
  Greedy Differential Approximations for Min Set Cover. 62-71
  
• Anna E. Bobkowska:
  A Methodology of Visual Modeling Language Evaluation. 72-81
  
• Jérémie Chalopin:
  Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. 82-91
  
• Jiu Jun Chen, Ji Gao, Jun Hu, Bei Shui Liao:
  A Hierarchical Markovian Mining Approach for Favorite Navigation Patterns. 92-95
  
• Markus Chimani, Gunnar W. Klau, René Weiskircher:
  Non-planar Orthogonal Drawings with Fixed Topology. 96-105
  
• Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
  A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. 106-116
  
• Walter Didimo:
  Computing Upward Planar Drawings Using Switch-Regularity Heuristics. 117-126
  
• Kayhan Erciyes, Ali Alp, Geoffrey Marshall:
  Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers. 127-136
  
• Henning Fernau:
  Two-Layer Planarization: Improving on Parameterized Algorithmics. 137-146
  
• Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
  On the Stability of Approximation for Hamiltonian Path Problems. 147-156
  
• Hacène Fouchal, Antoine Rollet, Abbas Tarhini:
  Robustness of Composed Timed Systems. 157-166
  
• György Frivolt, Mária Bieliková:
  Topology Generation for Web Communities Modeling. 167-177
  
• Hans Hüttel, Jirí Srba:
  Recursion Versus Replication in Simple Cryptographic Protocols. 178-187
  
• Piotr Habela, Krzysztof Kaczmarski, Hanna Kozankiewicz, Kazimierz Subieta:
  Modeling Data Integration with Updateable Object Views. 188-198
  
• Patrick Healy, Karol Lynch:
  Fixed-Parameter Tractable Algorithms for Testing Upward Planarity. 199-208
  
• Prasad Jayanti, Srdjan Petrovic, Neha Narula:
  Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion. 209-218
  
• Przemyslaw Kazienko, Mariusz Matrejek:
  Adjustment of Indirect Association Rules for the Web. 219-228
  
• Marek Klonowski, Miroslaw Kutylowski, Filip Zagórski:
  Anonymous Communication with On-line and Off-line Onion Encoding. 229-238
  
• Antonín Kucera, Jan Strejcek:
  Characteristic Patterns for LTL. 239-249
  
• Maciej Kurowski:
  Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n). 250-258
  
• Olli Luoma:
  Modeling Nested Relationships in XML Documents Using Relational Databases. 259-268
  
• Hamid Nazerzadeh, Mohammad Ghodsi:
  RAQ: A Range-Queriable Distributed Data Structure. 269-277
  
• Stefan Porschen:
  On Some Weighted Satisfiability and Graph Problems. 278-287
  
• Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade:
  On the Security and Composability of the One Time Pad. 288-297
  
• Daniel Sawitzki:
  Lower Bounds on the OBDD Size of Graphs of Some Popular Functions. 298-309
  
• Robert Steele, William Gardner, Tharam S. Dillon, Abdelkarim Erradi:
  XML-Based Declarative Access Control. 310-319
  
• David Safránek, Jirí Simsa:
  VCD: A Visual Formalism for Specification of Heterogeneous Software Architectures. 320-329
  
• Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno:
  Cost-Constrained Minimum-Delay Multicasting. 330-339
  
• Xuefeng Zhu, Zhi Jin:
  Ontology-Based Inconsistency Management of Software Requirements Specifications. 340-349
  

The Best Student Paper

• Martin Senft:
  Suffix Tree Based Data Compression. 350-359
  

Short Contributed Papers

• Radoslaw Adamus, Kazimierz Subieta:
  Tier Aspect Model Based on Updatable Views. 360-363
  
• Liliana Favre:
  Well-Founded Metamodeling for Model-Driven Architecture. 364-367
  
• Jun Feng, Naoto Mukai, Toyohide Watanabe:
  Stepwise Optimization Method for k-CNN Search for Location-Based Service. 368-371
  
• Roman Filkorn, Pavol Návrat:
  An Approach for Integrating Analysis Patterns and Feature Diagrams into Model Driven Architecture. 372-375
  
• Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto:
  Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. 376-379
  
• Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara:
  Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. 380-384
  
• Marcel Jirina, Marcel Jirina Jr.:
  Feature Selection by Reordering. 385-389
  
• Friedrich Mayer-Lindenberg:
  A Management Scheme for the Basic Types in High Level Languages. 390-393
  
• Ana Cristina Vieira de Melo, Adilson de J. Sanchez:
  Bayesian Networks in Software Maintenance Management. 394-398
  
• Ngoc Thanh Nguyen, Adam Blazowski, Michal Malowiecki:
  A Multiagent System Aiding Information Retrieval in Internet Using Consensus Methods. 399-402
  
• Adam Niewiadomski:
  Interval-Valued Data Structures and Their Application to e-Learning. 403-407
  
• Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina:
  Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. 408-412
  
• Aneta Poniszewska-Maranda, Gilles Goncalves, Fred Hemery:
  Representation of Extended RBAC Model Using UML Language. 413-417
  
• Nele Smeets, Eric Steegmans:
  A Methodology for Writing Class Contracts. 418-422
  
• Lubomir Torok:
  Volumes of 3D Drawings of Homogenous Product Graphs. 423-426