Output-sensitive algorithms for enumeration problems in graphs. (Algorithmes "output-sensitifs" pour les problèmes d'énumération dans les graphes). - Sarah Blind (2019)

Enumerating k-Arc-Connected Orientations. - Sarah Blind; Kolja Knauer; Petru Valicov (Algorithmica, 2020)

Locally definable vertex set properties are efficiently enumerable. - Sarah Blind; Nadia Creignou; Frédéric Olive (Discret. Appl. Math., 2021)

An alternate model to describe the radio-potentializing effects of metal-based nanoparticles in radiation therapy. - Sarah Blind; Lucie Lerouge; Mickaël Gries; Paul Retif; Noémie Thomas; Muriel Barberi-Heyob; Joël Daouk (Comput. Biol. Medicine, 2025)