↓ Skip to main content

WALCOM: Algorithms and Computation

Overview of attention for book
Cover of 'WALCOM: Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Geometry and Topology from Point Cloud Data
  3. Altmetric Badge
    Chapter 2 The Disjoint Paths Problem: Algorithm and Structure
  4. Altmetric Badge
    Chapter 3 The Physarum Computer
  5. Altmetric Badge
    Chapter 4 Maximum Betweenness Centrality: Approximability and Tractable Cases
  6. Altmetric Badge
    Chapter 5 Approximation Algorithms for Minimum Chain Vertex Deletion
  7. Altmetric Badge
    Chapter 6 Oblivious Buy-at-Bulk in Planar Graphs
  8. Altmetric Badge
    Chapter 7 The Complexity of Acyclic Subhypergraph Problems
  9. Altmetric Badge
    Chapter 8 Inapproximability of b -Matching in k -Uniform Hypergraphs
  10. Altmetric Badge
    Chapter 9 WALCOM: Algorithms and Computation
  11. Altmetric Badge
    Chapter 10 Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
  12. Altmetric Badge
    Chapter 11 Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
  13. Altmetric Badge
    Chapter 12 Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point
  14. Altmetric Badge
    Chapter 13 Efficient Top- k Queries for Orthogonal Ranges
  15. Altmetric Badge
    Chapter 14 Range-Aggregate Queries Involving Geometric Aggregation Operations
  16. Altmetric Badge
    Chapter 15 Multi Cover of a Polygon Minimizing the Sum of Areas
  17. Altmetric Badge
    Chapter 16 On the Discrete Unit Disk Cover Problem
  18. Altmetric Badge
    Chapter 17 Clustering with Internal Connectedness
  19. Altmetric Badge
    Chapter 18 Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
  20. Altmetric Badge
    Chapter 19 De Bruijn Sequences for the Binary Strings with Maximum Density
  21. Altmetric Badge
    Chapter 20 A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
  22. Altmetric Badge
    Chapter 21 Counting Spanning Trees in Graphs Using Modular Decomposition
  23. Altmetric Badge
    Chapter 22 On Graceful Labelings of Trees
  24. Altmetric Badge
    Chapter 23 Minimum-Layer Drawings of Trees
Attention for Chapter 23: Minimum-Layer Drawings of Trees
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
4 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
Minimum-Layer Drawings of Trees
Chapter number 23
Book title
WALCOM: Algorithms and Computation
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-19094-0_23
Book ISBNs
978-3-64-219093-3, 978-3-64-219094-0
Authors

Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman

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 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 50%
Student > Ph. D. Student 1 25%
Lecturer > Senior Lecturer 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Arts and Humanities 1 25%
Agricultural and Biological Sciences 1 25%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 01 September 2011.
All research outputs
#18,295,723
of 22,651,245 outputs
Outputs from Lecture notes in computer science
#6,005
of 8,122 outputs
Outputs of similar age
#159,884
of 180,239 outputs
Outputs of similar age from Lecture notes in computer science
#229
of 318 outputs
Altmetric has tracked 22,651,245 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,122 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% 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 180,239 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 5th percentile – i.e., 5% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 318 others from the same source and published within six weeks on either side of this one. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.