↓ 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 Fully Dynamic Arboricity Maintenance
  3. Altmetric Badge
    Chapter 2 A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice
  4. Altmetric Badge
    Chapter 3 An FPTAS for a General Class of Parametric Optimization Problems
  5. Altmetric Badge
    Chapter 4 Geodesic Fault-Tolerant Additive Weighted Spanners
  6. Altmetric Badge
    Chapter 5 Diameter of Colorings Under Kempe Changes
  7. Altmetric Badge
    Chapter 6 Dominating Set on Overlap Graphs of Rectangles Intersecting a Line
  8. Altmetric Badge
    Chapter 7 Minimizing the Cost of Batch Calibrations
  9. Altmetric Badge
    Chapter 8 Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
  10. Altmetric Badge
    Chapter 9 Chance-Constrained Submodular Knapsack Problem
  11. Altmetric Badge
    Chapter 10 Approximation Hardness of Travelling Salesman via Weighted Amplifiers
  12. Altmetric Badge
    Chapter 11 Deleting to Structured Trees
  13. Altmetric Badge
    Chapter 12 Sensitivity, Affine Transforms and Quantum Communication Complexity
  14. Altmetric Badge
    Chapter 13 On Exactly Learning Disjunctions and DNFs Without Equivalence Queries
  15. Altmetric Badge
    Chapter 14 Interactive Physical Zero-Knowledge Proof for Norinori
  16. Altmetric Badge
    Chapter 15 On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
  17. Altmetric Badge
    Chapter 16 Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
  18. Altmetric Badge
    Chapter 17 Feasibility Algorithms for the Duplication-Loss Cost
  19. Altmetric Badge
    Chapter 18 Imbalance, Cutwidth, and the Structure of Optimal Orderings
  20. Altmetric Badge
    Chapter 19 Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs
  21. Altmetric Badge
    Chapter 20 A Simple Construction of Broadcast Graphs
  22. Altmetric Badge
    Chapter 21 No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
  23. Altmetric Badge
    Chapter 22 Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts
  24. Altmetric Badge
    Chapter 23 3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation
  25. Altmetric Badge
    Chapter 24 Max-Min 3-Dispersion Problems
  26. Altmetric Badge
    Chapter 25 Matching Cut in Graphs with Large Minimum Degree
  27. Altmetric Badge
    Chapter 26 Incremental Optimization of Independent Sets Under the Reconfiguration Framework
  28. Altmetric Badge
    Chapter 27 Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems
  29. Altmetric Badge
    Chapter 28 On 1-Factorizations of Bipartite Kneser Graphs
  30. Altmetric Badge
    Chapter 29 An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead
  31. Altmetric Badge
    Chapter 30 Reoptimization of Path Vertex Cover Problem
  32. Altmetric Badge
    Chapter 31 A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs
  33. Altmetric Badge
    Chapter 32 The Seeding Algorithm for Functional k -Means Problem
  34. Altmetric Badge
    Chapter 33 More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space
  35. Altmetric Badge
    Chapter 34 Lower Bounds for Small Ramsey Numbers on Hypergraphs
  36. Altmetric Badge
    Chapter 35 APTER: Aggregated Prognosis Through Exponential Re-weighting
  37. Altmetric Badge
    Chapter 36 An Erdős–Pósa Theorem on Neighborhoods and Domination Number
  38. Altmetric Badge
    Chapter 37 On the Hardness of Reachability Reduction
  39. Altmetric Badge
    Chapter 38 Give and Take: Adaptive Balanced Allocation for Peer Assessments
  40. Altmetric Badge
    Chapter 39 LIKE Patterns and Complexity
  41. Altmetric Badge
    Chapter 40 Data Structures for Incremental Interval Coloring
  42. Altmetric Badge
    Chapter 41 Lower Bounds for the Happy Coloring Problems
  43. Altmetric Badge
    Chapter 42 An Efficient Decision Procedure for Propositional Projection Temporal Logic
  44. Altmetric Badge
    Chapter 43 On the Relationship Between Energy Complexity and Other Boolean Function Measures
  45. Altmetric Badge
    Chapter 44 The One-Round Multi-player Discrete Voronoi Game on Grids and Trees
  46. Altmetric Badge
    Chapter 45 Competitive Auctions and Envy-Freeness for Group of Agents
  47. Altmetric Badge
    Chapter 46 Upper and Lower Bounds on Approximating Weighted Mixed Domination
  48. Altmetric Badge
    Chapter 47 Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints
  49. Altmetric Badge
    Chapter 48 An Approximation Algorithm for Sorting by Bounded Singleton Moves
  50. Altmetric Badge
    Chapter 49 Universal Facility Location in Generalized Metric Space
  51. Altmetric Badge
    Chapter 50 Activation Probability Maximization for Target Users Under Influence Decay Model
  52. Altmetric Badge
    Chapter 51 Maximization of Constrained Non-submodular Functions
  53. Altmetric Badge
    Chapter 52 Truthful Mechanism Design of Reversed Auction on Cloud Computing
  54. Altmetric Badge
    Chapter 53 Distance Constrained Vehicle Routing Problem to Minimize the Total Cost
  55. Altmetric Badge
    Chapter 54 Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint
  56. Altmetric Badge
    Chapter 55 A Proof System for a Unified Temporal Logic
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
1 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, September 2019
DOI 10.1007/978-3-030-26176-4
ISBNs
978-3-03-026175-7, 978-3-03-026176-4
Editors

Du, Ding-Zhu, Duan, Zhenhua, Tian, Cong

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%