Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings,...

— —

Irene Finocchi Loukas Georgiadis

Algorithms and Complexity

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

Irene Finocchi, Loukas Georgiadis

$206.95 $165.78

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer International Publishing AG
18 May 2025

Graphics programming; Maths for computer scientists; Systems analysis & design; Artificial intelligence

Series: Lecture Notes in Computer Science

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.

Edited by: Irene Finocchi, Loukas Georgiadis
Imprint: Springer International Publishing AG
Country of Publication: Switzerland
Volume: 15680
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783031929342
ISBN 10: 3031929349
Series: Lecture Notes in Computer Science
Pages: 364
Publication Date: 18 May 2025
Audience: Professional and scholarly , College/higher education , Undergraduate , Further / Higher Education
Format: Paperback
Publisher's Status: Active

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