↓ 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 Completeness for Parity Problems
  3. Altmetric Badge
    Chapter 2 Monotony and Surprise
  4. Altmetric Badge
    Chapter 3 Smoothed Analysis of Algorithms and Heuristics
  5. Altmetric Badge
    Chapter 4 Gene Network: Model, Dynamics and Simulation
  6. Altmetric Badge
    Chapter 5 Conserved Interval Distance Computation Between Non-trivial Genomes
  7. Altmetric Badge
    Chapter 6 RNA Multiple Structural Alignment with Longest Common Subsequences
  8. Altmetric Badge
    Chapter 7 Perfect Sorting by Reversals
  9. Altmetric Badge
    Chapter 8 Genome Rearrangements with Partially Ordered Chromosomes
  10. Altmetric Badge
    Chapter 9 Quartet-Based Phylogeny Reconstruction from Gene Orders
  11. Altmetric Badge
    Chapter 10 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
  12. Altmetric Badge
    Chapter 11 RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
  13. Altmetric Badge
    Chapter 12 A New Pseudoknots Folding Algorithm for RNA Structure Prediction
  14. Altmetric Badge
    Chapter 13 Rapid Homology Search with Two-Stage Extension and Daughter Seeds
  15. Altmetric Badge
    Chapter 14 On the Approximation of Computing Evolutionary Trees
  16. Altmetric Badge
    Chapter 15 Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
  17. Altmetric Badge
    Chapter 16 Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
  18. Altmetric Badge
    Chapter 17 Construction of Scale-Free Networks with Partial Information
  19. Altmetric Badge
    Chapter 18 Radio Networks with Reliable Communication
  20. Altmetric Badge
    Chapter 19 Geometric Network Design with Selfish Agents
  21. Altmetric Badge
    Chapter 20 Bicriteria Network Design via Iterative Rounding
  22. Altmetric Badge
    Chapter 21 Interference in Cellular Networks: The Minimum Membership Set Cover Problem
  23. Altmetric Badge
    Chapter 22 Routing and Coloring for Maximal Number of Trees
  24. Altmetric Badge
    Chapter 23 Share the Multicast Payment Fairly
  25. Altmetric Badge
    Chapter 24 On Packing and Coloring Hyperedges in a Cycle
  26. Altmetric Badge
    Chapter 25 Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
  27. Altmetric Badge
    Chapter 26 Best Fitting Fixed-Length Substring Patterns for a Set of Strings
  28. Altmetric Badge
    Chapter 27 String Coding of Trees with Locality and Heritability
  29. Altmetric Badge
    Chapter 28 Finding Longest Increasing and Common Subsequences in Streaming Data
  30. Altmetric Badge
    Chapter 29 O ( n 2 log n ) Time On-Line Construction of Two-Dimensional Suffix Trees
  31. Altmetric Badge
    Chapter 30 Min-Energy Voltage Allocation for Tree-Structured Tasks
  32. Altmetric Badge
    Chapter 31 Semi-online Problems on Identical Machines with Inexact Partial Information
  33. Altmetric Badge
    Chapter 32 On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
  34. Altmetric Badge
    Chapter 33 Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling
  35. Altmetric Badge
    Chapter 34 Oblivious and Adaptive Strategies for the Majority and Plurality Problems
  36. Altmetric Badge
    Chapter 35 A Note on Zero Error Algorithms Having Oracle Access to One NP Query
  37. Altmetric Badge
    Chapter 36 On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain
  38. Altmetric Badge
    Chapter 37 Solovay Reducibility on D-c.e Real Numbers
  39. Altmetric Badge
    Chapter 38 Algorithms for Terminal Steiner Trees
  40. Altmetric Badge
    Chapter 39 Simple Distributed Algorithms for Approximating Minimum Steiner Trees
  41. Altmetric Badge
    Chapter 40 A Truthful (2–2/ k )-Approximation Mechanism for the Steiner Tree Problem with k Terminals
  42. Altmetric Badge
    Chapter 41 Radial Coordinate Assignment for Level Graphs
  43. Altmetric Badge
    Chapter 42 A Theoretical Upper Bound for IP-Based Floorplanning
  44. Altmetric Badge
    Chapter 43 Quantum Noisy Rational Function Reconstruction
  45. Altmetric Badge
    Chapter 44 Promised and Distributed Quantum Search
  46. Altmetric Badge
    Chapter 45 Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
  47. Altmetric Badge
    Chapter 46 Randomized Quicksort and the Entropy of the Random Source
  48. Altmetric Badge
    Chapter 47 Subquadratic Algorithm for Dynamic Shortest Distances
  49. Altmetric Badge
    Chapter 48 Randomly Generating Triangulations of a Simple Polygon
  50. Altmetric Badge
    Chapter 49 Triangulating a Convex Polygon with Small Number of Non-standard Bars
  51. Altmetric Badge
    Chapter 50 A PTAS for a Disc Covering Problem Using Width-Bounded Separators
  52. Altmetric Badge
    Chapter 51 Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy
  53. Altmetric Badge
    Chapter 52 Distributions of Points in d Dimensions and Large k -Point Simplices
  54. Altmetric Badge
    Chapter 53 Exploring Simple Grid Polygons
  55. Altmetric Badge
    Chapter 54 Approximation Algorithms for Cutting Out Polygons with Lines and Rays
  56. Altmetric Badge
    Chapter 55 Efficient Non-intersection Queries on Aggregated Geometric Data
  57. Altmetric Badge
    Chapter 56 An Upper Bound on the Number of Rectangulations of a Point Set
  58. Altmetric Badge
    Chapter 57 Opportunistic Data Structures for Range Queries
  59. Altmetric Badge
    Chapter 58 Generating Combinations by Prefix Shifts
  60. Altmetric Badge
    Chapter 59 Error-Set Codes and Related Objects
  61. Altmetric Badge
    Chapter 60 On Walrasian Price of CPU Time
  62. Altmetric Badge
    Chapter 61 On-Line Algorithms for Market Equilibria
  63. Altmetric Badge
    Chapter 62 Interval Subset Sum and Uniform-Price Auction Clearing
  64. Altmetric Badge
    Chapter 63 Improved Algorithms for the K -Maximum Subarray Problem for Small K
  65. Altmetric Badge
    Chapter 64 Server Allocation Algorithms for Tiered Systems
  66. Altmetric Badge
    Chapter 65 An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties
  67. Altmetric Badge
    Chapter 66 The Reverse Greedy Algorithm for the Metric K -Median Problem
  68. Altmetric Badge
    Chapter 67 On Approximate Balanced Bi-clustering
  69. Altmetric Badge
    Chapter 68 Toroidal Grids Are Anti-magic
  70. Altmetric Badge
    Chapter 69 Optimally Balanced Forward Degree Sequence
  71. Altmetric Badge
    Chapter 70 Conditionally Critical Indecomposable Graphs
  72. Altmetric Badge
    Chapter 71 A Tight Analysis of the Maximal Matching Heuristic
  73. Altmetric Badge
    Chapter 72 New Streaming Algorithms for Counting Triangles in Graphs
  74. Altmetric Badge
    Chapter 73 A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
  75. Altmetric Badge
    Chapter 74 On the Power of Lookahead in On-Line Vehicle Routing Problems
  76. Altmetric Badge
    Chapter 75 Efficient Algorithms for Simplifying Flow Networks
  77. Altmetric Badge
    Chapter 76 Approximation Algorithms for the b -Edge Dominating Set Problem and Its Related Problems
  78. Altmetric Badge
    Chapter 77 Bounded Degree Closest k -Tree Power Is NP-Complete
  79. Altmetric Badge
    Chapter 78 A New Algorithm for the Hypergraph Transversal Problem
  80. Altmetric Badge
    Chapter 79 On Finding a Shortest Path in Circulant Graphs with Two Jumps
  81. Altmetric Badge
    Chapter 80 A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
  82. Altmetric Badge
    Chapter 81 Algorithms for Finding Distance-Edge-Colorings of Graphs
  83. Altmetric Badge
    Chapter 82 On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs
  84. Altmetric Badge
    Chapter 83 Power Domination Problem in Graphs
  85. Altmetric Badge
    Chapter 84 Complexity and Approximation of Satisfactory Partition Problems
  86. Altmetric Badge
    Chapter 85 Distributed Weighted Vertex Cover via Maximal Matchings
  87. Altmetric Badge
    Chapter 86 On the Complexity of the Balanced Vertex Ordering Problem
  88. Altmetric Badge
    Chapter 87 An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
  89. Altmetric Badge
    Chapter 88 Approximating the Longest Cycle Problem on Graphs with Bounded Degree
  90. Altmetric Badge
    Chapter 89 Bin Packing and Covering Problems with Rejection
  91. Altmetric Badge
    Chapter 90 Query-Monotonic Turing Reductions
  92. Altmetric Badge
    Chapter 91 On Sequential and 1-Deterministic P Systems
  93. Altmetric Badge
    Chapter 92 Global Optimality Conditions and Near-Perfect Optimization in Coding
  94. Altmetric Badge
    Chapter 93 Angel, Devil, and King
  95. Altmetric Badge
    Chapter 94 Overlaps Help: Improved Bounds for Group Testing with Interval Queries
  96. Altmetric Badge
    Chapter 95 New Efficient Simple Authenticated Key Agreement Protocol
  97. Altmetric Badge
    Chapter 96 A Quadratic Lower Bound for Rocchio’s Similarity-Based Relevance Feedback Algorithm
  98. Altmetric Badge
    Chapter 97 The Money Changing Problem Revisited: Computing the Frobenius Number in Time O ( ka 1 )
  99. Altmetric Badge
    Chapter 98 W -Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
  100. Altmetric Badge
    Chapter 99 Some New Results on Inverse Sorting Problems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
patent
1 patent
wikipedia
1 Wikipedia page

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
14 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 2005
DOI 10.1007/11533719
ISBNs
978-3-54-028061-3, 978-3-54-031806-4
Editors

Wang, Lusheng

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 14 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 7%
Professor > Associate Professor 1 7%
Lecturer 1 7%
Student > Doctoral Student 1 7%
Unknown 10 71%
Readers by discipline Count As %
Mathematics 2 14%
Computer Science 1 7%
Agricultural and Biological Sciences 1 7%
Unknown 10 71%