An Adaptive Distributed Fault-Tolerant Routing Algorithm for
the Star Graph
--- Leqiang Bai and Hiroyuki Ebara and Hideo Nakano and
Hajime Maeda
Two-face Horn extensions
--- Thomas Eiter and Toshihide Ibaraki and Kazuhisa Makino
Approximating Unweighted Connectivity Problems in Parallel
--- Zhi-Zhong Chen
Peg-Solitaire, String Rewriting Systems and Finite Automata
--- B. Ravikumar
A Faster One-Dimensional Topological Compaction Algorithm
with Jog Insertion
--- Hsiao-Feng S. Chen and D. T. Lee
Complexity and Modeling Aspects of Mesh Refinement
into Quadrilaterals
--- Rolf H. Mohring and Matthias Muller-Hannemann
On the Size of Probabilistic Formulae
--- Hartmut Klauck
Algorithms for Enumerating All Perfect, Maximum and
Maximal Matchings in Bipartite Graphs
--- Takeaki UNO
Optimal fault-tolerant broadcasting in trees
--- Petrisor Panaite and Andrzej Pelc
On Defect Sets on Bipartite Graphs
--- P.E.Haxell and M.Loebl
The Complexity of Learning Branches and Strategies
from Queries
--- Mattias Ott and Frank Stephan
Airline Crew Scheduling Problem with Many
Irregular Flights
--- Akira Tajima and Shinji Misono
Practical Approach to a Faculty Location Problem
for Large=Scale Logistics
--- Kazuyoshi Hidaka and Hiroyuki Okano
Algorithms for Finding Optimal Disjoint Paths Around a
Rectangle
--- Wun-Tat Chan and Francis Y.L. Chin
Playing Tetris on Meshes and Mutil-Dimensional
SHEARSORT
--- Miroslaw Kutylowski and Rolf Wanka
Augmenting Edge and Vertex Connectivities Simultaneously
--- Toshimasa ISHII and Hiroshi NAGAMOCHI and Toshihide IBARAKI
A Characterization of Planar Graphs by
Pseudo-Line Arrangements
--- Hisao Tamaki and Takeshi Tokuyama
Multi-Color Routing in the Undirected Hypercube
--- Qian-Ping Gu and Hisao Tamaki
On-Line versus Off-line in Money-Making Strategies
with Brokerage
--- Eisuke Dannoura Kouichi Sakurai
Dynamic Programming on Distance-Hereditary Graphs
--- Maw-Shang Chang and Sun-Yuan Hsieh and Gen-Huey Chen
Competitive Source Routing on Tori and Meshes
--- Tzuoo-Hawn Yeh and Cheng-Ming Kuo and Chin-Luang Lei and
Hsu-Chun Yen
A Theoretical Framework of Hybrid Approaches to MAX SAT
--- Takao Asano and Kuniaki Hori and Takao Ono and Tomio Hirata
Topology Oriented vs Exact Arithmetic -
Experience in Implementing the Three-Dimensional
Convex Hull Algorithm
--- Tsuyoshi Minakawa and Kokichi Sugihara
Hard Instance Generation for SAT
--- Satoshi Horie and Osamu Watanabe
A Randomized Linear Work EREW PRAM Algorithm to Find
a Minimum Spanning Tree
--- C.K. Poon and Vijaya Ramachandran
Decision-Making by Hierarchies of Discordant Agents
--- XiaoTie Deng and Christos Papadimitriou
An Efficient Approximation Scheme for the Subset-Sum Problem
--- Hans Kellerer and Maria Grazia Speranza
Homophonic Coding with Logarithmic Memory Size
--- Boris Ryabko and Andrey Fionov
All-Cavity Maximum Matchings
--- Ming-Tang Kao and Tak Wah Lam and Wing Kin Sung
and Hing Fung Ting
Efficient Parallel Algorithms for Planar st-Graphs
--- Mikhail J. Atallah and Danny Z. Chen and Ovidiu Daescu
Formulation of the Addition-Shift-Sequence Problem and its
Complexity
--- Akihiro Matsuura and Akira Nagoya
An Algorithm for Finding a Region with the Minimum Total
L1-Distance from Prescibed Terminals
--- Yoshiyuki Kusakari and Takao Nishizeki
Exponential Lower Bounds on the Size of OBDDs Representing
Integer Division
--- Takashi Horiyama and Shuzo Yajima
Competitive Call Control in Mobile Networks
--- Grammati E. Pantziou and George Pentaris and Paul Spirakis
On the Equivalence in Complexity among Basic Problems
on Bipartite and Parity Graphs
--- Serafino Cicerone and Gabriele Di Stefano
Singularities Make Spatial Join Scheduling Hard
--- Gabriele Neyer and Peter Widmayer
An Efficient Off-Line Anonymous Cash Scheme
--- Kenny Nguyen and Vijay Varadharajan and Yi Mu
Time Reversibility : A Mathematical Tool for Creating Arbitrary
Generalized Swap-with-Parent Self-Organizing Lists
--- John Oommen and Juan Dong
Weighted and Unweighted Selection in k Sorted Sequences
--- Tatsuya Hayashi and Koji Nakano and Stephan Olariu
Fast Algorithms for Computing B-Skeletons and their Relatives
--- S. V. Rao and Asish Mukhopadhyay
Decremental Maintenance of Reachability in Hypergraphs
and Minimum Models of Horn Formulae
--- Giorgio Ausiello and Paolo Giulio Franciosa and Daniele Frigion
and Roberto Giaccio
A Branch-and-Cut Approach for Minimum Weight Triangulation
--- Yoshiaki Kyoda and Keiko Imai