05128nam 22008175 450 99646592160331620230220215712.01-280-38657-697866135644983-642-13073-910.1007/978-3-642-13073-1(CKB)2550000000011524(SSID)ssj0000446294(PQKBManifestationID)11249866(PQKBTitleCode)TC0000446294(PQKBWorkID)10491351(PQKB)10742075(DE-He213)978-3-642-13073-1(MiAaPQ)EBC3065249(PPN)149073119(EXLCZ)99255000000001152420100510d2010 u| 0engurnn|008mamaatxtccrAlgorithms and Complexity[electronic resource] 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings /edited by Josep Diaz, Tiziana Calamoneri1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XI, 384 p.) Theoretical Computer Science and General Issues,2512-2029 ;6078Bibliographic Level Mode of Issuance: Monograph3-642-13072-0 Includes bibliographic references and index.Invited Talks -- Towards a Distributed Search Engine -- Mechanisms for the Marriage and the Assignment Game -- Resilient Algorithms and Data Structures -- Session 1. Graph Algorithms I -- An Exact Algorithm for Connected Red-Blue Dominating Set -- Maximizing PageRank with New Backlinks -- Enumerating Rooted Graphs with Reflectional Block Structures -- Improved Approximations for TSP with Simple Precedence Constraints -- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number -- Session 2. Computational Complexity -- Parameterized Complexity of Even/Odd Subgraph Problems -- Popular Matchings in the Marriage and Roommates Problems -- Bounding the Number of Tolerable Faults in Majority-Based Systems -- A Parameterized Algorithm for Chordal Sandwich -- Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown -- Session 3. Graph Coloring -- Graph Unique-Maximum and Conflict-Free Colorings -- Strategic Coloring of a Graph -- Session 4. Tree Algorithms and Tree Decompositions -- Multicut Algorithms via Tree Decompositions -- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality -- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights -- A Planar Linear Arboricity Conjecture -- Session 5. Computational Geometry -- On the Number of Higher Order Delaunay Triangulations -- How Simple Robots Benefit from Looking Back -- Session 6. Game Theory -- On Strategy Improvement Algorithms for Simple Stochastic Games -- Online Cooperative Cost Sharing -- Session 7. Graph Algorithms II -- On the Power of Nodes of Degree Four in the Local Max-Cut Problem -- Packing Bipartite Graphs with Covers of Complete Bipartite Graphs -- Irredundant Set Faster Than O(2 n ) -- The Complexity of Computing Minimal Unidirectional Covering Sets -- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance -- Session 8. String Algorithms -- Finding the Maximum Suffix with Fewer Comparisons -- An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences -- Session 9. Network Algorithms -- Capacitated Confluent Flows: Complexity and Algorithms -- Preprocessing Speed-Up Techniques Is Hard -- Communication Requirements for Stable Marriages.Theoretical Computer Science and General Issues,2512-2029 ;6078Computer programmingComputer networksComputer scienceAlgorithmsComputer science—MathematicsDiscrete mathematicsArtificial intelligence—Data processingProgramming TechniquesComputer Communication NetworksTheory of ComputationAlgorithmsDiscrete Mathematics in Computer ScienceData ScienceComputer programming.Computer networks.Computer science.Algorithms.Computer science—Mathematics.Discrete mathematics.Artificial intelligence—Data processing.Programming Techniques.Computer Communication Networks.Theory of Computation.Algorithms.Discrete Mathematics in Computer Science.Data Science.004.0151Diaz Josepedthttp://id.loc.gov/vocabulary/relators/edtCalamoneri Tizianaedthttp://id.loc.gov/vocabulary/relators/edtItalian Conference on Algorithms and ComplexityBOOK996465921603316Algorithms and complexity55800UNISA