Lower bounds on the performance of online algorithms for relaxed packing problems.

György Dósa

János Balogh György Dósa Leah Epstein Lukasz Jez Lower bounds on the performance of online algorithms for relaxed packing problems. 2026 100941 60 Discret. Optim. https://doi.org/10.1016/j.disopt.2026.100941 db/journals/disopt/disopt60.html#BaloghDEJ26 streams/journals/disopt

Jirí Sgall János Balogh József Békési György Dósa Lars Magnus Hvattum Zsolt Tuza No tiling of the 70 × 70 square with consecutive squares. 115607 2026 1060 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2025.115607 db/journals/tcs/tcs1060.html#SgallBBDHT26 streams/journals/tcs

János Balogh József Békési György Dósa Leah Epstein Asaf Levin More on online cardinality constrained bin packing with small cardinality bounds. 115774 2026 1068 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2026.115774 db/journals/tcs/tcs1068.html#BaloghBDEL26 streams/journals/tcs

György Dósa András Éles Angshuman Robin Goswami István Szalkai Zsolt Tuza Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard. 115 2025 18 Algorithms 2 https://doi.org/10.3390/a18020115 db/journals/algorithms/algorithms18.html#DosaEGST25 streams/journals/algorithms

János Balogh György Dósa Lars Magnus Hvattum Tomas Olaj István Szalkai Zsolt Tuza Covering a square with consecutive squares. 911-926 2025 July 350 Ann. Oper. Res. 3 https://doi.org/10.1007/s10479-025-06633-5 db/journals/anor/anor350.html#BaloghDHOST25 streams/journals/anor

Zhihua Huang An Zhang 0001 György Dósa Yong Chen 0002 Chenling Xiong Improved Approximation Algorithms for Bin Packing with Conflicts. 667-682 2025 August 36 Int. J. Found. Comput. Sci. 5 https://doi.org/10.1142/S0129054122460054 db/journals/ijfcs/ijfcs36.html#HuangZDCX25 streams/journals/ijfcs

János Balogh József Békési Nóra Büki György Dósa Zsolt Tuza Extremal behavior of the Greedy algorithm for a triangle scheduling problem. 106718 2024 169 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2024.106718 db/journals/cor/cor169.html#BaloghBBDT24 streams/journals/cor

Jirí Sgall János Balogh József Békési György Dósa Lars Magnus Hvattum Zsolt Tuza No Tiling of the 70 × 70 Square with Consecutive Squares. 28:1-28:16 2024 FUN https://doi.org/10.4230/LIPIcs.FUN.2024.28 conf/fun/2024 db/conf/fun/fun2024.html#SgallBBDHT24

Gyula Abraham Peter Auer György Dósa Tibor Dulai Zsolt Tuza Agnes Werner-Stark The bin covering with delivery problem, extended investigations for the online case. 21-47 2023 March 31 Central Eur. J. Oper. Res. 1 https://doi.org/10.1007/s10100-022-00798-1 db/journals/cejor/cejor31.html#AbrahamADDTW23

Gyula Abraham György Dósa Lars Magnus Hvattum Tomas Olaj Zsolt Tuza The board packing problem. 1056-1073 2023 August 308 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2023.01.030 db/journals/eor/eor308.html#AbrahamDHOT23

József Békési György Dósa Gábor Galambos A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays. 844-852 2022 297 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2021.06.002 db/journals/eor/eor297.html#BekesiDG22

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Lower bounds for batched bin packing. 613-629 2022 43 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-021-00797-z db/journals/jco/jco43.html#BaloghBDEL22

János Balogh György Dósa Lars Magnus Hvattum Tomas Olaj Zsolt Tuza Guillotine cutting is asymptotically optimal for packing consecutive squares. 2775-2785 2022 16 Optim. Lett. 9 https://doi.org/10.1007/s11590-022-01858-w https://www.wikidata.org/entity/Q114222152 db/journals/ol/ol16.html#BaloghDHOT22

Marin Bougeret György Dósa Noam Goldberg Michael Poss Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. 2534-2552 2022 36 SIAM J. Discret. Math. 4 https://doi.org/10.1137/21m1457199 db/journals/siamdm/siamdm36.html#BougeretDGP22

