Ebook: WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.

---

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.

---

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.
Content:
Front Matter....Pages -
Mobility and Computations: Some Open Research Directions....Pages 1-3
Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries....Pages 4-4
A Novel Efficient Approach for Solving the Art Gallery Problem....Pages 5-16
Fixed-Orientation Equilateral Triangle Matching of Point Sets....Pages 17-28
Online Exploration and Triangulation in Orthogonal Polygonal Regions....Pages 29-40
A Competitive Strategy for Distance-Aware Online Shape Allocation....Pages 41-52
Base Location Problems for Base-Monotone Regions....Pages 53-64
Counting Maximal Points in a Query Orthogonal Rectangle....Pages 65-76
Voronoi Game on Graphs....Pages 77-88
Approximation Schemes for Covering and Packing....Pages 89-100
A Randomised Approximation Algorithm for the Hitting Set Problem....Pages 101-113
Exact and Approximation Algorithms for Densest k-Subgraph....Pages 114-125
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs....Pages 126-136
Approximation Algorithms for the Partition Vertex Cover Problem....Pages 137-145
Daemon Conversions in Distributed Self-stabilizing Algorithms....Pages 146-157
Broadcasting in Conflict-Aware Multi-channel Networks....Pages 158-169
Shared-Memory Parallel Frontier-Based Search....Pages 170-181
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching....Pages 182-193
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs....Pages 194-205
Alliances and Bisection Width for Planar Graphs....Pages 206-216
The Cyclical Scheduling Problem....Pages 217-232
Generalized Rainbow Connectivity of Graphs....Pages 233-244
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems....Pages 245-256
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs....Pages 257-264
Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem....Pages 265-273
On Directed Tree Realizations of Degree Sets....Pages 274-285
Circular Graph Drawings with Large Crossing Angles....Pages 286-297
On Graphs That Are Not PCGs....Pages 298-309
On Embedding of Certain Recursive Trees and Stars into Hypercube....Pages 310-321
Box-Rectangular Drawings of Planar Graphs....Pages 322-333
Back Matter....Pages 334-345
....Pages -