157 citations · 421 across the 63 of their papers we have counts for
88 papers
Frequencies of subwords in words of linear subword complexity
Jason Bell, Laindon Burnett, Chris Schulz
Using a method of Balková--Pelantová, we show that if is a right-infinite word over a finite alphabet, then for each nonnegative integer there are at most $3(p_{\bf w…
A Cobham theorem for scalar multiplication
Philipp Hieronymi, Sven Manthe, Chris Schulz
Let be such that are quadratic and . Then every subset of definable in both $(\mathbb{R},{<},+,\mathb…
Consecutive Power Occurrences in Sturmian Words
Jason Bell, Chris Schulz, Jeffrey Shallit
We show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by and this bound is…
Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
Jannick Borowitz, Ernestine Großmann, Christian Schulz +1
A 2-packing set for an undirected graph is a subset such that any two vertices have no common neighbors. Finding a 2-pac…
Arc-Flags Meet Trip-Based Public Transit Routing
Ernestine Großmann, Jonas Sauer, Christian Schulz +1
We present Arc-Flag TB, a journey planning algorithm for public transit networks which combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. Compare…
FREIGHT: Fast Streaming Hypergraph Partitioning
Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A…