Muutke küpsiste eelistusi

Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 1012, 2025, Proceedings, Part II [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 364 pages, kõrgus x laius: 235x155 mm, 35 Illustrations, color; 35 Illustrations, black and white; XIV, 364 p. 70 illus., 35 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15680
  • Ilmumisaeg: 18-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031929349
  • ISBN-13: 9783031929342
Teised raamatud teemal:
  • Pehme köide
  • Hind: 78,34 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 92,17 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 1012, 2025, Proceedings, Part IISuurem pilt
  • Formaat: Paperback / softback, 364 pages, kõrgus x laius: 235x155 mm, 35 Illustrations, color; 35 Illustrations, black and white; XIV, 364 p. 70 illus., 35 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15680
  • Ilmumisaeg: 18-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031929349
  • ISBN-13: 9783031929342
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031929342.html
Märksõnad:

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.