LEADER 04162nam  22006735  450 
001 996660361403316
005 20250518130238.0
010   $a3-031-92932-2
024 7 $a10.1007/978-3-031-92932-8
035   $a(CKB)38859114100041
035   $a(DE-He213)978-3-031-92932-8
035   $a(MiAaPQ)EBC32123769
035   $a(Au-PeEL)EBL32123769
035   $a(EXLCZ)9938859114100041
100   $a20250518d2025      u|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aAlgorithms and Complexity $e14th International Conference, CIAC 2025, Rome, Italy, June 10?12, 2025, Proceedings, Part I /$fedited by Irene Finocchi, Loukas Georgiadis
205   $a1st ed. 2025.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025.
215   $a1 online resource (XIV, 362 p. 71 illus., 47 illus. in color.) 
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15679
311 08$a3-031-92931-4 
327   $a -- Exact and Approximate High-Multiplicity Scheduling on Identical Machines.  -- Unit refutations in Horn constraint systems.  -- On Exact Learning of $d$-Monotone Functions.  -- Computational Complexity of Combinatorial Distance Matrix Realisation.  -- Online Range Assignment Problems.  -- General Position Subset Selection in Line Arrangements.  -- Branching Programs with Extended Memory: New Insights.  -- Tatami Printer: Physical ZKPs for Tatami Puzzles.  -- On the Price of Anarchy in Packet Routing Games with FIFO.  -- On the Computational Complexity of Graph Reconstruction.  -- Efficient Certifying Algorithms for Linear Classification.  -- Improved Sublinear-time Moment Estimation using Weighted Sampling.  -- Structural Parameterizations of Locating-Dominating Set and Test Cover.  -- Improved bounds for group testing in arbitrary hypergraphs.  -- A Parameterized Perspective of All-Colors.  -- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane.  -- Degree Realization by Bipartite Cactus Graphs.  -- On Two Simple[st] Learning Tasks.  -- Dynamic Filter and Retrieval with One Access to Modifiable Memory.  -- Longest path transversals in claw-free and $P 5$-free graphs.  -- Realizing Graphs with Cut Constraints.  -- On The Computational Complexity of Games with Uncertainty.
330   $aThe two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10?12, 2025. The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v15679
606   $aComputer graphics
606   $aComputer science$xMathematics
606   $aComputer systems
606   $aArtificial intelligence
606   $aAlgorithms
606   $aComputer Graphics
606   $aSymbolic and Algebraic Manipulation
606   $aComputer System Implementation
606   $aArtificial Intelligence
606   $aDesign and Analysis of Algorithms
615  0$aComputer graphics.
615  0$aComputer science$xMathematics.
615  0$aComputer systems.
615  0$aArtificial intelligence.
615  0$aAlgorithms.
615 14$aComputer Graphics.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aComputer System Implementation.
615 24$aArtificial Intelligence.
615 24$aDesign and Analysis of Algorithms.
676   $a006.6
702   $aFinocchi$b Irene$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aGeorgiadis$b Loukas$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996660361403316
996   $aAlgorithms and Complexity$94381040
997   $aUNISA