Abstract is missing.
- Solving Generalized Maximum Dispersion with Linear ProgrammingGerold Jäger, Anand Srivastav, Katja Wolf. 1-10 [doi]
- Significance-Driven Graph ClusteringMarco Gaertler, Robert Görke, Dorothea Wagner. 11-26 [doi]
- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple GraphsZhi-Zhong Chen, Ruka Tanahashi. 27-36 [doi]
- Digraph Strong Searching: Monotonicity and ComplexityBoting Yang, Yi Cao. 37-46 [doi]
- Algorithms for Counting 2-SatSolutions and Colorings with ApplicationsMartin Fürer, Shiva Prasad Kasiviswanathan. 47-57 [doi]
- Collaborative Ranking: An Aggregation Algorithm for Individuals Preference EstimationJoachim Giesen, Dieter Mitsche, Eva Schuberth. 58-67 [doi]
- A Compact Encoding of Rectangular Drawings with Efficient Query SupportsKatsuhisa Yamanaka, Shin-Ichi Nakano. 68-81 [doi]
- A New Efficient Algorithm for Computing the Longest Common SubsequenceM. Sohel Rahman, Costas S. Iliopoulos. 82-90 [doi]
- Scheduling a Flexible Batching MachineBaoqiang Fan, Jianzhong Gu, Guochun Tang. 91-99 [doi]
- Global Search Method for Parallel Machine SchedulingHyun Joon Shin. 100-107 [doi]
- Releasing and Scheduling of Lots in a Wafer FabSubhash C. Sarin, Vinod D. Shenai, Lixin Wang. 108-119 [doi]
- Mixed Criteria Packet SchedulingChad R. Meiners, Eric Torng. 120-133 [doi]
- Efficient Algorithms for ::::k:::: -Disjoint Paths Problems on DAGsRudolf Fleischer, Qi Ge, Jian Li, Hong Zhu. 134-143 [doi]
- Acyclic Edge Colouring of Outerplanar GraphsRahul Muthu, N. Narayanan, C. R. Subramanian. 144-152 [doi]
- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu. 153-166 [doi]
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted OutdegreeYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo. 167-177 [doi]
- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-LengthsNaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. 178-190 [doi]
- Online OVSF Code Assignment with Resource AugmentationFrancis Y. L. Chin, Yong Zhang, Hong Zhu. 191-200 [doi]
- Optimal Joint Rate and Power Allocation in CDMA NetworksRichard J. Boucherie, Aloysius Irwan Endrayanto, Adriana Felicia Gabor. 201-210 [doi]
- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving SchedulersHongkyu Jeong, Kyoung Y. Bae, Jinoo Joung. 211-220 [doi]
- How to Play the Majority Game with LiarsSteve Butler, Jia Mao, Ronald L. Graham. 221-230 [doi]
- On Satisfiability Games and the Power of Congestion GamesVittorio Bilò. 231-240 [doi]
- The Complexity of Algorithms Computing Game Trees on Random AssignmentsChenGuang Liu, Kazuyuki Tanaka. 241-250 [doi]
- An Efficient, and Fast Convergent Algorithm for Barrier OptionsTian-Shyr Dai, Yuh-Dauh Lyuu. 251-261 [doi]
- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average OptionsTian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei. 262-272 [doi]
- Optimal Order Allocation with Discount PricingBoris Goldengorin, John Keane, Viktor Kuzmenko, Michael Tso. 273-284 [doi]
- Convex Hulls of Point-Sets and Non-uniform HypergraphsHanno Lefmann. 285-295 [doi]
- Optimal ::::st:::: -Orientations for Plane TriangulationsHuaming Zhang, Xin He. 296-305 [doi]
- Minimum Spanning Tree with NeighborhoodsYang Yang, Mingen Lin, Jinhui Xu, Yulai Xie. 306-316 [doi]
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering ProblemBin Fu, Zhixiang Chen, Mahdi Abdelguerfi. 317-326 [doi]
- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation TherapyXiaodong Wu, Xin Dou. 327-336 [doi]
- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box GraphsXin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas. 337-345 [doi]
- ::::BMA:::::::*:::: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road MapsDan He. 346-357 [doi]
- Strip Packing vs. Bin PackingXin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang. 358-367 [doi]
- Probe Matrix Problems: Totally Balanced MatricesDavid B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier. 368-377 [doi]
- Efficiency of Data Distribution in BitTorrent-Like SystemsHo-Leung Chan, Tak Wah Lam, Prudence W. H. Wong. 378-388 [doi]
- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web ServersKa Ho Chan, Xiaowen Chu. 389-398 [doi]
- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary PseudoknotsMinghui Jiang. 399-410 [doi]
- A Heuristic Method for Selecting Support Features from Large DatasetsHong Seo Ryoo, In-Yong Jang. 411-423 [doi]
- Game and Market Equilibria: Computation, Approximation, and Smoothed AnalysisShang-Hua Teng. 424 [doi]
- Ad Auctions - Current and Future ResearchAnna R. Karlin. 425 [doi]
- Expressive Commerce and Its Application to Sourcing: How We Conducted 25 Billion of Generalized Combinatorial AuctionsTuomas Sandholm. 426 [doi]