LEADER 03996nam  22006735  450 
001 9911003693503321
005 20250518130237.0
010   $a3-031-92935-7
024 7 $a10.1007/978-3-031-92935-9
035   $a(CKB)38858980400041
035   $a(DE-He213)978-3-031-92935-9
035   $a(MiAaPQ)EBC32123764
035   $a(Au-PeEL)EBL32123764
035   $a(EXLCZ)9938858980400041
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 II /$fedited by Irene Finocchi, Loukas Georgiadis
205   $a1st ed. 2025.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025.
215   $a1 online resource (XIV, 364 p. 70 illus., 35 illus. in color.) 
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15680
311 08$a3-031-92934-9 
327   $a -- Happy set problems on cubic graphs and convex bipartite graphs.  -- Network Creation Games with 2-Neighborhood Maximization.  -- Almost-catalytic Computation.  -- The Complexity of Landmark Hub Labeling.  -- Improved Bounds for Geodetic Hulls.  -- Disjoint Temporal Walks Under Waiting Time Constraints.  -- A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering.  -- Bounded degree QBF and positional games.  -- Subsequence Matching and LCS with Segment Number Constraints.  -- Fast Geographic Routing in Fixed-Growth Graphs.  -- Arithmetic Circuits with Division.  -- Pinwheel Covering.  -- On the Hardness of the Drone Delivery Problem.  -- Nonpartisan Feedback Vertex Set.  -- Parameterized Complexity of Disconnected Matchings.  -- Burning Path-like and Clique-like Graphs.  -- Online Bichromatic Piercing Set Problem.  -- Packing dimers to maximum occupancy under soft-core constraints.  -- Atoms versus Avoiding Simplicial Vertices.  -- Supereulerian Testing on Semi-Eulerian Graphs.  -- Perpetual Scheduling with Explorable Uncertainty.  -- Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.
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 ;$v15680
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   $a9911003693503321
996   $aAlgorithms and Complexity$94381040
997   $aUNINA