Publications

2026: When is String Reconstruction using de Bruijn Graphs Hard? Ben Bals, Sebastiaan van Krieken, Solon Pissis, Leen Stougie, and Hilde Verbeek. Transactions on Algorithms, 2026.

Text Indexing: From Reporting to Counting Ben Bals, Panagiotis Charalampopoulos, Oded Lachish, Solon Pissis, and Hilde Verbeek. European Symposium on Algorithms (ESA) 2026.

Minimizing the Minimizers via Alphabet Reordering Hilde Verbeek, Lorraine Ayad, Grigorios Loukides, and Solon Pissis. Theoretical Computer Science, 115932.

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast Lorraine Ayad, Grigorios Loukides, Solon Pissis, and Hilde Verbeek. Algorithmica, vol. 88, no. 3.

Faster Algorithms for Shortest Unique and Absent Substrings Panagiotis Charalampopoulos, Manal Mohamed, Solon Pissis, Hilde Verbeek, and Wiktor Zuba. Scandinavian Symposium on Algorithmic Theory (SWAT) 2026.

Coloring Powers of Random Graphs Alan Frieze, Ross Kang, Aditya Raut, Michelle Sweering, and Hilde Verbeek. arXiv pre-print.
2025: String Consensus Problems with Swaps and Substitutions Estéban Gabory, Laurent Bulteau, Gabriele Fici, and Hilde Verbeek. International Symposium on String Processing and Information Retrieval (SPIRE) 2025.
2024: Heavy Nodes in a Small Neighborhood: Exact and Peeling Algorithms with Applications Ling Li, Hilde Verbeek, Huiping Chen, Grigorios Loukides, Robert Gwadera, Leen Stougie, and Solon Pissis. IEEE Transactions on Knowledge and Data Engineering, vol. 37, no. 4.
2023: Periodicity of Degenerate Strings Estéban Gabory, Eric Rivals, Michelle Sweering, Hilde Verbeek, and Pengfei Wang. Prague Stringology Conference 2023.
2022: Disjoint Paths and Directed Steiner Tree on Planar Graphs with Terminals on Few Faces Master’s thesis.