01786nas 2200397 n 450 99000890819040332120240229084346.00003-973X000890819FED01000890819(Aleph)000890819FED01000890819CNRP 0001820820161109b19371975km-y0itaa50------bafreFRauu--------Archives d'ophtalmologie et revue générale d'ophtalmologie1937-1975ParisMasson et Cie2001Revue générale d'ophtalmologie2001Archives d'ophtalmologie0010008908202001Archives d'ophtalmologie [1976]Archives d'ophtalmologie et revue générale d'ophtalmologie617.7617.7ITACNP20090723http://acnp.cib.unibo.it/cgi-ser/start/it/cnr/dc-p1.tcl?catno=10587&person=false&language=ITALIANO&libr=&libr_th=unina1Biblioteche che possiedono il periodicoSE990008908190403321Biblioteca. Dipartimento di Scienze Oftalmologiche. Facoltà di Medicina e Chirurgia dell'Università Federico II di Napoli1975.DMSOFDMSOFArchives d'ophtalmologie et revue générale d'ophtalmologie800326UNINA866-01NA170 Biblioteca. Dipartimento di Scienze Oftalmologiche. Facoltà di Medicina e Chirurgia dell'Università Federico II di NapoliVia Pansini,5, 80131 Napoli (NA)08174622970817462383itacnp.cib.unibo.itACNP Italian Union Catalogue of Serialshttp://acnp.cib.unibo.it/cgi-ser/start/it/cnr/df-p.tcl?catno=10587&language=ITALIANO&libr=&person=&B=1&libr_th=unina&proposto=NO05341nam 22007935 450 991077024590332120240702103939.09783031491931303149193910.1007/978-3-031-49193-1(MiAaPQ)EBC31009077(Au-PeEL)EBL31009077(DE-He213)978-3-031-49193-1(CKB)29337975000041(OCoLC)1413967975(EXLCZ)992933797500004120231208d2024 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierComputing and Combinatorics 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II /edited by Weili Wu, Guangmo Tong1st ed. 2024.Cham :Springer Nature Switzerland :Imprint: Springer,2024.1 online resource (430 pages)Lecture Notes in Computer Science,1611-3349 ;14423Print version: Wu, Weili Computing and Combinatorics Cham : Springer,c2024 9783031491924 Complexity and Approximation -- Complexity and Enumeration in Models of Genome Rearrangement -- Conditional automatic complexity and its metrics -- Streaming and Query Once Space Complexity of Longest Increasing Subsequence -- Approximating Decision Trees with Priority Hypotheses -- Approximating the $\lambda$-low-density Value -- Exponential Time Complexity of the Complex Weighted Boolean \#CSP -- Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs -- Graph Algorithms -- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs -- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width -- Shortest Longest-Path Graph Orientations -- Sink Location Problems in Dynamic Flow Grid Networks -- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs -- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs -- Sum-of-Local-Effects Data Structures for Separable Graphs -- Applied Algorithms -- Variants of Euclidean k-center Clusterings -- Red-black Spanners for Mixed-charging Vehicular Networks -- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms -- On Detecting Some Defective Items in Group Testing -- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression -- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem -- Improved Sourcewise Roundtrip Spanners with Constant Stretch -- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation -- The k edge-vertex domination problem -- Resource-Adaptive Newton’s Method for Distributed Learning -- DR-submodular Function Maximization with Adaptive Stepsize -- On the Routing Problems in Graphs with Ordered Forbidden Transitions -- DelayingDecisions and Reservation Costs -- A PTAS Framework for Clustering Problems in Doubling Metrics -- A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by Chat GPT.This two volume set volume LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023. The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections: Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks. Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.Lecture Notes in Computer Science,1611-3349 ;14423Computer scienceImage processingDigital techniquesComputer visionData structures (Computer science)Information theoryComputer scienceMathematicsDiscrete mathematicsNumerical analysisTheory of ComputationComputer Imaging, Vision, Pattern Recognition and GraphicsData Structures and Information TheoryDiscrete Mathematics in Computer ScienceSymbolic and Algebraic ManipulationNumerical AnalysisComputer science.Image processingDigital techniques.Computer vision.Data structures (Computer science)Information theory.Computer scienceMathematics.Discrete mathematics.Numerical analysis.Theory of Computation.Computer Imaging, Vision, Pattern Recognition and Graphics.Data Structures and Information Theory.Discrete Mathematics in Computer Science.Symbolic and Algebraic Manipulation.Numerical Analysis.004.0151Wu Weili1005291Tong Guangmo1460283MiAaPQMiAaPQMiAaPQBOOK9910770245903321Computing and Combinatorics3660150UNINA