↓ Skip to main content

Algorithms and Computation

Overview of attention for book
Cover of 'Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Discrepancy Method
  3. Altmetric Badge
    Chapter 2 Implementing Algorithms and Data Structures: An Educational and Research Perspective
  4. Altmetric Badge
    Chapter 3 L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
  5. Altmetric Badge
    Chapter 4 Facility Location on Terrains
  6. Altmetric Badge
    Chapter 5 Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
  7. Altmetric Badge
    Chapter 6 Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words
  8. Altmetric Badge
    Chapter 7 Disjunctions of Horn Theories and Their Cores
  9. Altmetric Badge
    Chapter 8 Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It
  10. Altmetric Badge
    Chapter 9 Two-Layer Planarization in Graph Drawing
  11. Altmetric Badge
    Chapter 10 Computing Orthogonal Drawings in a Variable Embedding Setting
  12. Altmetric Badge
    Chapter 11 Dynamic Grid Embedding with Few Bends and Changes
  13. Altmetric Badge
    Chapter 12 Two New Families of List Update Algorithms
  14. Altmetric Badge
    Chapter 13 An Optimal Algorithm for On-Line Palletizing at Delivery Industry
  15. Altmetric Badge
    Chapter 14 On-Line Scheduling of Parallel Jobs with Runtime Restrictions
  16. Altmetric Badge
    Chapter 15 Testing the Quality of Manufactured Disks and Cylinders
  17. Altmetric Badge
    Chapter 16 Casting with Skewed Ejection Direction
  18. Altmetric Badge
    Chapter 17 Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image
  19. Altmetric Badge
    Chapter 18 k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
  20. Altmetric Badge
    Chapter 19 Polyhedral Structure of Submodular and Posi-modular Systems
  21. Altmetric Badge
    Chapter 20 Maximizing the number of Connections in Optical Tree Networks
  22. Altmetric Badge
    Chapter 21 Selecting the k Largest Elements with Parity Tests
  23. Altmetric Badge
    Chapter 22 Randomized K-Dimensional Binary Search Trees
  24. Altmetric Badge
    Chapter 23 Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks
  25. Altmetric Badge
    Chapter 24 Random Regular Graphs with Edge Faults: Expansion through Cores
  26. Altmetric Badge
    Chapter 25 A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem
  27. Altmetric Badge
    Chapter 26 Generalized Graph Colorability and Compressibility of Boolean Formulae
  28. Altmetric Badge
    Chapter 27 On the Complexity of Free Monoid Morphisms
  29. Altmetric Badge
    Chapter 28 Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
  30. Altmetric Badge
    Chapter 29 Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs
  31. Altmetric Badge
    Chapter 30 Finding Planar Geometric Automorphisms in Planar Graphs
  32. Altmetric Badge
    Chapter 31 New Approach for Speeding Up Enumeration Algorithms
  33. Altmetric Badge
    Chapter 32 Hamiltonian Decomposition of Recursive Circulants
  34. Altmetric Badge
    Chapter 33 Convertibility among Grid Filling Curves
  35. Altmetric Badge
    Chapter 34 Generalized Self-Approaching Curves
  36. Altmetric Badge
    Chapter 35 The Steiner Tree Problem in λ4-geometry Plane
  37. Altmetric Badge
    Chapter 36 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages
  38. Altmetric Badge
    Chapter 37 On the Multiple Gene Duplication Problem
  39. Altmetric Badge
    Chapter 38 Visibility Queries in Simple Polygons and Applications
  40. Altmetric Badge
    Chapter 39 Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
  41. Altmetric Badge
    Chapter 40 Optimality and Integer Programming Formulations of Triangulations in General Dimension
  42. Altmetric Badge
    Chapter 41 Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
  43. Altmetric Badge
    Chapter 42 A Capacitated Vehicle Routing Problem on a Tree
  44. Altmetric Badge
    Chapter 43 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
  45. Altmetric Badge
    Chapter 44 The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
  46. Altmetric Badge
    Chapter 45 Inapproximability Results for Guarding Polygons without Holes
  47. Altmetric Badge
    Chapter 46 The Inapproximability of Non NP-hard Optimization Problems
  48. Altmetric Badge
    Chapter 47 An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
  49. Altmetric Badge
    Chapter 48 A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
  50. Altmetric Badge
    Chapter 49 Optimal Approximate Agreement with Omission Faults
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Algorithms and Computation
Published by
Springer, June 2003
DOI 10.1007/3-540-49381-6
ISBNs
978-3-54-049381-5, 978-3-54-065385-1
Editors

Chwa, Kyung-Yong, Ibarra, Oscar H.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Student > Ph. D. Student 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Engineering 1 50%