ICALP is the flagship conference of the European Association for Theoretical Computer Science. We have got 5 papers with coauthors from Helsinki in ICALP 2024, and all papers are already freely available on arXiv:

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs · A. Björklund (ITU Copenhagen), P. Kaski (Aalto), J. Nederlof (U. Utrecht)

It is NP-hard to find a Hamiltonian cycle in a given bipartite Pfaffian graph; but when presented with one, we show how to find another, in linear time.

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification · E. Galby (TU Hamburg), S. Kisfaludi-Bak (Aalto), D. Marx (CISPA), R. Sharma (MPI Inf.)

Directed Steiner Network finds a minimum subgraph connecting k terminals as required. We give a full trichotomy in planar digraphs (FPT/subexp./exp.) with respect to k.

Testing Spreading Behavior in Networks with Arbitrary Topologies · A. Modanese (Aalto), Y. Yoshida (NII)

We initiate the study of property testing in dynamic environments with arbitrary topologies. Previous works (Goldreich and Ron, 2017; Nakar and Ron, 2021) had only considered the case where the topology was a grid.

The Group Access Bounds for Binary Search Trees · P. Chalermsook (Aalto), M. Gupta (IIT), W. Jiamjitrak (Helsinki), A. Pareek (IIT), S. Yingchareonthawornchai (Hebrew University)

We propose a new bound for binary search trees, unifying many strong BST bounds that appeared in the literature.

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces · F. Abbassi, S. Banerjee, J. Byrka (Wroclaw), P. Chalermsook (Aalto), A. Gadekar (Bar-Ilan), K. Khodamoradi (Regina), D. Marx, R. Sharma (CISPA), J. Spoerhase (Sheffield)

We “complete” the landscape of the geometric socially fair clustering problem.