János Balogh György Dósa Leah Epstein Lukasz Jez Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. 101-113 2022 IWOCA https://doi.org/10.1007/978-3-031-06678-8_8 conf/iwoca/2022 db/conf/iwoca/iwoca2022.html#BaloghDEJ22

János Balogh György Dósa Leah Epstein Lukasz Jez Lower bounds on the performance of online algorithms for relaxed packing problems. 2022 abs/2201.05999 CoRR https://arxiv.org/abs/2201.05999 db/journals/corr/corr2201.html#abs-2201-05999

János Balogh József Békési György Dósa Leah Epstein Asaf Levin A New Lower Bound for Classic Online Bin Packing. 2047-2062 2021 83 Algorithmica 7 https://doi.org/10.1007/s00453-021-00818-7 db/journals/algorithmica/algorithmica83.html#BaloghBDEL21

Peter Auer György Dósa Tibor Dulai Armin Fügenschuh Peggy Näser Ronald Ortner Agnes Werner-Stark A new heuristic and an exact approach for a production planning problem. 1079-1113 2021 29 Central Eur. J. Oper. Res. 3 https://doi.org/10.1007/s10100-020-00689-3 db/journals/cejor/cejor29.html#AuerDDFNOW21

György Dósa Nicholas Newman Zsolt Tuza Vitaly I. Voloshin Coloring Properties of Mixed Cycloids. 1539 2021 13 Symmetry 8 https://doi.org/10.3390/sym13081539 db/journals/symmetry/symmetry13.html#DosaNTV21

György Dósa Hans Kellerer Tomas Olaj Zsolt Tuza An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. 69-81 2021 880 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.06.002 db/journals/tcs/tcs880.html#DosaKOT21

György Dósa Leah Epstein Quality of equilibria for selfish bin packing with cost sharing variants. 100556 2020 38 Discret. Optim. https://doi.org/10.1016/j.disopt.2019.100556 https://www.wikidata.org/entity/Q126810389 db/journals/disopt/disopt38.html#DosaE20

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Online bin packing with cardinality constraints resolved. 34-49 2020 112 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2020.03.002 db/journals/jcss/jcss112.html#BaloghBDEL20

János Csirik György Dósa Dávid Kószó Online Scheduling with Machine Cost and a Quadratic Objective Function. 199-210 2020 SOFSEM https://doi.org/10.1007/978-3-030-38919-2_17 conf/sofsem/2020 db/conf/sofsem/sofsem2020.html#CsirikDK20

György Dósa Armin Fügenschuh Zhiyi Tan 0001 Zsolt Tuza Krzysztof Wesek Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. 1107-1130 2019 27 Central Eur. J. Oper. Res. 4 https://doi.org/10.1007/s10100-018-0536-9 https://www.wikidata.org/entity/Q130041039 db/journals/cejor/cejor27.html#DosaFTTW19

György Dósa Hans Kellerer Zsolt Tuza Using weight decision for decreasing the price of anarchy in selfish bin packing games. 160-169 2019 278 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2019.04.026 https://www.wikidata.org/entity/Q128000780 db/journals/eor/eor278.html#DosaKT19

György Dósa Leah Epstein A new lower bound on the price of anarchy of selfish bin packing. 6-12 2019 150 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2019.06.002 db/journals/ipl/ipl150.html#DosaE19

György Dósa Leah Epstein Pareto optimal equilibria for selfish bin packing with uniform cost sharing. 827-847 2019 37 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-018-0323-5 https://www.wikidata.org/entity/Q129643970 db/journals/jco/jco37.html#DosaE19

János Balogh József Békési György Dósa Jirí Sgall Rob van Stee The optimal absolute ratio for online bin packing. 1-17 2019 102 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2018.11.005 https://www.wikidata.org/entity/Q128626216 db/journals/jcss/jcss102.html#BaloghBDSS19

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Lower Bounds for Several Online Variants of Bin Packing. 1757-1780 2019 63 Theory Comput. Syst. 8 https://doi.org/10.1007/s00224-019-09915-1 db/journals/mst/mst63.html#BaloghBDEL19

