04672nam 22007095 450 99646636330331620230330063112.03-030-00256-X10.1007/978-3-030-00256-5(CKB)4100000006098225(DE-He213)978-3-030-00256-5(MiAaPQ)EBC6302941(PPN)23053855X(EXLCZ)99410000000609822520180901d2018 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierGraph-Theoretic Concepts in Computer Science[electronic resource] 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings /edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer1st ed. 2018.Cham :Springer International Publishing :Imprint: Springer,2018.1 online resource (XIII, 384 p. 102 illus.)Theoretical Computer Science and General Issues,2512-2029 ;111593-030-00255-1 On Dispersable Book Embeddings -- Characterising AT-free Graphs with BFS -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- On Minimum Connecting Transition Sets in Graphs -- Recognizing Hyperelliptic Graphs in Polynomial Time -- On Directed Feedback Vertex Set Parameterized by Treewidth -- Optimality Program in Segment and String Graphs -- Anagram-Free Chromatic Number is Not Pathwidth-Bounded -- Tight Lower Bounds for the Number of st-Cuts -- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- Computing Small Pivot-Minors -- Saving Probe Bits by Cube Domination -- Graph Amalgamation under Logical Constraints -- Optimal General Matchings -- Quasimonotone Graphs -- Equiangular Polygon Contact Representations -- Temporal Graph Classes: A View Through Temporal Separators -- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization -- On the Relation of Strong Triadic Closure and Cluster Deletion -- On Perfect Linegraph Squares -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- Connected Vertex Cover for (sP_1+P_5)-Free Graphs -- Structurally Parameterized d-Scattered Set -- Popular Matchings of Desired Size -- Convexity-Increasing Morphs of Planar Graphs -- Treedepth Bounds in Linear Colorings -- An Improved FPT lgorithm for Independent Feedback Vertex Set -- Construction and Local Routing for Angle-Monotone Graphs -- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. .This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018. The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.Theoretical Computer Science and General Issues,2512-2029 ;11159Computer science—MathematicsDiscrete mathematicsAlgorithmsArtificial intelligence—Data processingComputer arithmetic and logic unitsComputer graphicsDiscrete Mathematics in Computer ScienceAlgorithmsData ScienceArithmetic and Logic StructuresComputer GraphicsComputer science—Mathematics.Discrete mathematics.Algorithms.Artificial intelligence—Data processing.Computer arithmetic and logic units.Computer graphics.Discrete Mathematics in Computer Science.Algorithms.Data Science.Arithmetic and Logic Structures.Computer Graphics.511.5Brandstädt Andreasedthttp://id.loc.gov/vocabulary/relators/edtKöhler Ekkehardedthttp://id.loc.gov/vocabulary/relators/edtMeer Klausedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996466363303316Graph-Theoretic Concepts in Computer Science2569248UNISA01588nam 2200469 450 99646438180331620231110220728.03-030-92548-X(MiAaPQ)EBC6825116(Au-PeEL)EBL6825116(CKB)20106121200041(PPN)25938500X(EXLCZ)992010612120004120220828d2021 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierCryptology and network security 20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, proceedings /edited by Mauro Conti, Marc Stevens, and Stephan KrennCham, Switzerland :Springer,[2021]©20211 online resource (556 pages)Lecture Notes in Computer Science ;v.13099Includes index.Print version: Conti, Mauro Cryptology and Network Security Cham : Springer International Publishing AG,c2022 9783030925475 Lecture Notes in Computer Science Computer networksSecurity measuresComputer securityComputer networksSecurity measures.Computer security.005.824Stevens MarcConti MauroKrenn StephanMiAaPQMiAaPQMiAaPQBOOK996464381803316Cryptology and Network Security2968064UNISA01810nam0 22003973i 450 SBL043255820231121125824.020030915d1972 ||||0itac50 baitaitz01i xxxe z01nDidattica delle osservazioni scientificheLuisa Ceccarelli, Maria Ferretti, Maria Teresa Monari2. edFirenzeLa Nuova Italiac1972VI, 238 p., [11] c. di tav.ill.21 cm˜La œnuova scuola media10001CFI00958972001 ˜La œnuova scuola media10ScienzeInsegnamentoScuola mediaFIRRMLC217464I500Scienze pure21507SCIENZE PURE. STUDIO E INSEGNAMENTO21Fabbrichesi Ceccarelli, LuisaBVEV00843307014975Ferretti, Maria <traduttrice>LO1V132311070347356Monari, Maria TeresaSBLV059676070733759Ceccarelli Fabbrichesi, LuisaBVEV008434Fabbrichesi Ceccarelli, LuisaCeccarelli, LuisaTSAV382629Fabbrichesi Ceccarelli, LuisaITIT-0120030915IT-FR0084 IT-RM0254 IT-FR0017 Biblioteca Del Monumento Nazionale Di MontecassinoFR0084 Biblioteca e Centro Studi Umberto Zanotti Bianco dell’Associazione Italia NostraRM0254 Biblioteca umanistica Giorgio ApreaFR0017 NSBL0432558Biblioteca umanistica Giorgio Aprea 52MAG 1/2759 52MAG0000025705 VMB RS A 2018110820181108 25 51 52Didattica delle osservazioni scientifiche1446937UNICAS