Sandy Heydrich

Orcid: 0000-0002-7724-2644

According to our database1, Sandy Heydrich authored at least 11 papers between 2014 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Online algorithms to schedule a proportionate flexible flow shop of batching machines.
J. Sched., 2022

2021
Approximating Geometric Knapsack via L-packings.
ACM Trans. Algorithms, 2021

2020
Scheduling a proportionate flow shop of batching machines.
J. Sched., 2020

2019
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.
ACM Trans. Algorithms, 2019

A Flexible Shift System for a Fully-Continuous Production Division.
Proceedings of the Operations Research Proceedings 2019, 2019

Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
A tale of two packing problems.
PhD thesis, 2018

2016
Improved Lower Bounds for Online Hypercube Packing.
CoRR, 2016

Beating the Harmonic Lower Bound for Online Bin Packing.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Dividing connected chores fairly.
Theor. Comput. Sci., 2015

2014
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition.
Proceedings of the Algorithms - ESA 2014, 2014


  Loading...