Algorithms and Complexity (eBook, PDF)

14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I
Redaktion: Finocchi, Irene; Georgiadis, Loukas

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Nature Switzerland
• Seitenzahl: 362
• Erscheinungstermin: 17. Mai 2025
• Englisch
• ISBN-13: 9783031929328
• Artikelnr.: 74238405

Inhaltsangabe

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