Algorithms and Complexity

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

Irene Finocchi, Loukas Georgiadis (Herausgeber)

Buch | Softcover

XIV, 364 Seiten

2025
Springer International Publishing (Verlag)
978-3-031-92934-2 (ISBN)

Artikel merken

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.

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

Erscheinungsdatum	20.05.2025
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XIV, 364 p. 70 illus., 35 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Schlagworte	algorithms • approximation algorithms • combinatorics • Computational Complexity • data structures • Distributed and Parallel Algorithms • Geometry • Graph Algorithms • online algorithms • parameterized complexity and exact algorithms • randomness • Streaming • theoretical computer science
ISBN-10	3-031-92934-9 / 3031929349
ISBN-13	978-3-031-92934-2 / 9783031929342
Zustand	Neuware