SOFSEM 2005: Theory and Practice of Computer Science

Invited Talks.- Discovering Treewidth.- From Research Prototypes to Industrial Strength Open Source Products - The ObjectWeb Experience.- How Hard Is It to Take a Snapshot?.- Logical Foundations for Data Integration.- Recent Advances in Graph Drawing.- The Hyperdatabase Network - New Middleware for Searching and Maintaining the Information Space.- Architecture of a Business Framework for the .NET Platform and Open Source Environments.- Progress on Crossing Number Problems.- Full Contributed Papers.- Greedy Differential Approximations for Min Set Cover.- A Methodology of Visual Modeling Language Evaluation.- Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem.- A Hierarchical Markovian Mining Approach for Favorite Navigation Patterns.- Non-planar Orthogonal Drawings with Fixed Topology.- A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines.- Computing Upward Planar Drawings Using Switch-Regularity Heuristics.- Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers.- Two-Layer Planarization: Improving on Parameterized Algorithmics.- On the Stability of Approximation for Hamiltonian Path Problems.- Robustness of Composed Timed Systems.- Topology Generation for Web Communities Modeling.- Recursion Versus Replication in Simple Cryptographic Protocols.- Modeling Data Integration with Updateable Object Views.- Fixed-Parameter Tractable Algorithms for Testing Upward Planarity.- Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion.- Adjustment of Indirect Association Rules for the Web.- Anonymous Communication with On-line and Off-line Onion Encoding.- Characteristic Patterns for LTL.- Planar Straight-Line Drawing in an Grid with Angular Resolution (1/n).- Modeling Nested Relationships in XML Documents Using Relational Databases.- RAQ: A Range-Queriable Distributed Data Structure.- On Some Weighted Satisfiability and Graph Problems.- On the Security and Composability of the One