↓ Skip to main content

Algorithms and Computation

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 229 Reaching a goal with directional uncertainty
  3. Altmetric Badge
    Chapter 230 Constructing degree-3 spanners with other sparseness properties
  4. Altmetric Badge
    Chapter 231 Remembering conflicts in history yields dynamic algorithms
  5. Altmetric Badge
    Chapter 232 Coloring random graphs in polynomial expected time
  6. Altmetric Badge
    Chapter 233 Graphical degree sequence problems with connectivity requirements
  7. Altmetric Badge
    Chapter 234 How to treat delete requests in semi-online problems
  8. Altmetric Badge
    Chapter 235 Finding the shortest watchman route in a simple polygon
  9. Altmetric Badge
    Chapter 236 Constructing shortest watchman routes by divide-and-conquer
  10. Altmetric Badge
    Chapter 237 A graph coloring result and its consequences for some guarding problems
  11. Altmetric Badge
    Chapter 238 The maximum k -dependent and f -dependent set problem
  12. Altmetric Badge
    Chapter 239 Finding shortest non-crossing rectilinear paths in plane regions
  13. Altmetric Badge
    Chapter 240 Treewidth of circle graphs
  14. Altmetric Badge
    Chapter 241 A framework for constructing heap-like structures in-place
  15. Altmetric Badge
    Chapter 242 Double-ended binomial queues
  16. Altmetric Badge
    Chapter 243 A simple balanced search tree with O (1) worst-case update time
  17. Altmetric Badge
    Chapter 244 Mapping dynamic data and algorithm structures into product networks
  18. Altmetric Badge
    Chapter 245 Permutation routing on reconfigurable meshes
  19. Altmetric Badge
    Chapter 246 Adaptive and oblivious algorithms for d-cube permutation routing
  20. Altmetric Badge
    Chapter 247 On quadratic lattice approximations
  21. Altmetric Badge
    Chapter 248 A 2/3-approximation of the matroid matching problem
  22. Altmetric Badge
    Chapter 249 Using fractal geometry for solving divide-and-conquer recurrences
  23. Altmetric Badge
    Chapter 250 Simple combinatorial Gray codes constructed by reversing sublists
  24. Altmetric Badge
    Chapter 251 Time space tradeoffs (getting closer to the barrier?)
  25. Altmetric Badge
    Chapter 252 Separating exponentially ambiguous NFA from polynomially ambiguous NFA
  26. Altmetric Badge
    Chapter 253 Threshold computation and cryptographic security
  27. Altmetric Badge
    Chapter 254 On the Power of reading and writing simultaneously in parallel computations
  28. Altmetric Badge
    Chapter 255 Relativizing complexity classes with Random Oracles
  29. Altmetric Badge
    Chapter 256 An introduction to perpetual gossiping
  30. Altmetric Badge
    Chapter 257 A probabilistic selection network with butterfly networks
  31. Altmetric Badge
    Chapter 258 Optimal group gossiping in hypercubes under wormhole routing model
  32. Altmetric Badge
    Chapter 259 Optimal linear broadcast routing with capacity limitations
  33. Altmetric Badge
    Chapter 260 Multicommodity flows: A survey of recent research
  34. Altmetric Badge
    Chapter 261 Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
  35. Altmetric Badge
    Chapter 262 Number theory helps line detection in digital images an extended abstract
  36. Altmetric Badge
    Chapter 263 Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version
  37. Altmetric Badge
    Chapter 264 Multicommodity flows in even, planar networks
  38. Altmetric Badge
    Chapter 265 Linear time algorithms for disjoint Two-Face Paths Problems in planar graphs
  39. Altmetric Badge
    Chapter 266 Robot mapping: Foot-prints vs tokens
  40. Altmetric Badge
    Chapter 267 Recent developments on the approximability of combinatorial problems
  41. Altmetric Badge
    Chapter 268 On the relationship among cryptographic physical assumptions
  42. Altmetric Badge
    Chapter 269 Separating complexity classes related to bounded alternating Ω-branching programs
  43. Altmetric Badge
    Chapter 270 The complexity of the optimal variable ordering problems of shared binary decision diagrams
  44. Altmetric Badge
    Chapter 271 On Horn envelopes and hypergraph transversals
  45. Altmetric Badge
    Chapter 272 Page migration algorithms using work functions
  46. Altmetric Badge
    Chapter 273 Memory paging for connectivity and path problems in graphs
  47. Altmetric Badge
    Chapter 274 Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists
  48. Altmetric Badge
    Chapter 275 Randomized on-line algorithms for the page replication problem
  49. Altmetric Badge
    Chapter 276 New algorithms for minimizing the longest wire length during circuit compaction
  50. Altmetric Badge
    Chapter 277 Parallel algorithms for single-layer channel routing
  51. Altmetric Badge
    Chapter 278 Consecutive interval query and dynamic programming on intervals
  52. Altmetric Badge
    Chapter 279 An improved algorithm for the traveler's problem
  53. Altmetric Badge
    Chapter 280 Vehicle scheduling on a tree with release and handling times
  54. Altmetric Badge
    Chapter 281 Scheduling algorithms for a chain-like task system
  55. Altmetric Badge
    Chapter 282 Weighted independent perfect domination on cocomparability graphs
  56. Altmetric Badge
    Chapter 283 Plane sweep algorithms for the polygonal approximation problems with applications
  57. Altmetric Badge
    Chapter 284 Optimal rectilinear steiner tree for extremal point sets
  58. Altmetric Badge
    Chapter 285 Faster approximation algorithms for the rectilinear steiner tree problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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 and Computation
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-57568-5
ISBNs
978-3-54-057568-9, 978-3-54-048233-8
Editors

Ng, K. W., Raghavan, P., Balasubramanian, N. V., Chin, F. Y. L.

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 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 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 100%
Readers by discipline Count As %
Engineering 1 100%