Computing and Combinatorics

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 133 Improved bounds for on-line load balancing
3. Altmetric Badge
   Chapter 134 O ( n log n )-average-time algorithm for shortest network under a given topology
4. Altmetric Badge
   Chapter 135 Steiner problems on directed acyclic graphs
5. Altmetric Badge
   Chapter 136 Wormhole versus deflection routing: A case study on the mesh
6. Altmetric Badge
   Chapter 137 On sparse parity check matrices (extended abstract)
7. Altmetric Badge
   Chapter 138 Finding a hidden code by asking questions
8. Altmetric Badge
   Chapter 139 Improved length lower bounds for reflecting sequences
9. Altmetric Badge
   Chapter 140 Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
10. Altmetric Badge
    Chapter 141 Output-sensitive reporting of disjoint paths (extended abstract)
11. Altmetric Badge
    Chapter 142 Rectangular grid drawings of plane graphs
12. Altmetric Badge
    Chapter 143 Area-efficient algorithms for upward straight-line tree drawings
13. Altmetric Badge
    Chapter 144 Straight skeletons for general polygonal figures in the plane
14. Altmetric Badge
    Chapter 145 A note on uniform circuit lower bounds for the counting hierarchy (extended abstract)
15. Altmetric Badge
    Chapter 146 A note on the simulation of exponential threshold weights
16. Altmetric Badge
    Chapter 147 Harmonic analysis, real approximation, and the communication complexity of Boolean functions
17. Altmetric Badge
    Chapter 148 Finding large planar subgraphs and large subgraphs of a given genus
18. Altmetric Badge
    Chapter 149 Efficient deterministic algorithms for embedding graphs on books
19. Altmetric Badge
    Chapter 150 Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
20. Altmetric Badge
    Chapter 151 Exact learning of subclasses of CDNF formulas with membership queries
21. Altmetric Badge
    Chapter 152 Fast separator decomposition for finite element meshes
22. Altmetric Badge
    Chapter 153 Reduction algorithms for constructing solutions in graphs with small treewidth
23. Altmetric Badge
    Chapter 154 Fast RNC and NC algorithms for finding a maximal set of paths with an application
24. Altmetric Badge
    Chapter 155 Sparse suffix trees
25. Altmetric Badge
    Chapter 156 Depth-efficient threshold circuits for multiplication and symmetric function computation
26. Altmetric Badge
    Chapter 157 A note on the self-witnessing property of computational problems
27. Altmetric Badge
    Chapter 158 The inverse satisfiability problem
28. Altmetric Badge
    Chapter 159 The join can lower complexity
29. Altmetric Badge
    Chapter 160 On the distribution of eigenvalues of graphs
30. Altmetric Badge
    Chapter 161 On the difficulty of designing good classifiers
31. Altmetric Badge
    Chapter 162 Approximating latin square extensions
32. Altmetric Badge
    Chapter 163 Approximating minimum keys and optimal substructure screens
33. Altmetric Badge
    Chapter 164 Reductions and convergence rates of average time
34. Altmetric Badge
    Chapter 165 On the complexity of computational problems associated with simple stochastic games
35. Altmetric Badge
    Chapter 166 On the complexity of commutativity analysis
36. Altmetric Badge
    Chapter 167 Improved non-approximability results for vertex cover with density constraints
37. Altmetric Badge
    Chapter 168 Some notes on the nearest neighbour interchange distance
38. Altmetric Badge
    Chapter 169 Distributed computing in asynchronous networks with byzantine edges
39. Altmetric Badge
    Chapter 170 Weight biased leftist trees and modified skip lists
40. Altmetric Badge
    Chapter 171 Probabilistic analysis of local search and NP-completeness result for constraint satisfaction
41. Altmetric Badge
    Chapter 172 On the reconfiguration of chains
42. Altmetric Badge
    Chapter 173 Two-guarding a rectilinear polygon
43. Altmetric Badge
    Chapter 174 Three systems for shared generation of authenticators
44. Altmetric Badge
    Chapter 175 Efficient generation of elliptic curve cryptosystems
45. Altmetric Badge
    Chapter 176 Superconnectivity for minimal multi-loop networks