دانلود کتاب Algorithms and Complexity: 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings

فهرست مطالب :

Front Matter....Pages -
Towards a Distributed Search Engine....Pages 1-5
Mechanisms for the Marriage and the Assignment Game....Pages 6-12
Resilient Algorithms and Data Structures....Pages 13-24
An Exact Algorithm for Connected Red-Blue Dominating Set....Pages 25-36
Maximizing PageRank with New Backlinks....Pages 37-48
Enumerating Rooted Graphs with Reflectional Block Structures....Pages 49-60
Improved Approximations for TSP with Simple Precedence Constraints....Pages 61-72
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number....Pages 73-84
Parameterized Complexity of Even/Odd Subgraph Problems....Pages 85-96
Popular Matchings in the Marriage and Roommates Problems....Pages 97-108
Bounding the Number of Tolerable Faults in Majority-Based Systems....Pages 109-119
A Parameterized Algorithm for Chordal Sandwich ....Pages 120-130
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown....Pages 131-142
Graph Unique-Maximum and Conflict-Free Colorings....Pages 143-154
Strategic Coloring of a Graph....Pages 155-166
Multicut Algorithms via Tree Decompositions....Pages 167-179
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality....Pages 180-191
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights....Pages 192-203
A Planar Linear Arboricity Conjecture....Pages 204-216
On the Number of Higher Order Delaunay Triangulations....Pages 217-228
How Simple Robots Benefit from Looking Back....Pages 229-239
On Strategy Improvement Algorithms for Simple Stochastic Games....Pages 240-251
Online Cooperative Cost Sharing....Pages 252-263
On the Power of Nodes of Degree Four in the Local Max-Cut Problem....Pages 264-275
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs....Pages 276-287
Irredundant Set Faster Than O (2 n )....Pages 288-298
The Complexity of Computing Minimal Unidirectional Covering Sets....Pages 299-310
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance....Pages 311-322
Finding the Maximum Suffix with Fewer Comparisons....Pages 323-334
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences....Pages 335-346
Capacitated Confluent Flows: Complexity and Algorithms....Pages 347-358
Preprocessing Speed-Up Techniques Is Hard....Pages 359-370
Communication Requirements for Stable Marriages....Pages 371-382
Back Matter....Pages -