Algorithms and Complexity, Kartoniert / Broschiert
Algorithms and Complexity
- 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I
- Herausgeber:
- Irene Finocchi, Loukas Georgiadis
- Verlag:
- Springer, 05/2025
- Einband:
- Kartoniert / Broschiert
- Sprache:
- Englisch
- ISBN-13:
- 9783031929311
- Artikelnummer:
- 12303672
- Umfang:
- 376 Seiten
- Gewicht:
- 569 g
- Maße:
- 235 x 155 mm
- Stärke:
- 21 mm
- Erscheinungstermin:
- 18.5.2025
- Hinweis
-
Achtung: Artikel ist nicht in deutscher Sprache!
Weitere Ausgaben von Algorithms and Complexity |
Preis |
|---|---|
| Buch, Kartoniert / Broschiert, Englisch | EUR 89,80* |
Klappentext
.- 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.