Ben Bals

As a PhD student at CWI and the VU in Amsterdam, I research fast graph algorithms and the application of graph-based techniques for string algorithms. I am a theoretician.

I am fortunate to be advised by Yasamin Nazari, Daniel Dadush, and Solon Pissis. You can reach me at bjjb (at) cwi (dot) nl.

1. Publications

See my dblp page for an up-to-date list of my publications.

2. Talks

  • ESA’25: When Is String Reconstruction Using de Bruijn Graphs Hard? [arxiv, slides]
  • SPIRE’25: Testing Quasiperiodicity [arxiv, slides]
  • ESA’25: How to Reduce Temporal Cliques to Find Sparse Spanners [arxiv, slides]