The Book Review Column

Games on Graphs: From Logic and Automata to Algorithms (Cambridge University Press, 2026), by Nathana¨el Fijalkow (Ed.) (University of Warsaw), is a collection of articles on infinite duration games on graphs, with applications in program verification and synthesis. Extremal Graph and Hypergraph Theory (Cambridge University Press, 2026), by Dhruv Mubayi (University of Illinois, Chicago) and Jacques Verstraete (University of California, San Diego), contains both introductory and advanced material in extremal graph theory, hypergraph theory and Ramsey theory. Quantum Computing: Foundations and Practice (Oxford University Press, 2026), by Steven Herbert (University of Cambridge), presents the most important quantum algorithms and communication protocols, weighs the question of quantum advantage, and addresses the subject of quantum error correction.

Authors

Institutions

Publication Details

Journal
ACM SIGACT News
Published
2026-03-31
DOI
https://doi.org/10.1145/3802807.3802808
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Book Review Column

Nicholas Trân
ACM SIGACT News
Complexity and Algorithms in Graphs
article

The Book Review Column

Nicholas Trân
article en

Abstract

Games on Graphs: From Logic and Automata to Algorithms (Cambridge University Press, 2026), by Nathana¨el Fijalkow (Ed.) (University of Warsaw), is a collection of articles on infinite duration games on graphs, with applications in program verification and synthesis. Extremal Graph and Hypergraph Theory (Cambridge University Press, 2026), by Dhruv Mubayi (University of Illinois, Chicago) and Jacques Verstraete (University of California, San Diego), contains both introductory and advanced material in extremal graph theory, hypergraph theory and Ramsey theory. Quantum Computing: Foundations and Practice (Oxford University Press, 2026), by Steven Herbert (University of Cambridge), presents the most important quantum algorithms and communication protocols, weighs the question of quantum advantage, and addresses the subject of quantum error correction.

ACM SIGACT NewsVol. 57(1)
Santa Clara University (US)
Openalex Percentile: Top 6%
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.