From the 2 of 8 linked papers with an AI index.
8 papers
String Matching in (Block) Graphs: A Full Classification by Walk Length
Sebastian Angrick, Ben Bals, PaweÅ Gawrychowski +2
The paper classifies the computational complexity of finding a walk with a given pattern in directed graphs whose nodes are labeled by strings, focusing on walks that traverse a bo…
Cut Query Reachability for DAGs with Subquadratic Queries
Ben Bals, Matei Tinca, Yasamin Nazari
The paper presents a deterministic algorithm for single-source reachability in directed acyclic graphs using subquadratic cut queries, achieving O(n √(n log n)) query complexity an…
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…
Greedy Algorithms for Shortcut Sets and Hopsets
Ben Bals, Joakim Blikstad, Greg Bodwin +3
For many popular graph metric sparsifiers, such as spanners, emulators, and preservers, simple and elegant greedy algorithms are known that achieve state-of-the-art or existentiall…
Optimal Enumeration of Eulerian Trails in Directed Graphs
Ben Bals, Solon P. Pissis, Matei Tinca
The BEST theorem, due to de Bruijn, van Aardenne-Ehrenfest, Smith, and Tutte, is a classical tool from graph theory that links the Eulerian trails in a directed graph wit…
Subtree Mode and Applications
Jialong Zhou, Ben Bals, Matei Tinca +4
The mode of a collection of values (i.e., the most frequent value in the collection) is a key summary statistic. Finding the mode in a given range of an array of values is thus of…