↓ Skip to main content
What is this page? Embed badge

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 Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
  3. Altmetric Badge
    Chapter 2 Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
  4. Altmetric Badge
    Chapter 3 Dynamic Sum-Radii Clustering
  5. Altmetric Badge
    Chapter 4 How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
  6. Altmetric Badge
    Chapter 5 On Guarding Orthogonal Polygons with Sliding Cameras
  7. Altmetric Badge
    Chapter 6 Bundling Two Simple Polygons to Minimize Their Convex Hull
  8. Altmetric Badge
    Chapter 7 Tangle and Maximal Ideal
  9. Altmetric Badge
    Chapter 8 A Width Parameter Useful for Chordal and Co-comparability Graphs
  10. Altmetric Badge
    Chapter 9 Byzantine Gathering in Networks with Authenticated Whiteboards
  11. Altmetric Badge
    Chapter 10 Generating All Patterns of Graph Partitions Within a Disparity Bound
  12. Altmetric Badge
    Chapter 11 An Experimental Study on the Ply Number of Straight-Line Drawings
  13. Altmetric Badge
    Chapter 12 Complexity Measures for Mosaic Drawings
  14. Altmetric Badge
    Chapter 13 Fast Optimal Labelings for Rotating Maps
  15. Altmetric Badge
    Chapter 14 Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
  16. Altmetric Badge
    Chapter 15 Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
  17. Altmetric Badge
    Chapter 16 Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
  18. Altmetric Badge
    Chapter 17 A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
  19. Altmetric Badge
    Chapter 18 Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
  20. Altmetric Badge
    Chapter 19 Online Inserting Points Uniformly on the Sphere
  21. Altmetric Badge
    Chapter 20 Computing the Center Region and Its Variants
  22. Altmetric Badge
    Chapter 21 Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
  23. Altmetric Badge
    Chapter 22 Gathering Asynchronous Robots in the Presence of Obstacles
  24. Altmetric Badge
    Chapter 23 A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
  25. Altmetric Badge
    Chapter 24 Time-Space Trade-Off for Finding the k -Visibility Region of a Point in a Polygon
  26. Altmetric Badge
    Chapter 25 Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
  27. Altmetric Badge
    Chapter 26 Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
  28. Altmetric Badge
    Chapter 27 The Complexity of (List) Edge-Coloring Reconfiguration Problem
  29. Altmetric Badge
    Chapter 28 An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances
  30. Altmetric Badge
    Chapter 29 Finding Triangles for Maximum Planar Subgraphs
  31. Altmetric Badge
    Chapter 30 An Approximation Algorithm for Maximum Internal Spanning Tree
  32. Altmetric Badge
    Chapter 31 Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
  33. Altmetric Badge
    Chapter 32 Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width
  34. Altmetric Badge
    Chapter 33 An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
  35. Altmetric Badge
    Chapter 34 Sequentially Swapping Colored Tokens on Graphs
  36. Altmetric Badge
    Chapter 35 The Time Complexity of the Token Swapping Problem and Its Parallel Variants
  37. Altmetric Badge
    Chapter 36 Sliding Tokens on Block Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
1 Wikipedia page

Readers on

mendeley
4 Mendeley
Summary X Wikipedia
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 International Publishing, February 2017
DOI 10.1007/978-3-319-53925-6
ISBNs
978-3-31-953924-9, 978-3-31-953925-6
Editors

Poon, Sheung-Hung, Rahman, Md. Saidur, Yen, Hsu-Chun

View on publisher site
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 %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Lecturer > Senior Lecturer 2 50%
Unknown 2 50%
Readers by discipline Count As %
Computer Science 1 25%
Agricultural and Biological Sciences 1 25%
Unknown 2 50%

This page is provided by Altmetric.