
Algorithms and Computation
by Oscar H. Ibarra, Kyung-Yong Chwa
No club is reading this yet — be the first to start one
Author: Kyung-Yong Chwa, Oscar H. Ibarra
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-65385-1
DOI: 10.1007/3-540-49381-6
Table of Contents:
- The Discrepancy Method
- Implementing Algorithms and Data Structures: An Educational and Research Perspective
- L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
- Facility Location on Terrains
- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words
- Disjunctions of Horn Theories and Their Cores
- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It
- Two-Layer Planarization in Graph Drawing
- Computing Orthogonal Drawings in a Variable Embedding Setting
- Dynamic Grid Embedding with Few Bends and Changes
- Two New Families of List Update Algorithms
- An Optimal Algorithm for On-Line Palletizing at Delivery Industry
- On-Line Scheduling of Parallel Jobs with Runtime Restrictions
- Testing the Quality of Manufactured Disks and Cylinders
- Casting with Skewed Ejection Direction
- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image
- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
- Polyhedral Structure of Submodular and Posi-modular Systems
- Maximizing the number of Connections in Optical Tree Networks
Discuss Algorithms and Computation with other readers
Join or start a book club for Algorithms and Computation on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Algorithms and Computation?
Sign up free on Readfeed, then browse public clubs or start your own club with Algorithms and Computation as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Algorithms and Computation with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithms and Computation with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.