↓ Skip to main content

Algorithm Theory -- SWAT 2012

Overview of attention for book
Cover of 'Algorithm Theory -- SWAT 2012'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 α -Visibility
  3. Altmetric Badge
    Chapter 2 Partial Matching between Surfaces Using Fréchet Distance
  4. Altmetric Badge
    Chapter 3 A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
  5. Altmetric Badge
    Chapter 4 Watchman Routes for Lines and Segments
  6. Altmetric Badge
    Chapter 5 Algorithm Theory – SWAT 2012
  7. Altmetric Badge
    Chapter 6 Higher Order City Voronoi Diagrams
  8. Altmetric Badge
    Chapter 7 On Minimum Sum of Radii and Diameters Clustering
  9. Altmetric Badge
    Chapter 8 A Simple Framework for the Generalized Nearest Neighbor Problem
  10. Altmetric Badge
    Chapter 9 Deterministic Parameterized Connected Vertex Cover
  11. Altmetric Badge
    Chapter 10 Faster Parameterized Algorithms for Deletion to Split Graphs
  12. Altmetric Badge
    Chapter 11 A Single-Exponential FPT Algorithm for the K 4 -Minor Cover Problem
  13. Altmetric Badge
    Chapter 12 An O ( n 3 loglog n /log 2 n ) Time Algorithm for All Pairs Shortest Paths
  14. Altmetric Badge
    Chapter 13 Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
  15. Altmetric Badge
    Chapter 14 Induced Disjoint Paths in AT-Free Graphs
  16. Altmetric Badge
    Chapter 15 Effective Computation of Immersion Obstructions for Unions of Graph Classes
  17. Altmetric Badge
    Chapter 16 Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
  18. Altmetric Badge
    Chapter 17 Annotating Simplices with a Homology Basis and Its Applications
  19. Altmetric Badge
    Chapter 18 Do Directional Antennas Facilitate in Reducing Interferences?
  20. Altmetric Badge
    Chapter 19 Minimum Convex Partitions and Maximum Empty Polytopes
  21. Altmetric Badge
    Chapter 20 A Probabilistic Analysis of Christofides’ Algorithm
  22. Altmetric Badge
    Chapter 21 New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
  23. Altmetric Badge
    Chapter 22 Non-preemptive Speed Scaling
  24. Altmetric Badge
    Chapter 23 A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
  25. Altmetric Badge
    Chapter 24 Sorted Range Reporting
  26. Altmetric Badge
    Chapter 25 String Indexing for Patterns with Wildcards
  27. Altmetric Badge
    Chapter 26 Linear-Space Data Structures for Range Minority Query in Arrays
  28. Altmetric Badge
    Chapter 27 Asynchronous Rumor Spreading in Preferential Attachment Graphs
  29. Altmetric Badge
    Chapter 28 Connectivity Oracles for Planar Graphs
  30. Altmetric Badge
    Chapter 29 Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
  31. Altmetric Badge
    Chapter 30 Competitive Analysis of Maintaining Frequent Items of a Stream
  32. Altmetric Badge
    Chapter 31 Kernel Bounds for Structural Parameterizations of Pathwidth
  33. Altmetric Badge
    Chapter 32 Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs
  34. Altmetric Badge
    Chapter 33 Testing formula satisfaction
  35. Altmetric Badge
    Chapter 34 Reconstructing Strings from Substrings with Quantum Queries
Attention for Chapter 33: Testing formula satisfaction
Altmetric Badge

Mentioned by

twitter
1 X user

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.
Chapter title
Testing formula satisfaction
Chapter number 33
Book title
Algorithm Theory – SWAT 2012
Published in
Lecture notes in computer science, January 2012
DOI 10.1007/978-3-642-31155-0_33
Book ISBNs
978-3-64-231154-3, 978-3-64-231155-0
Authors

Eldar Fischer, Yonatan Goldhirsh, Oded Lachish, Fischer, Eldar, Goldhirsh, Yonatan, Lachish, Oded

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

Geographical breakdown

Country Count As %
United Kingdom 2 50%
United States 1 25%
Unknown 1 25%

Demographic breakdown

Readers by professional status Count As %
Librarian 2 50%
Researcher 1 25%
Student > Doctoral Student 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Business, Management and Accounting 1 25%
Social Sciences 1 25%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 02 June 2014.
All research outputs
#18,379,655
of 22,765,347 outputs
Outputs from Lecture notes in computer science
#6,007
of 8,125 outputs
Outputs of similar age
#196,175
of 244,310 outputs
Outputs of similar age from Lecture notes in computer science
#389
of 490 outputs
Altmetric has tracked 22,765,347 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
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 244,310 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 9th percentile – i.e., 9% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 490 others from the same source and published within six weeks on either side of this one. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.