↓ 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 Time-Space Trade-Off for Triangulations of Points in the Plane
  3. Altmetric Badge
    Chapter 2 An FPTAS for the Volume of Some $$\mathcal{V}$$ -polytopes—It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
  4. Altmetric Badge
    Chapter 3 Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing
  5. Altmetric Badge
    Chapter 4 Depth Distribution in High Dimensions
  6. Altmetric Badge
    Chapter 5 An Improved Lower Bound on the Growth Constant of Polyiamonds
  7. Altmetric Badge
    Chapter 6 Constrained Routing Between Non-Visible Vertices
  8. Altmetric Badge
    Chapter 7 Deletion Graph Problems Based on Deadlock Resolution
  9. Altmetric Badge
    Chapter 8 Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications
  10. Altmetric Badge
    Chapter 9 Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes
  11. Altmetric Badge
    Chapter 10 The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality
  12. Altmetric Badge
    Chapter 11 Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
  13. Altmetric Badge
    Chapter 12 Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing
  14. Altmetric Badge
    Chapter 13 Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
  15. Altmetric Badge
    Chapter 14 Reoptimization of Minimum Latency Problem
  16. Altmetric Badge
    Chapter 15 Pure Nash Equilibria in Restricted Budget Games
  17. Altmetric Badge
    Chapter 16 A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound
  18. Altmetric Badge
    Chapter 17 Information Complexity of the AND Function in the Two-Party and Multi-party Settings
  19. Altmetric Badge
    Chapter 18 Optimal Online Two-Way Trading with Bounded Number of Transactions
  20. Altmetric Badge
    Chapter 19 Parameterized Shifted Combinatorial Optimization
  21. Altmetric Badge
    Chapter 20 Approximate Minimum Diameter
  22. Altmetric Badge
    Chapter 21 On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction
  23. Altmetric Badge
    Chapter 22 A Tighter Relation Between Sensitivity Complexity and Certificate Complexity
  24. Altmetric Badge
    Chapter 23 Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus
  25. Altmetric Badge
    Chapter 24 Reconfiguration of Maximum-Weight b-Matchings in a Graph
  26. Altmetric Badge
    Chapter 25 Constant Approximation for Stochastic Orienteering Problem with $$(1+\epsilon )$$ -Budget Relaxiation
  27. Altmetric Badge
    Chapter 26 Quantum Query Complexity of Unitary Operator Discrimination
  28. Altmetric Badge
    Chapter 27 Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended
  29. Altmetric Badge
    Chapter 28 NP-completeness Results for Partitioning a Graph into Total Dominating Sets
  30. Altmetric Badge
    Chapter 29 Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree
  31. Altmetric Badge
    Chapter 30 Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
  32. Altmetric Badge
    Chapter 31 Faster Graph Coloring in Polynomial Space
  33. Altmetric Badge
    Chapter 32 On the Modulo Degree Complexity of Boolean Functions
  34. Altmetric Badge
    Chapter 33 Approximating Weighted Duo-Preservation in Comparative Genomics
  35. Altmetric Badge
    Chapter 34 An Incentive Compatible, Efficient Market for Air Traffic Flow Management
  36. Altmetric Badge
    Chapter 35 Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank
  37. Altmetric Badge
    Chapter 36 Dynamic Rank-Maximal Matchings
  38. Altmetric Badge
    Chapter 37 Bend Complexity and Hamiltonian Cycles in Grid Graphs
  39. Altmetric Badge
    Chapter 38 Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares
  40. Altmetric Badge
    Chapter 39 Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum
  41. Altmetric Badge
    Chapter 40 Simple $$O(n~log^{2}~n)$$ Algorithms for the Planar 2-Center Problem
  42. Altmetric Badge
    Chapter 41 Stable Matchings in Trees
  43. Altmetric Badge
    Chapter 42 Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
  44. Altmetric Badge
    Chapter 43 Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops
  45. Altmetric Badge
    Chapter 44 The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graph
  46. Altmetric Badge
    Chapter 45 Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems
  47. Altmetric Badge
    Chapter 46 On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs
  48. Altmetric Badge
    Chapter 47 A Local Search Approximation Algorithm for the k-means Problem with Penalties
  49. Altmetric Badge
    Chapter 48 Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction
  50. Altmetric Badge
    Chapter 49 Cooperative Game Theory Approaches for Network Partitioning
  51. Altmetric Badge
    Chapter 50 Chain of Influencers: Multipartite Intra-community Ranking
  52. Altmetric Badge
    Chapter 51 Influence Spread in Social Networks with both Positive and Negative Influences
  53. Altmetric Badge
    Chapter 52 Guided Genetic Algorithm for the Influence Maximization Problem
  54. Altmetric Badge
    Chapter 53 Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks
  55. Altmetric Badge
    Chapter 54 Graph Construction Based on Local Representativeness
  56. Altmetric Badge
    Chapter 55 SHADE Algorithm Dynamic Analyzed Through Complex Network
  57. Altmetric Badge
    Chapter 56 An Efficient Potential Member Promotion Algorithm in Social Networks via Skyline
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
2 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, Cham, January 2017
DOI 10.1007/978-3-319-62389-4
ISBNs
978-3-31-962388-7, 978-3-31-962389-4
Editors

Yixin Cao, Jianer Chen

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 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

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