György Dósa Leah Epstein Quality of strong equilibria for selfish bin packing with uniform cost sharing. 473-485 2019 22 J. Sched. 4 https://doi.org/10.1007/s10951-018-0587-8 https://www.wikidata.org/entity/Q129150342 db/journals/scheduling/scheduling22.html#DosaE19

György Dósa Hans Kellerer Zsolt Tuza Restricted assignment scheduling with resource constraints. 72-87 2019 760 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.08.016 https://www.wikidata.org/entity/Q129344524 db/journals/tcs/tcs760.html#DosaKT19

János Balogh József Békési György Dósa Leah Epstein Asaf Levin A New Lower Bound for Classic Online Bin Packing. 18-28 2019 WAOA https://doi.org/10.1007/978-3-030-39479-0_2 conf/waoa/2019 db/conf/waoa/waoa2019.html#BaloghBDEL19

György Dósa Leah Epstein The Convergence Time for Selfish Bin Packing. 853-865 2018 23 Acta Cybern. 3 https://doi.org/10.14232/actacyb.23.3.2018.8 https://www.wikidata.org/entity/Q129527002 db/journals/actaC/actaC23.html#DosaE18

Martin Böhm 0001 György Dósa Leah Epstein Jirí Sgall Pavel Veselý 0001 Colored Bin Packing: Online Algorithms and Lower Bounds. 155-184 2018 80 Algorithmica 1 https://doi.org/10.1007/s00453-016-0248-2 db/journals/algorithmica/algorithmica80.html#BohmDESV18

Zhenbo Wang Xin Han György Dósa Zsolt Tuza A General Bin Packing Game: Interest Taken into Account. 1534-1555 2018 80 Algorithmica 5 https://doi.org/10.1007/s00453-017-0361-x db/journals/algorithmica/algorithmica80.html#WangHDT18

György Dósa Armin Fügenschuh Zhiyi Tan 0001 Zsolt Tuza Krzysztof Wesek Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. 161-180 2018 26 Central Eur. J. Oper. Res. 1 https://doi.org/10.1007/s10100-017-0481-z https://www.wikidata.org/entity/Q47555800 db/journals/cejor/cejor26.html#DosaFTTW18

György Dósa Zsolt Tuza Multiprofessor scheduling. 195-209 2018 234 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.01.035 db/journals/dam/dam234.html#DosaT18

György Dósa The Intermediate Price of Anarchy (IPoA) in bin packing games. 16-25 2018 242 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.10.010 db/journals/dam/dam242.html#Dosa18

György Dósa Leah Epstein The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints. 33-49 2018 96 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2018.03.004 https://www.wikidata.org/entity/Q129980508 db/journals/jcss/jcss96.html#DosaE18

János Balogh József Békési György Dósa Leah Epstein Asaf Levin A New and Improved Algorithm for Online Bin Packing. 5:1-5:14 2018 ESA https://doi.org/10.4230/LIPIcs.ESA.2018.5 conf/esa/2018 db/conf/esa/esa2018.html#BaloghBDEL18 György Dósa Hans Kellerer Zsolt Tuza Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. 204-217 2018 WAOA https://doi.org/10.1007/978-3-030-04693-4_13 conf/waoa/2018 db/conf/waoa/waoa2018.html#DosaKT18 János Csirik György Dósa Performance Guarantees for One Dimensional Bin Packing. 491-517 2018 Handbook of Approximation Algorithms and Metaheuristics (1) https://doi.org/10.1201/9781351236423-28 books/tf/18/2018aam-1 db/books/collections/aam2018-1.html#CsirikD18

János Balogh József Békési György Dósa Leah Epstein Asaf Levin A new lower bound for classic online bin packing. 2018 abs/1807.05554 CoRR http://arxiv.org/abs/1807.05554 db/journals/corr/corr1807.html#abs-1807-05554

