Abstract is missing.
- Matchings in Graphs Variations of the ProblemKurt Mehlhorn. 1-2 [doi]
- Combinatorics from Bacterial GenomesBailin Hao. 3 [doi]
- An Algorithm for Computing Virtual Cut Points in Finite Metric SpacesAndreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton. 4-10 [doi]
- Finding the Anti-block Vital Edge of a Shortest Path Between Two NodesBing Su, Qingchuan Xu, Peng Xiao. 11-19 [doi]
- ::::K:::: -Connected Target Coverage Problem in Wireless Sensor NetworksDeying Li, Jiannong Cao, Ming Liu, Yuan Zheng. 20-31 [doi]
- Searching Cycle-Disjoint GraphsBoting Yang, Runtao Zhang, Yi Cao. 32-43 [doi]
- An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize MakespanYuzhong Zhang, Zhigang Cao. 44-51 [doi]
- A New Dynamic Programming Algorithm for Multiple Sequence AlignmentJean-Michel Richer, Vincent Derrien, Jin-Kao Hao. 52-61 [doi]
- Energy Minimizing Vehicle Routing ProblemImdat Kara, Bahar Yetis Kara, M. Kadri Yetis. 62-71 [doi]
- On the On-Line ::::k:::: -Taxi Problem with Limited Look AheadWeimin Ma, Ting Gao, Ke Wang. 72-80 [doi]
- The Minimum Risk Spanning Tree ProblemXujin Chen, Jie Hu, Xiaodong Hu. 81-90 [doi]
- The Size of a Minimum Critically ::::m:::: -Neighbor-Scattered GraphFengwei Li, Qingfang Ye. 91-101 [doi]
- A New Hybrid Algorithm for Feature Selection and Its Application to Customer RecognitionLuo Yan, Yu Changrui. 102-111 [doi]
- Steiner Forests on Stochastic Metric GraphsVangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos. 112-123 [doi]
- On Threshold BDDs and the Optimal Variable Ordering ProblemMarkus Behle. 124-135 [doi]
- Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -Takashi Matsuhisa. 136-145 [doi]
- Fundamental Domains for Integer Programs with SymmetriesEric J. Friedman. 146-153 [doi]
- Exact Algorithms for Generalized Combinatorial Optimization ProblemsPetrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu. 154-162 [doi]
- Approximation Algorithms for ::::k:::: -Duplicates Combinatorial Auctions with Subadditive BiddersWenbin Chen 0002, Jiangtao Meng. 163-170 [doi]
- A Grid Resource Discovery Method Based on Adaptive ::::k:::: -Nearest Neighbors ClusteringYan Zhang, Yan Jia, Xiaobin Huang, Bin Zhou, Jian Gu. 171-181 [doi]
- Algorithms for Minimum ::::m:::: -Connected ::::k:::: -Dominating Set ProblemWeiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu. 182-190 [doi]
- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time ProblemDanyu Bai, Lixin Tang. 191-199 [doi]
- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of ChompEric J. Friedman, Adam Scott Landsberg. 200-207 [doi]
- Mechanism Design by CreditabilityRaphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer. 208-219 [doi]
- Infinite Families of Optimal Double-Loop NetworksXiaoping Dai, Jianqin Zhou, Xiaolin Wang. 220-229 [doi]
- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of PointsHanno Lefmann. 230-241 [doi]
- An Experimental Study of Compressed Indexing and Local Alignments of DNATak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Chi-Kwong Wong, Siu-Ming Yiu. 242-254 [doi]
- Secure Multiparty Computations Using the 15 PuzzleTakaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone. 255-266 [doi]
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment ProblemErnst Althaus, Stefan Canzar. 267-278 [doi]
- Single Machine Common Due Window Scheduling with Controllable Job Processing TimesGuohua Wan. 279-290 [doi]
- A Lower Bound on Approximation Algorithms for the Closest Substring ProblemJianxin Wang, Min Huang, Jianer Chen. 291-300 [doi]
- A New Exact Algorithm for the Two-Sided Crossing Minimization ProblemLanbo Zheng, Christoph Buchheim. 301-310 [doi]
- Improved Approximation Algorithm for Connected Facility Location ProblemsMohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa. 311-322 [doi]
- The Computational Complexity of Game Trees by Eigen-DistributionChenGuang Liu, Kazuyuki Tanaka. 323-334 [doi]
- The Minimum All-Ones Problem for Graphs with Small TreewidthYunting Lu, Yueping Li. 335-342 [doi]
- An Exact Algorithm Based on Chain Implication for the Min-CVCB ProblemJianxin Wang, Xiaoshuang Xu, Yunlong Liu. 343-353 [doi]
- Arc Searching Digraphs Without JumpingBrian Alspach, Danny Dyer, Denis Hanson, Boting Yang. 354-365 [doi]
- On the Complexity of Some Colorful Problems Parameterized by TreewidthMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen. 366-377 [doi]
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing ModelMinghui Jiang. 378-387 [doi]