1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
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
Faster Algorithms for Shortest Unique or Absent Substrings
Panagiotis Charalampopoulos, Manal Mohamed, Solon P. Pissis +2
We revisit two well-known algorithmic problems on strings: computing a shortest unique substring (SUS) and a shortest absent substring (SAS) of a string of length . Both pro…
math.CO2026
Coloring powers of random graphs
Alan Frieze, Ross Kang, Aditya Raut +2
Given a graph and an integer , the th power of is the graph obtained from by adding edges for all pairs of distinct vertices at distance at most fr…