Approximation Algorithms for Min-Distance Problems in DAGs. - Mina Dalirrooyfard; Jenny Kaufmann (ICALP, 2021)

Square-Free Graphs with no Induced Fork. - Maria Chudnovsky; Shenwei Huang; T. Karthick; Jenny Kaufmann (Electron. J. Comb., 2021)

Coloring Graph Classes with no Induced Fork via Perfect Divisibility. - T. Karthick; Jenny Kaufmann; Vaidy Sivaraman (Electron. J. Comb., 2022)

Approximating Min-Diameter: Standard and Bichromatic. - Aaron Berger; Jenny Kaufmann; Virginia Vassilevska Williams (ESA, 2023)

Can Interpretation Predict Behavior on Unseen Data? - Victoria R. Li; Jenny Kaufmann; Martin Wattenberg; David Alvarez-Melis; Naomi Saphra (CoRR, 2025)