↓ 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 Understanding and Inductive Inference
  3. Altmetric Badge
    Chapter 2 Computing with Cells: Membrane Systems
  4. Altmetric Badge
    Chapter 3 Boxicity and Poset Dimension
  5. Altmetric Badge
    Chapter 4 On the Hardness against Constant-Depth Linear-Size Circuits
  6. Altmetric Badge
    Chapter 5 A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
  7. Altmetric Badge
    Chapter 6 The Curse of Connectivity: t -Total Vertex (Edge) Cover
  8. Altmetric Badge
    Chapter 7 Counting Paths in VPA Is Complete for # NC 1
  9. Altmetric Badge
    Chapter 8 Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
  10. Altmetric Badge
    Chapter 9 Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
  11. Altmetric Badge
    Chapter 10 Clustering with or without the Approximation
  12. Altmetric Badge
    Chapter 11 A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks
  13. Altmetric Badge
    Chapter 12 Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
  14. Altmetric Badge
    Chapter 13 Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
  15. Altmetric Badge
    Chapter 14 Computing and Combinatorics
  16. Altmetric Badge
    Chapter 15 Triangle-Free 2-Matchings Revisited
  17. Altmetric Badge
    Chapter 16 The Cover Time of Deterministic Random Walks
  18. Altmetric Badge
    Chapter 17 Finding Maximum Edge Bicliques in Convex Bipartite Graphs
  19. Altmetric Badge
    Chapter 18 A Note on Vertex Cover in Graphs with Maximum Degree 3
  20. Altmetric Badge
    Chapter 19 Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
  21. Altmetric Badge
    Chapter 20 Factorization of Cartesian Products of Hypergraphs
  22. Altmetric Badge
    Chapter 21 Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
  23. Altmetric Badge
    Chapter 22 On Three Parameters of Invisibility Graphs
  24. Altmetric Badge
    Chapter 23 Imbalance Is Fixed Parameter Tractable
  25. Altmetric Badge
    Chapter 24 The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs
  26. Altmetric Badge
    Chapter 25 Optimal Binary Space Partitions in the Plane
  27. Altmetric Badge
    Chapter 26 Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
  28. Altmetric Badge
    Chapter 27 Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux
  29. Altmetric Badge
    Chapter 28 Detecting Areas Visited Regularly
  30. Altmetric Badge
    Chapter 29 Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard
  31. Altmetric Badge
    Chapter 30 The Rectilinear k -Bends TSP
  32. Altmetric Badge
    Chapter 31 Tracking a Generator by Persistence
  33. Altmetric Badge
    Chapter 32 Auspicious Tatami Mat Arrangements
  34. Altmetric Badge
    Chapter 33 Faster Generation of Shorthand Universal Cycles for Permutations
  35. Altmetric Badge
    Chapter 34 The Complexity of Word Circuits
  36. Altmetric Badge
    Chapter 35 On the Density of Regular and Context-Free Languages
  37. Altmetric Badge
    Chapter 36 Extensions of the Minimum Cost Homomorphism Problem
  38. Altmetric Badge
    Chapter 37 The Longest Almost-Increasing Subsequence
  39. Altmetric Badge
    Chapter 38 Universal Test Sets for Reversible Circuits
  40. Altmetric Badge
    Chapter 39 Approximate Counting with a Floating-Point Counter
  41. Altmetric Badge
    Chapter 40 Broadcasting in Heterogeneous Tree Networks
  42. Altmetric Badge
    Chapter 41 Contention Resolution in Multiple-Access Channels: k -Selection in Radio Networks
  43. Altmetric Badge
    Chapter 42 Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
  44. Altmetric Badge
    Chapter 43 Discovering Pairwise Compatibility Graphs
  45. Altmetric Badge
    Chapter 44 Near Optimal Solutions for Maximum Quasi-bicliques
  46. Altmetric Badge
    Chapter 45 Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial
  47. Altmetric Badge
    Chapter 46 Constant Time Approximation Scheme for Largest Well Predicted Subset
  48. Altmetric Badge
    Chapter 47 On Sorting Permutations by Double-Cut-and-Joins
  49. Altmetric Badge
    Chapter 48 A Three-String Approach to the Closest String Problem
  50. Altmetric Badge
    Chapter 49 A 2 k Kernel for the Cluster Editing Problem
  51. Altmetric Badge
    Chapter 50 On the Computation of 3D Visibility Skeletons
  52. Altmetric Badge
    Chapter 51 The Violation Heap: A Relaxed Fibonacci-Like Heap
  53. Altmetric Badge
    Chapter 52 Threshold Rules for Online Sample Selection
  54. Altmetric Badge
    Chapter 53 Heterogeneous Subset Sampling
  55. Altmetric Badge
    Chapter 54 Identity-Based Authenticated Asymmetric Group Key Agreement Protocol
  56. Altmetric Badge
    Chapter 55 Zero-Knowledge Argument for Simultaneous Discrete Logarithms
  57. Altmetric Badge
    Chapter 56 Directed Figure Codes: Decidability Frontier
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age (60th percentile)
  • Good Attention Score compared to outputs of the same age and source (73rd percentile)

Mentioned by

wikipedia
1 Wikipedia page

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
Computing and Combinatorics
Published by
ADS, June 2010
DOI 10.1007/978-3-642-14031-0
ISBNs
978-3-64-214030-3, 978-3-64-214031-0
Editors

Thai, My T., Sahni, Sartaj

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

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 20 May 2018.
All research outputs
#4,008,007
of 13,450,780 outputs
Outputs from ADS
#5,435
of 21,764 outputs
Outputs of similar age
#102,748
of 271,501 outputs
Outputs of similar age from ADS
#20
of 98 outputs
Altmetric has tracked 13,450,780 research outputs across all sources so far. This one is in the 49th percentile – i.e., 49% of other outputs scored the same or lower than it.
So far Altmetric has tracked 21,764 research outputs from this source. They receive a mean Attention Score of 4.3. This one is in the 30th percentile – i.e., 30% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 271,501 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 60% of its contemporaries.
We're also able to compare this research output to 98 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 73% of its contemporaries.