Skip to content

Computing and Combinatorics 5th Annual International Conference, Cocoon'99, Tokyo, Japan, July 26-28, 1999, Proceedings

Spend $50 to get a free movie!

ISBN-10: 3540662006

ISBN-13: 9783540662006

Edition: 1999

Authors: Takao Asano, Hiroshi Imai, D. T. Lee, Shin-ichi Nakano, Takeshi Tokuyama

List price: $129.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


This book constitutes the refereed proceedings of the 5th Annual International Conference on Computing and Combinatorics, COCOON'99, held in Tokyo, Japan in July 1999. The 46 revised papers presented were carefully reviewed and selected from a total of 88 submissions; also included are two invited survey papers. The papers are organized in topical sections on data structures, computational biology, graph drawing, discrete mathematics, graph algorithms, automata and languages, complexity theory and learning, combinatorial optimization, number theory, distributed computing, network routing, computational geometry, online algorithms, rewriting systems, and parallel computing.
Customers also bought

Book details

List price: $129.00
Copyright year: 1999
Publisher: Springer Berlin / Heidelberg
Publication date: 7/7/1999
Binding: Paperback
Pages: 494
Size: 6.10" wide x 9.25" long x 0.75" tall
Weight: 3.476
Language: English

Hiroshi Imai was born in 1958 at Kobe, Japan. He obtained B.Eng. in Mathematical Engineering, and M.Eng. and D.Eng. in Information Engineering, University of Tokyo in 1981, 1983 and 1986, respectively. In 1986-1990, he was an associate professor of Department of Computer Science and Communication Engineering, Kyushu University. He was also a visiting associate professor at School of Computer Science, McGill University in 1987 and a visiting scientist at IBM T. J. Watson Research Center in 1988. Since 1990, he joined Department of Information Science, University of Tokyo. He is now a professor in Department of Computer Science, Univeristy of Tokyo. He has been a project leader of ERATO…    

The Web as a Graph: Measurements, Models and Methods
Some Observations on the Computational Complexity of Graph Accessibility Problem
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree
Theory of 2-3 Heaps
An External Memory Data Structure for Shortest Path Queries
Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees
Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations
An Approximation Algorithm for the Two-Layered Graph Drawing Problem
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Layout Problems on Lattice Graphs
A New Transference Theorem in the Geometry of Numbers
On Covering and Rank Problems for Boolean Matrices and Their Applications
A Combinatorial Algorithm for Pfaffians
How to Swap a Failing Edge of a Single Source Shortest Paths Tree
On Bounds for the [kappa]-Partitioning of Graphs
A Faster Algorithm for Computing Minimum 5-way and 6-way Cuts
Probabilities to Accept Languages by Quantum Finite Automata
Distributionally-Hard Languages
Circuits and Context-Free Languages
On the Negation-Limited Circuit Complexity of Merging
Super-Polynomial versus Half-Exponential Circuit Size in the Exponential Hierarchy
Efficient Learning of Some Linear Matrix Languages
Minimizing Mean Response Time in Batch Processing System
Approximation Algorithms for Bounded Facility Location
Scheduling Trees onto Hypercubes and Grids Is NP Complete
Approximations of Weighted Independent Set and Hereditary Subset Problems
Multi-Coloring Trees
On the Complexity of Approximating Colored-Graph Problems
On the Average Sensitivity of Testing Square-Free Numbers
Binary Enumerability of Real Numbers
GCD of Many Integers
Multi-party Finite Computations
Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
A Dynamic Programming Bound for the Quadratic Assignment Problem
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
On Routing in Circulant Graphs
Minimum Congestion Embedding of Complete Binary Trees into Tori
Maximum Stabbing Line in 2D Plane
Generalized Shooter Location Problem
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory
Using Generalized Forecasts for Online Currency Conversion
On S-regular Prefix-Rewriting Systems and Automatic Structures
Tractable and Intractable Second-Order Matching Problems
Efficient Fixed-Size Systolic Arrays for the Modular Multiplication
Improving Parallel Computation with Fast Integer Sorting
A Combinatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
Author Index