Table of Contents

• Graphs from Search Engine QueriesRicardo A. Baeza-Yates. 1-8 [doi]
• Model-Checking Large Finite-State Systems and BeyondLubos Brim, Mojmír Kretínský. 9-28 [doi]
• Interaction and RealizabilityManfred Broy. 29-50 [doi]
• A Short Introduction to Computational Social ChoiceYann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet. 51-69 [doi]
• Distributed Models and Algorithms for Mobile Robot SystemsAsaf Efrima, David Peleg. 70-87 [doi]
• Point-to-Point Shortest Path Algorithms with PreprocessingAndrew V. Goldberg. 88-102 [doi]
• Games, Time, and Probability: Graph Models for System Design and AnalysisThomas A. Henzinger. 103-110 [doi]
• Agreement TechnologiesNicholas R. Jennings. 111-113 [doi]
• Automatic Testing of Object-Oriented SoftwareBertrand Meyer, Ilinca Ciupa, Andreas Leitner, Lisa Ling Liu. 114-129 [doi]
• Architecture-Based Reasoning About Performability in Component-Based SystemsHeinz W. Schmidt. 130-137 [doi]
• Multimedia Retrieval AlgorithmicsRemco C. Veltkamp. 138-154 [doi]
• Size of Quantum Finite State TransducersRuben Agadzanyan, Rusins Freivalds. 155-163 [doi]
• Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on CyclesYuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta. 164-175 [doi]
• Straightening Drawings of Clustered Hierarchical GraphsSergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang. 176-187 [doi]
• Improved Upper Bounds for ::::lambda:::: -Backbone Colorings Along Matchings and StarsHajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman. 188-199 [doi]
• About the Termination Detection in the Asynchronous Message Passing ModelJérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel. 200-211 [doi]
• Fast Approximate Point Set Matching for Information RetrievalRaphaël Clifford, Benjamin Sach. 212-223 [doi]
• A Software Architecture for Shared Resource Management in Mobile Ad Hoc NetworksOrhan Dagdeviren, Kayhan Erciyes. 224-234 [doi]
• Compressed Prefix SumsO Neil Delpratt, Naila Rahman, Rajeev Raman. 235-247 [doi]
• On Optimal Solutions for the Bottleneck Tower of Hanoi ProblemYefim Dinitz, Shay Solomon. 248-259 [doi]
• Competitive Maintenance of Minimum Spanning Trees in Dynamic GraphsMiroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski. 260-271 [doi]
• Exact Max 2-Sat: Easier and FasterMartin Fürer, Shiva Prasad Kasiviswanathan. 272-283 [doi]
• Maximum Finding in the Symmetric Radio Networks with Collision DetectionFrantisek Galcík, Gabriel Semanisin. 284-294 [doi]
• An Approach to Modelling and Verification of Component Based SystemsGregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis. 295-308 [doi]
• Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point LanguagesMika Hirvensalo. 309-319 [doi]
• On the (High) Undecidability of Distributed Synthesis ProblemsDavid Janin. 320-329 [doi]
• Maximum Rigid Components as Means for Direction-Based Localization in Sensor NetworksBastian Katz, Marco Gaertler, Dorothea Wagner. 330-341 [doi]
• Online Service Management Algorithm for Cellular/WALN Multimedia NetworksSungwook Kim, Sungchun Kim. 342-346 [doi]
• A Simple Algorithm for Stable Minimum Storage MergingPok-Son Kim, Arne Kutzner. 347-356 [doi]
• Generating High Dimensional Data and Query SetsSang-Wook Kim, Seok-Ho Yoon, Sang-Cheol Lee, Junghoon Lee, Miyoung Shin. 357-366 [doi]
• Partial vs. Complete Domination: t-Dominating SetJoachim Kneis, Daniel Mölle, Peter Rossmanith. 367-376 [doi]
• Estimates of Data Complexity in Neural-Network LearningVera Kurková. 377-387 [doi]
• Concurrent and Located Synchronizations in ::::pi::::-CalculusIvan Lanese. 388-399 [doi]
• Efficient Group Key Agreement for Dynamic TETRA NetworksSu-Mi Lee, Su Youn Lee, Dong-Hoon Lee. 400-409 [doi]
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless NetworksMarkus Maier, Steffen Mecke, Dorothea Wagner. 410-421 [doi]
• The P::k:: Partition Problem and Related Problems in Bipartite GraphsJérôme Monnot, Sophie Toulouse. 422-433 [doi]
• Spatial Selection of Sparse Pivots for Similarity Search in Metric SpacesOscar Pedreira, Nieves R. Brisaboa. 434-445 [doi]
• A Model of an Amorphous Computer and Its Communication ProtocolLukás Petru, Jirí Wiedermann. 446-455 [doi]
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack ProblemsDominique Quadri, Éric Soutif, Pierre Tolla. 456-464 [doi]
• Indexing Factors with GapsM. Sohel Rahman, Costas S. Iliopoulos. 465-474 [doi]
• Information EfficiencyJoel Ratsaby. 475-487 [doi]
• Deterministic Simulation of a NFA with ::::k:::: -Symbol LookaheadBala Ravikumar, Nicolae Santean. 488-497 [doi]
• Mobility Management Using Virtual Domain in IPv6-Based Cellular NetworksJae-Kwon Seo, Kyung-Geun Lee. 498-509 [doi]
• Restarting Tree AutomataHeiko Stamer, Friedrich Otto. 510-521 [doi]
• A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3Jirí Síma, Stanislav Zák. 522-531 [doi]
• Formal Translation Directed by Parallel ::::LLP:::: ParsingLadislav Vagner, Borivoj Melichar. 532-543 [doi]
• Self-adaptive Lagrange Relaxation Algorithm for Aggregated MulticastHua Wang, Zuquan Ge, Jun Ma. 544-553 [doi]
• A Language for Reliable Service CompositionQingjun Xiao, Ruonan Rao, Jinyuan You. 554-565 [doi]
• Operational Semantics of Framed Temporal Logic ProgramsXiaoxiao Yang, Zhenhua Duan. 566-578 [doi]
• Constraints for Argument FilteringsHarald Zankl, Nao Hirokawa, Aart Middeldorp. 579-590 [doi]
• Performance Analysis of a Multiagent Architecture for Passenger TransportationClaudio Cubillos, Franco Guidi-Polanco, Ricardo Soto. 591-600 [doi]
• Teacher-Directed Learning with Mixture of Experts for View-Independent Face RecognitionReza Ebrahimpour, Ehsanollah Kabir, Mohammad Reza Yousefi. 601-611 [doi]
• FTTH-Enhanced Mini-System ::::m :::: TBCP-Based Overlay Construction and EvaluationMi-young Kang, Omar F. Hamad, Choung-Ung Pom, Ji-Seung Nam. 612-623 [doi]
• On Efficient Resource Allocation in Communication NetworksMichal Karpowicz, Krzysztof Malinowski. 624-635 [doi]
• Protecting Agent from Attack in Grid Computing:::III:::Byungryong Kim. 636-643 [doi]
• Incremental Learning of Planning Operators in Stochastic DomainsJavad Safaei, Gholamreza Ghassem-Sani. 644-655 [doi]
• Competitive Contract Net ProtocolJirí Vokrínek, Jirí Bíba, Jirí Hodík, Jaromír Vybíhal, Michal Pechoucek. 656-668 [doi]
• Agent Oriented Methodology Construction and Customization with HDAXue Xiao, Zeng Zhifeng, Cui Ying. 669-681 [doi]
• Building an Ontological Base for Experimental Evaluation of Semantic Web ApplicationsPeter Bartalos, Michal Barla, György Frivolt, Michal Tvarozek, Anton Andrejko, Mária Bieliková, Pavol Návrat. 682-692 [doi]
• Semantic Web Approach in Designing a Collaborative E-Item Bank SystemHeung-Nam Kim, Ae-Ttie Ji, Soon-Geun Lee, GeunSik Jo. 693-704 [doi]
• A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the WebDeok-Hwan Kim, Jae-Won Song, Ju-Hong Lee. 705-715 [doi]
• Rapid Development of Web Interfaces to Heterogeneous SystemsJosé Paulo Leal, Marcos Aurélio Domingues. 716-725 [doi]
• Enhancing Security by Embedding Biometric Data in IP HeaderDae Sung Lee, Ki-Chang Kim, Year Back Yoo. 726-737 [doi]
• Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message BrokersHyunho Lee, Wonsuk Lee. 738-749 [doi]
• A Semantic Peer-to-Peer Overlay for Web Services DiscoveryYong Li, Fangchun Yang, Kai Shuang, Sen Su. 750-760 [doi]
• Multi-document Summarization Based on Cluster Using Non-negative Matrix FactorizationSun Park, Ju-Hong Lee, Deok-Hwan Kim, Chan-Min Ahn. 761-770 [doi]
• A Program Slicing Based Method to Filter XML/DTD DocumentsJosep Silva. 771-782 [doi]
• A Hybrid Approach for XML SimilarityJoe Tekli, Richard Chbeir, Kokou Yétongnon. 783-795 [doi]
• Personalized Presentation in Web-Based Information SystemsMichal Tvarozek, Michal Barla, Mária Bieliková. 796-807 [doi]
• Immune-Inspired Online Method for Service Interactions DetectionJianyin Zhang, Fangchun Yang, Kai Shuang, Sen Su. 808-818 [doi]
• Separation of Concerns and Consistent Integration in Requirements ModellingXin Chen, Zhiming Liu, Vladimir Mencl. 819-831 [doi]
• Checking Interaction Consistency in MARMOT Component RefinementsYunja Choi. 832-843 [doi]
• Towards a Versatile Contract Model to Organize Behavioral SpecificationsPhilippe Collet, Alain Ozanne, Nicolas Rivierre. 844-855 [doi]
• Improved Processing of Textual Use Cases: Deriving Behavior SpecificationsJaroslav Drazan, Vladimir Mencl. 856-868 [doi]
• A Dialogue-Based NLIDB System in a Schedule Management DomainHarksoo Kim. 869-877 [doi]
• Experimental Assessment of the Practicality of a Fault-Tolerant SystemJai Wug Kim, Jongpil Lee, Heon Young Yeom. 878-887 [doi]
• A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based SystemsMila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier. 888-899 [doi]
• Extracting Zing Models from C Source CodeTomas Matousek, Filip Zavoral. 900-910 [doi]
• Parameterised Extra-Functional Prediction of Component-Based Control Systems - Industrial ExperienceIan D. Peake, Heinz W. Schmidt. 911-922 [doi]
• Explicit Connectors in Component Based Software Engineering for Distributed Embedded SystemsDietmar Schreiner, Karl M. Göschka. 923-934 [doi]