↓ Skip to main content
What is this page? Embed badge

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 1 Algorithms for Equilibrium Prices in Linear Market Models
  3. Altmetric Badge
    Chapter 2 In as Few Comparisons as Possible
  4. Altmetric Badge
    Chapter 3 The Happy End Theorem and Related Results
  5. Altmetric Badge
    Chapter 4 Generalized Class Cover Problem with Axis-Parallel Strips
  6. Altmetric Badge
    Chapter 5 Top- k Manhattan Spatial Skyline Queries
  7. Altmetric Badge
    Chapter 6 On Generalized Planar Skyline and Convex Hull Range Queries
  8. Altmetric Badge
    Chapter 7 Boundary Labeling with Flexible Label Positions
  9. Altmetric Badge
    Chapter 8 Approximating the Bipartite TSP and Its Biased Generalization
  10. Altmetric Badge
    Chapter 9 A ( k  + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
  11. Altmetric Badge
    Chapter 10 Simple Linear Comparison of Strings in V -Order
  12. Altmetric Badge
    Chapter 11 SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
  13. Altmetric Badge
    Chapter 12 Optimal Serial Broadcast of Successive Chunks
  14. Altmetric Badge
    Chapter 13 The ${\mathcal{G}}$ -Packing with t -Overlap Problem
  15. Altmetric Badge
    Chapter 14 Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
  16. Altmetric Badge
    Chapter 15 On a Class of Covering Problems with Variable Capacities in Wireless Networks
  17. Altmetric Badge
    Chapter 16 Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
  18. Altmetric Badge
    Chapter 17 Some Results on Point Visibility Graphs
  19. Altmetric Badge
    Chapter 18 Some Extensions of the Bottleneck Paths Problem
  20. Altmetric Badge
    Chapter 19 I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs
  21. Altmetric Badge
    Chapter 20 On Some $\mathcal{NP}$ -complete SEFE Problems
  22. Altmetric Badge
    Chapter 21 On Dilworth k Graphs and Their Pairwise Compatibility
  23. Altmetric Badge
    Chapter 22 Efficient Algorithms for Sorting k -Sets in Bins
  24. Altmetric Badge
    Chapter 23 Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
  25. Altmetric Badge
    Chapter 24 Editing the Simplest Graphs
  26. Altmetric Badge
    Chapter 25 Alignment with Non-overlapping Inversions on Two Strings
  27. Altmetric Badge
    Chapter 26 Collapsing Exact Arithmetic Hierarchies
  28. Altmetric Badge
    Chapter 27 Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs
  29. Altmetric Badge
    Chapter 28 Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods
  30. Altmetric Badge
    Chapter 29 On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
  31. Altmetric Badge
    Chapter 30 Linear Layouts of Weakly Triangulated Graphs
  32. Altmetric Badge
    Chapter 31 Bichromatic Point-Set Embeddings of Trees with Fewer Bends
  33. Altmetric Badge
    Chapter 32 ℓ 1 -Embeddability of 2-Dimensional ℓ 1 -Rigid Periodic Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

facebook
1 Facebook page
Summary Facebook
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 International Publishing, January 2014
DOI 10.1007/978-3-319-04657-0
ISBNs
978-3-31-904656-3, 978-3-31-904657-0
Editors

Pal, Sudebkumar Prasant, Sadakane, Kunihiko

View on publisher site

This page is provided by Altmetric.