Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The Square Root Phenomenon in Planar Graphs
3. Altmetric Badge
   Chapter 2 An Algorithm for Determining Whether a Pair of Polygons Is Reversible
4. Altmetric Badge
   Chapter 3 Disjoint Small Cycles in Graphs and Bipartite Graphs
5. Altmetric Badge
   Chapter 4 An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
6. Altmetric Badge
   Chapter 5 Algorithms for Testing Length Four Permutations
7. Altmetric Badge
   Chapter 6 Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
8. Altmetric Badge
   Chapter 7 Faster Exact Computation of rSPR Distance
9. Altmetric Badge
   Chapter 8 Arbitrated Quantum Signature Schemes: Attacks and Security
10. Altmetric Badge
    Chapter 9 Randomized Algorithms for Removable Online Knapsack Problems
11. Altmetric Badge
    Chapter 10 An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
12. Altmetric Badge
    Chapter 11 FWLS: A Local Search for Graph Coloring
13. Altmetric Badge
    Chapter 12 A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
14. Altmetric Badge
    Chapter 13 Monomial Testing and Applications
15. Altmetric Badge
    Chapter 14 The Optimal Rescue Path Set Problem in Undirected Graphs
16. Altmetric Badge
    Chapter 15 Expected Computations on Color Spanning Sets
17. Altmetric Badge
    Chapter 16 Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
18. Altmetric Badge
    Chapter 17 Spanning Distribution Trees of Graphs
19. Altmetric Badge
    Chapter 18 A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem
20. Altmetric Badge
    Chapter 19 Zero-Visibility Cops and Robber Game on a Graph
21. Altmetric Badge
    Chapter 20 On (k,ℓ)-Graph Sandwich Problems
22. Altmetric Badge
    Chapter 21 Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
23. Altmetric Badge
    Chapter 22 Two-Round Discrete Voronoi Game along a Line
24. Altmetric Badge
    Chapter 23 Inverse Maximum Flow Problems under the Combining Norms
25. Altmetric Badge
    Chapter 24 The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs
26. Altmetric Badge
    Chapter 25 A Cost-Efficient Scheduling Algorithm for Traffic Grooming
27. Altmetric Badge
    Chapter 26 Strategies of Groups Evacuation from a Convex Region in the Plane
28. Altmetric Badge
    Chapter 27 Kernelization and Lower Bounds of the Signed Domination Problem
29. Altmetric Badge
    Chapter 28 On Edge-Independent Sets
30. Altmetric Badge
    Chapter 29 On the Complexity of Approximate Sum of Sorted List
31. Altmetric Badge
    Chapter 30 Large Hypertree Width for Sparse Random Hypergraphs
32. Altmetric Badge
    Chapter 31 On Perfect Absorbants in De Bruijn Digraphs
33. Altmetric Badge
    Chapter 32 Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
34. Altmetric Badge
    Chapter 33 Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints
35. Altmetric Badge
    Chapter 34 Zero-Sum Flow Numbers of Hexagonal Grids
36. Altmetric Badge
    Chapter 35 Pattern-Guided k-Anonymity