↓ Skip to main content

Algorithm theory--SWAT 2008 : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008 ; proceedings

Overview of attention for book
Cover of 'Algorithm theory--SWAT 2008 : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008 ; proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Survey of Results for Deletion Channels and Related Synchronization Channels
  3. Altmetric Badge
    Chapter 2 Nash Bargaining Via Flexible Budget Markets
  4. Altmetric Badge
    Chapter 3 Simplified Planar Coresets for Data Streams
  5. Altmetric Badge
    Chapter 4 Uniquely Represented Data Structures for Computational Geometry
  6. Altmetric Badge
    Chapter 5 I/O Efficient Dynamic Data Structures for Longest Prefix Queries
  7. Altmetric Badge
    Chapter 6 Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
  8. Altmetric Badge
    Chapter 7 Vision-Based Pursuit-Evasion in a Grid
  9. Altmetric Badge
    Chapter 8 Angle Optimization in Target Tracking
  10. Altmetric Badge
    Chapter 9 Improved Bounds for Wireless Localization
  11. Altmetric Badge
    Chapter 10 Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
  12. Altmetric Badge
    Chapter 11 Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
  13. Altmetric Badge
    Chapter 12 The Maximum Energy-Constrained Dynamic Flow Problem
  14. Altmetric Badge
    Chapter 13 Bounded Unpopularity Matchings
  15. Altmetric Badge
    Chapter 14 Data Structures with Local Update Operations
  16. Altmetric Badge
    Chapter 15 On the Redundancy of Succinct Data Structures
  17. Altmetric Badge
    Chapter 16 Confluently Persistent Tries for Efficient Version Control
  18. Altmetric Badge
    Chapter 17 A Uniform Approach Towards Succinct Representation of Trees
  19. Altmetric Badge
    Chapter 18 An $\mbox{O}(n^{1.75})$ Algorithm for L (2,1)-Labeling of Trees
  20. Altmetric Badge
    Chapter 19 Batch Coloring Flat Graphs and Thin
  21. Altmetric Badge
    Chapter 20 Algorithm Theory – SWAT 2008
  22. Altmetric Badge
    Chapter 21 A Path Cover Technique for LCAs in Dags
  23. Altmetric Badge
    Chapter 22 Boundary Labeling with Octilinear Leaders
  24. Altmetric Badge
    Chapter 23 Distributed Disaster Disclosure
  25. Altmetric Badge
    Chapter 24 Reoptimization of Steiner Trees
  26. Altmetric Badge
    Chapter 25 On the Locality of Extracting a 2-Manifold in
  27. Altmetric Badge
    Chapter 26 On Metric Clustering to Minimize the Sum of Radii
  28. Altmetric Badge
    Chapter 27 On Covering Problems of Rado
  29. Altmetric Badge
    Chapter 28 Packing Rectangles into 2OPT Bins Using Rotations
  30. Altmetric Badge
    Chapter 29 A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
  31. Altmetric Badge
    Chapter 30 Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
  32. Altmetric Badge
    Chapter 31 On a Special Co-cycle Basis of Graphs
  33. Altmetric Badge
    Chapter 32 A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
  34. Altmetric Badge
    Chapter 33 Spanners of Additively Weighted Point Sets
  35. Altmetric Badge
    Chapter 34 The Kinetic Facility Location Problem
  36. Altmetric Badge
    Chapter 35 Computing the Greedy Spanner in Near-Quadratic Time
  37. Altmetric Badge
    Chapter 36 Parameterized Computational Complexity of Dodgson and Young Elections
  38. Altmetric Badge
    Chapter 37 Online Compression Caching
  39. Altmetric Badge
    Chapter 38 On Trade-Offs in External-Memory Diameter-Approximation
Attention for Chapter 17: A Uniform Approach Towards Succinct Representation of Trees
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
11 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
A Uniform Approach Towards Succinct Representation of Trees
Chapter number 17
Book title
Algorithm Theory – SWAT 2008
Published by
Springer, Berlin, Heidelberg, July 2008
DOI 10.1007/978-3-540-69903-3_17
Book ISBNs
978-3-54-069900-2, 978-3-54-069903-3
Authors

Arash Farzan, J. Ian Munro, Farzan, Arash, Munro, J. Ian

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Spain 1 9%
Germany 1 9%
Unknown 9 82%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 27%
Researcher 2 18%
Student > Master 2 18%
Professor 1 9%
Professor > Associate Professor 1 9%
Other 1 9%
Unknown 1 9%
Readers by discipline Count As %
Computer Science 6 55%
Mathematics 1 9%
Agricultural and Biological Sciences 1 9%
Engineering 1 9%
Unknown 2 18%