↓ Skip to main content

Algorithm Theory — SWAT'96

Overview of attention for book
Cover of 'Algorithm Theory — SWAT'96'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 115 Derandomization via small sample spaces
  3. Altmetric Badge
    Chapter 116 The randomized complexity of maintaining the minimum
  4. Altmetric Badge
    Chapter 117 Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
  5. Altmetric Badge
    Chapter 118 Service-constrained network design problems
  6. Altmetric Badge
    Chapter 119 Approximate hypergraph coloring
  7. Altmetric Badge
    Chapter 120 Facility dispersion and remote subgraphs
  8. Altmetric Badge
    Chapter 121 The constrained minimum spanning tree problem
  9. Altmetric Badge
    Chapter 122 Randomized approximation of the constraint satisfaction problem
  10. Altmetric Badge
    Chapter 123 On the hardness of global and local approximation
  11. Altmetric Badge
    Chapter 124 Approximation algorithms for the maximum satisfiability problem
  12. Altmetric Badge
    Chapter 125 On the hardness of approximating the minimum consistent OBDD problem
  13. Altmetric Badge
    Chapter 126 Computing the unrooted maximum agreement subtree in sub-quadratic time
  14. Altmetric Badge
    Chapter 127 Greedily finding a dense subgraph
  15. Altmetric Badge
    Chapter 128 Using sparsification for parametric minimum spanning tree problems
  16. Altmetric Badge
    Chapter 129 Vertex partitioning problems on partial k -trees
  17. Altmetric Badge
    Chapter 130 Making an arbitrary filled graph minimal by removing fill edges
  18. Altmetric Badge
    Chapter 131 Sorting and searching revisted
  19. Altmetric Badge
    Chapter 132 Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
  20. Altmetric Badge
    Chapter 133 Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
  21. Altmetric Badge
    Chapter 134 Neighborhood graphs and distributed Δ+1-coloring
  22. Altmetric Badge
    Chapter 135 Communication complexity of gossiping by packets
  23. Altmetric Badge
    Chapter 136 Optimal cost-sensitive distributed minimum spanning tree algorithm
  24. Altmetric Badge
    Chapter 137 A linear time algorithm for the feasibility of pebble motion on trees
  25. Altmetric Badge
    Chapter 138 Linear-time heuristics for minimum weight rectangulation
  26. Altmetric Badge
    Chapter 139 Visibility with multiple reflections
  27. Altmetric Badge
    Chapter 140 A fast heuristic for approximating the minimum weight triangulation
  28. Altmetric Badge
    Chapter 141 Neighbours on a grid
  29. Altmetric Badge
    Chapter 142 On two dimensional packing
  30. Altmetric Badge
    Chapter 143 Optimal orthogonal drawings of triconnected plane graphs
  31. Altmetric Badge
    Chapter 144 Walking streets faster
  32. Altmetric Badge
    Chapter 145 Safe and efficient traffic laws for mobile robots
  33. Altmetric Badge
    Chapter 146 Progress in selection
  34. Altmetric Badge
    Chapter 147 Probabilistic ancestral sequences and multiple alignments
  35. Altmetric Badge
    Chapter 148 Efficient algorithms for Lempel-Ziv encoding
  36. Altmetric Badge
    Chapter 149 The deterministic complexity of parallel multisearch
  37. Altmetric Badge
    Chapter 150 Priority queues on parallel machines
  38. Altmetric Badge
    Chapter 151 Binary search trees: How low can you go?
  39. Altmetric Badge
    Chapter 152 Boolean analysis of incomplete examples
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 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
Algorithm Theory — SWAT'96
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-61422-2
ISBNs
978-3-54-061422-7, 978-3-54-068529-6
Editors

Karlsson, Rolf, Lingas, Andrzej

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Postgraduate 3 100%
Student > Ph. D. Student 2 67%
Student > Master 2 67%
Readers by discipline Count As %
Computer Science 6 200%
Economics, Econometrics and Finance 1 33%