Table of Contents

• The Unpredictable Deviousness of ModelsFranco P. Preparata. 1 [doi]
• Security Issues in Collaborative ComputingMikhail J. Atallah. 2 [doi]
• A Simplicial Approach for Discrete Fixed Point TheoremsXi Chen, Xiaotie Deng. 3-12 [doi]
• On Incentive Compatible Competitive Selection ProtocolXi Chen, Xiaotie Deng, Becky Jie Liu. 13-22 [doi]
• Edge Pricing of Multicommodity Networks for Selfish Users with Elastic DemandsGeorge Karakostas, Stavros G. Kolliopoulos. 23-32 [doi]
• Aggregating Strategy for Online AuctionsShigeaki Harada, Eiji Takimoto, Akira Maruoka. 33-41 [doi]
• On Indecomposability Preserving Elimination SequencesChandan K. Dubey, Shashank K. Mehta. 42-51 [doi]
• Improved Algorithms for the Minmax Regret 1-Median ProblemHung-I Yu, Tzu-Chin Lin, Biing-Feng Wang. 52-62 [doi]
• Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform SizeTakehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki. 63-72 [doi]
• Characterizations and Linear Time Recognition of Helly Circular-Arc GraphsMin Chih Lin, Jayme Luiz Szwarcfiter. 73-82 [doi]
• Varieties Generated by Certain Models of Reversible Finite AutomataMarats Golovkins, Jean-Eric Pin. 83-93 [doi]
• Iterated TGR Languages: Membership Problem and Effective Closure PropertiesIan McQuillan, Kai Salomaa, Mark Daley. 94-103 [doi]
• On the Negation-Limited Circuit Complexity of Sorting and Inverting ::::k::::-tonic SequencesTakayuki Sato, Kazuyuki Amano, Akira Maruoka. 104-115 [doi]
• Robust Quantum Algorithms with ::::epsilon::::-Biased OraclesTomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe. 116-125 [doi]
• The Complexity of Black-Box Ring ProblemsVikraman Arvind, Bireswar Das, Partha Mukhopadhyay. 126-135 [doi]
• Lower Bounds and Parameterized Approach for Longest Common SubsequenceXiuzhen Huang. 136-145 [doi]
• Finding Patterns with Variable Length Gaps or Don t CaresM. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth. 146-155 [doi]
• The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation TherapyXin Dou, Xiaodong Wu, John E. Bayouth, John M. Buatti. 156-165 [doi]
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion ProblemMarc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff. 166-175 [doi]
• A PTAS for Cutting Out Polygons with LinesSergey Bereg, Ovidiu Daescu, Minghui Jiang. 176-185 [doi]
• On Unfolding Lattice Polygons/Trees and Diameter-4 TreesSheung-Hung Poon. 186-195 [doi]
• Restricted Mesh Simplification Using Edge ContractionsMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. 196-204 [doi]
• Enumerating Non-crossing Minimally Rigid FrameworksDavid Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa. 205-215 [doi]
• Sequences Characterizing ::::k::::-TreesZvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber. 216-225 [doi]
• On the Threshold of Having a Linear Treewidth in Random GraphsYong Gao. 226-234 [doi]
• Reconciling Gene Trees with Apparent PolytomiesWen-Chieh Chang, Oliver Eulenstein. 235-244 [doi]
• Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of GenomesZhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu. 245-254 [doi]
• Computing Maximum-Scoring Segments in Almost Linear TimeFredrik Bengtsson, Jingsen Chen. 255-264 [doi]
• Enumerate and Expand: New Runtime Bounds for Vertex Cover VariantsDaniel Mölle, Stefan Richter, Peter Rossmanith. 265-273 [doi]
• A Detachment Algorithm for Inferring a Graph from Path FrequencyHiroshi Nagamochi. 274-283 [doi]
• The ::::d::::-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation AlgorithmYing Xiao, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman. 284-298 [doi]
• Reconstructing Evolution of Natural Languages: Complexity and Parameterized AlgorithmsIyad A. Kanj, Luay Nakhleh, Ge Xia. 299-308 [doi]
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation AnalysisWun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung. 309-319 [doi]
• Improved On-Line Broadcast Scheduling with DeadlinesFeifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong. 320-329 [doi]
• A Tight Analysis of Most-Requested-First for On-Demand Data BroadcastRegant Y. S. Hung, H. F. Ting. 330-339 [doi]
• On Lazy Bin Covering and Packing ProblemsMingen Lin, Yang Yang, Jinhui Xu. 340-349 [doi]
• Creation and Growth of Components in a Random Hypergraph ProcessVlady Ravelomanana, Alphonse Laza Rijamamy. 350-359 [doi]
• Optimal Acyclic Edge Colouring of Grid Like GraphsRahul Muthu, N. Narayanan, C. R. Subramanian. 360-367 [doi]
• An Edge Ordering Problem of Regular HypergraphsHongbing Fan, Robert Kalbfleisch. 368-377 [doi]
• Efficient Partially Blind Signature Scheme with Provable SecurityZheng Gong, Xiangxue Li, Kefei Chen. 378-386 [doi]
• A Rigorous Analysis for Set-Up Time Models - A Metric PerspectiveEitan Bachmat, Tao-Kai Lam, Avner Magen. 387-397 [doi]
• Geometric Representation of Graphs in Low DimensionL. Sunil Chandran, Naveen Sivadasan. 398-407 [doi]
• The On-Line Heilbronn s Triangle Problem in ::::d:::: DimensionsGill Barequet, Alina Shaikhet. 408-417 [doi]
• Counting ::::d::::-Dimensional Polycubes and Nonrectangular Planar PolyominoesGadi Aleksandrowicz, Gill Barequet. 418-427 [doi]
• Approximating Min-Max (Regret) Versions of Some Polynomial ProblemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. 428-438 [doi]
• The Class Constrained Bin Packing Problem with Applications to Video-on-DemandE. C. Xavier, Flávio Keidi Miyazawa. 439-448 [doi]
• MAX-SNP Hardness and Approximation of Selected-Internal Steiner TreesSun-Yuan Hsieh, Shih-Cheng Yang. 449-458 [doi]
• Minimum Clique Partition Problem with Constrained Weight for Interval GraphsJianbo Li, Mingxia Chen, Jianping Li, Weidong Li. 459-468 [doi]
• Overlap-Free Regular LanguagesYo-Sub Han, Derick Wood. 469-478 [doi]
• On the Combinatorial Representation of InformationJoel Ratsaby. 479-488 [doi]
• Finding Small OBDDs for Incompletely Specified Truth Tables Is HardJesper Torp Kristensen, Peter Bro Miltersen. 489-496 [doi]
• Bimodal Crossing MinimizationChristoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan. 497-506 [doi]
• Fixed Linear Crossing Minimization by Reduction to the Maximum Cut ProblemChristoph Buchheim, Lanbo Zheng. 507-516 [doi]
• On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow ProblemDae-Sik Choi, In-Chan Choi. 517-526 [doi]