output
19942026
most citedLOFAR: The LOw-Frequency ARray

2.7k citations

1,286 papers

cs.DS2026

Text Indexing: From Reporting to Counting

Ben Bals, Panagiotis Charalampopoulos, Oded Lachish +2

We prove an elementary yet powerful combinatorial lemma: in any rooted tree with leaves, the number of nodes whose depth is smaller than the number of their leaf descendants is…

cs.DS2026

String Matching in (Block) Graphs: A Full Classification by Walk Length

Sebastian Angrick, Ben Bals, Paweł Gawrychowski +2

We consider directed graphs in which the nodes are labeled with strings. A walk in such a graph naturally corresponds to the concatenation of the visited nodes' labels. These graph…

cs.DS2026

Revisiting Diameter in Directed Graphs

Ben Bals, Joakim Blikstad, Daniel Dadush +2

The reachability diameter () of a directed graph is the maximum distance over all pairs where is reachable from . This notion is present in the def…

hep-th2026

Resonance transformations for the minimal string via swap: a proof of Artemev's conjecture

Kornelis Dekinga, Sergey Shadrin, Erik Verlinde

This paper contains a proof of a recent conjecture of Artemev that connected the resonance transformations for the minimal string to the swap in the theory of topo…

cs.NE2026★ 3 cited

Simultaneous Model-Based Evolution of Constants and Expression Structure in GP-GOMEA for Symbolic Regression

Johannes Koch, Tanja Alderliesten, Peter A. N. Bosman

Genetic programming (GP) approaches are among the state-of-the-art for symbolic regression, the task of constructing symbolic expressions that fit well with data. To find highly ac…

cs.IR2026

Semantic Recall for Vector Search

Leonardo Kuffo, Ioanna Tsakalidou, Roberta De Viti +3

We introduce Semantic Recall, a novel metric to assess the quality of approximate nearest neighbor search algorithms by considering only semantically relevant objects that are theo…