György Dósa Batched bin packing revisited. 199-209 2017 20 J. Sched. 2 https://doi.org/10.1007/s10951-015-0431-3 db/journals/scheduling/scheduling20.html#Dosa17

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Online Bin Packing with Cardinality Constraints Resolved. 10:1-10:14 2017 ESA https://doi.org/10.4230/LIPIcs.ESA.2017.10 conf/esa/2017 db/conf/esa/esa2017.html#BaloghBDEL17 János Balogh József Békési György Dósa Leah Epstein Asaf Levin Lower Bounds for Several Online Variants of Bin Packing. 102-117 2017 WAOA https://doi.org/10.1007/978-3-319-89441-6_9 conf/waoa/2017 db/conf/waoa/waoa2017.html#BaloghBDEL17

János Balogh József Békési György Dósa Leah Epstein Asaf Levin A new and improved algorithm for online bin packing. 2017 abs/1707.01728 CoRR http://arxiv.org/abs/1707.01728 db/journals/corr/corr1707.html#BaloghBDEL17

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Lower bounds for several online variants of bin packing. 2017 abs/1708.03228 CoRR http://arxiv.org/abs/1708.03228 db/journals/corr/corr1708.html#abs-1708-03228

János Balogh József Békési Gábor Galambos György Dósa Zhiyi Tan 0001 Lower bound for 3-batched bin packing. 14-24 2016 21 Discret. Optim. https://doi.org/10.1016/j.disopt.2016.04.007 db/journals/disopt/disopt21.html#BaloghBGDT16

József Békési György Dósa Leah Epstein Bounds for online bin packing with cardinality constraints. 190-204 2016 249 Inf. Comput. https://doi.org/10.1016/j.ic.2016.06.001 db/journals/iandc/iandc249.html#BekesiDE16

Csilla Bujtás György Dósa Csanád Imreh Judit Nagy-György Zsolt Tuza New models of graph-bin packing. 94-103 2016 640 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2016.06.008 https://www.wikidata.org/entity/Q59072412 db/journals/tcs/tcs640.html#BujtasDINT16

György Dósa First Fit Algorithm for Bin Packing. 753-755 2016 Encyclopedia of Algorithms https://doi.org/10.1007/978-1-4939-2864-4_487 db/reference/algo/algo2016.html#Dosa16

János Balogh József Békési György Dósa Leah Epstein Asaf Levin Online bin packing with cardinality constraints resolved. 2016 abs/1608.06415 CoRR http://arxiv.org/abs/1608.06415 db/journals/corr/corr1608.html#BaloghBDEL16

Xin Chen 0032 Ning Ding György Dósa Xin Han He Jiang 0001 Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs. 873-881 2015 92 Int. J. Comput. Math. 5 https://doi.org/10.1080/00207160.2014.922682 db/journals/ijcm/ijcm92.html#ChenDDHJ15

János Balogh József Békési György Dósa Leah Epstein Hans Kellerer Zsolt Tuza Online Results for Black and White Bin Packing. 137-155 2015 56 Theory Comput. Syst. 1 https://doi.org/10.1007/s00224-014-9538-8 db/journals/mst/mst56.html#BaloghBDEKT15

János Balogh József Békési György Dósa Leah Epstein Hans Kellerer Asaf Levin Zsolt Tuza Offline black and white bin packing. 92-101 2015 596 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.06.045 db/journals/tcs/tcs596.html#BaloghBDEKLT15

György Dósa The tight absolute bound of First Fit in the parameterized case. 149-154 2015 596 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.06.046 db/journals/tcs/tcs596.html#Dosa15

Zhenbo Wang Xin Han György Dósa Zsolt Tuza Bin Packing Game with an Interest Matrix. 57-69 2015 COCOON https://doi.org/10.1007/978-3-319-21398-9_5 conf/cocoon/2015 db/conf/cocoon/cocoon2015.html#WangHDT15 István Szalkai György Dósa Online Algorithms for a Generalized Parallel Machine Scheduling Problem. 193-200 2015 MACRo https://doi.org/10.1515/macro-2015-0019 conf/macro/2015 db/conf/macro/macro2015.html#SzalkaiD15 János Balogh József Békési György Dósa Jirí Sgall Rob van Stee The optimal absolute ratio for online bin packing. 1425-1438 2015 SODA https://doi.org/10.1137/1.9781611973730.94 conf/soda/2015 db/conf/soda/soda2015.html#BaloghBDSS15

