LEADER 06321nam 22008775 450 001 9910483984903321 005 20251226203004.0 010 $a1-280-38657-6 010 $a9786613564498 010 $a3-642-13073-9 024 7 $a10.1007/978-3-642-13073-1 035 $a(CKB)2550000000011524 035 $a(SSID)ssj0000446294 035 $a(PQKBManifestationID)11249866 035 $a(PQKBTitleCode)TC0000446294 035 $a(PQKBWorkID)10491351 035 $a(PQKB)10742075 035 $a(DE-He213)978-3-642-13073-1 035 $a(MiAaPQ)EBC3065249 035 $a(PPN)149073119 035 $a(BIP)30656425 035 $a(EXLCZ)992550000000011524 100 $a20100510d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity $e7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings /$fedited by Josep Diaz, Tiziana Calamoneri 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 384 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6078 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-13072-0 320 $aIncludes bibliographic references and index. 327 $aInvited 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 ParameterizedRoute 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. 330 $aThis volume contains the papers presented at the 7th International Conference onAlgorithmsandComplexity(CIAC-2010),whichtookplaceatSapienza,U- versity of Rome, during May 26-28, 2010. The volume contains 30 accepted papers, selected by the Program Comm- tee from 114 submissions received, with an acceptance ratio of 26%. We thank all the authors who submitted papers, the members of the Program Committee and the external reviewers. We are grateful also to the ?ve invited speakers, Ricardo Baeza-Yates (Yahoo! Research), Eran Halperin (Tel Aviv University), Monika Henzinger (EPF Lausanne), Giuseppe F. Italiano (University of Rome Tor Vergata), and Bruce Reed (McGill University), that kindly accepted our invitation to give plenary lectures at the conference. We gratefully acknowledge support from Sapienza, its Department of Computer Science, Yahoo! Research and EATCS. We ?nally would like to thank Saverio Caminiti, Umberto F- raro Petrillo, Emanuele G. Fusco and M. Daniela Salvati for their help in the organization tasks. March 2010 Tiziana Calamoneri Josep Dī ?az Conference Organization Steering Committee Giorgio Ausiello Sapienza University of Rome, Italy Giuseppe F. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6078 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a004.0151 701 $aCalamoneri$b Tiziana$01756360 701 $aDiaz$b Josep$01221273 712 12$aItalian Conference on Algorithms and Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483984903321 996 $aAlgorithms and complexity$94193596 997 $aUNINA