WALCOM: Algorithms and Computation: 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings

Front Matter....Pages -
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?....Pages 1-1
Approximability of Stable Matching Problems....Pages 2-2
On Three-Dimensional Graph Drawing and Embedding....Pages 3-4
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression....Pages 5-16
Generalized Above Guarantee Vertex Cover and r -Partization....Pages 17-27
Farthest Voronoi Diagrams under Travel Time Metrics....Pages 28-39
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments....Pages 40-51
Range Aggregate Maximal Points in the Plane....Pages 52-63
Approximating the Multi-level Bottleneck Assignment Problem....Pages 64-75
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion....Pages 76-87
Comparing and Aggregating Partial Orders with Kendall Tau Distances....Pages 88-99
On the Round-Trip 1-Center and 1-Median Problems....Pages 100-111
Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs....Pages 112-123
On Relaxing the Constraints in Pairwise Compatibility Graphs....Pages 124-135
Universal Line-Sets for Drawing Planar 3-Trees....Pages 136-147
On the Hardness of Point-Set Embeddability....Pages 148-159
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet....Pages 160-172
Fat Heaps without Regular Counters....Pages 173-185
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles....Pages 186-197
Drawing Unordered Trees on k -Grids....Pages 198-210
Heuristics for the Maximum 2-layer RAC Subgraph Problem....Pages 211-216
Nash Equilibria with Minimum Potential in Undirected Broadcast Games....Pages 217-228
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers....Pages 229-240
Back Matter....Pages -