István Szalkai György Dósa Online Algorithms for a Generalized Parallel Machine Scheduling Problem. 2015 abs/1502.02304 CoRR http://arxiv.org/abs/1502.02304 db/journals/corr/corr1502.html#SzalkaiD15

Ning Ding Yan Lan Xin Chen 0032 György Dósa He Guo 0001 Xin Han Online Minimum makespan Scheduling with a Buffer. 525-536 2014 25 Int. J. Found. Comput. Sci. 5 https://doi.org/10.1142/S0129054114500191 db/journals/ijfcs/ijfcs25.html#DingLCDGH14

György Dósa Jirí Sgall Optimal Analysis of Best Fit Bin Packing. 429-441 2014 ICALP (1) https://doi.org/10.1007/978-3-662-43948-7_36 conf/icalp/2014-1 db/conf/icalp/icalp2014-1.html#DosaS14 György Dósa Leah Epstein The Convergence Time for Selfish Bin Packing. 37-48 2014 SAGT https://doi.org/10.1007/978-3-662-44803-8_4 conf/sagt/2014 db/conf/sagt/sagt2014.html#DosaE14 György Dósa Leah Epstein Colorful Bin Packing. 170-181 2014 SWAT https://doi.org/10.1007/978-3-319-08404-6_15 conf/swat/2014 db/conf/swat/swat2014.html#DosaE14

György Dósa Leah Epstein Online bin packing with cardinality constraints revisited. 2014 abs/1404.1056 CoRR http://arxiv.org/abs/1404.1056 db/journals/corr/corr1404.html#DosaE14

György Dósa Leah Epstein Colorful bin packing. 2014 abs/1404.3990 CoRR http://arxiv.org/abs/1404.3990 db/journals/corr/corr1404.html#DosaE14a

Attila Benko György Dósa Zsolt Tuza Bin covering with a general profit function: approximability results. 805-816 2013 21 Central Eur. J. Oper. Res. 4 https://doi.org/10.1007/s10100-012-0269-0 db/journals/cejor/cejor21.html#BenkoDT13

Xin Chen 0032 Zhenzhen Xu György Dósa Xin Han He Jiang 0001 Semi-online hierarchical scheduling problems with buffer or rearrangements. 127-131 2013 113 Inf. Process. Lett. 4 https://doi.org/10.1016/j.ipl.2012.12.007 db/journals/ipl/ipl113.html#ChenXDHJ13

György Dósa Zsolt Tuza Deshi Ye Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. 416-436 2013 26 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-011-9408-0 db/journals/jco/jco26.html#DosaTY13

Ruixin Ma György Dósa Xin Han Hing-Fung Ting Deshi Ye Yong Zhang 0001 A note on a selfish bin packing problem. 1457-1462 2013 56 J. Glob. Optim. 4 https://doi.org/10.1007/s10898-012-9856-9 https://www.wikidata.org/entity/Q105583417 db/journals/jgo/jgo56.html#MaDHTYZ13

Yan Lan György Dósa Xin Han Chenyang Zhou 0001 Attila Benko 2D knapsack: Packing squares. 35-40 2013 508 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.07.035 db/journals/tcs/tcs508.html#LanDHZB13

György Dósa Rongheng Li Xin Han Zsolt Tuza Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9. 13-61 2013 510 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.09.007 db/journals/tcs/tcs510.html#DosaLHT13

György Dósa Csanád Imreh The generalization of scheduling with machine cost. 102-110 2013 510 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.09.009 db/journals/tcs/tcs510.html#DosaI13

György Dósa Jirí Sgall First Fit bin packing: A tight analysis. 538-549 2013 STACS https://doi.org/10.4230/LIPIcs.STACS.2013.538 conf/stacs/2013 db/conf/stacs/stacs2013.html#DosaS13

Joan Boyar György Dósa Leah Epstein On the absolute approximation ratio for First Fit and related results. 1914-1923 2012 160 Discret. Appl. Math. 13-14 https://doi.org/10.1016/j.dam.2012.04.012 db/journals/dam/dam160.html#BoyarDE12

