LEADER 01086nam0-2200253 --450 001 9911011079503321 005 20250620114229.0 100 $a20250620d1853----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $aSulla difficolta d'ottenersi un prodotto chimico differenziale dalle ceneri della vite sana e quella affetta da oidiopatia$erisposta al quesito della Commessione d'agricoltura e pastorizia di Sicilia$ememoria di Francesco Tornabene letta nella tornata del 20 gennaro 1853, alla societa economica della provincia di Catania 210 $aCatania$cdai tipi dell'Accademia Gioenia$d1853 215 $a24$d19 cm 610 0 $aVite$aMalattie 676 $a580$v23$zita 700 1$aTornabene,$bFrancesco$f<1813-1897>$0740046 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9911011079503321 952 $aA MUSA 561$b03/3457/25$fFAGBC 959 $aFAGBC 996 $aSulla difficolta d'ottenersi un prodotto chimico differenziale dalle ceneri della vite sana e quella affetta da oidiopatia$94398690 997 $aUNINA LEADER 01444nas 2200445 c 450 001 9910895363603321 005 20251012104155.0 035 $a(DE-599)ZDB3043957-7 035 $a(OCoLC)1226370066 035 $a(DE-101)1220732443 035 $a(CKB)4100000011568560 035 $a(EXLCZ)994100000011568560 100 $a20201103a19859999 |y | 101 0 $ager 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aStichwort BAYER$edie anderen Informationen zu einem multinationalen Chemiekonzern$fCoordination gegen BAYER-Gefahren e.V., CBG 210 31$aDu?sseldorf$cCBG$d1985- 215 $aOnline-Ressource 300 $aGesehen am 16.08.24 300 $aHerausgebendes Organ fru?her: Internationale Coordinationsstelle - Aktiv gegen BAYER-Umweltgefa?hrdung e.V. 300 $aUngeza?hlte Beilage: Ticker; SWB-Dossier; BIG Business Crime 300 $aErscheint anfangs alle 2 Monate, spa?ter viertelja?hrlich 517 3 $aStichwort BAYER / Ticker 517 3 $aSWB-Dossier 517 3 $aBIG Business Crime 608 $aZeitschrift$2gnd-content 676 $a333.7 676 $a330 676 $a360 712 02$aCoordination gegen Bayer-Gefahren e.V.$4isb 801 0$b0034 801 1$bDE-101 801 2$b9999 906 $aJOURNAL 912 $a9910895363603321 996 $aStichwort BAYER$94242934 997 $aUNINA LEADER 05236nam 22008055 450 001 9910682598603321 005 20251225203729.0 010 $a9783031270512 010 $a3031270517 024 7 $a10.1007/978-3-031-27051-2 035 $a(MiAaPQ)EBC7214039 035 $a(Au-PeEL)EBL7214039 035 $a(DE-He213)978-3-031-27051-2 035 $a(PPN)269092668 035 $a(CKB)26262628200041 035 $a(EXLCZ)9926262628200041 100 $a20230217d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWALCOM: Algorithms and Computation $e17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22?24, 2023, Proceedings /$fedited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (398 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13973 311 08$aPrint version: Lin, Chun-Cheng WALCOM: Algorithms and Computation Cham : Springer,c2023 9783031270505 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult -- The Family of Fan-planar Graphs -- Computational Geometry -- Minimum Ply Covering of Points with Unit Squares -- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms -- Flipping Plane Spanning Paths -- Away from Each Other -- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree -- Reflective Guarding a Gallery -- Improved and Generalized Algorithms for Burning a Planar Point Set -- On the Longest Flip Sequence to Untangle Segments in the Plane -- String Algorithm.-Inferring Strings from Position Heaps in Linear Time -- Internal Longest Palindrome Queries in Optimal Time -- Finding the Cyclic Covers of a String -- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs -- Optimization -- Better Hardness Results for the Minimum Spanning Tree Congestion Problem -- Energy Efficient Sorting, Selection and Searching -- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs -- k-Transmitter Watchman Routes -- Graph Algorithm -- Splitting Plane Graphs to Outerplanarity -- Certifying Induced Subgraphs in Large Graphs -- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs -- On the Complexity of Distance-d Independent Set Reconfiguration -- On Star-multi-interval Pairwise Compatibility Graphs -- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration -- Parameterized Complexity of Path Set Packing -- Approximation Algorithm -- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput -- Recognizing When a Preference System Is Close to Admitting a Master List -- Groups Burning: Analyzing Spreading Processes in Community-based Networks -- Roman k-domination:Hardness, Approximation and Parameterized Results -- Parameterized Complexity -- On the Parameterized Complexity of Compact Set Packing -- Structural Parameterization of Cluster Deletion -- Parity Permutation Pattern Matching. 330 $aThis book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13973 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer graphics 606 $aApplication software 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aDesign and Analysis of Algorithms 606 $aComputer Graphics 606 $aComputer and Information Systems Applications 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aApplication software. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Graphics. 615 24$aComputer and Information Systems Applications. 676 $a005.1 676 $a005.1 702 $aLin$b Juncheng 702 $aLin$b Bertrand M. T. 702 $aLiotta$b Giuseppe$cPh. D. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910682598603321 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNINA