Epstein, Leah; Mualem, Loay Online bin packing of squares and cubes. (English) Zbl 07680780 Algorithmica 85, No. 5, 1415-1458 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{L. Epstein} and \textit{L. Mualem}, Algorithmica 85, No. 5, 1415--1458 (2023; Zbl 07680780) Full Text: DOI
Epstein, Leah Several methods of analysis for cardinality constrained bin packing. (English) Zbl 07636002 Theor. Comput. Sci. 942, 213-229 (2023). MSC: 90C27 68Q25 90C59 PDFBibTeX XMLCite \textit{L. Epstein}, Theor. Comput. Sci. 942, 213--229 (2023; Zbl 07636002) Full Text: DOI
Epstein, Leah Open-end bin packing: new and old analysis approaches. (English) Zbl 1500.90056 Discrete Appl. Math. 321, 220-239 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein}, Discrete Appl. Math. 321, 220--239 (2022; Zbl 1500.90056) Full Text: DOI arXiv
Balogh, János; Dósa, György; Epstein, Leah; Jeż, Łukasz Lower bounds on the performance of online algorithms for relaxed packing problems. (English) Zbl 07577693 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 101-113 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Balogh} et al., Lect. Notes Comput. Sci. 13270, 101--113 (2022; Zbl 07577693) Full Text: DOI arXiv
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Lower bounds for batched bin packing. (English) Zbl 1490.90235 J. Comb. Optim. 43, No. 3, 613-629 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comb. Optim. 43, No. 3, 613--629 (2022; Zbl 1490.90235) Full Text: DOI
Balogh, János; Cohen, Ilan Reuven; Epstein, Leah; Levin, Asaf Truly asymptotic lower bounds for online vector bin packing. (English) Zbl 07768353 Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 8, 18 p. (2021). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., LIPIcs -- Leibniz Int. Proc. Inform. 207, Article 8, 18 p. (2021; Zbl 07768353) Full Text: DOI arXiv
Balogh, János; Epstein, Leah; Levin, Asaf More on ordered open end bin packing. (English) Zbl 1483.90130 J. Sched. 24, No. 6, 589-614 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Sched. 24, No. 6, 589--614 (2021; Zbl 1483.90130) Full Text: DOI arXiv
Epstein, Leah On bin packing with clustering and bin packing with delays. (English) Zbl 1506.90222 Discrete Optim. 41, Article ID 100647, 16 p. (2021). MSC: 90C27 68Q25 68W27 PDFBibTeX XMLCite \textit{L. Epstein}, Discrete Optim. 41, Article ID 100647, 16 p. (2021; Zbl 1506.90222) Full Text: DOI arXiv
Epstein, Leah; Kleiman, Elena Selfish vector packing. (English) Zbl 1515.90115 Algorithmica 83, No. 9, 2952-2988 (2021). MSC: 90C27 91A06 91A68 91B32 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{E. Kleiman}, Algorithmica 83, No. 9, 2952--2988 (2021; Zbl 1515.90115) Full Text: DOI
Epstein, Leah; Levin, Asaf A note on a variant of the online open end bin packing problem. (English) Zbl 1525.90352 Oper. Res. Lett. 48, No. 6, 844-849 (2020). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Oper. Res. Lett. 48, No. 6, 844--849 (2020; Zbl 1525.90352) Full Text: DOI
Dósa, György; Epstein, Leah Quality of equilibria for selfish bin packing with cost sharing variants. (English) Zbl 1506.90221 Discrete Optim. 38, Article ID 100556, 21 p. (2020). MSC: 90C27 91A10 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, Discrete Optim. 38, Article ID 100556, 21 p. (2020; Zbl 1506.90221) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Online bin packing with cardinality constraints resolved. (English) Zbl 1442.68269 J. Comput. Syst. Sci. 112, 34-49 (2020). MSC: 68W27 68Q17 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comput. Syst. Sci. 112, 34--49 (2020; Zbl 1442.68269) Full Text: DOI arXiv Link
Dósa, György; Epstein, Leah Quality of strong equilibria for selfish bin packing with uniform cost sharing. (English) Zbl 1431.90129 J. Sched. 22, No. 4, 473-485 (2019). MSC: 90C27 91A80 91A10 91A43 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, J. Sched. 22, No. 4, 473--485 (2019; Zbl 1431.90129) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Lower bounds for several online variants of bin packing. (English) Zbl 1436.68402 Theory Comput. Syst. 63, No. 8, 1757-1780 (2019). MSC: 68W27 68Q17 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., Theory Comput. Syst. 63, No. 8, 1757--1780 (2019; Zbl 1436.68402) Full Text: DOI arXiv
Dósa, György; Epstein, Leah A new lower bound on the price of anarchy of selfish bin packing. (English) Zbl 1460.91052 Inf. Process. Lett. 150, 6-12 (2019). MSC: 91A46 90C27 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, Inf. Process. Lett. 150, 6--12 (2019; Zbl 1460.91052) Full Text: DOI
Dósa, György; Epstein, Leah Pareto optimal equilibria for selfish bin packing with uniform cost sharing. (English) Zbl 1425.90089 J. Comb. Optim. 37, No. 3, 827-847 (2019). MSC: 90C27 90C29 91A10 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, J. Comb. Optim. 37, No. 3, 827--847 (2019; Zbl 1425.90089) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf A new and improved algorithm for online bin packing. (English) Zbl 1522.68758 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 5, 14 p. (2018). MSC: 68W27 68W40 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 5, 14 p. (2018; Zbl 1522.68758) Full Text: DOI arXiv
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Online-bounded analysis. (English) Zbl 1406.90034 J. Sched. 21, No. 4, 429-441 (2018). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Sched. 21, No. 4, 429--441 (2018; Zbl 1406.90034) Full Text: DOI Link
Dósa, György; Epstein, Leah The convergence time for selfish bin packing. (English) Zbl 1413.68119 Acta Cybern. 23, No. 3, 853-865 (2018). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, Acta Cybern. 23, No. 3, 853--865 (2018; Zbl 1413.68119) Full Text: DOI
Epstein, Leah; Johnson, David S.; Levin, Asaf Min-sum bin packing. (English) Zbl 1421.90125 J. Comb. Optim. 36, No. 2, 508-531 (2018). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{L. Epstein} et al., J. Comb. Optim. 36, No. 2, 508--531 (2018; Zbl 1421.90125) Full Text: DOI
Dósa, György; Epstein, Leah The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints. (English) Zbl 1393.68057 J. Comput. Syst. Sci. 96, 33-49 (2018). MSC: 68Q17 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, J. Comput. Syst. Sci. 96, 33--49 (2018; Zbl 1393.68057) Full Text: DOI
Böhm, Martin; Dósa, György; Epstein, Leah; Sgall, Jiří; Veselý, Pavel Colored bin packing: online algorithms and lower bounds. (English) Zbl 1386.68227 Algorithmica 80, No. 1, 155-184 (2018). MSC: 68W27 68W40 90C27 PDFBibTeX XMLCite \textit{M. Böhm} et al., Algorithmica 80, No. 1, 155--184 (2018; Zbl 1386.68227) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Online bin packing with cardinality constraints resolved. (English) Zbl 1442.68268 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 10, 14 p. (2017). MSC: 68W27 68Q17 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 10, 14 p. (2017; Zbl 1442.68268) Full Text: DOI
Epstein, Leah; Levin, Asaf An AFPTAS for variable sized bin packing with general activation costs. (English) Zbl 1353.68120 J. Comput. Syst. Sci. 84, 79-96 (2017). MSC: 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, J. Comput. Syst. Sci. 84, 79--96 (2017; Zbl 1353.68120) Full Text: DOI
Epstein, Leah More on batched bin packing. (English) Zbl 1408.90251 Oper. Res. Lett. 44, No. 2, 273-277 (2016). MSC: 90C27 68W25 90C60 PDFBibTeX XMLCite \textit{L. Epstein}, Oper. Res. Lett. 44, No. 2, 273--277 (2016; Zbl 1408.90251) Full Text: DOI
Epstein, Leah; Kleiman, Elena; Mestre, Julián Parametric packing of selfish items and the subset sum algorithm. (English) Zbl 1394.68440 Algorithmica 74, No. 1, 177-207 (2016). MSC: 68W25 90C27 90C59 91A46 PDFBibTeX XMLCite \textit{L. Epstein} et al., Algorithmica 74, No. 1, 177--207 (2016; Zbl 1394.68440) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Kellerer, Hans; Levin, Asaf; Tuza, Zsolt Offline black and white bin packing. (English) Zbl 1328.68294 Theor. Comput. Sci. 596, 92-101 (2015). MSC: 68W25 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{J. Balogh} et al., Theor. Comput. Sci. 596, 92--101 (2015; Zbl 1328.68294) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Kellerer, Hans; Tuza, Zsolt Online results for black and white bin packing. (English) Zbl 1328.68310 Theory Comput. Syst. 56, No. 1, 137-155 (2015). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., Theory Comput. Syst. 56, No. 1, 137--155 (2015; Zbl 1328.68310) Full Text: DOI
Dósa, György; Epstein, Leah The convergence time for selfish bin packing. (English) Zbl 1403.91073 Lavi, Ron (ed.), Algorithmic game theory. 7th international symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44802-1/pbk). Lecture Notes in Computer Science 8768, 37-48 (2014). MSC: 91A46 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, Lect. Notes Comput. Sci. 8768, 37--48 (2014; Zbl 1403.91073) Full Text: DOI
Epstein, Leah; Imreh, Csanád; Levin, Asaf Bin covering with cardinality constraints. (English) Zbl 1286.05026 Discrete Appl. Math. 161, No. 13-14, 1975-1987 (2013). MSC: 05B40 68R10 68W27 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Discrete Appl. Math. 161, No. 13--14, 1975--1987 (2013; Zbl 1286.05026) Full Text: DOI
Adar, Ron; Epstein, Leah Selfish bin packing with cardinality constraints. (English) Zbl 1295.91005 Theor. Comput. Sci. 495, 66-80 (2013). MSC: 91A10 90C27 PDFBibTeX XMLCite \textit{R. Adar} and \textit{L. Epstein}, Theor. Comput. Sci. 495, 66--80 (2013; Zbl 1295.91005) Full Text: DOI
Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S. Comparing online algorithms for bin packing problems. (English) Zbl 1280.68297 J. Sched. 15, No. 1, 13-21 (2012). MSC: 68W27 90C27 05C85 PDFBibTeX XMLCite \textit{L. Epstein} et al., J. Sched. 15, No. 1, 13--21 (2012; Zbl 1280.68297) Full Text: DOI
Boyar, Joan; Dósa, György; Epstein, Leah On the absolute approximation ratio for first fit and related results. (English) Zbl 1247.90220 Discrete Appl. Math. 160, No. 13-14, 1914-1923 (2012). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Discrete Appl. Math. 160, No. 13--14, 1914--1923 (2012; Zbl 1247.90220) Full Text: DOI
Epstein, Leah; Levin, Asaf; van Stee, Rob Approximation schemes for packing splittable items with cardinality constraints. (English) Zbl 1236.90067 Algorithmica 62, No. 1-2, 102-129 (2012). MSC: 90B80 90C27 68W25 PDFBibTeX XMLCite \textit{L. Epstein} et al., Algorithmica 62, No. 1--2, 102--129 (2012; Zbl 1236.90067) Full Text: DOI
Epstein, Leah; Favrholdt, Lene M.; Levin, Asaf Online variable-sized bin packing with conflicts. (English) Zbl 1241.90106 Discrete Optim. 8, No. 2, 333-343 (2011). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Discrete Optim. 8, No. 2, 333--343 (2011; Zbl 1241.90106) Full Text: DOI
Epstein, Leah; van Stee, Rob Improved results for a memory allocation problem. (English) Zbl 1209.68006 Theory Comput. Syst. 48, No. 1, 79-92 (2011). MSC: 68M07 68W27 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, Theory Comput. Syst. 48, No. 1, 79--92 (2011; Zbl 1209.68006) Full Text: DOI
Epstein, Leah; Levin, Asaf AFPTAS results for common variants of bin packing: a new method for handling the small items. (English) Zbl 1211.68510 SIAM J. Optim. 20, No. 6, 3121-3145 (2010). MSC: 68W25 68Q25 68W40 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, SIAM J. Optim. 20, No. 6, 3121--3145 (2010; Zbl 1211.68510) Full Text: DOI arXiv
Epstein, Leah; Imreh, Csanád; Levin, Asaf Class constrained bin packing revisited. (English) Zbl 1196.68311 Theor. Comput. Sci. 411, No. 34-36, 3073-3089 (2010). MSC: 68W05 68W27 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Theor. Comput. Sci. 411, No. 34--36, 3073--3089 (2010; Zbl 1196.68311) Full Text: DOI
Epstein, Leah Two-dimensional online bin packing with rotation. (English) Zbl 1192.68923 Theor. Comput. Sci. 411, No. 31-33, 2899-2911 (2010). MSC: 68W27 PDFBibTeX XMLCite \textit{L. Epstein}, Theor. Comput. Sci. 411, No. 31--33, 2899--2911 (2010; Zbl 1192.68923) Full Text: DOI
Boyar, Joan; Epstein, Leah; Levin, Asaf Tight results for next fit and worst fit with resource augmentation. (English) Zbl 1207.68453 Theor. Comput. Sci. 411, No. 26-28, 2572-2580 (2010). MSC: 68W40 68W25 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 411, No. 26--28, 2572--2580 (2010; Zbl 1207.68453) Full Text: DOI
Epstein, Leah Bin packing with rejection revisited. (English) Zbl 1187.68719 Algorithmica 56, No. 4, 505-528 (2010). MSC: 68W27 68W25 PDFBibTeX XMLCite \textit{L. Epstein}, Algorithmica 56, No. 4, 505--528 (2010; Zbl 1187.68719) Full Text: DOI
Epstein, Leah; Levin, Asaf Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. (English) Zbl 1191.68864 Inf. Process. Lett. 109, No. 1, 32-37 (2009). MSC: 68W25 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Inf. Process. Lett. 109, No. 1, 32--37 (2009; Zbl 1191.68864) Full Text: DOI
Epstein, Leah; Kleiman, Elena Resource augmented semi-online bounded space bin packing. (English) Zbl 1209.90336 Discrete Appl. Math. 157, No. 13, 2785-2798 (2009). MSC: 90C35 68W27 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{E. Kleiman}, Discrete Appl. Math. 157, No. 13, 2785--2798 (2009; Zbl 1209.90336) Full Text: DOI
Epstein, Leah On online bin packing with LIB constraints. (English) Zbl 1180.90267 Nav. Res. Logist. 56, No. 8, 780-786 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein}, Nav. Res. Logist. 56, No. 8, 780--786 (2009; Zbl 1180.90267) Full Text: DOI Link
Epstein, Leah; Levin, Asaf On bin packing with conflicts. (English) Zbl 1175.68200 SIAM J. Optim. 19, No. 3, 1270-1298 (2008). MSC: 68Q25 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, SIAM J. Optim. 19, No. 3, 1270--1298 (2008; Zbl 1175.68200) Full Text: DOI
Epstein, Leah; Levin, Asaf An APTAS for generalized cost variable-sized bin packing. (English) Zbl 1165.68035 SIAM J. Comput. 38, No. 1, 411-428 (2008). MSC: 68Q25 68W25 68W40 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, SIAM J. Comput. 38, No. 1, 411--428 (2008; Zbl 1165.68035) Full Text: DOI
Correa, José R.; Epstein, Leah Bin packing with controllable item sizes. (English) Zbl 1169.90018 Inf. Comput. 206, No. 8, 1003-1016 (2008). MSC: 90C27 68W25 68W40 90C59 91B32 PDFBibTeX XMLCite \textit{J. R. Correa} and \textit{L. Epstein}, Inf. Comput. 206, No. 8, 1003--1016 (2008; Zbl 1169.90018) Full Text: DOI
Epstein, Leah; Levin, Asaf More on online bin packing with two item sizes. (English) Zbl 1151.90500 Discrete Optim. 5, No. 4, 705-713 (2008). MSC: 90C10 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Discrete Optim. 5, No. 4, 705--713 (2008; Zbl 1151.90500) Full Text: DOI
Epstein, Leah; Levy, Meital Online interval coloring with packing constraints. (English) Zbl 1153.68055 Theor. Comput. Sci. 407, No. 1-3, 203-212 (2008). MSC: 68W05 05C15 05C78 05C85 68Q17 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{M. Levy}, Theor. Comput. Sci. 407, No. 1--3, 203--212 (2008; Zbl 1153.68055) Full Text: DOI
Epstein, Leah; van Stee, Rob Online bin packing with resource augmentation. (English) Zbl 1135.68627 Discrete Optim. 4, No. 3-4, 322-333 (2007). MSC: 68W05 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, Discrete Optim. 4, No. 3--4, 322--333 (2007; Zbl 1135.68627) Full Text: DOI Link
Epstein, Leah; van Stee, Rob Bounds for online bounded space hypercube packing. (English) Zbl 1163.90603 Discrete Optim. 4, No. 2, 185-197 (2007). MSC: 90B80 90C27 90C39 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, Discrete Optim. 4, No. 2, 185--197 (2007; Zbl 1163.90603) Full Text: DOI Link
Epstein, Leah; van Stee, Rob This side up! (English) Zbl 1321.68513 ACM Trans. Algorithms 2, No. 2, 228-243 (2006). MSC: 68W27 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, ACM Trans. Algorithms 2, No. 2, 228--243 (2006; Zbl 1321.68513) Full Text: DOI
Epstein, Leah Online bin packing with cardinality constraints. (English) Zbl 1130.68063 SIAM J. Discrete Math. 20, No. 4, 1015-1030 (2006). MSC: 68Q25 68W40 PDFBibTeX XMLCite \textit{L. Epstein}, SIAM J. Discrete Math. 20, No. 4, 1015--1030 (2006; Zbl 1130.68063) Full Text: DOI
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S.; Larsen, Kim S.; Pedersen, Morten M.; Wøhlk, Sanne The maximum resource bin packing problem. (English) Zbl 1100.68125 Theor. Comput. Sci. 362, No. 1-3, 127-139 (2006). MSC: 68W05 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{J. Boyar} et al., Theor. Comput. Sci. 362, No. 1--3, 127--139 (2006; Zbl 1100.68125) Full Text: DOI
Epstein, Leah; Levy, Meital Online interval coloring with packing constraints. (English) Zbl 1153.68555 Jędrzejowicz, Joanna (ed.) et al., Mathematical foundations of computer science 2005. 30th international symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28702-7/pbk). Lecture Notes in Computer Science 3618, 295-307 (2005). MSC: 68W05 05C15 05C78 05C85 68Q17 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{M. Levy}, Lect. Notes Comput. Sci. 3618, 295--307 (2005; Zbl 1153.68555) Full Text: DOI
Epstein, Leah; van Stee, Rob Optimal online algorithms for multidimensional packing problems. (English) Zbl 1092.68047 SIAM J. Comput. 35, No. 2, 431-448 (2005). MSC: 68Q25 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, SIAM J. Comput. 35, No. 2, 431--448 (2005; Zbl 1092.68047) Full Text: DOI
Epstein, Leah; Tassa, Tamir Vector assignment problems: a general framework. (English) Zbl 1079.90078 J. Algorithms 48, No. 2, 360-384 (2003). MSC: 90B80 90B35 90C29 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{T. Tassa}, J. Algorithms 48, No. 2, 360--384 (2003; Zbl 1079.90078) Full Text: DOI
Epstein, L.; Favrholdt, L. M. On-line maximizing the number of items packed in variable-sized bins. (English) Zbl 1027.68041 Acta Cybern. 16, No. 1, 57-66 (2003). MSC: 68P10 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{L. M. Favrholdt}, Acta Cybern. 16, No. 1, 57--66 (2003; Zbl 1027.68041)
Seiden, Steven S.; van Stee, Rob; Epstein, Leah New bounds for variable-sized online bin packing. (English) Zbl 1029.68084 SIAM J. Comput. 32, No. 2, 455-469 (2003). MSC: 68Q25 68W25 68W40 PDFBibTeX XMLCite \textit{S. S. Seiden} et al., SIAM J. Comput. 32, No. 2, 455--469 (2003; Zbl 1029.68084) Full Text: DOI
Azar, Yossi; Boyar, Joan.; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S. Fair versus unrestricted bin packing. (English) Zbl 1001.68181 Algorithmica 34, No. 2, 181-196 (2002). MSC: 68W05 05B40 PDFBibTeX XMLCite \textit{Y. Azar} et al., Algorithmica 34, No. 2, 181--196 (2002; Zbl 1001.68181) Full Text: DOI