Yuxin Wang 0001 Attila Benko Xin Chen 0032 György Dósa He Guo 0001 Xin Han Cecilia Sik-Lányi Online scheduling with one rearrangement at the end: Revisited. 641-645 2012 112 Inf. Process. Lett. 16 https://doi.org/10.1016/j.ipl.2012.05.009 db/journals/ipl/ipl112.html#WangBCDGHS12

Yan Lan Xin Chen 0032 Ning Ding György Dósa Xin Han Online Minimum Makespan Scheduling with a Buffer. 161-171 2012 FAW-AAIM https://doi.org/10.1007/978-3-642-29700-7_15 conf/aaim/2012 db/conf/aaim/aaim2012.html#LanCDDH12 János Balogh József Békési György Dósa Hans Kellerer Zsolt Tuza Black and White Bin Packing. 131-144 2012 WAOA https://doi.org/10.1007/978-3-642-38016-7_12 conf/waoa/2012 db/conf/waoa/waoa2012.html#BaloghBDKT12

György Dósa Leah Epstein Generalized selfish bin packing http://arxiv.org/abs/1202.4080 2012 CoRR abs/1202.4080 db/journals/corr/corr1202.html#abs-1202-4080

György Dósa Zsolt Tuza Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms http://arxiv.org/abs/1207.5672 2012 CoRR abs/1207.5672 db/journals/corr/corr1207.html#abs-1207-5672

Csilla Bujtás György Dósa Csanád Imreh Judit Nagy-György Zsolt Tuza The Graph-Bin Packing Problem. 1971-1993 2011 22 Int. J. Found. Comput. Sci. 8 https://doi.org/10.1142/S012905411100915X https://www.wikidata.org/entity/Q59072655 db/journals/ijfcs/ijfcs22.html#BujtasDINT11

György Dósa Maria Grazia Speranza Zsolt Tuza Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. 458-480 2011 21 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-009-9265-2 db/journals/jco/jco21.html#DosaST11

György Dósa Leah Epstein Preemptive Online Scheduling with Reordering. 21-49 2011 25 SIAM J. Discret. Math. 1 https://doi.org/10.1137/090766139 db/journals/siamdm/siamdm25.html#DosaE11

György Dósa Yuxin Wang 0001 Xin Han He Guo 0001 Online scheduling with rearrangement on two related machines. 642-653 2011 412 Theor. Comput. Sci. 8-10 https://doi.org/10.1016/j.tcs.2010.10.019 db/journals/tcs/tcs412.html#DosaWHG11

Xin Chen 0032 Yan Lan Attila Benko György Dósa Xin Han Optimal algorithms for online scheduling with bounded rearrangement at the end. 6269-6278 2011 412 Theor. Comput. Sci. 45 https://doi.org/10.1016/j.tcs.2011.07.014 https://www.wikidata.org/entity/Q63353562 db/journals/tcs/tcs412.html#ChenLBDH11

Min Chen György Dósa Xin Han Chenyang Zhou 0001 Attila Benko 2D Knapsack: Packing Squares. 176-184 2011 FAW-AAIM https://doi.org/10.1007/978-3-642-21204-8_21 conf/aaim/2011 db/conf/aaim/aaim2011.html#ChenDHZB11

György Dósa Zhiyi Tan 0001 New upper and lower bounds for online scheduling with machine cost. 125-135 2010 7 Discret. Optim. 3 https://doi.org/10.1016/j.disopt.2010.02.005 db/journals/disopt/disopt7.html#DosaT10

György Dósa Leah Epstein Online scheduling with a buffer on related machines. 161-179 2010 20 J. Comb. Optim. 2 https://doi.org/10.1007/s10878-008-9200-y db/journals/jco/jco20.html#DosaE10

