Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings

Front Matter....Pages I-XIV
Algorithms for Equilibrium Prices in Linear Market Models....Pages 1-4
In as Few Comparisons as Possible....Pages 5-6
The Happy End Theorem and Related Results....Pages 7-7
Generalized Class Cover Problem with Axis-Parallel Strips....Pages 8-21
Top- k Manhattan Spatial Skyline Queries....Pages 22-33
On Generalized Planar Skyline and Convex Hull Range Queries....Pages 34-43
Boundary Labeling with Flexible Label Positions....Pages 44-55
Approximating the Bipartite TSP and Its Biased Generalization....Pages 56-67
A ( k  + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow....Pages 68-79
Simple Linear Comparison of Strings in V -Order....Pages 80-89
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search....Pages 90-101
Optimal Serial Broadcast of Successive Chunks....Pages 102-113
The ${\\mathcal{G}}$ -Packing with t -Overlap Problem....Pages 114-124
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity....Pages 125-137
On a Class of Covering Problems with Variable Capacities in Wireless Networks....Pages 138-150
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs....Pages 151-162
Some Results on Point Visibility Graphs....Pages 163-175
Some Extensions of the Bottleneck Paths Problem....Pages 176-187
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs....Pages 188-199
On Some $\\mathcal{NP}$ -complete SEFE Problems....Pages 200-212
On Dilworth k Graphs and Their Pairwise Compatibility....Pages 213-224
Efficient Algorithms for Sorting k -Sets in Bins....Pages 225-236
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio....Pages 237-248
Editing the Simplest Graphs....Pages 249-260
Alignment with Non-overlapping Inversions on Two Strings....Pages 261-272
Collapsing Exact Arithmetic Hierarchies....Pages 273-285
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs....Pages 286-297
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods....Pages 298-309
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees....Pages 310-321
Linear Layouts of Weakly Triangulated Graphs....Pages 322-336
Bichromatic Point-Set Embeddings of Trees with Fewer Bends....Pages 337-348
ℓ 1 -Embeddability of 2-Dimensional ℓ 1 -Rigid Periodic Graphs....Pages 349-360
Back Matter....Pages -