ISBN: 3-540-64824-0
TITLE: Computing and Combinatorics
AUTHOR: Hsu, Wen-Lian; Kao, Ming-Yang (Eds.)
TOC:

Invited Presentations 
On Certain Algorithmic Approaches to Information Retrieval and Data 
Mining 1 
Christos Papadimitriou 
Combinatorial Problems Arising in Massive Data Sets 2 
Fan Chung Graham 
Estimating Statistics of Monotone Boolean Functions 3 
Michael Fischer 
De-amortization of Algorithms 4 
Rao Kosaraju 
Computational Geometry 
On Computing New Classes of Optimal Triangulations with Angular Con- 
straints 5 
Yang Dai and Naoki Katoh 
Maximum Weight Triangulation and Its Application on Graph Drawing 15 
Cao An Wang, Francis Y. Chin and Bo Ting Yang 
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient 
High Dimensional Nearest-Foreign-Neighbor Queries 25 
T. Graf, V. Kamakoti, N. S. Janaki Latha and C. Pandu Rangan 
Space-Efficient Algorithms for Approximating Polygonal Curves in Two 
Dimensional Space 35 
Danny Z. Chen and Ovidiu Daescu 
Parallel Geometric Algorithms in Coarse-Grain Network Models 45 
Mikhail J. Atallah and Danny Z. Chen 
Algorithms and Data Structures (I) 
On the Bahncard Problem 55 
Rudolf Fleischer 
The Ultimate Strategy to Search on m Rays? 65 
Alejandro Lpez-Ortiz and Sven Schuierer 
Better Approximation of Diagonal-Flip Transformation and Rotation Trans- 
formation 75 
Ming Li and Louxin Zhang 
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body 
Simulations 85 
Guoliang Xue 
Algorithms and Data Structures (II) 
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT 95 
Mutsunori Yagiura and Toshihide Ibaraki 
Algorithms for Almost-uniform Generation with an Unbiased Binary 
Source 107 
mer Egecioglu and Marcus Peinado 
Improved Algorithms for Chemical Threshold Testing Problems 117 
Annalisa De Bonis, Luisa Gargano and Ugo Vaccaro 
Min-Max-Boundary Domain Decomposition 127 
Marcos Kiwi, Daniel A. Spielman and Shang-Hua Teng 
Computational Complexities 
On Boolean Lowness and Boolean Highness 137 
Steffen Reith and Klaus W. Wagner 
The Inherent Dimension of Bounded Counting Classes 147 
Ulrich Hertrampf 
An Exact Characterization of Symmetric Functions in qAC^0[2] 157 
Chi-Jen Lu 
Robust Reductions 164 
Jin-Yi Cai, Lane A. Hemaspaandra and Gerd Wechsung 
Approaches to Effective Semi-Continuity of Real Functions 174 
Vasco Brattka, Klaus Weihrauch and Xizhong Zheng 
On the Power of Additive Combinatorial Search Model 184 
Vladimir Grebinski 
Parallel and Distributed Processing, and Switching Networks 
The Number of Rearrangements in a 3-stage Clos Network Using an Aux- 
iliary Switch 194 
Frank K. Hwang and Wen-Dar Lin 
Lower Bounds for Wide-Sense Non-Blocking Clos Network 203 
Kuo-Hui Tsai and Da-Wei Wang 
Multirate Multicast Switching Networks 210 
Dongsoo S. Kim and Ding-Zhu Du 
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh 
of Buses 220 
Kazuo Iwama, Eiji Miyano, Satoshi Tajima and Hisao Tamaki 
Executing Divisible Jobs on a Network with a Fixed Number of Processors 232 
Tsan-sheng Hsu and Dian Rae Lopez 
Graph Theory (I) 
On the dm Conjecture on Circulant Graphs 242 
Bernard Mans, Francesco Pappalardi and Igor Shparlinski 
Proof of Toft's Conjecture: Every Graph Containing no Fully Odd K_4 is 
3-Colorable 252 
Wenan Zang 
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter 262 
Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu and Men-Yang Lin 
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strat- 
egy of a Tree 272 
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko and 
Chuan Yi Tang 
Graph Theory (II) 
A Graph Optimization Problem in Virtual Colonoscopy 282 
Jie Wang and Yaorong Ge 
Approximation and Exact Algorithms for Constructing Minimum Ultra- 
metric Trees from Distance Matrices 292 
Bang Ye Wu, Kun-Mao Chao and Chuan Yi Tang 
An Optimal Algorithm for Finding the Minimum Cardinality Dominating 
Set on Permutation Graphs 302 
H. S. Chao, F. R. Hsu and R. C. T. Lee 
Combinatorics and Cryptography 
Similarity in Two-Dimensional Strings 312 
Ricardo A. Baeza-Yates 
On Multi-Dimensional Hilbert Indexings 322 
Jochen Alber and Rolf Niedermeier 
Combinatorial Properties of Classes of Functions Hard to Compute in 
Constant Depth 332 
Anna Bernasconi 
Eulerian Secret Key Exchange 342 
Takaaki Mizuki, Hiroki Shizuya and Takao Nishizeki 
One-Time Tables for Two-Party Computation 354 
Donald Beaver 
Author Index 364 
END
