↓ Skip to main content

WALCOM: Algorithms and Computation

Overview of attention for book
Cover of 'WALCOM: Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis
  3. Altmetric Badge
    Chapter 2 Tropical Dominating Sets in Vertex-Coloured Graphs
  4. Altmetric Badge
    Chapter 3 WALCOM: Algorithms and Computation
  5. Altmetric Badge
    Chapter 4 Vertex-Coloring with Star-Defects
  6. Altmetric Badge
    Chapter 5 Lower Bounds for Graph Exploration Using Local Policies
  7. Altmetric Badge
    Chapter 6 Optimal Distributed Searching in the Plane with and Without Uncertainty
  8. Altmetric Badge
    Chapter 7 Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
  9. Altmetric Badge
    Chapter 8 On Aligned Bar 1-Visibility Graphs
  10. Altmetric Badge
    Chapter 9 A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
  11. Altmetric Badge
    Chapter 10 Mixing Times of Markov Chains of 2-Orientations
  12. Altmetric Badge
    Chapter 11 Computing a Minimum-Width Square Annulus in Arbitrary Orientation
  13. Altmetric Badge
    Chapter 12 A General Framework for Searching on a Line
  14. Altmetric Badge
    Chapter 13 An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
  15. Altmetric Badge
    Chapter 14 Covering Points with Convex Sets of Minimum Size
  16. Altmetric Badge
    Chapter 15 Efficient Generation of Top-k Procurements in a Multi-item Auction
  17. Altmetric Badge
    Chapter 16 Counting Subgraphs in Relational Event Graphs
  18. Altmetric Badge
    Chapter 17 Large Independent Sets in Subquartic Planar Graphs
  19. Altmetric Badge
    Chapter 18 As Close as It Gets
  20. Altmetric Badge
    Chapter 19 Shortest Reconfiguration of Sliding Tokens on a Caterpillar
  21. Altmetric Badge
    Chapter 20 Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers
  22. Altmetric Badge
    Chapter 21 Approximation Algorithms for Generalized Bounded Tree Cover
  23. Altmetric Badge
    Chapter 22 Approximation Algorithms for Three Dimensional Protein Folding
  24. Altmetric Badge
    Chapter 23 Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
  25. Altmetric Badge
    Chapter 24 Optimal Online Algorithms for the Multi-objective Time Series Search Problem
  26. Altmetric Badge
    Chapter 25 Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs
  27. Altmetric Badge
    Chapter 26 A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems
  28. Altmetric Badge
    Chapter 27 Semimetric Properties of Sørensen-Dice and Tversky Indexes
  29. Altmetric Badge
    Chapter 28 Finding Mode Using Equality Comparisons
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 tweeters
facebook
1 Facebook page

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
WALCOM: Algorithms and Computation
Published by
Springer, March 2016
DOI 10.1007/978-3-319-30139-6
ISBNs
978-3-31-930139-6, 978-3-31-930138-9
Editors

Kaykobad, Mohammad, Petreschi, Rossella

Twitter Demographics

The data shown below were collected from the profiles of 3 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 %
Computer Science 1 100%