↓ 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 Clairvoyant Mechanisms for Online Auctions
  3. Altmetric Badge
    Chapter 2 Truthfulness for the Sum of Weighted Completion Times
  4. Altmetric Badge
    Chapter 3 Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
  5. Altmetric Badge
    Chapter 4 New Results for Network Pollution Games
  6. Altmetric Badge
    Chapter 5 Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
  7. Altmetric Badge
    Chapter 6 Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
  8. Altmetric Badge
    Chapter 7 A Parameterized Algorithm for Bounded-Degree Vertex Deletion
  9. Altmetric Badge
    Chapter 8 The Monotone Circuit Value Problem with Bounded Genus Is in NC
  10. Altmetric Badge
    Chapter 9 Locality-Sensitive Hashing Without False Negatives for \(l_p\)
  11. Altmetric Badge
    Chapter 10 Improved Space Efficient Algorithms for BFS, DFS and Applications
  12. Altmetric Badge
    Chapter 11 Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
  13. Altmetric Badge
    Chapter 12 Frequent-Itemset Mining Using Locality-Sensitive Hashing
  14. Altmetric Badge
    Chapter 13 On the Hardness of Switching to a Small Number of Edges
  15. Altmetric Badge
    Chapter 14 On Hard Instances of Non-Commutative Permanent
  16. Altmetric Badge
    Chapter 15 The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
  17. Altmetric Badge
    Chapter 16 Minimum Cost Homomorphisms with Constrained Costs
  18. Altmetric Badge
    Chapter 17 An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
  19. Altmetric Badge
    Chapter 18 Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
  20. Altmetric Badge
    Chapter 19 Balls and Funnels: Energy Efficient Group-to-Group Anycasts
  21. Altmetric Badge
    Chapter 20 Assigning Proximity Facilities for Gatherings
  22. Altmetric Badge
    Chapter 21 Combiners for Chosen-Ciphertext Security
  23. Altmetric Badge
    Chapter 22 Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
  24. Altmetric Badge
    Chapter 23 Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits
  25. Altmetric Badge
    Chapter 24 Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
  26. Altmetric Badge
    Chapter 25 The Routing of Complex Contagion in Kleinberg’s Small-World Networks
  27. Altmetric Badge
    Chapter 26 The Maximum Disjoint Routing Problem
  28. Altmetric Badge
    Chapter 27 Balanced Allocation on Graphs: A Random Walk Approach
  29. Altmetric Badge
    Chapter 28 Computing and Combinatorics
  30. Altmetric Badge
    Chapter 29 Deterministic Algorithms for Unique Sink Orientations of Grids
  31. Altmetric Badge
    Chapter 30 From Graph Orientation to the Unweighted Maximum Cut
  32. Altmetric Badge
    Chapter 31 Maximum Weight Independent Sets in ( \(S_{1,1,3}\) , bull)-free Graphs
  33. Altmetric Badge
    Chapter 32 Decomposing Cubic Graphs into Connected Subgraphs of Size Three
  34. Altmetric Badge
    Chapter 33 Automorphisms of the Cube \(n^d\)
  35. Altmetric Badge
    Chapter 34 Hadwiger’s Conjecture and Squares of Chordal Graphs
  36. Altmetric Badge
    Chapter 35 Minimum Width Color Spanning Annulus
  37. Altmetric Badge
    Chapter 36 Computing a Minimum-Width Square or Rectangular Annulus with Outliers
  38. Altmetric Badge
    Chapter 37 Approximating the Maximum Rectilinear Crossing Number
  39. Altmetric Badge
    Chapter 38 An Improved Approximation Algorithm for rSPR Distance
  40. Altmetric Badge
    Chapter 39 Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine
  41. Altmetric Badge
    Chapter 40 Complex-Demand Scheduling Problem with Application in Smart Grid
  42. Altmetric Badge
    Chapter 41 From Preemptive to Non-preemptive Scheduling Using Rejections
  43. Altmetric Badge
    Chapter 42 Flow Shop for Dual CPUs in Dynamic Voltage Scaling
  44. Altmetric Badge
    Chapter 43 Algorithms for k-median Clustering over Distributed Streams
  45. Altmetric Badge
    Chapter 44 Polygon Simplification by Minimizing Convex Corners
  46. Altmetric Badge
    Chapter 45 Combinatorial Scoring of Phylogenetic Networks
  47. Altmetric Badge
    Chapter 46 Highly Bi-Connected Subgraphs for Computational Protein Function Annotation
  48. Altmetric Badge
    Chapter 47 Cost Register Automata for Nested Words
  49. Altmetric Badge
    Chapter 48 Extending MSVL with Semaphore
  50. Altmetric Badge
    Chapter 49 Satisfiability of Linear Time Mu-Calculus on Finite Traces
  51. Altmetric Badge
    Chapter 50 On the Complexity of Insertion Propagation with Functional Dependency Constraints
Attention for Chapter 45: Combinatorial Scoring of Phylogenetic Networks
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (90th percentile)
  • High Attention Score compared to outputs of the same age and source (97th percentile)

Mentioned by

blogs
1 blog
twitter
12 X users

Citations

dimensions_citation
1 Dimensions

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.
Chapter title
Combinatorial Scoring of Phylogenetic Networks
Chapter number 45
Book title
Computing and Combinatorics
Published in
arXiv, February 2016
DOI 10.1007/978-3-319-42634-1_45
Book ISBNs
978-3-31-942633-4, 978-3-31-942634-1
Authors

Nikita Alexeev, Max A. Alekseyev

Editors

Thang N. Dinh, My T. Thai

X Demographics

X Demographics

The data shown below were collected from the profiles of 12 X users 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 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 2 40%
Unknown 3 60%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 2 40%
Student > Ph. D. Student 1 20%
Researcher 1 20%
Unknown 1 20%
Readers by discipline Count As %
Mathematics 1 20%
Computer Science 1 20%
Economics, Econometrics and Finance 1 20%
Unknown 2 40%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 17. 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 10 August 2016.
All research outputs
#1,863,783
of 22,844,985 outputs
Outputs from arXiv
#30,913
of 938,447 outputs
Outputs of similar age
#36,057
of 400,364 outputs
Outputs of similar age from arXiv
#399
of 14,847 outputs
Altmetric has tracked 22,844,985 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 91st percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 938,447 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done particularly well, scoring higher than 96% of its peers.
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 400,364 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 90% of its contemporaries.
We're also able to compare this research output to 14,847 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 97% of its contemporaries.