LEADER 01212nam2 22002771i 450 001 RML0301462 005 20231121125744.0 010 $a3451218062 100 $a20121121d1974 ||||0itac50 ba 101 | $ager 102 $ade 181 1$6z01$ai $bxxxe 182 1$6z01$an 200 1 $a˜Vol. 8.: œIkonographie der Heiligen$eMeletius bis Zweiundvierzig Martyrer Register$emit 310 abbildungen$fEngelbert Kirschbaum 210 $aFreiburger $cHerder $d1974 215 $a643 p.$d23 cm 461 1$1001RML0301454$12001 $aLexicon der christlichen ikonographie$fhrsg. von Engelbert Kirschbaum in zusammenarbeit mit Gunter Bandman, Wolfgang Braunfels, Johannes Kollwitz, Wilheim Mrazek, Alfred A. Schmid, Hugo Schnell 700 1$aKirschbaum$b, Engelbert$3RMLV194585$0206571 801 3$aIT$bIT-01$c20121121 850 $aIT-FR0017 899 $aBiblioteca umanistica Giorgio Aprea$bFR0017 912 $aRML0301462 950 2$aBiblioteca umanistica Giorgio Aprea$d 52CIS 11/1037.8$e 52VM 0000715015 VM barcode:00062113. - Inventario:405 FLSVM$fA $h20071106$i20121204 977 $a 52 996 $aIkonographie der Heiligen$93630030 997 $aUNICAS LEADER 05746nam 22007695 450 001 996673178303316 005 20250806182448.0 010 $a9789819502189$b(electronic bk.) 010 $z9789819502172 024 7 $a10.1007/978-981-95-0218-9 035 $a(MiAaPQ)EBC32254376 035 $a(Au-PeEL)EBL32254376 035 $a(CKB)40123499000041 035 $a(DE-He213)978-981-95-0218-9 035 $a(EXLCZ)9940123499000041 100 $a20250806d2026 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputing and Combinatorics $e31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15?17, 2025, Proceedings, Part II /$fedited by Fedor V. Fomin, Mingyu Xiao 205 $a1st ed. 2026. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2026. 215 $a1 online resource (754 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15984 311 08$aPrint version: Fomin, Fedor V. Computing and Combinatorics Singapore : Springer,c2025 9789819502172 327 $a -- Graph Algorithms and Graph Theory. -- On the Complexity of 2-Club Cluster Editing with Vertex Splitting. -- A sufficient condition for the existence of two completely independent spanning trees. -- Undecidability of polynomial inequalities in subset densities and additive energies. -- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints. -- Sum-of-Max Chain Partition of a Tree. -- Reconfiguring Multiple Connected Components with Size Multiset Constraints. -- Fault diagnosability evaluation of BCCC data center networks. -- Testing Some First-Order Logic Properties on Sparse Graphs. -- Massively Parallel Approximate Steiner Tree Algorithms. -- A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem. -- Vertex-Critical (P5, W4)-Free Graphs. -- Learning and Data-Related Theory. -- A Dynamic Working Set Method for Compressed Sensing. -- Data Debugging is NP-hard for Classifiers Trained with SGD. -- Coresets for k-Median of Lines with Group Fairness Constraints. -- Redefining Entity Integration: Theoretical Insights for GNN-based Recommender Systems. -- Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits. -- A Robust Distributed Minimax Learning Method against Model Poisoning Attacks. -- Parameterized Algorithms. -- Parameterized Complexity of Influence Maximization. -- Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows. -- Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?. -- An FPT Factor-11 Approximation Algorithm for TSP. -- From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems. -- String Algorithms and Discrete Structures. -- Revisit the Partial Coloring Method: Prefix Spencer and Sampling. -- A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem. -- Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals. -- Longest Double-Bounded (k]-tuple Common Substrings. -- Finding cycle types in permutation groups with few generators. -- Counting overlapping pairs of words. 330 $aThis two-volume set, LNCS 15983 and 15984, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15?17, 2025. The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows: Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation. Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15984 606 $aComputer science 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aTheory of Computation 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aNumerical Analysis 615 0$aComputer science. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aTheory of Computation. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aNumerical Analysis. 676 $a004.0151 700 $aFomin$b Fedor V$01750515 701 $aXiao$b Mingyu$01785303 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a996673178303316 996 $aComputing and Combinatorics$94428601 997 $aUNISA