↓ 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 Efficient Compression of Web Graphs
  3. Altmetric Badge
    Chapter 2 Damaged BZip Files Are Difficult to Repair
  4. Altmetric Badge
    Chapter 3 Isoperimetric Problem and Meta-fibonacci Sequences
  5. Altmetric Badge
    Chapter 4 On the Complexity of Equilibria Problems in Angel-Daemon Games
  6. Altmetric Badge
    Chapter 5 Average-Case Competitive Analyses for One-Way Trading
  7. Altmetric Badge
    Chapter 6 On the Monotonicity of Weak Searching
  8. Altmetric Badge
    Chapter 7 VC Dimension Bounds for Analytic Algebraic Computations
  9. Altmetric Badge
    Chapter 8 Resource Bounded Frequency Computations with Three Errors
  10. Altmetric Badge
    Chapter 9 A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
  11. Altmetric Badge
    Chapter 10 Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
  12. Altmetric Badge
    Chapter 11 Counting Polycubes without the Dimensionality Curse
  13. Altmetric Badge
    Chapter 12 Polychromatic Colorings of n -Dimensional Guillotine-Partitions
  14. Altmetric Badge
    Chapter 13 The Computational Complexity of Link Building
  15. Altmetric Badge
    Chapter 14 Improved Parameterized Algorithms for Weighted 3-Set Packing
  16. Altmetric Badge
    Chapter 15 Structural Identifiability in Low-Rank Matrix Factorization
  17. Altmetric Badge
    Chapter 16 Complexity of Counting the Optimal Solutions
  18. Altmetric Badge
    Chapter 17 The Orbit Problem Is in the GapL Hierarchy
  19. Altmetric Badge
    Chapter 18 Quantum Separation of Local Search and Fixed Point Computation
  20. Altmetric Badge
    Chapter 19 Multi-party Quantum Communication Complexity with Routed Messages
  21. Altmetric Badge
    Chapter 20 Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
  22. Altmetric Badge
    Chapter 21 Approximating Alternative Solutions
  23. Altmetric Badge
    Chapter 22 Dimensions of Points in Self-similar Fractals
  24. Altmetric Badge
    Chapter 23 Visual Cryptography on Graphs
  25. Altmetric Badge
    Chapter 24 Algebraic Cryptanalysis of CTRU Cryptosystem
  26. Altmetric Badge
    Chapter 25 Detecting Community Structure by Network Vectorization
  27. Altmetric Badge
    Chapter 26 Quasi-bicliques: Complexity and Binding Pairs
  28. Altmetric Badge
    Chapter 27 Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
  29. Altmetric Badge
    Chapter 28 Genome Halving under DCJ Revisited
  30. Altmetric Badge
    Chapter 29 Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
  31. Altmetric Badge
    Chapter 30 Adjacent Swaps on Strings
  32. Altmetric Badge
    Chapter 31 Efficient Algorithms for SNP Haplotype Block Selection Problems
  33. Altmetric Badge
    Chapter 32 Sequence Alignment Algorithms for Run-Length-Encoded Strings
  34. Altmetric Badge
    Chapter 33 A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
  35. Altmetric Badge
    Chapter 34 A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
  36. Altmetric Badge
    Chapter 35 Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
  37. Altmetric Badge
    Chapter 36 On Center Regions and Balls Containing Many Points
  38. Altmetric Badge
    Chapter 37 On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
  39. Altmetric Badge
    Chapter 38 New Algorithms for Online Rectangle Filling with k -Lookahead
  40. Altmetric Badge
    Chapter 39 Geometric Spanner of Objects under L 1 Distance
  41. Altmetric Badge
    Chapter 40 Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
  42. Altmetric Badge
    Chapter 41 A New Characterization of P 6 -Free Graphs
  43. Altmetric Badge
    Chapter 42 Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
  44. Altmetric Badge
    Chapter 43 Efficient Algorithms for the k Smallest Cuts Enumeration
  45. Altmetric Badge
    Chapter 44 Covering Directed Graphs by In-Trees
  46. Altmetric Badge
    Chapter 45 On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
  47. Altmetric Badge
    Chapter 46 Probe Ptolemaic Graphs
  48. Altmetric Badge
    Chapter 47 Diagnosability of Two-Matching Composition Networks
  49. Altmetric Badge
    Chapter 48 The Iterated Restricted Immediate Snapshot Model
  50. Altmetric Badge
    Chapter 49 Finding Frequent Items in a Turnstile Data Stream
  51. Altmetric Badge
    Chapter 50 A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d -ary Multilog Networks under General Crosstalk Constraints
  52. Altmetric Badge
    Chapter 51 Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
  53. Altmetric Badge
    Chapter 52 Throughput Maximization with Traffic Profile in Wireless Mesh Network
  54. Altmetric Badge
    Chapter 53 Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment
  55. Altmetric Badge
    Chapter 54 (6 +  ε )-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
  56. Altmetric Badge
    Chapter 55 Spectrum Bidding in Wireless Networks and Related
  57. Altmetric Badge
    Chapter 56 (1 +  ρ )-Approximation for Selected-Internal Steiner Minimum Tree
  58. Altmetric Badge
    Chapter 57 Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
  59. Altmetric Badge
    Chapter 58 Spreading Messages
  60. Altmetric Badge
    Chapter 59 On Some City Guarding Problems
  61. Altmetric Badge
    Chapter 60 Optimal Insertion of a Segment Highway in a City Metric
  62. Altmetric Badge
    Chapter 61 Approximating the Generalized Capacitated Tree-Routing Problem
  63. Altmetric Badge
    Chapter 62 Column Generation Algorithms for the Capacitated m -Ring-Star Problem
  64. Altmetric Badge
    Chapter 63 Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
  65. Altmetric Badge
    Chapter 64 A Two-Stage Flexible Flowshop Problem with Deterioration
  66. Altmetric Badge
    Chapter 65 A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
  67. Altmetric Badge
    Chapter 66 The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

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
Computing and Combinatorics
Published by
Springer Berlin Heidelberg, June 2008
DOI 10.1007/978-3-540-69733-6
ISBNs
978-3-54-069732-9, 978-3-54-069733-6
Editors

Hu, Xiaodong, Wang, Jie

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 > Master 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Unknown 1 50%