↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 External Geometric Data Structures
  3. Altmetric Badge
    Chapter 2 The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k -SAT Problems
  4. Altmetric Badge
    Chapter 3 Robust Geometric Computation Based on Digital Topology
  5. Altmetric Badge
    Chapter 4 Adjacency of Optimal Regions for Huffman Trees
  6. Altmetric Badge
    Chapter 5 A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs
  7. Altmetric Badge
    Chapter 6 Towards Constructing Optimal Strip Move Sequences
  8. Altmetric Badge
    Chapter 7 Large Triangles in the d -Dimensional Unit-Cube
  9. Altmetric Badge
    Chapter 8 Progress on Maximum Weight Triangulation
  10. Altmetric Badge
    Chapter 9 Coloring Octrees
  11. Altmetric Badge
    Chapter 10 Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes
  12. Altmetric Badge
    Chapter 11 Q -Ary Ulam-Rényi Game with Weighted Constrained Lies
  13. Altmetric Badge
    Chapter 12 Necessary and Sufficient Numbers of Cards for the Transformation Protocol
  14. Altmetric Badge
    Chapter 13 On the Selection and Assignment with Minimum Quantity Commitments
  15. Altmetric Badge
    Chapter 14 Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study
  16. Altmetric Badge
    Chapter 15 Transshipment Through Crossdocks with Inventory and Time Windows
  17. Altmetric Badge
    Chapter 16 Approximated Vertex Cover for Graphs with Perfect Matchings
  18. Altmetric Badge
    Chapter 17 An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
  19. Altmetric Badge
    Chapter 18 On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts
  20. Altmetric Badge
    Chapter 19 The Worst-Case Time Complexity for Generating All Maximal Cliques
  21. Altmetric Badge
    Chapter 20 Regular Expressions for Languages over Infinite Alphabets
  22. Altmetric Badge
    Chapter 21 On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations
  23. Altmetric Badge
    Chapter 22 Learning DNFs and Circuits Using Teaching Assistants
  24. Altmetric Badge
    Chapter 23 On the Complexity of Samples for Learning
  25. Altmetric Badge
    Chapter 24 New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
  26. Altmetric Badge
    Chapter 25 Maximization of the Size and the Weight of Schedules of Degradable Intervals
  27. Altmetric Badge
    Chapter 26 Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines
  28. Altmetric Badge
    Chapter 27 Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain
  29. Altmetric Badge
    Chapter 28 Algorithms for Point Set Matching with k -Differences
  30. Altmetric Badge
    Chapter 29 Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon
  31. Altmetric Badge
    Chapter 30 The Traveling Salesman Problem with Few Inner Points
  32. Altmetric Badge
    Chapter 31 A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application
  33. Altmetric Badge
    Chapter 32 Algorithms for the On-Line Quota Traveling Salesman Problem
  34. Altmetric Badge
    Chapter 33 On the Orthogonal Drawing of Outerplanar Graphs
  35. Altmetric Badge
    Chapter 34 Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
  36. Altmetric Badge
    Chapter 35 New Bounds on the Number of Edges in a k -Map Graph
  37. Altmetric Badge
    Chapter 36 Dynamic Storage Allocation and On-Line Colouring Interval Graphs
  38. Altmetric Badge
    Chapter 37 New Approximation Algorithms for Some Dynamic Storage Allocation Problems
  39. Altmetric Badge
    Chapter 38 k -Center Problems with Minimum Coverage
  40. Altmetric Badge
    Chapter 39 On the Extensions of Solovay-Reducibility
  41. Altmetric Badge
    Chapter 40 The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups
  42. Altmetric Badge
    Chapter 41 Computational Complexity Classification of Partition under Compaction and Retraction
  43. Altmetric Badge
    Chapter 42 One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
  44. Altmetric Badge
    Chapter 43 Fault-Tolerant Meshes with Constant Degree
  45. Altmetric Badge
    Chapter 44 Fault Hamiltonicity of Meshes with Two Wraparound Edges
  46. Altmetric Badge
    Chapter 45 On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm
  47. Altmetric Badge
    Chapter 46 An Efficient Online Algorithm for Square Detection
  48. Altmetric Badge
    Chapter 47 An Efficient Local Alignment Algorithm for Masked Sequences
  49. Altmetric Badge
    Chapter 48 Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard
  50. Altmetric Badge
    Chapter 49 Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
5 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
Computing and Combinatorics
Published by
Springer Science & Business Media, August 2004
DOI 10.1007/b99243
ISBNs
978-3-54-022856-1, 978-3-54-027798-9
Editors

Chwa, Kyung-Yong, Munro, J. Ian J.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 40%
Professor > Associate Professor 1 20%
Lecturer 1 20%
Unknown 1 20%
Readers by discipline Count As %
Computer Science 2 40%
Mathematics 1 20%
Agricultural and Biological Sciences 1 20%
Unknown 1 20%