I am a third-year PhD student supervised by Solon Pissis and Leen Stougie. My research interests are in string algorithms, which have various applications in DNA analysis, information retrieval and various other fields, and graph theory, with algorithmic applications to network and connectivity problems. So far, my PhD research has mostly been related to "string sketching", a technique that represents a string using a number of carefully selected fragments. This allows for the design of algorithms that run faster and use less memory, and are therefore more suitable for working with large amounts of data. I was the first recipient of CWI's Constance van Eeden fellowship, which aims to stimulate women to pursue a career in mathematics and computer science.
Previously, I did both my bachelor's and master's in computer science at Utrecht University. During my master's thesis, supervised by Jesper Nederlof, I studied two well-known connectivity problems (Disjoint Paths and Directed Steiner Tree) in the setting of planar graphs in which all endpoints are incident on a small number of faces, or "hubs". This has natural applications in the design of microchips.
