↓ 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 Drawing Planar Graphs
  3. Altmetric Badge
    Chapter 2 Space Efficient Separator Algorithms for Planar Graphs
  4. Altmetric Badge
    Chapter 3 Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks
  5. Altmetric Badge
    Chapter 4 Optimum Algorithm for the Mutual Visibility Problem
  6. Altmetric Badge
    Chapter 5 Routing in Histograms
  7. Altmetric Badge
    Chapter 6 A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
  8. Altmetric Badge
    Chapter 7 Shortest Covers of All Cyclic Shifts of a String
  9. Altmetric Badge
    Chapter 8 Packing Trees into 1-Planar Graphs
  10. Altmetric Badge
    Chapter 9 Angle Covers: Algorithms and Complexity
  11. Altmetric Badge
    Chapter 10 Fast Multiple Pattern Cartesian Tree Matching
  12. Altmetric Badge
    Chapter 11 Generalized Dictionary Matching Under Substring Consistent Equivalence Relations
  13. Altmetric Badge
    Chapter 12 Reconfiguring k -path Vertex Covers
  14. Altmetric Badge
    Chapter 13 Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
  15. Altmetric Badge
    Chapter 14 Maximum Bipartite Subgraph of Geometric Intersection Graphs
  16. Altmetric Badge
    Chapter 15 The Stub Resolution of 1-Planar Graphs
  17. Altmetric Badge
    Chapter 16 Dispersion of Mobile Robots on Grids
  18. Altmetric Badge
    Chapter 17 Packing and Covering with Segments
  19. Altmetric Badge
    Chapter 18 Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
  20. Altmetric Badge
    Chapter 19 Partitioning a Graph into Complementary Subgraphs
  21. Altmetric Badge
    Chapter 20 On the Maximum Edge-Pair Embedding Bipartite Matching
  22. Altmetric Badge
    Chapter 21 Packing Arc-Disjoint Cycles in Bipartite Tournaments
  23. Altmetric Badge
    Chapter 22 Matching Random Colored Points with Rectangles
  24. Altmetric Badge
    Chapter 23 Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams
  25. Altmetric Badge
    Chapter 24 Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
  26. Altmetric Badge
    Chapter 25 Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
  27. Altmetric Badge
    Chapter 26 Faster Privacy-Preserving Computation of Edit Distance with Moves
  28. Altmetric Badge
    Chapter 27 Parameterized Algorithms for the Happy Set Problem
  29. Altmetric Badge
    Chapter 28 An Experimental Study of a 1-Planarity Testing and Embedding Algorithm
  30. Altmetric Badge
    Chapter 29 Trichotomy for the Reconfiguration Problem of Integer Linear Systems
  31. Altmetric Badge
    Chapter 30 Train Scheduling: Hardness and Algorithms
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
Summary X
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, April 2020
DOI 10.1007/978-3-030-39881-1
ISBNs
978-3-03-039880-4, 978-3-03-039881-1
Editors

Rahman, M. Sohel, Sadakane, Kunihiko, Sung, Wing-Kin

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.

This page is provided by Altmetric.