02070nam2 2200397 i 450 BVEE05121320170908093226.0n-si e.i, i.i, E'On (3) 1593 (A)feiVol. 2.20100304d1593 ||||0itac50 baitaitz01i xxxe z01n˜[2]: ÂœRaccolta di lagrime, cioè, di Maria Maddalena. Di Maria Vergine. Del penitenteIn Bergamoper Comin Ventura1593[16], 31, [17], 75, [1] p.illLa prima opera è di Erasmo da Valvason, la seconda e la terza di Angelo Grillo, come risulta dall'occhietto col quale ciascuna inizia, rispettivamente a carta a8r (in cornice xil.), ²A1r, ²A8rMarca (U00484) nella cornice sul frontespizioSegnatura: a⁸, A-B⁸, ²A⁸, ³A-D⁸ E⁶La carta ²A3 segnata A4, la c. ³B3 segnata A3Stampato in rosso e nero.v. 2IT-NA0070, Z.B. 0696001BVEE0060702001 Nuoua raccolta di lagrime di piu poeti illustri, all'illustriss. et ecc.mo signore Aluigi Prioli ...2ITBergamoRMLL000340Grillo, Angelo <1550-1629>CFIV097793Valvason, Erasmo : da <1523-1593>LO1V138524Valvasone, Erasmo : diCFIV138798Valvason, Erasmo : da <1523-1593>Erasmo : da ValvasoneCFIV138800Valvason, Erasmo : da <1523-1593>ITIT-NA007920100304IT-NA0070BVEE051213BVEM001694Fortuna. Donna in mare su delfino regge una vela al vento. Sole sullo sfondo. Motto: Bona fortunae.U484Nella cornice sul front. Biblioteca Universitaria1 v.v. 1 BUZ.B. 0696 BUSI 0000184025 B 2 v. 2Z 2010030420100304 BURaccolta di lagrime, cioè, di Maria Maddalena. Di Maria Vergine. Del penitente1481948UNISANNIO00997nam0-22003491i-450-99000379623040332120111219223929.02-7178-3370-6000379623FED01000379623(Aleph)000379623FED0100037962320030910d1997----km-y0itay50------bafreFRy-------001yyWilliam Petty (1623-1687)fondateur de l'économie politiqueFrançois Régis MahieuParisEconomicac1997110 p.20 cmEconomie poche44Petty William (economista, 1623-1687)StudiEconomiaSistemi e teorie330.092330.1Mahieu,François Régis382091ITUNINARICAUNIMARCBK990003796230403321PT 330.092 MAH 16456BFSBFSWilliam Petty (1623-1687506492UNINA05657nam 22008295 450 99646602390331620230406050713.03-642-00202-110.1007/978-3-642-00202-1(CKB)1000000000714732(SSID)ssj0000320657(PQKBManifestationID)11241649(PQKBTitleCode)TC0000320657(PQKBWorkID)10249365(PQKB)10814250(DE-He213)978-3-642-00202-1(MiAaPQ)EBC3063935(PPN)132874784(EXLCZ)99100000000071473220100301d2009 u| 0engurnn|008mamaatxtccrWALCOM: Algorithms and Computation[electronic resource] Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings /edited by Sandip Das, Ryuhei Uehara1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (XIII, 408 p.) Theoretical Computer Science and General Issues,2512-2029 ;5431Bibliographic Level Mode of Issuance: Monograph3-642-00201-3 Includes bibliographical references and index.Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates.This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.Theoretical Computer Science and General Issues,2512-2029 ;5431AlgorithmsComputer science—MathematicsDiscrete mathematicsNumerical analysisComputer networksComputer graphicsBioinformaticsAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisComputer Communication NetworksComputer GraphicsComputational and Systems BiologyAlgorithms.Computer science—Mathematics.Discrete mathematics.Numerical analysis.Computer networks.Computer graphics.Bioinformatics.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.Computer Communication Networks.Computer Graphics.Computational and Systems Biology.005.1DAT 530fstubSS 4800rvkDas Sandipedthttp://id.loc.gov/vocabulary/relators/edtUehara Ryuheiedthttp://id.loc.gov/vocabulary/relators/edtWALCOM (Workshop)BOOK996466023903316WALCOM: Algorithms and Computation774152UNISA