05160nam 22007935 450 99646591500331620230320193457.01-280-38546-497866135633853-642-11409-110.1007/978-3-642-11409-0(CKB)1000000000812683(SSID)ssj0000355516(PQKBManifestationID)11233500(PQKBTitleCode)TC0000355516(PQKBWorkID)10320433(PQKB)11785138(DE-He213)978-3-642-11409-0(MiAaPQ)EBC3064900(PPN)149054904(EXLCZ)99100000000081268320100301d2010 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers /edited by Christophe Paul, Michel Habib1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XIII, 353 p.) Theoretical Computer Science and General Issues,2512-2029 ;5911Bibliographic Level Mode of Issuance: Monograph3-642-11408-3 Includes bibliographical references and index.Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs.This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.Theoretical Computer Science and General Issues,2512-2029 ;5911Computer science—MathematicsDiscrete mathematicsGeometryAlgorithmsArtificial intelligence—Data processingDiscrete Mathematics in Computer ScienceGeometryAlgorithmsSymbolic and Algebraic ManipulationData ScienceComputer science—Mathematics.Discrete mathematics.Geometry.Algorithms.Artificial intelligence—Data processing.Discrete Mathematics in Computer Science.Geometry.Algorithms.Symbolic and Algebraic Manipulation.Data Science.004.015115DAT 537fstubMAT 055fstubSS 4800rvkPaul Christopheedthttp://id.loc.gov/vocabulary/relators/edtHabib Micheledthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop WGBOOK996465915003316Graph-Theoretic Concepts in Computer Science2569248UNISA01174nam0 22002891i 450 UON0051039120231205105455.115978-07-556-3935-920221205d2022 |0itac50 baengGB|||| |||||ˆThe ‰ Berbers of MoroccoMichael PeyronLondon [etc.]I. B. Tauris2022xv, 333 p.23 cmBERBERIMaroccoUONC022965FIGBLondonUONL003044964.004933STORIA DEI BERBERI IN MAROCCO21PEYRONMichaelUONV0873841590260TaurisUONV245873650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00510391SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI B Afr 3 0483 SI 40061 5 0483 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI2022704 1J 20221205DDT n. 22 del 28/1/2023. Berbers of Morocco3901286UNIOR01890nam0 2200433 i 450 CFI010613520251003044121.08820005875IT89-8683 20021029d1987 ||||0itac50 baitafreitz01i xxxe z01nˆIl ‰banchiere dei banchieriun uomo d'influenza: sir Siegmund WarburgJacques Attali[Milano]Sperling & Kupfer[1987]X, 476 p.22 cmE & MEconomia e management35Trad. di Marisa Aboaf.001CFI00145322001 E & MEconomia e management35ˆUn ‰homme d'influence.CFI0106139CFIV0233413578571Warburg, SiegmundFIRCFIC038358E332ECONOMIA FINANZIARIA19332.1092BANCHE E SERVIZI BANCARI. Persone12332.1092BANCHE E SERVIZI BANCARI. PERSONE20332.1092BANCHE. Persone21332.10924BANCHE E SERVIZI BANCARI. Singole persone23X0.1BIOGRAFIE GENERALIRX30.0STORIA ECONOMICO-SOCIALERX30.5FINANZA CREDITO MONETARAttali, JacquesCFIV023341070118880ITIT-00000020021029IT-BN0095 NAP 01POZZO LIB.Vi sono collocati fondi di economia, periodici di ingegneria e scienze, periodici di economia e statistica e altri fondi comprendenti documenti di economia pervenuti in dono. CFI0106135Biblioteca Centralizzata di Ateneo1 v. 01POZZO LIB.F. PARRAVICINI 606 0101 0600170175E VMA 1 v. (Precedente collocazione P. 1160)B 2005062720231109 01Homme d'influence3578571UNISANNIO