↓ Skip to main content

SOFSEM 2019: Theory and Practice of Computer Science

Overview of attention for book
Cover of 'SOFSEM 2019: Theory and Practice of Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Cross-Layer Adaptation in Multi-layer Autonomic Systems (Invited Talk)
  3. Altmetric Badge
    Chapter 2 Distance-Based Community Search (Invited Talk Extended Abstract)
  4. Altmetric Badge
    Chapter 3 Minicomplexity
  5. Altmetric Badge
    Chapter 4 Action Research in Software Engineering: Metrics’ Research Perspective (Invited Talk)
  6. Altmetric Badge
    Chapter 5 From Big Data to Big Knowledge
  7. Altmetric Badge
    Chapter 6 Sorting Networks on Restricted Topologies
  8. Altmetric Badge
    Chapter 7 Minimum Reload Cost Graph Factors
  9. Altmetric Badge
    Chapter 8 Stable Divisorial Gonality is in NP
  10. Altmetric Badge
    Chapter 9 Coalition Resilient Outcomes in Max k-Cut Games
  11. Altmetric Badge
    Chapter 10 Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
  12. Altmetric Badge
    Chapter 11 On Infinite Prefix Normal Words
  13. Altmetric Badge
    Chapter 12 Priority Scheduling in the Bamboo Garden Trimming Problem
  14. Altmetric Badge
    Chapter 13 Patrolling on Dynamic Ring Networks
  15. Altmetric Badge
    Chapter 14 Gathering of Robots in a Grid with Mobile Faults
  16. Altmetric Badge
    Chapter 15 Probabilistic Parameterized Polynomial Time
  17. Altmetric Badge
    Chapter 16 On Matrix Ins-Del Systems of Small Sum-Norm
  18. Altmetric Badge
    Chapter 17 Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints
  19. Altmetric Badge
    Chapter 18 On the Complexity of Optimal Matching Reconfiguration
  20. Altmetric Badge
    Chapter 19 Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs
  21. Altmetric Badge
    Chapter 20 Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption
  22. Altmetric Badge
    Chapter 21 On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge
  23. Altmetric Badge
    Chapter 22 Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison
  24. Altmetric Badge
    Chapter 23 Multi-stranded String Assembling Systems
  25. Altmetric Badge
    Chapter 24 Towards Automatic Comparison of Cloud Service Security Certifications
  26. Altmetric Badge
    Chapter 25 On the Expressive Power of GF(2)-Grammars
  27. Altmetric Badge
    Chapter 26 An Efficient Algorithm for Combining Verification and Validation Methods
  28. Altmetric Badge
    Chapter 27 Robustness Radius for Chamberlin-Courant on Restricted Domains
  29. Altmetric Badge
    Chapter 28 On the Complexity of Color-Avoiding Site and Bond Percolation
  30. Altmetric Badge
    Chapter 29 Lackadaisical Quantum Walks with Multiple Marked Vertices
  31. Altmetric Badge
    Chapter 30 A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs
  32. Altmetric Badge
    Chapter 31 Minimizing the Cost of Team Exploration
  33. Altmetric Badge
    Chapter 32 Two-Head Finite-State Acceptors with Translucent Letters
  34. Altmetric Badge
    Chapter 33 Do Null-Type Mutation Operators Help Prevent Null-Type Faults?
  35. Altmetric Badge
    Chapter 34 Towards Combining Multitask and Multilingual Learning
  36. Altmetric Badge
    Chapter 35 On the Size of Logical Automata
  37. Altmetric Badge
    Chapter 36 Bayesian Root Cause Analysis by Separable Likelihoods
  38. Altmetric Badge
    Chapter 37 Algorithms and Complexity Results for the Capacitated Vertex Cover Problem
  39. Altmetric Badge
    Chapter 38 Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems
  40. Altmetric Badge
    Chapter 39 A Hierarchy of Polynomial Kernels
  41. Altmetric Badge
    Chapter 40 Behavioral Strengths and Weaknesses of Various Models of Limited Automata
Attention for Chapter 28: On the Complexity of Color-Avoiding Site and Bond Percolation
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (65th percentile)
  • High Attention Score compared to outputs of the same age and source (84th percentile)

Mentioned by

11 tweeters


1 Dimensions

Readers on

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.
Chapter title
On the Complexity of Color-Avoiding Site and Bond Percolation
Chapter number 28
Book title
SOFSEM 2019: Theory and Practice of Computer Science
Published in
arXiv, January 2019
DOI 10.1007/978-3-030-10801-4_28
Book ISBNs
978-3-03-010800-7, 978-3-03-010801-4

Roland Molontay, Kitti Varga

Twitter Demographics

The data shown below were collected from the profiles of 11 tweeters who shared this research output. Click here to find out more about how the information was compiled.

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 %
Researcher 1 100%
Readers by discipline Count As %
Mathematics 1 100%

Attention Score in Context

This research output has an Altmetric Attention Score of 5. 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 04 November 2018.
All research outputs
of 15,132,677 outputs
Outputs from arXiv
of 576,342 outputs
Outputs of similar age
of 322,406 outputs
Outputs of similar age from arXiv
of 26,809 outputs
Altmetric has tracked 15,132,677 research outputs across all sources so far. This one has received more attention than most of these and is in the 73rd percentile.
So far Altmetric has tracked 576,342 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done well, scoring higher than 85% 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 322,406 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 65% of its contemporaries.
We're also able to compare this research output to 26,809 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 84% of its contemporaries.