ICALP is the flagship conference of the European Association for Theoretical Computer Science. We have got 6 papers with coauthors from Helsinki in ICALP 2026:

Classification of Local Optimization Problems in Directed Cycles · T. Boudier, F. Kuhn, A. Modanese, R. Stimpert, J. Suomela

We present a complete classification of the distributed computational complexity of local optimization problems in directed cycles for both deterministic and randomized distributed algorithms.

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms · A. Björklund, P. Kaski, T. Koana, J. Nederlof

We show that sufficiently low tensor rank for a balanced tripartitioning tensor implies uniform arithmetic circuits for the matrix permanent that are exponentially smaller than those obtainable from Ryser's formula.

Beyond Brooks: (Δ−1)-Coloring in Semi-Streaming · M. Flin, M.M. Halldórsson

Reed showed that graphs of maximum degree Δ ≥ 10¹⁴ without Δ-cliques are (Δ−1)-colorable. We design a one-pass semi-streaming algorithm for computing such a coloring.

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane · T.M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng

We undertake a comprehensive study of computing diameter on geometric intersection graphs, showing that the landscape depends in nuanced ways on the object type, the true diameter value, and how the objects intersect.

Touring a Sequence of Orthogonal Polygons · K. Casel, S. Kisfaludi-Bak, L. Kleist, J.S.K. Lamme, E. Oh, Y. Wang

We study the fine-grained complexity of computing a shortest tour in Manhattan distance that visits a sequence of orthogonal polygons, giving a truly subquadratic algorithm when consecutive polygons are disjoint.

Connected Dominating Sets in Triangulations · P. Bose, V. Dujmovic, H. Houdrouge, P. Morin, S. Odak

We show that every n-vertex planar triangulation has a connected dominating set of size at most 10n/21.