Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings

Front Matter....Pages -
Broadcast Problem in Hypercube of Trees....Pages 1-12
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time....Pages 13-24
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding....Pages 25-35
A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy....Pages 36-47
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints....Pages 48-59
The Complexity of Zero-Visibility Cops and Robber....Pages 60-70
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem....Pages 71-81
Randomized Parameterized Algorithms for Co-path Set Problem....Pages 82-93
Improved LP-rounding Approximations for the k -Disjoint Restricted Shortest Paths Problem....Pages 94-104
Monotone Grid Drawings of Planar Graphs....Pages 105-116
Spanning Distribution Forests of Graphs....Pages 117-127
A (1.408+ ε )-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations....Pages 128-140
Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time....Pages 141-150
Minimal Double Dominating Sets in Trees....Pages 151-157
Parallel-Machine Scheduling Problem under the Job Rejection Constraint....Pages 158-169
Approximation Algorithms on Consistent Dynamic Map Labeling....Pages 170-181
The PoA of Scheduling Game with Machine Activation Costs....Pages 182-193
Approximation Algorithms for Bandwidth Consecutive Multicolorings....Pages 194-204
Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees....Pages 205-215
Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost....Pages 216-228
Finding Simple Paths on Given Points in a Polygonal Region....Pages 229-239
Near Optimal Algorithms for Online Maximum Weighted b -Matching....Pages 240-251
Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth....Pages 252-263
Zero-Sum Flow Numbers of Triangular Grids....Pages 264-275
A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains....Pages 276-287
Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity....Pages 288-297
On Star-Cover and Path-Cover of a Tree....Pages 298-308
On the Complexity of Constrained Sequences Alignment Problems....Pages 309-319
On the Advice Complexity of One-Dimensional Online Bin Packing....Pages 320-329
Dynamic Matchings in Left Weighted Convex Bipartite Graphs....Pages 330-342
Back Matter....Pages -