default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandy Heydrich
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Raphael Kühn
, Christian Weiß, Heiner Ackermann, Sandy Heydrich:
Scheduling a single machine with multiple due dates per job. J. Sched. 27(6): 565-585 (2024)- 2022
- [j5]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. J. Sched. 25(6): 643-657 (2022) - 2021
- [j4]Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17(4): 33:1-33:67 (2021) - 2020
- [j3]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. J. Sched. 23(5): 575-593 (2020) - [i5]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines. CoRR abs/2005.03552 (2020) - [i4]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a Proportionate Flow Shop of Batching Machines. CoRR abs/2006.09872 (2020)
2010 – 2019
- 2019
- [j2]Sandy Heydrich, Andreas Wiese:
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. ACM Trans. Algorithms 15(4): 47:1-47:28 (2019) - [c7]Elisabeth Finhold, Tobias Fischer, Sandy Heydrich, Karl-Heinz Küfer:
A Flexible Shift System for a Fully-Continuous Production Division. OR 2019: 531-537 - [c6]Heiner Ackermann, Sandy Heydrich, Christian Weiß:
Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process. OR 2019: 591-597 - 2018
- [b1]Sandy Heydrich:
A tale of two packing problems. Saarland University, Germany, 2018 - 2017
- [c5]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-Packings. FOCS 2017: 260-271 - [c4]Sandy Heydrich, Andreas Wiese:
Faster approximation schemes for the two-dimensional knapsack problem. SODA 2017: 79-98 - [i3]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-packings. CoRR abs/1711.07710 (2017) - 2016
- [c3]Sandy Heydrich, Rob van Stee:
Beating the Harmonic Lower Bound for Online Bin Packing. ICALP 2016: 41:1-41:14 - [i2]Sandy Heydrich, Rob van Stee:
Improved Lower Bounds for Online Hypercube Packing. CoRR abs/1607.01229 (2016) - 2015
- [j1]Sandy Heydrich, Rob van Stee:
Dividing connected chores fairly. Theor. Comput. Sci. 593: 51-61 (2015) - [i1]Sandy Heydrich, Rob van Stee:
Beating the Harmonic lower bound for online bin packing. CoRR abs/1511.00876 (2015) - 2014
- [c2]Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer:
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ESA 2014: 235-246 - 2013
- [c1]Sandy Heydrich, Rob van Stee:
Dividing Connected Chores Fairly. SAGT 2013: 171-182
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
