↓ Skip to main content

FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science : 20th Conference New Delhi, India, December 13–15, 2000 Proceedings

Overview of attention for book
Cover of 'FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science : 20th Conference New Delhi, India, December 13–15, 2000 Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Model Checking: Theory into Practice
  3. Altmetric Badge
    Chapter 2 An Algebra for XML Query
  4. Altmetric Badge
    Chapter 3 Irregularities of Distribution, Derandomization, and Complexity Theory
  5. Altmetric Badge
    Chapter 4 Rewriting Logic as a Metalogical Framework
  6. Altmetric Badge
    Chapter 5 Frequency Assignment in Mobile Phone Systems
  7. Altmetric Badge
    Chapter 6 Data Provenance: Some Basic Issues
  8. Altmetric Badge
    Chapter 7 Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition
  9. Altmetric Badge
    Chapter 8 On-Line Edge-Coloring with a Fixed Number of Colors
  10. Altmetric Badge
    Chapter 9 On Approximability of the Independent/Connected Edge Dominating Set Problems
  11. Altmetric Badge
    Chapter 10 Model Checking CTL Properties of Pushdown Systems
  12. Altmetric Badge
    Chapter 11 A Decidable Dense Branching-Time Temporal Logic
  13. Altmetric Badge
    Chapter 12 Fair Equivalence Relations
  14. Altmetric Badge
    Chapter 13 Arithmetic Circuits and Polynomial Replacement Systems
  15. Altmetric Badge
    Chapter 14 Depth-3 Arithmetic Circuits for S inn su2 (X) and Extensions of the Graham-Pollack Theorem
  16. Altmetric Badge
    Chapter 15 The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
  17. Altmetric Badge
    Chapter 16 Combining Semantics with Non-standard Interpreter Hierarchies
  18. Altmetric Badge
    Chapter 17 Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
  19. Altmetric Badge
    Chapter 18 Dynamically Ordered Probabilistic Choice Logic Programming
  20. Altmetric Badge
    Chapter 19 Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
  21. Altmetric Badge
    Chapter 20 Planar Graph Blocking for External Searching
  22. Altmetric Badge
    Chapter 21 A Complete Fragment of Higher-Order Duration μ-Calculus
  23. Altmetric Badge
    Chapter 22 A Complete Axiomatisation for Timed Automata
  24. Altmetric Badge
    Chapter 23 Text Sparsification via Local Maxima
  25. Altmetric Badge
    Chapter 24 Approximate Swapped Matching
  26. Altmetric Badge
    Chapter 25 A Semantic Theory for Heterogeneous System Design
  27. Altmetric Badge
    Chapter 26 Formal Verification of the Ricart-Agrawala Algorithm
  28. Altmetric Badge
    Chapter 27 On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
  29. Altmetric Badge
    Chapter 28 Θ in2 sup -Completeness: A Classical Approach for New Results
  30. Altmetric Badge
    Chapter 29 Is the Standard Proof System for SAT P-Optimal?
  31. Altmetric Badge
    Chapter 30 A General Framework for Types in Graph Rewriting
  32. Altmetric Badge
    Chapter 31 The Ground Congruence for Chi Calculus
  33. Altmetric Badge
    Chapter 32 Inheritance in the Join Calculus
  34. Altmetric Badge
    Chapter 33 Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
  35. Altmetric Badge
    Chapter 34 Dynamic Spectrum Allocation: The Impotency of Duration Notification
  36. Altmetric Badge
    Chapter 35 The Fine Structure of Game Lambda Models
  37. Altmetric Badge
    Chapter 36 Strong Normalization of Second Order Symmetric λ-Calculus
  38. Altmetric Badge
    Chapter 37 Scheduling to Minimize the Average Completion Time of Dedicated Tasks
  39. Altmetric Badge
    Chapter 38 Hunting for Functionally Analogous Genes
  40. Altmetric Badge
    Chapter 39 Keeping Track of the Latest Gossip in Shared Memory Systems
  41. Altmetric Badge
    Chapter 40 Concurrent Knowledge and Logical Clock Abstractions
  42. Altmetric Badge
    Chapter 41 Decidable Hierarchies of Starfree Languages
  43. Altmetric Badge
    Chapter 42 Prefix Languages of Church-Rosser Languages
Attention for Chapter 19: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (57th percentile)

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

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
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Chapter number 19
Book title
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science
Published in
Lecture notes in computer science, November 2000
DOI 10.1007/3-540-44450-5_19
Book ISBNs
978-3-54-041413-1, 978-3-54-044450-3
Authors

Michael, R. Fellows, McCartin, Catherine, Frances, A. Rosamond, Stege, Ulrike, R. Fellows Michael, Catherine McCartin, A. Rosamond Frances, Ulrike Stege

Editors

Kapoor, Sanjiv, Prasad, Sanjiva

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 1 25%
Professor > Associate Professor 1 25%
Lecturer 1 25%
Student > Master 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Engineering 1 25%
Unknown 1 25%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 22 September 2017.
All research outputs
#7,474,859
of 22,851,489 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,126 outputs
Outputs of similar age
#26,349
of 114,170 outputs
Outputs of similar age from Lecture notes in computer science
#8
of 26 outputs
Altmetric has tracked 22,851,489 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% 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 114,170 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 17th percentile – i.e., 17% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 26 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 57% of its contemporaries.