↓ 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 Recent Results for Online Makespan Minimization
  3. Altmetric Badge
    Chapter 2 Optimal Stopping Meets Combinatorial Optimization
  4. Altmetric Badge
    Chapter 3 New Bounds for the Balloon Popping Problem
  5. Altmetric Badge
    Chapter 4 On the Sequential Price of Anarchy of Isolation Games
  6. Altmetric Badge
    Chapter 5 Social Exchange Networks with Distant Bargaining
  7. Altmetric Badge
    Chapter 6 The 1/4-Core of the Uniform Bin Packing Game Is Nonempty
  8. Altmetric Badge
    Chapter 7 On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles
  9. Altmetric Badge
    Chapter 8 On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
  10. Altmetric Badge
    Chapter 9 A Fast Algorithm for Data Collection along a Fixed Track
  11. Altmetric Badge
    Chapter 10 Random Methods for Parameterized Problems
  12. Altmetric Badge
    Chapter 11 DVS Scheduling in a Line or a Star Network of Processors
  13. Altmetric Badge
    Chapter 12 Online Algorithms for Batch Machines Scheduling with Delivery Times
  14. Altmetric Badge
    Chapter 13 How to Schedule the Marketing of Products with Negative Externalities
  15. Altmetric Badge
    Chapter 14 From Preemptive to Non-preemptive Speed-Scaling Scheduling
  16. Altmetric Badge
    Chapter 15 Selection from Read-Only Memory with Limited Workspace
  17. Altmetric Badge
    Chapter 16 Deternimization of Büchi Automata as Partitioned Automata
  18. Altmetric Badge
    Chapter 17 On Linear-Size Pseudorandom Generators and Hardcore Functions
  19. Altmetric Badge
    Chapter 18 A Fast Algorithm Finding the Shortest Reset Words
  20. Altmetric Badge
    Chapter 19 The Discrete Voronoi Game in a Simple Polygon
  21. Altmetric Badge
    Chapter 20 Facets for Art Gallery Problems
  22. Altmetric Badge
    Chapter 21 Hitting and Piercing Rectangles Induced by a Point Set
  23. Altmetric Badge
    Chapter 22 Realistic Roofs over a Rectilinear Polygon Revisited
  24. Altmetric Badge
    Chapter 23 Parametric Power Supply Networks
  25. Altmetric Badge
    Chapter 24 Approximating the Minimum Independent Dominating Set in Perturbed Graphs
  26. Altmetric Badge
    Chapter 25 A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property
  27. Altmetric Badge
    Chapter 26 On the Conjunctive Capacity of Graphs
  28. Altmetric Badge
    Chapter 27 Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
  29. Altmetric Badge
    Chapter 28 An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
  30. Altmetric Badge
    Chapter 29 Improved Local Search for Universal Facility Location
  31. Altmetric Badge
    Chapter 30 Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
  32. Altmetric Badge
    Chapter 31 The k-Separator Problem
  33. Altmetric Badge
    Chapter 32 On the Treewidth of Dynamic Graphs
  34. Altmetric Badge
    Chapter 33 Square-Orthogonal Drawing with Few Bends per Edge
  35. Altmetric Badge
    Chapter 34 Covering Tree with Stars
  36. Altmetric Badge
    Chapter 35 A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
  37. Altmetric Badge
    Chapter 36 An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
  38. Altmetric Badge
    Chapter 37 An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance
  39. Altmetric Badge
    Chapter 38 A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics
  40. Altmetric Badge
    Chapter 39 Maximum Balanced Subgraph Problem Parameterized above Lower Bound
  41. Altmetric Badge
    Chapter 40 A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies
  42. Altmetric Badge
    Chapter 41 A Linear Edge Kernel for Two-Layer Crossing Minimization
  43. Altmetric Badge
    Chapter 42 A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
  44. Altmetric Badge
    Chapter 43 Metrical Service Systems with Multiple Servers
  45. Altmetric Badge
    Chapter 44 The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity
  46. Altmetric Badge
    Chapter 45 Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing
  47. Altmetric Badge
    Chapter 46 Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
  48. Altmetric Badge
    Chapter 47 Parameterized Complexity of Flood-Filling Games on Trees
  49. Altmetric Badge
    Chapter 48 Parameterized Approximability of Maximizing the Spread of Influence in Networks
  50. Altmetric Badge
    Chapter 49 An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs
  51. Altmetric Badge
    Chapter 50 Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
  52. Altmetric Badge
    Chapter 51 Small H-Coloring Problems for Bounded Degree Digraphs
  53. Altmetric Badge
    Chapter 52 Bounded Model Checking for Propositional Projection Temporal Logic
  54. Altmetric Badge
    Chapter 53 Packing Cubes into a Cube Is NP-Hard in the Strong Sense
  55. Altmetric Badge
    Chapter 54 On the Complexity of Solving or Approximating Convex Recoloring Problems
  56. Altmetric Badge
    Chapter 55 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
  57. Altmetric Badge
    Chapter 56 How to Catch L 2-Heavy-Hitters on Sliding Windows
  58. Altmetric Badge
    Chapter 57 Time/Memory/Data Tradeoffs for Variants of the RSA Problem
  59. Altmetric Badge
    Chapter 58 An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship
  60. Altmetric Badge
    Chapter 59 Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
  61. Altmetric Badge
    Chapter 60 Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems
  62. Altmetric Badge
    Chapter 61 The Program Download Problem: Complexity and Algorithms
  63. Altmetric Badge
    Chapter 62 Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic
  64. Altmetric Badge
    Chapter 63 Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data
  65. Altmetric Badge
    Chapter 64 Sublinear Time Approximate Sum via Uniform Random Sampling
  66. Altmetric Badge
    Chapter 65 Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)
  67. Altmetric Badge
    Chapter 66 On the Minimum Caterpillar Problem in Digraphs
  68. Altmetric Badge
    Chapter 67 A New Model for Product Adoption over Social Networks
  69. Altmetric Badge
    Chapter 68 Generating Uncertain Networks Based on Historical Network Snapshots
  70. Altmetric Badge
    Chapter 69 A Short-Term Prediction Model of Topic Popularity on Microblogs
  71. Altmetric Badge
    Chapter 70 Social Network Path Analysis Based on HBase
  72. Altmetric Badge
    Chapter 71 Community Expansion Model Based on Charged System Theory
  73. Altmetric Badge
    Chapter 72 Computing and Combinatorics
  74. Altmetric Badge
    Chapter 73 Finding Network Communities Using Random Walkers with Improved Accuracy
  75. Altmetric Badge
    Chapter 74 Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category
  76. Altmetric Badge
    Chapter 75 Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks
  77. Altmetric Badge
    Chapter 76 Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks
  78. Altmetric Badge
    Chapter 77 A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
  79. Altmetric Badge
    Chapter 78 Using Network Sciences to Evaluate the Brazilian Airline Network
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users

Readers on

mendeley
10 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, Berlin, Heidelberg, January 2013
DOI 10.1007/978-3-642-38768-5
ISBNs
978-3-64-238767-8, 978-3-64-238768-5
Editors

Ding-Zhu Du, Guochuan Zhang

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 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 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 10 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 10%
Unknown 9 90%
Readers by discipline Count As %
Engineering 1 10%
Unknown 9 90%