↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Branching Systems
  3. Altmetric Badge
    Chapter 2 Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
  4. Altmetric Badge
    Chapter 3 Succinct Representations of Trees
  5. Altmetric Badge
    Chapter 4 K t Minors in Large t -Connected Graphs
  6. Altmetric Badge
    Chapter 5 Intractability in Graph Drawing and Geometry: FPT Approaches
  7. Altmetric Badge
    Chapter 6 Evaluation of Recoverable-Robust Timetables on Tree Networks
  8. Altmetric Badge
    Chapter 7 Weighted LCS
  9. Altmetric Badge
    Chapter 8 Integrality Properties of Certain Special Balanceable Families
  10. Altmetric Badge
    Chapter 9 Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
  11. Altmetric Badge
    Chapter 10 Polynomial Kernels for 3-Leaf Power Graph Modification Problems
  12. Altmetric Badge
    Chapter 11 Approximating the Max Edge-Coloring Problem
  13. Altmetric Badge
    Chapter 12 Three Complexity Results on Coloring P k -Free Graphs
  14. Altmetric Badge
    Chapter 13 Fully Decomposable Split Graphs
  15. Altmetric Badge
    Chapter 14 Feedback Vertex Set on Graphs of Low Cliquewidth
  16. Altmetric Badge
    Chapter 15 Note on Decomposition of K n , n into (0, j )-prisms
  17. Altmetric Badge
    Chapter 16 Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
  18. Altmetric Badge
    Chapter 17 Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O ( n ) Breadth-First Search
  19. Altmetric Badge
    Chapter 18 LPF Computation Revisited
  20. Altmetric Badge
    Chapter 19 Limiting Distribution for Distances in k -Trees
  21. Altmetric Badge
    Chapter 20 Gray Code Compression
  22. Altmetric Badge
    Chapter 21 Embedded Trees and the Support of the ISE
  23. Altmetric Badge
    Chapter 22 Combinatorial Models for Cooperation Networks
  24. Altmetric Badge
    Chapter 23 Polar Permutation Graphs
  25. Altmetric Badge
    Chapter 24 A New Algorithm for Efficient Pattern Matching with Swaps
  26. Altmetric Badge
    Chapter 25 The Height and Range of Watermelons without Wall
  27. Altmetric Badge
    Chapter 26 Fast Convolutions and Their Applications in Approximate String Matching
  28. Altmetric Badge
    Chapter 27 Better Polynomial Algorithms on Graphs of Bounded Rank-Width
  29. Altmetric Badge
    Chapter 28 Minimax Trees in Linear Time with Applications
  30. Altmetric Badge
    Chapter 29 Planar Biconnectivity Augmentation with Fixed Embedding
  31. Altmetric Badge
    Chapter 30 Trivially-Perfect Width
  32. Altmetric Badge
    Chapter 31 Lightweight Parameterized Suffix Array Construction
  33. Altmetric Badge
    Chapter 32 On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
  34. Altmetric Badge
    Chapter 33 Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
  35. Altmetric Badge
    Chapter 34 On the Maximal Number of Cubic Subwords in a String
  36. Altmetric Badge
    Chapter 36 An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
  37. Altmetric Badge
    Chapter 37 Simpler Parameterized Algorithm for OCT
  38. Altmetric Badge
    Chapter 38 Bipartite Graphs of Large Clique-Width
  39. Altmetric Badge
    Chapter 39 Kernel in Oriented Circulant Graphs
  40. Altmetric Badge
    Chapter 40 Randomized Postoptimization of Covering Arrays
  41. Altmetric Badge
    Chapter 41 New Word-Based Adaptive Dense Compressors
  42. Altmetric Badge
    Chapter 42 Rainbow Connection in Graphs with Minimum Degree Three
  43. Altmetric Badge
    Chapter 43 The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
  44. Altmetric Badge
    Chapter 44 Computability of Width of Submodular Partition Functions
  45. Altmetric Badge
    Chapter 45 The Guarding Problem – Complexity and Approximation
  46. Altmetric Badge
    Chapter 46 Antibandwidth of d-Dimensional Meshes
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age (63rd percentile)
  • Good Attention Score compared to outputs of the same age and source (70th percentile)

Mentioned by

twitter
1 X user
wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

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
Combinatorial Algorithms
Published by
ADS, November 2009
DOI 10.1007/978-3-642-10217-2
ISBNs
978-3-64-210216-5, 978-3-64-210217-2
Editors

Fiala, Jiří, Kratochvíl, Jan, Miller, Mirka

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 %
Librarian 1 100%
Readers by discipline Count As %
Engineering 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 26 September 2022.
All research outputs
#8,463,388
of 25,837,817 outputs
Outputs from ADS
#7,252
of 26,309 outputs
Outputs of similar age
#38,010
of 111,629 outputs
Outputs of similar age from ADS
#77
of 265 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. This one has received more attention than most of these and is in the 66th percentile.
So far Altmetric has tracked 26,309 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has gotten more attention than average, scoring higher than 72% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 111,629 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 63% of its contemporaries.
We're also able to compare this research output to 265 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 70% of its contemporaries.