↓ Skip to main content
What is this page? Embed badge

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 On the Complexity of 2-Club Cluster Editing with Vertex Splitting
  3. Altmetric Badge
    Chapter 2 A Sufficient Condition for the Existence of Two Completely Independent Spanning Trees
  4. Altmetric Badge
    Chapter 3 Undecidability of Polynomial Inequalities in Subset Densities and Additive Energies
  5. Altmetric Badge
    Chapter 4 Approximation Algorithm for Prize-Collecting Hypergraph Vertex Cover with Fairness Constraints
  6. Altmetric Badge
    Chapter 5 Sum-of-Max Chain Partition of a Tree
  7. Altmetric Badge
    Chapter 6 Reconfiguring Multiple Connected Components with Size Multiset Constraints
  8. Altmetric Badge
    Chapter 7 Fault Diagnosability Evaluation of BCCC Data Center Networks
  9. Altmetric Badge
    Chapter 8 Testing Some First-Order Logic Properties on Sparse Graphs
  10. Altmetric Badge
    Chapter 9 Massively Parallel Approximate Steiner Tree Algorithms
  11. Altmetric Badge
    Chapter 10 A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem
  12. Altmetric Badge
    Chapter 11 Vertex-Critical $$(P_5,W_4)$$ ( P 5 , W 4 ) -Free Graphs
  13. Altmetric Badge
    Chapter 12 A Dynamic Working Set Method for Compressed Sensing
  14. Altmetric Badge
    Chapter 13 Data Debugging Is NP-Hard for Classifiers Trained with SGD
  15. Altmetric Badge
    Chapter 14 Coresets for  k -Median of Lines with Group Fairness Constraints
  16. Altmetric Badge
    Chapter 15 Redefining Entity Integration: Theoretical Insights for GNN-Based Recommender Systems
  17. Altmetric Badge
    Chapter 16 Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
  18. Altmetric Badge
    Chapter 17 A Robust Distributed Minimax Learning Method Against Model Poisoning Attacks
  19. Altmetric Badge
    Chapter 18 Parameterized Complexity of Influence Maximization
  20. Altmetric Badge
    Chapter 19 Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows
  21. Altmetric Badge
    Chapter 20 Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?
  22. Altmetric Badge
    Chapter 21 An FPT Factor-11 Approximation Algorithm for TSP
  23. Altmetric Badge
    Chapter 22 From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems
  24. Altmetric Badge
    Chapter 23 Revisit the Partial Coloring Method: Prefix Spencer and Sampling
  25. Altmetric Badge
    Chapter 24 A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem
  26. Altmetric Badge
    Chapter 25 Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals
  27. Altmetric Badge
    Chapter 26 Longest Double-Bounded ( k ]-Tuple Common Substrings
  28. Altmetric Badge
    Chapter 27 Finding Cycle Types in Permutation Groups with Few Generators
  29. Altmetric Badge
    Chapter 28 Counting Overlapping Pairs of Words
Attention for Chapter 28: Counting Overlapping Pairs of Words
Altmetric Badge

Mentioned by

twitter
1 X user
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.
Chapter title
Counting Overlapping Pairs of Words
Chapter number 28
Book title
Computing and Combinatorics
Published by
Springer, Singapore, January 2026
DOI 10.1007/978-981-95-0218-9_28
Book ISBNs
978-9-81-950217-2, 978-9-81-950218-9
Authors

Rivals, Eric, Wang, Pengfei, Eric Rivals, Pengfei Wang

View on publisher site

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
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.