LEADER 02906nam 2200685 450 001 9910459229003321 005 20211005090151.0 010 $a1-282-87060-2 010 $a9786612870606 010 $a0-8264-3350-2 035 $a(CKB)2670000000056045 035 $a(EBL)601837 035 $a(OCoLC)676697930 035 $a(SSID)ssj0000414085 035 $a(PQKBManifestationID)12130481 035 $a(PQKBTitleCode)TC0000414085 035 $a(PQKBWorkID)10384832 035 $a(PQKB)11195977 035 $a(MiAaPQ)EBC601837 035 $a(MiAaPQ)EBC5309759 035 $a(Au-PeEL)EBL5309759 035 $a(CaPaEBR)ebr11518725 035 $a(OCoLC)1027194870 035 $a(MiAaPQ)EBC3003064 035 $a(Au-PeEL)EBL3003064 035 $a(OCoLC)928191777 035 $a(EXLCZ)992670000000056045 100 $a20180315h20082008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aCircles of thorns $eHieronymus Bosch and being human /$fJustin Lewis-Anthony 210 1$aLondon, [England] ;$aNew York, New York :$cContinuum,$d2008. 210 4$dİ2008 215 $a1 online resource (198 p.) 225 1 $aThe Mowbray Lent book ;$v2009 300 $aDescription based upon print version of record. 311 $a1-906286-21-3 320 $aIncludes bibliographical references and index. 327 $aContents; 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 330 $aUnlike 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 410 0$aMowbray Lent book. 606 $aChristian art and symbolism$zNetherlands$yRenaissance, 1450-1600 606 $aTheological anthropology$xChristianity 606 $aHumanity in art 608 $aElectronic books. 615 0$aChristian art and symbolism 615 0$aTheological anthropology$xChristianity. 615 0$aHumanity in art. 676 $a759.9492 700 $aLewis-Anthony$b Justin$01035645 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910459229003321 996 $aCircles of thorns$92455449 997 $aUNINA LEADER 00390oas 2200157z- 450 001 9910679772703321 035 $a(CKB)3860000000035147 035 $a(EXLCZ)993860000000035147 100 $a20190505cuuuuuuuu -u- - 101 0 $aeng 200 00$aAiCIO News 210 $cAsset International, Inc 906 $aJOURNAL 912 $a9910679772703321 996 $aAiCIO News$93076936 997 $aUNINA LEADER 05090nam 22006615 450 001 996418221603316 005 20230329140924.0 010 $a3-030-39219-8 024 7 $a10.1007/978-3-030-39219-2 035 $a(CKB)4100000010121594 035 $a(DE-He213)978-3-030-39219-2 035 $a(MiAaPQ)EBC6114573 035 $a(PPN)242844995 035 $a(EXLCZ)994100000010121594 100 $a20200125d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics$b[electronic resource] $e6th International Conference, CALDAM 2020, Hyderabad, India, February 13?15, 2020, Proceedings /$fedited by Manoj Changat, Sandip Das 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XX, 490 p. 151 illus., 36 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12016 300 $aIncludes index. 311 $a3-030-39218-X 327 $a0-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 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. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12016 606 $aMathematics?Data processing 606 $aComputer science?Mathematics 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputational Mathematics and Numerical Analysis 606 $aMathematics of Computing 606 $aTheory of Computation 606 $aData Structures and Information Theory 615 0$aMathematics?Data processing. 615 0$aComputer science?Mathematics. 615 0$aComputer science. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aComputational Mathematics and Numerical Analysis. 615 24$aMathematics of Computing. 615 24$aTheory of Computation. 615 24$aData Structures and Information Theory. 676 $a518 702 $aChangat$b Manoj$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDas$b Sandip$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418221603316 996 $aAlgorithms and Discrete Applied Mathematics$92587952 997 $aUNISA