Abstract is missing.
- Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)Toshihide Ibaraki. 1
- Airline Crew-Scheduling Problem with Many Irregular FlightsAkira Tajima, Shinji Misono. 2-11
- Practical Approach to a Facility Location Problem for Large-Scale LogisticsKazuyoshi Hidaka, Hiroyuki Okano. 12-21
- Hard Instance Generation for SAT (Extended Abstract)Satoshi Horie, Osamu Watanabe. 22-31
- Playing Tetris on Meshes and Multi-Dimensional SHEARSORTMiroslaw Kutylowski, Rolf Wanka. 32-41
- Formulation of the Addition-Shift-Sequence Problem and Its ComplexityKaihiro Matsuura, Akira Nagoya. 42-51
- Weighted and Unweighted Selection Algorithms for k Sorted SequencesTatsuya Hayashi, Koji Nakano, Stephan Olariu. 52-61
- An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star GraphLeqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda. 62-71
- Multi-Color Routing in the Undirected HypercubeQian-Ping Gu, Hisao Tamaki. 72-81
- Competitive Source Routing on Tori and MeshesTzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen. 82-91
- Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite GraphsTakeaki Uno. 92-101
- Augmenting Edge and Vertex Connectivities SimultaneouslyToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki. 102-111
- Two-Face Horn ExtensionsThomas Eiter, Toshihide Ibaraki, Kazuhisa Makino. 112-121
- Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn FormulaeGiorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. 122-131
- Algorithmic Analysis of Multithreaded Algorithms (Abstract)Charles E. Leiserson. 132
- A Characterization of Planar Graphs by Pseudo-Line ArrangementsHisao Tamaki, Takeshi Tokuyama. 133-142
- Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract)Petrisor Panaite, Andrzej Pelc. 143-152
- A Theoretical Framework of Hybrid Approaches to MAX SATTakao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata. 153-162
- Exponential Lower Bounds on the Size of OBDDs Representing Integer DivistionTakashi Horiyama, Shuzo Yajima. 163-172
- On-Line Versus Off-Line in Money-Making Strategies with BROKERAGEEisuke Dannoura, Kouichi Sakurai. 173-182
- Decision-Making by Hierarchies of Discordant AgentsXiaotie Deng, Christos H. Papadimitriou. 183-192
- A New Efficient Off-line Anonymous Cash SchemeKhanh Quoc Nguyen, Vijay Varadharajan, Yi Mu. 193-201
- Approximating Unweighted Connectivity Problems in ParallelZhi-Zhong Chen. 202-211
- A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning ForestChung Keung Poon, Vijaya Ramachandran. 212-222
- Efficient Parallel Algorithms for Planar ::::st::::-GraphsMikhail J. Atallah. 223-232
- Peg-Solitaire, String Rewriting Systems and Finite AutomataBala Ravikumar. 233-242
- On the Size of Probabilistic FormulaeHartmut Klauck. 243-252
- Homophonic Coding with Logarithmic Memory SizeBoris Ryabko, Andrei Fionov. 253-262
- Complexity and Modeling Aspects of Mesh Refinement into QuadrilateralsRolf H. Möhring, Matthias Müller-Hannemann. 263-272
- Topology Oriented vs. Exact Arithmetic - Experience in Implementing the Three-Dimensional Convex Hull AlgorithmTsuyoshi Minakawa, Kokichi Sugihara. 273-282
- The Complexity of Learning Branches and Strategies from QueriesMatthias Ott, Frank Stephan. 283-292
- Singularities Make Spatial Join Scheduling HardGabriele Neyer, Peter Widmayer. 293-302
- A Faster One-Dimensional Topological Compaction AlgorithmHsiao-Feng Steven Chen, D. T. Lee. 303-313
- Algorithms for Finding Optimal Disjoint Paths Around a RectangleWun-Tat Chan, Francis Y. L. Chin. 314-323
- An Algorithm for Finding a Region with the Minimum Lotal L::1:: from Prescribed TerminalsYoshiyuki Kusakari, Takao Nishizeki. 324-333
- On Defect Sets in Bipartite Graphs (Extended Abstract)Penny E. Haxell, Martin Loebl. 334-343
- Dynamic Programming on Distance-Hereditary GraphsMaw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen. 344-353
- On the Equivalence in Complexity among Basic Problems on Bipartite and Parity GraphsSerafino Cicerone, Gabriele Di Stefano. 354-363
- All-Cavity Maximum MatchingsMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. 364-373
- Fast Algorithms for Computing beta-Skeletons and Their RelativesS. V. Rao, Asish Mukhopadhyay. 374-383
- A Branch-and-Cut Approach for Minimum Weight TriangulationYoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima. 384-393
- An Efficient Approximation Scheme for the Subset-Sum ProblemHans Kellerer, Ulrich Pferschy, Maria Grazia Speranza. 394-403
- Competitive Call Control in Mobile NetworksGrammati E. Pantziou, George P. Pentaris, Paul G. Spirakis. 404-413
- Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear ListsB. John Oommen, Juan Dong. 414-423