Table of Contents

• Complete Problems for Valiant s Class of qp-Computable Families of PolynomialsMarkus Bläser. 1-10 [doi]
• Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n:::4.03:::)Michal Koucký. 11-20 [doi]
• On Universally Polynomial Context-Free LanguagesNicholas Tran. 21-27 [doi]
• Separating Oblivious and Non-oblivious BPsKazuo Iwama, Yasuo Okabe, Toshiro Takase. 28-38 [doi]
• Program Schemes, Queues, the Recursive Spectrum and Zero-One LawsIain A. Stewart. 39-48 [doi]
• Algebraic Properties for P-SelectivityLane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen. 49-58 [doi]
• Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAMCarla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara. 59-63 [doi]
• Enhanced Sequence Reconstruction with DNA Microarray ApplicationSamuel A. Heath, Franco P. Preparata. 64-74 [doi]
• Non-approximability of Weighted Multiple Sequence AlignmentBodo Siebert. 75-85 [doi]
• A Greedy Algorithm for Optimal RecombinationShiquan Wu, Xun Gu. 86-90 [doi]
• Generating Well-Shaped d-dimensional Delaunay MeshesXiang-Yang Li. 91-100 [doi]
• Towards Compatible TriangulationsOswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado. 101-110 [doi]
• An Improved Upper Bound on the Size of Planar Convex-HullsAbdullah N. Arslan, Ömer Egecioglu. 111-120 [doi]
• On the Planar Two-Watchtower ProblemSergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu. 121-130 [doi]
• Efficient Generation of Triconnected Plane TriangulationsShin-Ichi Nakano. 131-141 [doi]
• Packing Two Disks into a Polygonal EnvironmentProsenjit Bose, Pat Morin, Antoine Vigneron. 142-149 [doi]
• Maximum Red/Blue Interval Matching with ApplicationsDanny Z. Chen, Xiaobo Hu, Xiaodong Wu. 150-158 [doi]
• Computing Farthest Neighbors on a Convex PolytopeOtfried Cheong, Chan-Su Shin, Antoine Vigneron. 159-169 [doi]
• Finding an Optimal Bridge between Two PolygonsXuehou Tan. 170-180 [doi]
• How Good Is Sink Insertion?Xiang-Yang Li, Yu Wang. 181-190 [doi]
• Polynomial Time Algorithms for Three-Label Point LabelingRob Duncan, Jianbo Qian, Binhai Zhu. 191-200 [doi]
• Approximation Algorithms for the Watchman Route and Zookeeper s ProblemsXuehou Tan. 201-206 [doi]
• PC-Trees vs. PQ-TreesWen-Lian Hsu. 207-217 [doi]
• Stacks versus DequesHolger Petersen. 218-227 [doi]
• Optimizing a Computational Method for Length Lower Bounds for Reflecting SequencesH. K. Dai. 228-236 [doi]
• Competitive Facility Location along a HighwayHee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum. 237-246 [doi]
• Membership for Core of LP Games and Other GamesQizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng. 247-256 [doi]
• Strong Solutions to the Identification ProblemPino Caballero-Gil, Candelaria Hernández-Goya. 257-261 [doi]
• Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2:::m:::Hyun-Sung Kim, Kee-Young Yoo. 262-267 [doi]
• A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path AlgorithmsValerie King, Mikkel Thorup. 268-277 [doi]
• Finding the Most Vital Node of a Shortest PathEnrico Nardelli, Guido Proietti, Peter Widmayer. 278-287 [doi]
• Algorithm for the Cost Edge-Coloring of TreesXiao Zhou, Takao Nishizeki. 288-297 [doi]
• Counting H-Colorings of Partial k-TreesJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. 298-307 [doi]
• A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal GraphL. Sunil Chandran. 308-317 [doi]
• Graph Separators: A Parameterized ViewJochen Alber, Henning Fernau, Rolf Niedermeier. 318-327 [doi]
• On Assigning Prefix Free Codes to the Vertices of a GraphN. S. Narayanaswamy, C. E. Veni Madhavan. 328-337 [doi]
• A New Measure of Edit Distance between Labeled TreesChin Lung Lu, Zheng-Yao Su, Chuan Yi Tang. 338-348 [doi]
• A Highly Efficient Algorithm to Determine Bicritical GraphsDingjun Lou, Ning Zhong. 349-356 [doi]
• Layered Drawings of Graphs with Crossing ConstraintsIrene Finocchi. 357-367 [doi]
• On the Validity of Hierarchical DecompositionsIrene Finocchi, Rossella Petreschi. 368-374 [doi]
• Lower Bounds on the Minus Domination and k-Subdomination NumbersLiying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du. 375-383 [doi]
• Edge Connectivity vs Vertex Connectivity in Chordal GraphsL. Sunil Chandran. 384-389 [doi]
• Changing the Diameter of Graph ProductsTing-Yi Sung, Jeng-Jung Wang. 390-394 [doi]
• Plane Graphs with Acyclic ComplexBaogang Xu. 395-399 [doi]
• On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz DigraphsYosuke Kikuchi, Yukio Shibata. 400-408 [doi]
• A Notion of Cross-Perfect Bipartite GraphsMilind Dawande. 409-413 [doi]
• Some Results on Orthogonal FactorizationsHaodi Feng. 414-419 [doi]
• Cluttered Orderings for the Complete GraphMyra B. Cohen, Charles J. Colbourn, Dalibor Froncek. 420-431 [doi]
• Improved On-Line Stream Merging: From a Restricted to a General SettingWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. 432-442 [doi]
• On-Line Deadline Scheduling on Multiple ResourcesJae-Hoon Kim, Kyung-Yong Chwa. 443-452 [doi]
• Competitive Online Scheduling with Level of ServiceEe-Chien Chang, Chee-Keng Yap. 453-462 [doi]
• On-Line Variable Sized CoveringLeah Epstein. 463-472 [doi]
• On Testing for Zero Polynomials by a Set of Points with Bounded PrecisionJin-yi Cai, Eric Bach. 473-482 [doi]
• A Randomized Algorithm for Gossiping in Radio NetworksMarek Chrobak, Leszek Gasieniec, Wojciech Rytter. 483-492 [doi]
• Deterministic Application of Grover s Quantum Search AlgorithmKyoichi Okamoto, Osamu Watanabe. 493-501 [doi]
• Random Instance Generation for MAX 3SATMitsuo Motoki. 502-508 [doi]
• The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner PointsDing-Zhu Du, Lusheng Wang, Baogang Xu. 509-518 [doi]
• An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel GraphsGuangting Chen, Guoliang Xue. 519-528 [doi]
• Decidable Approximations on Generalized and Parameterized Discrete Timed AutomataZhe Dang, Oscar H. Ibarra, Richard A. Kemmerer. 529-539 [doi]
• Multiplicative Adaptive Algorithms for User Preference RetrievalZhixiang Chen. 540-549 [doi]
• Parametric Scheduling for Network ConstraintsK. Subramani. 550-560 [doi]
• A Logical Framework for Knowledge Sharing in Multi-agent SystemsKaile Su, Xudong Luo, Huaiqing Wang, Chengqi Zhang, Shichao Zhang, Qingfeng Chen. 561-570 [doi]
• A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion ProblemKumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi. 571-575 [doi]
• Prefix-Free Languages and Initial Segments of Computably Enumerable DegreesGuohua Wu. 576-585 [doi]
• Weakly Computable Real Numbers and Total Computable Real FunctionsRobert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl. 586-595 [doi]
• Turing Computability of a Nonlinear Schrödinger PropagatorKlaus Weihrauch, Ning Zhong 0002. 596-600 [doi]