Algorithms and Complexity
14th International Conference, CIAC 2025, Rome, Italy, June 10?12, 2025, Proceedings, Part II
Series: Lecture Notes in Computer Science; 15680;
- Publisher's listprice EUR 87.73
-
37 030 Ft (35 267 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 12% (cc. 4 444 Ft off)
- Discounted price 32 587 Ft (31 035 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
37 030 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer
- Date of Publication 18 May 2025
- Number of Volumes 1 pieces, Book
- ISBN 9783031929342
- Binding Paperback
- No. of pages364 pages
- Size 235x155 mm
- Language English
- Illustrations 35 Illustrations, black & white; 35 Illustrations, color 671
Categories
Long description:
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.
Table of Contents:
.- 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.
More
