Algorithms and Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Solving NP-hard combinatorial problems in the practical sense Invited presentation
3. Altmetric Badge
   Chapter 2 Airline crew-scheduling problem with many irregular flights
4. Altmetric Badge
   Chapter 3 Practical approach to a facility location problem for large-scale logistics
5. Altmetric Badge
   Chapter 4 Hard instance generation for SAT
6. Altmetric Badge
   Chapter 5 Playing tetris on meshes and multi-dimensional Shearsort
7. Altmetric Badge
   Chapter 6 Formulation of the addition-shift-sequence problem and its complexity
8. Altmetric Badge
   Chapter 7 Weighted and unweighted selection algorithms for k sorted sequences
9. Altmetric Badge
   Chapter 8 An adaptive distributed fault-tolerant routing algorithm for the star graph
10. Altmetric Badge
    Chapter 9 Multi-color routing in the undirected hypercube
11. Altmetric Badge
    Chapter 10 Competitive source routing on tori and meshes
12. Altmetric Badge
    Chapter 11 Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
13. Altmetric Badge
    Chapter 12 Augmenting edge and vertex connectivities simultaneously
14. Altmetric Badge
    Chapter 13 Two-face horn extensions
15. Altmetric Badge
    Chapter 14 Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae
16. Altmetric Badge
    Chapter 15 Algorithmic analysis of multithreaded algorithms
17. Altmetric Badge
    Chapter 16 A characterization of planar graphs by pseudo-line arrangements
18. Altmetric Badge
    Chapter 17 Optimal fault-tolerant broadcasting in trees
19. Altmetric Badge
    Chapter 18 A theoretical framework of hybrid approaches to MAX SAT
20. Altmetric Badge
    Chapter 19 Exponential lower bounds on the size of OBDDs representing integer division
21. Altmetric Badge
    Chapter 20 On-line versus off-line in money-making strategies with brokerage
22. Altmetric Badge
    Chapter 21 Decision-making by hierarchies of discordant agents
23. Altmetric Badge
    Chapter 22 A new efficient off-line anonymous cash scheme
24. Altmetric Badge
    Chapter 23 Approximating unweighted connectivity problems in parallel
25. Altmetric Badge
    Chapter 24 A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
26. Altmetric Badge
    Chapter 25 Efficient parallel algorithms for planar st-graphs
27. Altmetric Badge
    Chapter 26 Peg-solitaire, string rewriting systems and finite automata
28. Altmetric Badge
    Chapter 27 On the size of probabilistic formulae
29. Altmetric Badge
    Chapter 28 Homophonic coding with logarithmic memory size
30. Altmetric Badge
    Chapter 29 Complexity and modeling aspects of mesh refinement into quadrilaterals
31. Altmetric Badge
    Chapter 30 Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm
32. Altmetric Badge
    Chapter 31 The complexity of learning branches and strategies from queries
33. Altmetric Badge
    Chapter 32 Singularities make spatial join scheduling hard
34. Altmetric Badge
    Chapter 33 A faster one-dimensional topological compaction algorithm
35. Altmetric Badge
    Chapter 34 Algorithms for finding optimal disjoint paths around a rectangle
36. Altmetric Badge
    Chapter 35 An algorithm for finding a region with the minimum total L 1 from prescribed terminals
37. Altmetric Badge
    Chapter 36 On defect sets in bipartite graphs (extended abstract)
38. Altmetric Badge
    Chapter 37 Dynamic programming on distance-hereditary graphs
39. Altmetric Badge
    Chapter 38 On the equivalence in complexity among basic problems on bipartite and parity graphs
40. Altmetric Badge
    Chapter 39 All-cavity maximum matchings
41. Altmetric Badge
    Chapter 40 Fast algorithms for computing β -Skeletons and their relatives
42. Altmetric Badge
    Chapter 41 A branch-and-cut approach for minimum weight triangulation
43. Altmetric Badge
    Chapter 42 An efficient approximation scheme for the subset-sum problem
44. Altmetric Badge
    Chapter 43 Competitive call control in mobile networks
45. Altmetric Badge
    Chapter 44 Generalized swap-with-parent schemes for self-organizing sequential linear lists