Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. - Parinya Chalermsook; Sandy Heydrich; Eugenia Holm; Andreas Karrenbauer (ESA, 2014)

Dividing connected chores fairly. - Sandy Heydrich; Rob van Stee (Theor. Comput. Sci., 2015)

Beating the Harmonic Lower Bound for Online Bin Packing. - Sandy Heydrich; Rob van Stee (ICALP, 2016)

Improved Lower Bounds for Online Hypercube Packing. - Sandy Heydrich; Rob van Stee (CoRR, 2016)

A tale of two packing problems. - Sandy Heydrich (2018)

Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process. - Heiner Ackermann; Sandy Heydrich; Christian Weiß 003 (OR, 2019)

A Flexible Shift System for a Fully-Continuous Production Division. - Elisabeth Finhold; Tobias Fischer 002; Sandy Heydrich; Karl-Heinz Küfer (OR, 2019)

Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. - Sandy Heydrich; Andreas Wiese (ACM Trans. Algorithms, 2019)

Scheduling a proportionate flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2020)

Approximating Geometric Knapsack via L-packings. - Waldo Gálvez; Fabrizio Grandoni 001; Salvatore Ingala; Sandy Heydrich; Arindam Khan 001; Andreas Wiese (ACM Trans. Algorithms, 2021)

Online algorithms to schedule a proportionate flexible flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2022)

Scheduling a single machine with multiple due dates per job. - Raphael Kühn; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich (J. Sched., 2024)