Attila Benko György Dósa Zsolt Tuza Bin Packing/Covering with Delivery, solved with the evolution of algorithms. 298-302 2010 BIC-TA https://doi.org/10.1109/BICTA.2010.5645312 conf/bic-ta/2010 db/conf/bic-ta/bic-ta2010.html#BenkoDT10 György Dósa Leah Epstein Preemptive Online Scheduling with Reordering. 456-467 2009 ESA https://doi.org/10.1007/978-3-642-04128-0_41 conf/esa/2009 db/conf/esa/esa2009.html#DosaE09

György Dósa Leah Epstein Preemptive scheduling on a small number of hierarchical machines. 602-619 2008 206 Inf. Comput. 5 https://doi.org/10.1016/j.ic.2007.11.004 db/journals/iandc/iandc206.html#DosaE08

Yong He György Dósa Extension of algorithm list scheduling for a semi-online scheduling problem. 97-104 2007 15 Central Eur. J. Oper. Res. 1 https://doi.org/10.1007/s10100-006-0003-x db/journals/cejor/cejor15.html#HeD07

Weiya Zhong György Dósa Zhiyi Tan 0001 On the machine scheduling problem with job delivery coordination. 1057-1072 2007 182 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2006.09.059 db/journals/eor/eor182.html#ZhongDT07

György Dósa The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9. 1-11 2007 conf/escape/2007 ESCAPE https://doi.org/10.1007/978-3-540-74450-4_1 db/conf/escape/escape2007.html#Dosa07

György Dósa Yong He Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines. 149-164 2006 76 Computing 1-2 https://doi.org/10.1007/s00607-005-0130-6 db/journals/computing/computing76.html#DosaH06

György Dósa Yong He Bin packing problems with rejection penalties and their dual problems. 795-815 2006 204 Inf. Comput. 5 https://doi.org/10.1016/j.ic.2006.02.003 db/journals/iandc/iandc204.html#DosaH06

György Dósa Yong He Scheduling with machine cost and rejection. 337-350 2006 12 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-006-9003-y db/journals/jco/jco12.html#DosaH06

Yong He György Dósa Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. 140-159 2005 150 Discret. Appl. Math. 1-3 https://doi.org/10.1016/j.dam.2004.12.005 db/journals/dam/dam150.html#HeD05

Yong He György Dósa Bin Packing and Covering Problems with Rejection. 885-894 2005 conf/cocoon/2005 COCOON https://doi.org/10.1007/11533719_89 db/conf/cocoon/cocoon2005.html#HeD05

György Dósa Yong He Semi-Online Algorithms for Parallel Machine Scheduling Problems. 355-363 2004 72 Computing 3-4 https://doi.org/10.1007/s00607-003-0034-2 db/journals/computing/computing72.html#DosaH04

György Dósa Yong He Better Online Algorithms for Scheduling with Machine Cost. 1035-1051 2004 33 SIAM J. Comput. 5 https://doi.org/10.1137/S009753970343395X db/journals/siamcomp/siamcomp33.html#DosaH04

Gyula Abraham Peter Auer János Balogh József Békési Attila Benko Martin Böhm 0001 Marin Bougeret Joan Boyar Csilla Bujtás Nóra Büki Min Chen Xin Chen 0032 Yong Chen 0002 János Csirik Ning Ding Tibor Dulai András Éles Leah Epstein Armin Fügenschuh Gábor Galambos Noam Goldberg Angshuman R. GoswamiAngshuman Robin Goswami He Guo 0001 Xin Han Yong He Zhihua Huang Lars Magnus Hvattum Csanád Imreh Lukasz Jez He Jiang 0001 Hans Kellerer Dávid Kószó Yan Lan Asaf Levin Rongheng Li Ruixin Ma Judit Nagy-György Peggy Näser Nicholas Newman Tomas Olaj Ronald Ortner Michael Poss Jirí Sgall Cecilia Sik-Lányi Maria Grazia Speranza Rob van Stee István Szalkai Zhiyi Tan 0001 Hing-Fung Ting Zsolt Tuza Pavel Veselý 0001 Vitaly I. Voloshin Yuxin Wang 0001 Zhenbo Wang Agnes Werner-Stark Krzysztof Wesek Chenling Xiong Zhenzhen Xu Deshi Ye An Zhang 0001 Yong Zhang 0001 Weiya Zhong Chenyang Zhou 0001