Table of Contents

• Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal LinkagesSue Whitesides. 1-13 [doi]
• Application of M-Convex Submodular Flow Problem to Mathematical EconomicsKazuo Murota, Akihisa Tamura. 14-25 [doi]
• A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch SchedulingXiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu. 26-35 [doi]
• A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling TimesYoshiyuki Karuno, Hiroshi Nagamochi. 36-47 [doi]
• Semi-normal Schedulings: Improvement on Goemans AlgorithmJianer Chen, Jingui Huang. 48-60 [doi]
• Balanced Scheduling toward Loss-Free Packet Queuing and Delay FairnessHisashi Koga. 61-73 [doi]
• Broadcasting with Universal Lists Revisited: Using Competitive AnalysisJae-Hoon Kim, Kyung-Yong Chwa. 74-85 [doi]
• On Adaptive Fault Diagnosis for Multiprocessor SystemsKumiko Nomura, Toshinori Yamada, Shuichi Ueno. 86-98 [doi]
• On-Line Multicasting in All-Optical NetworksKenta Hashimoto, Toshinori Yamada, Shuichi Ueno. 99-106 [doi]
• Enumerating Floorplans with n RoomsShin-Ichi Nakano. 107-115 [doi]
• On Min-Max Cycle BasesGiulia Galbiati. 116-123 [doi]
• On the Minimum Local-Vertex-Connectivity Augmentation in GraphsHiroshi Nagamochi, Toshimasa Ishii. 124-135 [doi]
• Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique NumberTakayuki Nagoya. 136-147 [doi]
• Quantum Algorithms for Intersection and Proximity ProblemsKunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama. 148-159 [doi]
• BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean SpacesZheng Sun, John H. Reif. 160-171 [doi]
• Approximation of Minimum Triangulation for Polyhedron with Bounded DegreesFrancis Y. L. Chin, Stanley P. Y. Fung. 172-184 [doi]
• Tree-Approximations for the Weighted Cost-Distance ProblemChristian Schindelhauer, Birgitta Weber. 185-195 [doi]
• Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical GroupsTakaaki Mizuki, Takao Nishizeki. 196-207 [doi]
• Generic Algorithms and Key Agreement Protocols Based on Group ActionsAkihiro Yamamura, Kaoru Kurosawa. 208-218 [doi]
• Baire Category and Nowhere Differentiability for Feasible Real FunctionsJosef M. Breutzmann, David W. Juedes, Jack H. Lutz. 219-230 [doi]
• Translation among CNFs, Characteristic Models and Ordered Binary Decision DiagramsTakashi Horiyama, Toshihide Ibaraki. 231-243 [doi]
• On Removing the Pushdown Stack in Reachability ConstructionsOscar H. Ibarra, Zhe Dang. 244-256 [doi]
• A New Recognition Algorithm for Extended Regular ExpressionsHiroaki Yamamoto. 257-267 [doi]
• Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite AutomataTakeshi Koshiba. 268-278 [doi]
• An Index for the Data Size to Extract Decomposable Structures in LADHirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki. 279-290 [doi]
• Parameterized Complexity: The Main Ideas and Some Research FrontiersMichael R. Fellows. 291-307 [doi]
• Tight Bounds on Maximal and Maximum MatchingsTherese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. 308-319 [doi]
• Recognition and Orientation Algorithms for P::4::-Comparability GraphsStavros D. Nikolopoulos, Leonidas Palios. 320-331 [doi]
• Efficient Algorithms for k-Terminal Cuts on Planar GraphsDanny Z. Chen, Xiaodong Wu. 332-344 [doi]
• Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian PathsAnna Galluccio, Guido Proietti. 345-354 [doi]
• Algorithms for Pattern Involvement in PermutationsMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton. 355-366 [doi]
• A Fast Algorithm for Enumerating Bipartite Perfect MatchingsTakeaki Uno. 367-379 [doi]
• On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion TimeBo Chen, Xiaotie Deng, Wenan Zang. 380-389 [doi]
• On the Complexity of Train Assignment ProblemsThomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer. 390-402 [doi]
• A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical ModelJames Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah. 403-415 [doi]
• Complexity of Comparing Hidden Markov ModelsRune B. Lyngsø, Christian N. S. Pedersen. 416-428 [doi]
• DNA Self-Assembly For Constructing 3D BoxesMing-Yang Kao, Vijay Ramachandran. 429-440 [doi]
• Exact Solutions for CLOSEST STRING and Related ProblemsJens Gramm, Rolf Niedermeier, Peter Rossmanith. 441-453 [doi]
• Topological Peeling and ImplementationDanny Z. Chen, Shuang Luan, Jinhui Xu. 454-466 [doi]
• Image Segmentation with Monotonicity and Smoothness ConstraintsDanny Z. Chen, Jie Wang, Xiaodong Wu. 467-479 [doi]
• Optimization Algorithms for Sweeping a Polygonal Region with Mobile GuardsJae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa. 480-492 [doi]
• Approximation of a Geometric Set Covering ProblemSofia Kovaleva, Frits C. R. Spieksma. 493-501 [doi]
• Shortest Path Algorithms: Engineering AspectsAndrew V. Goldberg. 502-513 [doi]
• Efficient Algorithms for Weighted Colorings of Series-Parallel GraphsXiao Zhou, Takao Nishizeki. 514-524 [doi]
• Go with the Winners Algorithms for Cliques in Random GraphsMarcus Peinado. 525-536 [doi]
• Complexity of Partial Covers of GraphsJirí Fiala, Jan Kratochvíl. 537-549 [doi]
• On Game-Theoretic Models of NetworksHans Leo Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov. 550-561 [doi]
• The Complexity of Some Basic Problems for Dynamic Process GraphsAndreas Jakoby, Maciej Liskiewicz. 562-574 [doi]
• Delay Optimizations in Quorum ConsensusXuemin Lin. 575-586 [doi]
• Randomized Shared Queues Applied to Distributed Optimization AlgorithmsHyunyoung Lee, Jennifer L. Welch. 587-598 [doi]
• Multiprocess Time QueueAndrej Brodnik, Johan Karlsson. 599-609 [doi]
• Labeling Points with WeightsSheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff. 610-622 [doi]
• Small Convex Quadrangulations of Point SetsDavid Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan. 623-635 [doi]
• How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-DiscrepancyTetsuo Asano, Takeshi Tokuyama. 636-648 [doi]
• Labeling Subway LinesMaria Angeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff. 649-659 [doi]
• Complexity Study on Two Clustering ProblemsLouxin Zhang, Song Zhu. 660-669 [doi]
• A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2Toshihiro Fujito, Tsuyoshi Okumura. 670-681 [doi]
• A Unified Framework for Approximating Multiway Partition ProblemsLiang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki. 682-694 [doi]
• On-Line Algorithms for Cardinality Constrained Bin Packing ProblemsLuitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov. 695-706 [doi]
• Suffix Vector: A Space-Efficient Suffix Tree RepresentationKrisztián Monostori, Arkady B. Zaslavsky, István Vajk. 707-718 [doi]
• Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary WorksHideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara. 719-730 [doi]
• Computing the Quartet Distance between Evolutionary Trees in Time O(n log:::2::: n)Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen. 731-742 [doi]
• The Cent-dian Path Problem on Tree NetworksRonald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari. 743-755 [doi]
• Approximate Hotlink AssignmentEvangelos Kranakis, Danny Krizanc, Sunil M. Shende. 756-767 [doi]
• Efficient Algorithms for Two Generalized 2-Median Problems on TreesShan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin. 768-778 [doi]