This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33]. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
planar automorphism group, entanglement ensemble, median queries, global roundings, matroidal model, quantum query model, waiting region, chordal subgraph, geometric dilation, clairvoyant user model, covering suites, descendent subtrees, greedy user model, inactive vertices, nearest subtrees, cheapest proof, stable marriage model, train rostering, forced rectangle, hypergraph decomposition, satisfactory subset, quaternion polynomials, canonical alignment, frictionless point contacts, incremental polynomial time Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Springer-Verlag Berlin Heidelberg, Theory of Computing, Springer Verlag, Searchable Partial Sums, Annual Symposium, Discrete Applied Mathematics, Cambridge University Press, Discrete Mathematics, Journal of Algorithms, International Symposium, Hong Kong, International Colloquium, Operations Research, Academic Press, Introduction Given, Journal of Cryptology, Labeled Search, Meet Odd Diameter Requirements, Ministry of Education, Rinnooy Kan, Symbolically Represented Graphs, American Mathematical Society, Computer Society, John Wiley New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33]. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
planar automorphism group, entanglement ensemble, median queries, global roundings, matroidal model, quantum query model, waiting region, chordal subgraph, geometric dilation, clairvoyant user model, covering suites, descendent subtrees, greedy user model, inactive vertices, nearest subtrees, cheapest proof, stable marriage model, train rostering, forced rectangle, hypergraph decomposition, satisfactory subset, quaternion polynomials, canonical alignment, frictionless point contacts, incremental polynomial time Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Springer-Verlag Berlin Heidelberg, Theory of Computing, Springer Verlag, Searchable Partial Sums, Annual Symposium, Discrete Applied Mathematics, Cambridge University Press, Discrete Mathematics, Journal of Algorithms, International Symposium, Hong Kong, International Colloquium, Operations Research, Academic Press, Introduction Given, Journal of Cryptology, Labeled Search, Meet Odd Diameter Requirements, Ministry of Education, Rinnooy Kan, Symbolically Represented Graphs, American Mathematical Society, Computer Society, John Wiley New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 77
books:
See all 77 books this book cites
- Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences) by Michael A. Nielsen on page 188, page 198, and page 208
- Progress in Graph Theory by John Adrian Bondy on page 4, and page 5
- The Design and Analysis of Computer Algorithms by Alfred V. Aho on page 211, and page 563
- Parameterized Complexity (Monographs in Computer Science) by Rodney G. Downey on page 97, and page 157
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg on page 45, and page 211
See all 77 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science
- Books > Computers & Technology > Databases
- Books > Computers & Technology > Hardware > Internet & Networking
- Books > Computers & Technology > Networking > Networks, Protocols & APIs
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Graphics & Multimedia
- Books > Computers & Technology > Software
- Books > New & Used Textbooks > Computer Science
