Ebook: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.

---

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.

---

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
Content:
Front Matter....Pages -
The Square Root Phenomenon in Planar Graphs....Pages 1-1
An Algorithm for Determining Whether a Pair of Polygons Is Reversible....Pages 2-3
Disjoint Small Cycles in Graphs and Bipartite Graphs....Pages 4-11
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree....Pages 12-16
Algorithms for Testing Length Four Permutations....Pages 17-23
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds....Pages 24-35
Faster Exact Computation of rSPR Distance....Pages 36-47
Arbitrated Quantum Signature Schemes: Attacks and Security....Pages 48-59
Randomized Algorithms for Removable Online Knapsack Problems....Pages 60-71
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs....Pages 72-83
FWLS: A Local Search for Graph Coloring....Pages 84-93
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids....Pages 94-105
Monomial Testing and Applications....Pages 106-117
The Optimal Rescue Path Set Problem in Undirected Graphs....Pages 118-129
Expected Computations on Color Spanning Sets....Pages 130-141
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs....Pages 142-152
Spanning Distribution Trees of Graphs....Pages 153-162
A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem....Pages 163-174
Zero-Visibility Cops and Robber Game on a Graph....Pages 175-186
On (k,?)-Graph Sandwich Problems....Pages 187-197
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints....Pages 198-209
Two-Round Discrete Voronoi Game along a Line....Pages 210-220
Inverse Maximum Flow Problems under the Combining Norms....Pages 221-230
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs....Pages 231-240
A Cost-Efficient Scheduling Algorithm for Traffic Grooming....Pages 241-249
Strategies of Groups Evacuation from a Convex Region in the Plane....Pages 250-260
Kernelization and Lower Bounds of the Signed Domination Problem....Pages 261-271
On Edge-Independent Sets....Pages 272-283
On the Complexity of Approximate Sum of Sorted List....Pages 284-293
Large Hypertree Width for Sparse Random Hypergraphs....Pages 294-302
On Perfect Absorbants in De Bruijn Digraphs....Pages 303-314
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width....Pages 315-324
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints....Pages 325-338
Zero-Sum Flow Numbers of Hexagonal Grids....Pages 339-349
Pattern-Guided k-Anonymity....Pages 350-361
Back Matter....Pages -

---

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
Content:
Front Matter....Pages -
The Square Root Phenomenon in Planar Graphs....Pages 1-1
An Algorithm for Determining Whether a Pair of Polygons Is Reversible....Pages 2-3
Disjoint Small Cycles in Graphs and Bipartite Graphs....Pages 4-11
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree....Pages 12-16
Algorithms for Testing Length Four Permutations....Pages 17-23
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds....Pages 24-35
Faster Exact Computation of rSPR Distance....Pages 36-47
Arbitrated Quantum Signature Schemes: Attacks and Security....Pages 48-59
Randomized Algorithms for Removable Online Knapsack Problems....Pages 60-71
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs....Pages 72-83
FWLS: A Local Search for Graph Coloring....Pages 84-93
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids....Pages 94-105
Monomial Testing and Applications....Pages 106-117
The Optimal Rescue Path Set Problem in Undirected Graphs....Pages 118-129
Expected Computations on Color Spanning Sets....Pages 130-141
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs....Pages 142-152
Spanning Distribution Trees of Graphs....Pages 153-162
A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem....Pages 163-174
Zero-Visibility Cops and Robber Game on a Graph....Pages 175-186
On (k,?)-Graph Sandwich Problems....Pages 187-197
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints....Pages 198-209
Two-Round Discrete Voronoi Game along a Line....Pages 210-220
Inverse Maximum Flow Problems under the Combining Norms....Pages 221-230
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs....Pages 231-240
A Cost-Efficient Scheduling Algorithm for Traffic Grooming....Pages 241-249
Strategies of Groups Evacuation from a Convex Region in the Plane....Pages 250-260
Kernelization and Lower Bounds of the Signed Domination Problem....Pages 261-271
On Edge-Independent Sets....Pages 272-283
On the Complexity of Approximate Sum of Sorted List....Pages 284-293
Large Hypertree Width for Sparse Random Hypergraphs....Pages 294-302
On Perfect Absorbants in De Bruijn Digraphs....Pages 303-314
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width....Pages 315-324
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints....Pages 325-338
Zero-Sum Flow Numbers of Hexagonal Grids....Pages 339-349
Pattern-Guided k-Anonymity....Pages 350-361
Back Matter....Pages -
....