The 2-Attractor Problem Is NP-Complete. - Janosch Fuchs; Philip Whittington (STACS, 2024)

Online String Attractors - And Their Relation to the Lempel-Ziv Factorization. - Philip Whittington (WAOA, 2024)

Online String Attractors. - Philip Whittington (CoRR, 2024)

Tokenisation is NP-Complete. - Philip Whittington; Gregor Bachmann; Tiago Pimentel (ACL (1), 2025)

Time-Optimal k-Server. - Fabian Frei; Dennis Komm; Moritz Stocker; Philip Whittington (CoRR, 2025)