Abstract is missing.
- Discovering TreewidthHans Leo Bodlaender. 1-16 [doi]
- From Research Prototypes to Industrial Strength Open Source Products - The ObjectWeb ExperienceEmmanuel Cecchet. 17-27 [doi]
- How Hard Is It to Take a Snapshot?Faith Ellen Fich. 28-37 [doi]
- Logical Foundations for Data IntegrationMaurizio Lenzerini. 38-40 [doi]
- Recent Advances in Graph DrawingPetra Mutzel. 41 [doi]
- The Hyperdatabase Network - New Middleware for Searching and Maintaining the Information SpaceHans-Jörg Schek. 42-46 [doi]
- Architecture of a Business Framework for the .NET Platform and Open Source EnvironmentsThomas Seidmann. 47-52 [doi]
- Progress on Crossing Number ProblemsLászló A. Székely. 53-61 [doi]
- Greedy Differential Approximations for Min Set CoverCristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière. 62-71 [doi]
- A Methodology of Visual Modeling Language EvaluationAnna E. Bobkowska. 72-81 [doi]
- Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming ProblemJérémie Chalopin. 82-91 [doi]
- A Hierarchical Markovian Mining Approach for Favorite Navigation PatternsJiu Jun Chen, Ji Gao, Jun Hu, Bei Shui Liao. 92-95 [doi]
- Non-planar Orthogonal Drawings with Fixed TopologyMarkus Chimani, Gunnar W. Klau, René Weiskircher. 96-105 [doi]
- A Topology-Driven Approach to the Design of Web Meta-search Clustering EnginesEmilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta. 106-116 [doi]
- Computing Upward Planar Drawings Using Switch-Regularity HeuristicsWalter Didimo. 117-126 [doi]
- Serial and Parallel Multilevel Graph Partitioning Using Fixed CentersKayhan Erciyes, Ali Alp, Geoffrey Marshall. 127-136 [doi]
- Two-Layer Planarization: Improving on Parameterized AlgorithmicsHenning Fernau. 137-146 [doi]
- On the Stability of Approximation for Hamiltonian Path ProblemsLuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert. 147-156 [doi]
- Robustness of Composed Timed SystemsHacène Fouchal, Antoine Rollet, Abbas Tarhini. 157-166 [doi]
- Topology Generation for Web Communities ModelingGyörgy Frivolt, Mária Bieliková. 167-177 [doi]
- Recursion Versus Replication in Simple Cryptographic ProtocolsHans Hüttel, Jirí Srba. 178-187 [doi]
- Modeling Data Integration with Updateable Object ViewsPiotr Habela, Krzysztof Kaczmarski, Hanna Kozankiewicz, Kazimierz Subieta. 188-198 [doi]
- Fixed-Parameter Tractable Algorithms for Testing Upward PlanarityPatrick Healy, Karol Lynch. 199-208 [doi]
- Read/Write Based Fast-Path Transformation for FCFS Mutual ExclusionPrasad Jayanti, Srdjan Petrovic, Neha Narula. 209-218 [doi]
- Adjustment of Indirect Association Rules for the WebPrzemyslaw Kazienko, Mariusz Matrejek. 219-228 [doi]
- Anonymous Communication with On-line and Off-line Onion EncodingMarek Klonowski, Miroslaw Kutylowski, Filip Zagórski. 229-238 [doi]
- Characteristic Patterns for LTLAntonín Kucera, Jan Strejcek. 239-249 [doi]
- Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n)Maciej Kurowski. 250-258 [doi]
- Modeling Nested Relationships in XML Documents Using Relational DatabasesOlli Luoma. 259-268 [doi]
- RAQ: A Range-Queriable Distributed Data StructureHamid Nazerzadeh, Mohammad Ghodsi. 269-277 [doi]
- On Some Weighted Satisfiability and Graph ProblemsStefan Porschen. 278-287 [doi]
- On the Security and Composability of the One Time PadDominik Raub, Rainer Steinwandt, Jörn Müller-Quade. 288-297 [doi]
- Lower Bounds on the OBDD Size of Graphs of Some Popular FunctionsDaniel Sawitzki. 298-309 [doi]
- XML-Based Declarative Access ControlRobert Steele, William Gardner, Tharam S. Dillon, Abdelkarim Erradi. 310-319 [doi]
- VCD: A Visual Formalism for Specification of Heterogeneous Software ArchitecturesDavid Safránek, Jirí Simsa. 320-329 [doi]
- Cost-Constrained Minimum-Delay MulticastingSatoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno. 330-339 [doi]
- Ontology-Based Inconsistency Management of Software Requirements SpecificationsXuefeng Zhu, Zhi Jin. 340-349 [doi]
- Suffix Tree Based Data CompressionMartin Senft. 350-359 [doi]
- Tier Aspect Model Based on Updatable ViewsRadoslaw Adamus, Kazimierz Subieta. 360-363 [doi]
- Well-Founded Metamodeling for Model-Driven ArchitectureLiliana Favre. 364-367 [doi]
- Stepwise Optimization Method for k-CNN Search for Location-Based ServiceJun Feng, Naoto Mukai, Toyohide Watanabe. 368-371 [doi]
- An Approach for Integrating Analysis Patterns and Feature Diagrams into Model Driven ArchitectureRoman Filkorn, Pavol Návrat. 372-375 [doi]
- Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite GraphsRadoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto. 376-379 [doi]
- Fast Bit-Vector Algorithms for Approximate String Matching Under Indel DistanceHeikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara. 380-384 [doi]
- Feature Selection by ReorderingMarcel Jirina, Marcel Jirina Jr.. 385-389 [doi]
- A Management Scheme for the Basic Types in High Level LanguagesFriedrich Mayer-Lindenberg. 390-393 [doi]
- Bayesian Networks in Software Maintenance ManagementAna Cristina Vieira de Melo, Adilson de J. Sanchez. 394-398 [doi]
- A Multiagent System Aiding Information Retrieval in Internet Using Consensus MethodsNgoc Thanh Nguyen, Adam Blazowski, Michal Malowiecki. 399-402 [doi]
- Interval-Valued Data Structures and Their Application to e-LearningAdam Niewiadomski. 403-407 [doi]
- Boolean Functions with a Low Polynomial Degree and Quantum Query AlgorithmsRaitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina. 408-412 [doi]
- Representation of Extended RBAC Model Using UML LanguageAneta Poniszewska-Maranda, Gilles Goncalves, Fred Hemery. 413-417 [doi]
- A Methodology for Writing Class ContractsNele Smeets, Eric Steegmans. 418-422 [doi]
- Volumes of 3D Drawings of Homogenous Product GraphsLubomir Torok. 423-426 [doi]