2 citations · 5 across the 10 of their papers we have counts for
4 papers · 1 filter
When is String Reconstruction using de Bruijn Graphs Hard?
Ben Bals, Sebastiaan van Krieken, Solon P. Pissis +2
The reduction of the fragment assembly problem to (variations of) the classical Eulerian trail problem [Pevzner et al., PNAS 2001] has led to remarkable progress in genome assembly…
Optimal antimatroid sorting
Benjamin Aram Berendsohn
The classical comparison-based sorting problem asks us to find the underlying total order of a given set of elements, where we can only access the elements via comparisons. In this…
Permutation patterns in streams
Benjamin Aram Berendsohn
Permutation patterns and pattern avoidance are central, well-studied concepts in combinatorics and computer science. Given two permutations and , the pattern matching proble…
Balanced TSP partitioning
Benjamin Aram Berendsohn, Hwi Kim, László Kozma
The traveling salesman problem (TSP) famously asks for a shortest tour that a salesperson can take to visit a given set of cities in any order. In this paper, we ask how much faste…