↓ Skip to main content

Algorithms – ESA 2004

Overview of attention for book
Cover of 'Algorithms – ESA 2004'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
  3. Altmetric Badge
    Chapter 2 Algorithmic Aspects of Web Search Engines
  4. Altmetric Badge
    Chapter 3 Algorithms – ESA 2004
  5. Altmetric Badge
    Chapter 4 Swap and Mismatch Edit Distance
  6. Altmetric Badge
    Chapter 5 Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
  7. Altmetric Badge
    Chapter 6 Optimal External Memory Planar Point Enclosure
  8. Altmetric Badge
    Chapter 7 Maximizing Throughput in Multi-queue Switches
  9. Altmetric Badge
    Chapter 8 An Improved Algorithm for CIOQ Switches
  10. Altmetric Badge
    Chapter 9 Labeling Smart Dust
  11. Altmetric Badge
    Chapter 10 Graph Decomposition Lemmas and Their Role in Metric Embedding Methods
  12. Altmetric Badge
    Chapter 11 Modeling Locality: A Probabilistic Analysis of LRU and FWF
  13. Altmetric Badge
    Chapter 12 An Algorithm for Computing DNA Walks
  14. Altmetric Badge
    Chapter 13 Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
  15. Altmetric Badge
    Chapter 14 Direct Routing: Algorithms and Complexity
  16. Altmetric Badge
    Chapter 15 Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
  17. Altmetric Badge
    Chapter 16 A Parameterized Algorithm for Upward Planarity Testing
  18. Altmetric Badge
    Chapter 17 Fisher Equilibrium Price with a Class of Concave Utility Functions
  19. Altmetric Badge
    Chapter 18 Hardness and Approximation Results for Packing Steiner Trees
  20. Altmetric Badge
    Chapter 19 Approximation hardness of dominating set problems
  21. Altmetric Badge
    Chapter 20 Improved Online Algorithms for Buffer Management in QoS Switches
  22. Altmetric Badge
    Chapter 21 Time Dependent Multi Scheduling of Multicast
  23. Altmetric Badge
    Chapter 22 Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
  24. Altmetric Badge
    Chapter 23 The Average Case Analysis of Partition Sorts
  25. Altmetric Badge
    Chapter 24 A Fast Distributed Algorithm for Approximating the Maximum Matching
  26. Altmetric Badge
    Chapter 25 Extreme Points Under Random Noise
  27. Altmetric Badge
    Chapter 26 Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings
  28. Altmetric Badge
    Chapter 27 On Variable-Sized Multidimensional Packing
  29. Altmetric Badge
    Chapter 28 An Inductive Construction for Plane Laman Graphs via Vertex Splitting
  30. Altmetric Badge
    Chapter 29 Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
  31. Altmetric Badge
    Chapter 30 On the Evolution of Selfish Routing
  32. Altmetric Badge
    Chapter 31 Competitive Online Approximation of the Optimal Search Ratio
  33. Altmetric Badge
    Chapter 32 Incremental Algorithms for Facility Location and k-Median
  34. Altmetric Badge
    Chapter 33 Dynamic Shannon Coding
  35. Altmetric Badge
    Chapter 34 Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries
  36. Altmetric Badge
    Chapter 35 Negotiation-Range Mechanisms: Coalition-Resistant Markets
  37. Altmetric Badge
    Chapter 36 Approximation Algorithms for Quickest Spanning Tree Problems
  38. Altmetric Badge
    Chapter 37 An Approximation Algorithm for Maximum Triangle Packing
  39. Altmetric Badge
    Chapter 38 Approximate Parameterized Matching
  40. Altmetric Badge
    Chapter 39 Approximation of Rectangle Stabbing and Interval Stabbing Problems
  41. Altmetric Badge
    Chapter 40 Fast 3-Coloring Triangle-Free Planar Graphs
  42. Altmetric Badge
    Chapter 41 Approximate Unions of Lines and Minkowski Sums
  43. Altmetric Badge
    Chapter 42 Radio Network Clustering from Scratch
  44. Altmetric Badge
    Chapter 43 Seeking a Vertex of the Planar Matching Polytope in NC
  45. Altmetric Badge
    Chapter 44 Equivalence of Search Capability Among Mobile Guards with Various Visibilities
  46. Altmetric Badge
    Chapter 45 Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors
  47. Altmetric Badge
    Chapter 46 On the Stability of Multiple Partner Stable Marriages with Ties
  48. Altmetric Badge
    Chapter 47 Flows on Few Paths: Algorithms and Lower Bounds
  49. Altmetric Badge
    Chapter 48 Maximum Matchings in Planar Graphs via Gaussian Elimination
  50. Altmetric Badge
    Chapter 49 Fast Multipoint Evaluation of Bivariate Polynomials
  51. Altmetric Badge
    Chapter 50 On Adaptive Integer Sorting
  52. Altmetric Badge
    Chapter 51 Tiling a Polygon with Two Kinds of Rectangles
  53. Altmetric Badge
    Chapter 52 On Dynamic Shortest Paths Problems
  54. Altmetric Badge
    Chapter 53 Uniform Algorithms for Deterministic Construction of Efficient Dictionaries
  55. Altmetric Badge
    Chapter 54 Fast Sparse Matrix Multiplication
  56. Altmetric Badge
    Chapter 55 An Experimental Study of Random Knapsack Problems
  57. Altmetric Badge
    Chapter 56 Contraction and Treewidth Lower Bounds
  58. Altmetric Badge
    Chapter 57 Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
  59. Altmetric Badge
    Chapter 58 Comparing Real Algebraic Numbers of Small Degree
  60. Altmetric Badge
    Chapter 59 Code Flexibility and Program Efficiency by Genericity: Improving Cgal ’s Arrangements
  61. Altmetric Badge
    Chapter 60 Finding Dominators in Practice
  62. Altmetric Badge
    Chapter 61 Data Migration on Parallel Disks
  63. Altmetric Badge
    Chapter 62 Classroom Examples of Robustness Problems in Geometric Computations
  64. Altmetric Badge
    Chapter 63 Stable Minimum Storage Merging by Symmetric Comparisons
  65. Altmetric Badge
    Chapter 64 On Rectangular Cartograms
  66. Altmetric Badge
    Chapter 65 Multi-word Atomic Read/Write Registers on Multiprocessor Systems
  67. Altmetric Badge
    Chapter 66 Beyond Optimal Play in Two-Person-Zerosum Games
  68. Altmetric Badge
    Chapter 67 Solving Geometric Covering Problems by Data Reduction
  69. Altmetric Badge
    Chapter 68 Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions
  70. Altmetric Badge
    Chapter 69 Super Scalar Sample Sort
  71. Altmetric Badge
    Chapter 70 Construction of Minimum-Weight Spanners
  72. Altmetric Badge
    Chapter 71 A Straight Skeleton Approximating the Medial Axis
  73. Altmetric Badge
    Chapter 72 Non-additive Shortest Paths
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter
wikipedia
5 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
15 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
Algorithms – ESA 2004
Published by
Springer, Berlin, Heidelberg, January 2004
DOI 10.1007/b100428
ISBNs
978-3-54-023025-0, 978-3-54-030140-0
Editors

Susanne Albers, Tomasz Radzik

Twitter Demographics

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 15 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 7%
Unknown 14 93%
Readers by discipline Count As %
Mathematics 1 7%
Unknown 14 93%