01078cam0 2200277 450 E60020002505820200826091734.088-222-3786-220070205d1990 |||||ita|0103 baitaITLeonardo Bruni cancelliere della Repubblica di FirenzeConvegno di studiFirenze, 27-29 ottobre 1987 a cura di Paolo Viti[organizzato da] Istituto nazionale di studi sul RinascimentoFirenzeLeo S. Olschki1990XVI, 424 p., [5] c. di tav.ill.24 cmAtti di ConvegniXVIII001LAEC000186652001 *Atti di ConvegniXVIIIViti, PaoloAF00021819070ITUNISOB20200826RICAUNISOBUNISOB90063036E600200025058M 102 Monografia moderna SBNM900001999Si63036acquistopregresso2UNISOBUNISOB20070205112336.020200826091734.0rovitoLeonardo Bruni cancelliere della repubblica di Firenze142551UNISOB04528nam 2200493 450 99650866970331620230429210556.03-031-25211-X10.1007/978-3-031-25211-2(MiAaPQ)EBC7187108(Au-PeEL)EBL7187108(CKB)26068928400041(DE-He213)978-3-031-25211-2(PPN)26780718X(EXLCZ)992606892840004120230429d2023 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierAlgorithms and discrete applied mathematics 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, proceedings /edited by Amitabha Bagchi, Rahul Muthu1st ed. 2023.Cham, Switzerland :Springer,[2023]©20231 online resource (464 pages)Lecture Notes in Computer Science,1611-3349 ;13947Print version: Bagchi, Amitabha Algorithms and Discrete Applied Mathematics Cham : Springer International Publishing AG,c2023 9783031252105 Includes bibliographical references and index.Stable Approximation Schemes -- A whirlwind tour of intersection graph enumeration -- Graph modification problems with forbidden minors -- Algorithms & Optimization Efficient reductions and algorithms for Subset Product -- Optimal length cutting plane refutations of integer programs -- Fault-Tolerant Dispersion Resource management in device-to-device communications -- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane -- Arbitrary oriented color spanning region for line segments -- Games with a Simple Rectilinear Obstacle in Plane -- Diverse Fair Allocations: Complexity and Algorithms -- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs -- D K 5-list coloring toroidal 6-regular triangulations in linear time -- On Locally Identifying Coloring of Graphs -- On Structural Parameterizations of Star Coloring -- Reddy Perfectness of G-generalized join of graphs -- Coloring of a superclass of 2K2-free graphs -- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures -- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs -- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs -- Monitoring edge-geodetic sets in graphs -- Cyclability, Connectivity and Circumference -- Graph Domination On three domination-based identification problems in block graphs -- Graph modification problems with forbidden minors -- Computational Aspects of Double Dominating Sequences in Graph -- Relation between broadcast domination and multipacking numbers on chordal graphs -- Pushing Cops and Robber on Oriented Graphs -- Mind the Gap: Edge Facility Location Problems in Theory and Practice -- Complexity Results on Cosecure Domination in Graphs -- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures -- Minimum Maximal Acyclic Matching in Proper Interval Graphs -- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs -- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength -- Covering using Bounded Size Subgraphs -- Axiomatic characterization of the the toll walk function of some graph classes -- Structural Parameterization of Alliance Problems.This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.Lecture Notes in Computer Science,1611-3349 ;13947Computer algorithmsComputer algorithms.929.605Bagchi AmitabhaMuthu RahulMiAaPQMiAaPQMiAaPQBOOK996508669703316Algorithms and Discrete Applied Mathematics3004624UNISA01314nam2 22002891i 450 UON0052424820240423020537.9220240423d1986 |0itac50 baitaIT|||| |||||Dizionario italiano-spagnoloLucio AmbruzziNovaraIstituto geografico De Agostini19861289 p.26 cm..Valore stimato, recupero pregressoIT-UONSI UFFICIOBIBLIOTECACORTILE001UON005242492001 ˆLo ‰spagnolo per tutticorso programmato di lingua spagnola210 NovaraIstituto geografico De Agostini215 v.ill.26 cmdizionario.Lingua spagnolaDizionariUONC039897FIITNovaraUONL000383463.51Lingua spagnola. Dizionari in italiano21AMBRUZZILucioUONV01480634932Istituto Geografico De AgostiniUONV247374650ITSOL20250221RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00524248SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI BIBLIOTECA CORTILE SI 51057 6 Valore stimato, recupero pregressoDizionario italiano spagnolo231578UNIOR