Table of Contents

• Voronoi-Based Systems of Coordinates and Surface ReconstructionJean-Daniel Boissonnat. 1 [doi]
• Essentially Every Unimodular Matrix Defines and ExpanderJin-yi Cai. 2-22 [doi]
• Strategies for Hotlink AssignmentsProsenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec. 23-34 [doi]
• A New Competitive Analysis of Randomized CachingChing Law, Charles E. Leiserson. 35-46 [doi]
• Online Routing in Convex SubdivisionsProsenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz. 47-59 [doi]
• A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four ProcessorsJingui Huang, Jianer Chen, Songqiao Chen. 60-71 [doi]
• Classification of Various Neighborhood Operations for the Nurse Scheduling ProblemTakayuki Osogami, Hiroshi Imai. 72-83 [doi]
• Optimal Bid Sequences for Multiple-Object Auctions with Unequal BudgetsYuyu Chen, Ming-Yang Kao, Hsueh-I Lu. 84-95 [doi]
• coping with Delays and Time-Outs in Binary Search ProceduresFerdinando Cicalese, Ugo Vaccaro. 96-107 [doi]
• Some Formal Analysis of Roccio s Similarity-Based Relvance Feedback AlgorithmZhixiang Chen, Binhai Zhu. 108-119 [doi]
• Reasoning with Ordered Binary Decision DiagramsTakashi Horiyama, Toshihide Ibaraki. 120-131 [doi]
• On Approximating Minimum Vertex Cover for Graphs with Perfect MatchingJianer Chen, Iyad A. Kanj. 132-143 [doi]
• A 2-Approximation Algorithm for Path Coloring on Trees of RingsXiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang. 144-155 [doi]
• An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a TreeQ. S. Wu, Chin Lung Lu, Richard C. T. Lee. 156-167 [doi]
• Finding Independent Spanning Trees in Partial k-TreesXiao Zhou, Takao Nishizeki. 168-179 [doi]
• On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVERRolf Niedermeier, Peter Rossmanith. 180-191 [doi]
• Constructive Linear Time Algorithms for Small Cutwidth and Carving-WidthDimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender. 192-203 [doi]
• Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial CircuitsTakao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda. 204-215 [doi]
• A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the PlaneNorihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto. 216-227 [doi]
• Simple Algorithms for a Weighted Interval Selection ProblemThomas Erlebach, Frits C. R. Spieksma. 228-240 [doi]
• Efficient Minus and Signed Domination in GraphsChin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang. 241-253 [doi]
• Convex Grid Drwaings of Four-Connected Plane GraphsKazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano. 254-265 [doi]
• An Algorithm for Finding Three Dimensional Symmetry in Series Parallel DigraphsSeok-Hee Hong, Peter Eades. 266-277 [doi]
• Undecidability Results for Monoids with Linear-Time Decidable Word ProblemsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. 278-289 [doi]
• Secret Key Exchange Using Random Deals of Cards on Hierarchical StructuresReina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi. 290-301 [doi]
• Derandomizing Arthur-Merlin Games under Uniform AssumptionsChi-Jen Lu. 302-312 [doi]
• A Near Optimal Algorithm for Vertex Connectivity AugmentationBill Jackson, Tibor Jordán. 312-325 [doi]
• Simultaneous Augmentation of Two Graphs to an ::::l::::-Edge-Connected Graph and a Biconnected GraphToshimasa Ishii, Hiroshi Nagamochi. 326-337 [doi]
• Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-SubsetsHiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito. 338-349 [doi]
• An Intuitive and Effective New Representation for Interconnection Network StructuresJianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia. 350-361 [doi]
• Randomized Leader Election Protocols in Radio Networks with No Collision DetectionKoji Nakano, Stephan Olariu. 362-373 [doi]
• Deterministic Broadcasting Time with Partial Knowledge of the NetworkGianluca De Marco, Andrzej Pelc. 374-385 [doi]
• Minimizing Makespan in Batch Machine SchedulingChung Keung Poon, Pixing Zhang. 386-397 [doi]
• Preemptive Parallel Task Scheduling in O(n)+Poly(m) TimeKlaus Jansen, Lorant Porkolab. 398-409 [doi]
• Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix ArrayKunihiko Sadakane. 410-421 [doi]
• A Better Lower Bound for Two-Circle Point LabelingAlexander Wolff, Michael Thon, Yin-Feng Xu. 422-431 [doi]
• Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point SetDeok-Soo Kim, Donguk Kim, Kokichi Sugihara. 432-443 [doi]
• An Improved Algorithm for Subdivision Traversal without Extra StorageProsenjit Bose, Pat Morin. 444-455 [doi]
• Generalized ::::H::::-Coloring of GraphsPetter Kristiansen, Jan Arne Telle. 456-466 [doi]
• Finding a Two-Core of a Tree in Linear TimeBiing-Feng Wang, Jyh-Jye Lin. 467-478 [doi]
• Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree ComparisonMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. 479-490 [doi]
• Optimal Beam Penetrations in Two and Three DimensionsDanny Z. Chen, Xiaobo Hu, Jinhui Xu. 491-502 [doi]
• Searching a Simple Polygon by a ::::k::::-SearcherXuehou Tan. 503-514 [doi]
• Characterization of Rooms Searchable by Two GuardsSang-Min Park, Kyung-Yong Chwa, Jae-Ha Lee. 515-526 [doi]
• Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree TransfersWing-Kai Hon, Ming-Yang Kao, Tak Wah Lam. 527-538 [doi]
• Phylogenetic ::::k::::-Root and Steiner ::::k::::-RootGuo-Hui Lin, Tao Jiang, Paul E. Kearney. 539-551 [doi]
• Maintenance of a Percing Set for Intervals with ApplicationsMatthew J. Katz, Frank Nielsen, Michael Segal. 552-563 [doi]
• Optimal Polygon Cover Problems and ApplcationsDanny Z. Chen, Xiaobo Hu, Xiaodong Wu. 564-576 [doi]