{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":46,"n_cols":5,"rows_kept":46,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[15,2,15,3],[16,2,16,3],[20,2,20,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[39,2,39,3],[40,2,40,3],[43,2,43,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910459229003321"]
[null,null,"Autore",null,"Lewis-Anthony Justin"]
[null,null,"Titolo",null,"Circles of thorns : Hieronymus Bosch and being human / / Justin Lewis-Anthony"]
[null,null,"Pubbl/distr/stampa",null,"London, [England] ; ; New York, New York : , : Continuum, , 2008"]
[{"$nulls":4},"©2008"]
[null,null,"ISBN",null,"1-282-87060-2"]
[{"$nulls":4},"9786612870606"]
[{"$nulls":4},"0-8264-3350-2"]
[null,null,"Descrizione fisica",null,"1 online resource (198 p.)"]
[null,null,"Collana",null,"The Mowbray Lent book ; ; 2009"]
[null,null,"Disciplina",null,"759.9492"]
[null,null,"Soggetti",null,"Christian art and symbolism - Netherlands - Renaissance, 1450-1600"]
[{"$nulls":4},"Theological anthropology - Christianity"]
[{"$nulls":4},"Humanity in art"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Contents; Introduction; An Unrelenting Gaze in WC1; Circle 1: Politics; Circle 2: Elements; Circle 3: Temperaments; Circle 4: Devotions; Circle 5: Quiddity; A Certain Regard; Appendix: Who Was Hieronymous Bosch?; Further Reading; Acknowledgements; Index"]
[null,null,null,"Sommario/riassunto","Unlike Bosch's better-known, fantastical, 'proto-surrealist' paintings, Christ Mocked is small, still and sombre, and yet, with a little effort of knowledge and interpretation, it reveals a depth of understanding of both the Passion, and of human nature, that speaks as much to the twenty-first century as it did to the sixteenth. By exploring the political, scientific, psychological and devotional world of early modern Europe, and applying those insights to our own time, the author shows how Bosch used his sophisticated artistic skills to convey a similarly sophisticated understanding of humani"]
[null,"2.","Record Nr.",null,"UNISA996418221603316"]
[null,null,"Titolo",null,"Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings / / edited by Manoj Changat, Sandip Das"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020"]
[null,null,"ISBN",null,"3-030-39219-8"]
[null,null,"Edizione",null,"[1st ed. 2020.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XX, 490 p. 151 illus., 36 illus. in color.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12016"]
[null,null,"Disciplina",null,"518"]
[null,null,"Soggetti",null,"Mathematics—Data processing"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Computational Mathematics and Numerical Analysis"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Data Structures and Information Theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"0-1 Timed Matching in Bipartite Temporal Graphs -- Partitioning cographs into two forests and one independent set -- Monitoring the edges of a graph using distances -- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method -- Approximating Modular Decomposition is Hard -- Vertex Edge Dominating Set in Unit Disk Graphs -- Geometric Planar Networks on Bichromatic Points -- Algorithmic Aspects of Global Total k-Domination in Graphs -- Hardness and approximation for the geodetic set problem in some graph classes -- Maximum Weighted Edge Biclique Problem on Bipartite Graphs -- Determining Number of Generalized and Double Generalized Petersen Graph -- Self-centeredness of generalized Petersen Graphs -- Weak Roman Bondage Number of a Graph -- On the geodetic and hull numbers of shadow Graphs -- Indicated coloring of complete "]
[{"$nulls":4},"expansion and lexicographic product of graphs -- Smallest C2l+1-critical graphs of odd-girth 2k + 1 -- Ramsey Numbers for Line Graphs -- On Cartesian products of signed graphs -- List distinguishing number of pth power of hypercube and Cartesian powers of a graph -- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs -- On the relative oriented clique number of planar graphs -- On the minimmum satisfiability problem -- Waiting for Trains: Complexity Results -- Oriented Diameter of Star Graphs -- Gathering over Meeting Nodes of Infinite Grid -- 0-1 Timed Matching in Bipartite Temporal Graphs -- Arbitrary Pattern Formation by Opaque Fat Robots with Lights -- Greedy universal cycle constructions for weak orders -- A New Model in Firefighting Theory -- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties -- Overlaying a hypergraph with a graph with bounded maximum degree -- Parameterized Algorithms for Directed Modular Width -- On the Complexity of Spanning Trees with a Small Vertex Cover -- Minimum Conflict free Colouring Parameterized by Treewidth -- Planar projections of graphs -- New Algorithms and Bounds for Halving Pseudolines -- Algorithms for Radon Partitions with Tolerance. ."]
[null,null,null,"Sommario/riassunto","This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity."]