↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
  3. Altmetric Badge
    Chapter 2 A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
  4. Altmetric Badge
    Chapter 3 Speed Scaling for Maximum Lateness
  5. Altmetric Badge
    Chapter 4 Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
  6. Altmetric Badge
    Chapter 5 Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs
  7. Altmetric Badge
    Chapter 6 Online Knapsack Problem with Removal Cost
  8. Altmetric Badge
    Chapter 7 An Improved Exact Algorithm for TSP in Degree-4 Graphs
  9. Altmetric Badge
    Chapter 8 Dynamic Programming for H-minor-free Graphs
  10. Altmetric Badge
    Chapter 9 Restricted Max-Min Fair Allocations with Inclusion-Free Intervals
  11. Altmetric Badge
    Chapter 10 An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
  12. Altmetric Badge
    Chapter 11 Towards Optimal and Expressive Kernelization for d-Hitting Set
  13. Altmetric Badge
    Chapter 12 Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
  14. Altmetric Badge
    Chapter 13 A Local Algorithm for Finding Dense Bipartite-Like Subgraphs
  15. Altmetric Badge
    Chapter 14 Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
  16. Altmetric Badge
    Chapter 15 On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property
  17. Altmetric Badge
    Chapter 16 Rainbow Colouring of Split and Threshold Graphs
  18. Altmetric Badge
    Chapter 17 Approximating the Rainbow – Better Lower and Upper Bounds
  19. Altmetric Badge
    Chapter 18 Ramsey Numbers for Line Graphs and Perfect Graphs
  20. Altmetric Badge
    Chapter 19 Geodesic Order Types
  21. Altmetric Badge
    Chapter 20 Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
  22. Altmetric Badge
    Chapter 21 Monotone Paths in Planar Convex Subdivisions
  23. Altmetric Badge
    Chapter 22 The Cost of Bounded Curvature
  24. Altmetric Badge
    Chapter 23 Optimally Solving a Transportation Problem Using Voronoi Diagrams
  25. Altmetric Badge
    Chapter 24 Unexplored Steiner Ratios in Geometric Networks
  26. Altmetric Badge
    Chapter 25 Geometric RAC Simultaneous Drawings of Graphs
  27. Altmetric Badge
    Chapter 26 Simultaneous Embeddings with Vertices Mapping to Pre-specified Points
  28. Altmetric Badge
    Chapter 27 Multilevel Drawings of Clustered Graphs
  29. Altmetric Badge
    Chapter 28 Outerplanar Graph Drawings with Few Slopes
  30. Altmetric Badge
    Chapter 29 Computing and Combinatorics
  31. Altmetric Badge
    Chapter 30 Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application
  32. Altmetric Badge
    Chapter 31 External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue
  33. Altmetric Badge
    Chapter 32 Partially Specified Nearest Neighbor Search
  34. Altmetric Badge
    Chapter 33 Multi-pattern Matching with Bidirectional Indexes
  35. Altmetric Badge
    Chapter 34 Succinct Representations of Binary Trees for Range Minimum Queries
  36. Altmetric Badge
    Chapter 35 Lower Bounds against Weakly Uniform Circuits
  37. Altmetric Badge
    Chapter 36 On TC0 Lower Bounds for the Permanent
  38. Altmetric Badge
    Chapter 37 Formula Complexity of Ternary Majorities
  39. Altmetric Badge
    Chapter 38 On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles
  40. Altmetric Badge
    Chapter 39 The Complexity of Unary Subset Sum
  41. Altmetric Badge
    Chapter 40 On the Advice Complexity of Tournaments
  42. Altmetric Badge
    Chapter 41 A Remark on One-Wayness versus Pseudorandomness
  43. Altmetric Badge
    Chapter 42 Integral Mixed Unit Interval Graphs
  44. Altmetric Badge
    Chapter 43 Complementary Vertices and Adjacency Testing in Polytopes
  45. Altmetric Badge
    Chapter 44 Online Coloring of Bipartite Graphs with and without Advice
  46. Altmetric Badge
    Chapter 45 Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms
  47. Altmetric Badge
    Chapter 46 On the 2-Central Path Problem
  48. Altmetric Badge
    Chapter 47 Making Profit in a Prediction Market
  49. Altmetric Badge
    Chapter 48 Computing Shapley Value in Supermodular Coalitional Games
  50. Altmetric Badge
    Chapter 49 Equilibria of GSP for Range Auction
  51. Altmetric Badge
    Chapter 50 Stretch in Bottleneck Games
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter
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
Computing and Combinatorics
Published by
Springer, Berlin, Heidelberg, January 2012
DOI 10.1007/978-3-642-32241-9
ISBNs
978-3-64-232240-2, 978-3-64-232241-9
Editors

Joachim Gudmundsson, Julián Mestre, Taso Viglas

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.