↓ 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 Constructing Independent Spanning Trees on Bubble-Sort Networks
  3. Altmetric Badge
    Chapter 2 Exact Algorithms for Finding Partial Edge-Disjoint Paths
  4. Altmetric Badge
    Chapter 3 A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications
  5. Altmetric Badge
    Chapter 4 Contextual Dependent Click Bandit Algorithm for Web Recommendation
  6. Altmetric Badge
    Chapter 5 LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering
  7. Altmetric Badge
    Chapter 6 Approximation Algorithms for a Two-Phase Knapsack Problem
  8. Altmetric Badge
    Chapter 7 More Routes for Evacuation
  9. Altmetric Badge
    Chapter 8 Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem
  10. Altmetric Badge
    Chapter 9 Approximating Global Optimum for Probabilistic Truth Discovery
  11. Altmetric Badge
    Chapter 10 Online Interval Scheduling to Maximize Total Satisfaction
  12. Altmetric Badge
    Chapter 11 Properties of Minimal-Perimeter Polyominoes
  13. Altmetric Badge
    Chapter 12 Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
  14. Altmetric Badge
    Chapter 13 Polygon Queries for Convex Hulls of Points
  15. Altmetric Badge
    Chapter 14 Synergistic Solutions for Merging and Computing Planar Convex Hulls
  16. Altmetric Badge
    Chapter 15 Cophenetic Distances: A Near-Linear Time Algorithmic Framework
  17. Altmetric Badge
    Chapter 16 Computing Coverage Kernels Under Restricted Settings
  18. Altmetric Badge
    Chapter 17 Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible Sets
  19. Altmetric Badge
    Chapter 18 Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
  20. Altmetric Badge
    Chapter 19 On Contact Representations of Directed Planar Graphs
  21. Altmetric Badge
    Chapter 20 Computation and Growth of Road Network Dimensions
  22. Altmetric Badge
    Chapter 21 Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings
  23. Altmetric Badge
    Chapter 22 Directed Path-Width and Directed Tree-Width of Directed Co-graphs
  24. Altmetric Badge
    Chapter 23 Generalized Graph k -Coloring Games
  25. Altmetric Badge
    Chapter 24 On Colorful Bin Packing Games
  26. Altmetric Badge
    Chapter 25 Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
  27. Altmetric Badge
    Chapter 26 The Path Set Packing Problem
  28. Altmetric Badge
    Chapter 27 Manipulation Strategies for the Rank-Maximal Matching Problem
  29. Altmetric Badge
    Chapter 28 Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
  30. Altmetric Badge
    Chapter 29 An FPT Algorithm for Contraction to Cactus
  31. Altmetric Badge
    Chapter 30 An Approximation Framework for Bounded Facility Location Problems
  32. Altmetric Badge
    Chapter 31 Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
  33. Altmetric Badge
    Chapter 32 Solving the Gene Duplication Feasibility Problem in Linear Time
  34. Altmetric Badge
    Chapter 33 An Efficiently Recognisable Subset of Hypergraphic Sequences
  35. Altmetric Badge
    Chapter 34 Partial Homology Relations - Satisfiability in Terms of Di-Cographs
  36. Altmetric Badge
    Chapter 35 Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds
  37. Altmetric Badge
    Chapter 36 Reconfiguring Spanning and Induced Subgraphs
  38. Altmetric Badge
    Chapter 37 Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators
  39. Altmetric Badge
    Chapter 38 Efficient Enumeration of Bipartite Subgraphs in Graphs
  40. Altmetric Badge
    Chapter 39 Bipartite Graphs of Small Readability
  41. Altmetric Badge
    Chapter 40 Maximum Colorful Cliques in Vertex-Colored Graphs
  42. Altmetric Badge
    Chapter 41 Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage
  43. Altmetric Badge
    Chapter 42 Characterizing Star-PCGs
  44. Altmetric Badge
    Chapter 43 Liar’s Dominating Set in Unit Disk Graphs
  45. Altmetric Badge
    Chapter 44 Minimum Spanning Tree of Line Segments
  46. Altmetric Badge
    Chapter 45 Improved Learning of k -Parities
  47. Altmetric Badge
    Chapter 46 On a Fixed Haplotype Variant of the Minimum Error Correction Problem
  48. Altmetric Badge
    Chapter 47 Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
  49. Altmetric Badge
    Chapter 48 Amplitude Amplification for Operator Identification and Randomized Classes
  50. Altmetric Badge
    Chapter 49 Reconstruction of Boolean Formulas in Conjunctive Normal Form
  51. Altmetric Badge
    Chapter 50 A Faster FPTAS for the Subset-Sums Ratio Problem
  52. Altmetric Badge
    Chapter 51 A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
  53. Altmetric Badge
    Chapter 52 Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive
  54. Altmetric Badge
    Chapter 53 Minimum Membership Hitting Sets of Axis Parallel Segments
  55. Altmetric Badge
    Chapter 54 Minimum Transactions Problem
  56. Altmetric Badge
    Chapter 55 Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem
  57. Altmetric Badge
    Chapter 56 Geometric Spanners in the MapReduce Model
  58. Altmetric Badge
    Chapter 57 SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
  59. Altmetric Badge
    Chapter 58 Lower Bounds for Special Cases of Syntactic Multilinear ABPs
  60. Altmetric Badge
    Chapter 59 Approximation Algorithms on Multiple Two-Stage Flowshops
  61. Altmetric Badge
    Chapter 60 Constant Factor Approximation Algorithm for l -Pseudoforest Deletion Problem
  62. Altmetric Badge
    Chapter 61 New Bounds for Energy Complexity of Boolean Functions
  63. Altmetric Badge
    Chapter 62 Hitting and Covering Partially
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
4 X users
facebook
1 Facebook page

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
Computing and Combinatorics
Published by
Springer International Publishing, August 2018
DOI 10.1007/978-3-319-94776-1
ISBNs
978-3-31-994775-4, 978-3-31-994776-1
Editors

Wang, Lusheng, Zhu, Daming

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users 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 > Ph. D. Student 2 67%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 1 33%
Unknown 2 67%