00993nam a2200277 i 450099100134311970753620020507191733.0970912s1996 us ||| | eng 0817638326b10834321-39ule_instLE01310823ExLDip.to Matematicaeng521AMS 70F15Grossman, Nathaniel536795The sheer joy of celestial mechanics /Nathaniel GrossmanBoston ; Basel ; Berlin :Birkhauser,c1996xvii, 181 p. :ill. ;25 cm.Includes bibliographical references and indexCelestial mechanics.b1083432121-09-0628-06-02991001343119707536LE013 70F GRO11 (1996)12013000090412le013-E0.00-l- 04140.i1094368728-06-02Sheer joy of celestial mechanics923603UNISALENTOle01301-01-97ma -engus 4100977nam a2200253 i 450099100093281970753620020502181246.0990927s1998 it ||| | ita 8840809473b1143904x-39ule_instPRUMB51722ExLDUSS - Diploma Universitario in Servizio SocialeitaCavazzuti, Francesco526537Assistenza geriatrica oggi /F. Cavazzuti, G. Cremonini ; con la collaborazione di Paola Di Giulio, Ermellina ZanettiMilano :CEA,1998XIX, 540 p. ;27 cm.AnzianiAssistenzaCremonini, Giuliano.b1143904x12-10-1201-07-02991000932819707536LE024 SS/B III 2112024000017446le021ex DUSS-E0.00-l- 01010.i1162392501-07-02Assistenza geriatrica oggi819738UNISALENTOle02101-01-99ma -itait 0106321nam 22008775 450 991048398490332120251226203004.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(BIP)30656425(EXLCZ)99255000000001152420100510d2010 u| 0engurnn|008mamaatxtccrAlgorithms and Complexity 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 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.This 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.Theoretical Computer Science and General Issues,2512-2029 ;6078Computer programmingComputer networksComputer scienceAlgorithmsComputer scienceMathematicsDiscrete mathematicsArtificial intelligenceData processingProgramming TechniquesComputer Communication NetworksTheory of ComputationAlgorithmsDiscrete Mathematics in Computer ScienceData ScienceComputer programming.Computer networks.Computer science.Algorithms.Computer scienceMathematics.Discrete mathematics.Artificial intelligenceData processing.Programming Techniques.Computer Communication Networks.Theory of Computation.Algorithms.Discrete Mathematics in Computer Science.Data Science.004.0151Calamoneri Tiziana1756360Diaz Josep1221273Italian Conference on Algorithms and ComplexityMiAaPQMiAaPQMiAaPQBOOK9910483984903321Algorithms and complexity4193596UNINA