↓ 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 Building above Read-once Polynomials: Identity Testing and Hardness of Representation
  3. Altmetric Badge
    Chapter 2 Sampling from Dense Streams without Penalty
  4. Altmetric Badge
    Chapter 3 L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
  5. Altmetric Badge
    Chapter 4 Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm
  6. Altmetric Badge
    Chapter 5 Online Prediction Problems with Variation
  7. Altmetric Badge
    Chapter 6 Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
  8. Altmetric Badge
    Chapter 7 An Axiomatization for Cylinder Computation Model
  9. Altmetric Badge
    Chapter 8 Normal Form Expressions of Propositional Projection Temporal Logic
  10. Altmetric Badge
    Chapter 9 On the Smoothed Heights of Trie and Patricia Index Trees
  11. Altmetric Badge
    Chapter 10 One-Dimensional k-Center on Uncertain Data
  12. Altmetric Badge
    Chapter 11 The Range 1 Query (R1Q) Problem
  13. Altmetric Badge
    Chapter 12 Competitive Cost-Savings in Data Stream Management Systems
  14. Altmetric Badge
    Chapter 13 On the Kernelization Complexity of String Problems
  15. Altmetric Badge
    Chapter 14 Complexity of Dense Bicluster Editing Problems
  16. Altmetric Badge
    Chapter 15 Parameterized Complexity of Edge Interdiction Problems
  17. Altmetric Badge
    Chapter 16 Vertex Cover Gets Faster and Harder on Low Degree Graphs
  18. Altmetric Badge
    Chapter 17 A Protocol for Generating Random Elements with Their Probabilities
  19. Altmetric Badge
    Chapter 18 A New View on Worst-Case to Average-Case Reductions for NP Problems
  20. Altmetric Badge
    Chapter 19 The Power of Duples (in Self-Assembly): It’s Not So Hip to Be Square
  21. Altmetric Badge
    Chapter 20 A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents
  22. Altmetric Badge
    Chapter 21 Diffuse Reflection Radius in a Simple Polygon
  23. Altmetric Badge
    Chapter 22 On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes
  24. Altmetric Badge
    Chapter 23 Directed Steiner Tree with Branching Constraint
  25. Altmetric Badge
    Chapter 24 On the Parameterized Complexity of Labelled Correlation Clustering Problem
  26. Altmetric Badge
    Chapter 25 Shortest Color-Spanning Intervals
  27. Altmetric Badge
    Chapter 26 Fixed parameter tractable algorithms in combinatorial topology
  28. Altmetric Badge
    Chapter 27 Improved Approximation Algorithms for a Bilevel Knapsack Problem
  29. Altmetric Badge
    Chapter 28 A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
  30. Altmetric Badge
    Chapter 29 Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
  31. Altmetric Badge
    Chapter 30 A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem
  32. Altmetric Badge
    Chapter 31 Approximability of the Minimum Weighted Doubly Resolving Set Problem
  33. Altmetric Badge
    Chapter 32 Approximating High-Dimensional Range Queries with kNN Indexing Techniques
  34. Altmetric Badge
    Chapter 33 Approximation Algorithms for Maximum Agreement Forest on Multiple Trees
  35. Altmetric Badge
    Chapter 34 Optimal Inspection Points for Malicious Attack Detection in Smart Grids
  36. Altmetric Badge
    Chapter 35 Reconfiguration of Dominating Sets
  37. Altmetric Badge
    Chapter 36 Back-Up 2-Center on a Path/Tree/Cycle/Unicycle
  38. Altmetric Badge
    Chapter 37 Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
  39. Altmetric Badge
    Chapter 38 Approximation Algorithm for the Balanced 2-Connected Bipartition Problem
  40. Altmetric Badge
    Chapter 39 Improved Approximation for Time-Dependent Shortest Paths
  41. Altmetric Badge
    Chapter 40 Approximate Sorting of Data Streams with Limited Storage
  42. Altmetric Badge
    Chapter 41 Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
  43. Altmetric Badge
    Chapter 42 Classifying the Clique-Width of H-Free Bipartite Graphs
  44. Altmetric Badge
    Chapter 43 Displacing Random Sensors to Avoid Interference
  45. Altmetric Badge
    Chapter 44 On the Performance of Mildly Greedy Players in Cut Games
  46. Altmetric Badge
    Chapter 45 Statistical Properties of Short RSA Distribution and Their Cryptographic Applications
  47. Altmetric Badge
    Chapter 46 Numerical Tic-Tac-Toe on the 4×4 Board
  48. Altmetric Badge
    Chapter 47 On Linear Congestion Games with Altruistic Social Context
  49. Altmetric Badge
    Chapter 48 Scheduling over Scenarios on Two Machines
  50. Altmetric Badge
    Chapter 49 The Complexity of Bounded Register and Skew Arithmetic Computation
  51. Altmetric Badge
    Chapter 50 Minimizing Average Flow-Time under Knapsack Constraint
  52. Altmetric Badge
    Chapter 51 Depth Lower Bounds against Circuits with Sparse Orientation
  53. Altmetric Badge
    Chapter 52 Efficient Respondents Selection for Biased Survey Using Online Social Networks
  54. Altmetric Badge
    Chapter 53 Explaining Snapshots of Network Diffusions: Structural and Hardness Results
  55. Altmetric Badge
    Chapter 54 Pioneers of Influence Propagation in Social Networks
  56. Altmetric Badge
    Chapter 55 Empirical Models for Complex Network Dynamics: A Preliminary Study
  57. Altmetric Badge
    Chapter 56 Partner Matching Applications of Social Networks
  58. Altmetric Badge
    Chapter 57 YASCA: An Ensemble-Based Approach for Community Detection in Complex Networks
  59. Altmetric Badge
    Chapter 58 Mining the Key Structure of the Information Diffusion Network
  60. Altmetric Badge
    Chapter 59 Handling Big Data of Online Social Networks on a Small Machine
  61. Altmetric Badge
    Chapter 60 Erratum: A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
  62. Altmetric Badge
    Chapter 61 Erratum: Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users

Readers on

mendeley
4 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 2014
DOI 10.1007/978-3-319-08783-2
ISBNs
978-3-31-908782-5, 978-3-31-908783-2
Editors

Zhipeng Cai, Alex Zelikovsky, Anu Bourgeois

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 50%
Student > Master 1 25%
Unknown 1 25%
Readers by discipline Count As %
Mathematics 1 25%
Computer Science 1 25%
Engineering 1 25%
Unknown 1 25%