Algorithms and Complexity

14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part II

AvIrene Finocchi,Loukas Georgiadis

Häftad, Engelska, 2025

Del 15680 i serien Lecture Notes in Computer Science

1 012 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The 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.

Produktinformation

Utgivningsdatum:2025-05-18
Mått:155 x 235 x 21 mm
Vikt:575 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:364
Förlag:Springer International Publishing AG
ISBN:9783031929342
Originaltitel:Algorithms and Complexity

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

.- 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.