György Dósa

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 53

Top Topics

Packing Problem

Graph Colouring

Top Venues

Theor. Comput. Sci.

Central Eur. J. Oper. Res.

J. Comput. Syst. Sci.

Publications

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. Comput. Oper. Res. 169 (2024)
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. FUN (2024)
Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
The board packing problem. Eur. J. Oper. Res. 308 (3) (2023)
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. Central Eur. J. Oper. Res. 31 (1) (2023)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Lower bounds for batched bin packing. J. Comb. Optim. 43 (3) (2022)
Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM J. Discret. Math. 36 (4) (2022)
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. Eur. J. Oper. Res. 297 (3) (2022)
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR (2022)
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. IWOCA (2022)
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16 (9) (2022)
György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin
Coloring Properties of Mixed Cycloids. Symmetry 13 (8) (2021)
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. Theor. Comput. Sci. 880 (2021)
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. Central Eur. J. Oper. Res. 29 (3) (2021)
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. Algorithmica 83 (7) (2021)
János Csirik, György Dósa, Dávid Kószó
Online Scheduling with Machine Cost and a Quadratic Objective Function. SOFSEM (2020)
György Dósa, Leah Epstein
Quality of equilibria for selfish bin packing with cost sharing variants. Discret. Optim. 38 (2020)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. 112 (2020)
György Dósa, Leah Epstein
Quality of strong equilibria for selfish bin packing with uniform cost sharing. J. Sched. 22 (4) (2019)
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. Theory Comput. Syst. 63 (8) (2019)
György Dósa, Hans Kellerer, Zsolt Tuza
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760 (2019)
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. WAOA (2019)
György Dósa, Hans Kellerer, Zsolt Tuza
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278 (1) (2019)
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. J. Comput. Syst. Sci. 102 (2019)
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 27 (4) (2019)
György Dósa, Leah Epstein
A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150 (2019)
György Dósa, Leah Epstein
Pareto optimal equilibria for selfish bin packing with uniform cost sharing. J. Comb. Optim. 37 (3) (2019)
György Dósa, Leah Epstein
The Convergence Time for Selfish Bin Packing. Acta Cybern. 23 (3) (2018)
György Dósa, Leah Epstein
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints. J. Comput. Syst. Sci. 96 (2018)
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. ESA (2018)
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. WAOA (2018)
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80 (1) (2018)
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. CoRR (2018)
György Dósa
The Intermediate Price of Anarchy (IPoA) in bin packing games. Discret. Appl. Math. 242 (2018)
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 26 (1) (2018)
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
A General Bin Packing Game: Interest Taken into Account. Algorithmica 80 (5) (2018)
György Dósa, Zsolt Tuza
Multiprofessor scheduling. Discret. Appl. Math. 234 (2018)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online Bin Packing with Cardinality Constraints Resolved. ESA (2017)
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. CoRR (2017)
György Dósa
Batched bin packing revisited. J. Sched. 20 (2) (2017)
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. WAOA (2017)
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. CoRR (2017)
János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan
Lower bound for 3-batched bin packing. Discret. Optim. 21 (2016)
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
New models of graph-bin packing. Theor. Comput. Sci. 640 (2016)
József Békési, György Dósa, Leah Epstein
Bounds for online bin packing with cardinality constraints. Inf. Comput. 249 (2016)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. CoRR (2016)
István Szalkai, György Dósa
Online Algorithms for a Generalized Parallel Machine Scheduling Problem. CoRR (2015)
György Dósa
The tight absolute bound of First Fit in the parameterized case. Theor. Comput. Sci. 596 (2015)
Xin Chen, Ning Ding, György Dósa, Xin Han, He Jiang
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs. Int. J. Comput. Math. 92 (5) (2015)
István Szalkai, György Dósa
Online Algorithms for a Generalized Parallel Machine Scheduling Problem. MACRo (2015)
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
Bin Packing Game with an Interest Matrix. COCOON (2015)
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. Theory Comput. Syst. 56 (1) (2015)
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. Theor. Comput. Sci. 596 (2015)
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. SODA (2015)
Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han
Online Minimum makespan Scheduling with a Buffer. Int. J. Found. Comput. Sci. 25 (5) (2014)
György Dósa, Leah Epstein
Online bin packing with cardinality constraints revisited. CoRR (2014)
György Dósa, Leah Epstein
Colorful Bin Packing. SWAT (2014)
György Dósa, Jirí Sgall
Optimal Analysis of Best Fit Bin Packing. ICALP (1) (2014)
György Dósa, Leah Epstein
The Convergence Time for Selfish Bin Packing. SAGT (2014)
György Dósa, Leah Epstein
Colorful bin packing. CoRR (2014)
Xin Chen, Zhenzhen Xu, György Dósa, Xin Han, He Jiang
Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf. Process. Lett. 113 (4) (2013)
Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang
A note on a selfish bin packing problem. J. Glob. Optim. 56 (4) (2013)
Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko
2D knapsack: Packing squares. Theor. Comput. Sci. 508 (2013)
György Dósa, Jirí Sgall
First Fit bin packing: A tight analysis. STACS (2013)
György Dósa, Csanád Imreh
The generalization of scheduling with machine cost. Theor. Comput. Sci. 510 (2013)
György Dósa, Zsolt Tuza, Deshi Ye
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. J. Comb. Optim. 26 (3) (2013)
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. Theor. Comput. Sci. 510 (2013)
Attila Benko, György Dósa, Zsolt Tuza
Bin covering with a general profit function: approximability results. Central Eur. J. Oper. Res. 21 (4) (2013)
Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han
Online Minimum Makespan Scheduling with a Buffer. FAW-AAIM (2012)
Joan Boyar, György Dósa, Leah Epstein
On the absolute approximation ratio for First Fit and related results. Discret. Appl. Math. 160 (13-14) (2012)
Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik-Lányi
Online scheduling with one rearrangement at the end: Revisited. Inf. Process. Lett. 112 (16) (2012)
György Dósa, Zsolt Tuza
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms CoRR (2012)
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
Black and White Bin Packing. WAOA (2012)
György Dósa, Leah Epstein
Generalized selfish bin packing CoRR (2012)
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. J. Comb. Optim. 21 (4) (2011)
György Dósa, Yuxin Wang, Xin Han, He Guo
Online scheduling with rearrangement on two related machines. Theor. Comput. Sci. 412 (8-10) (2011)
Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko
2D Knapsack: Packing Squares. FAW-AAIM (2011)
Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han
Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor. Comput. Sci. 412 (45) (2011)
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
The Graph-Bin Packing Problem. Int. J. Found. Comput. Sci. 22 (8) (2011)
György Dósa, Leah Epstein
Preemptive Online Scheduling with Reordering. SIAM J. Discret. Math. 25 (1) (2011)
György Dósa, Zhiyi Tan
New upper and lower bounds for online scheduling with machine cost. Discret. Optim. 7 (3) (2010)
György Dósa, Leah Epstein
Online scheduling with a buffer on related machines. J. Comb. Optim. 20 (2) (2010)
Attila Benko, György Dósa, Zsolt Tuza
Bin Packing/Covering with Delivery, solved with the evolution of algorithms. BIC-TA (2010)
György Dósa, Leah Epstein
Preemptive Online Scheduling with Reordering. ESA (2009)
György Dósa, Leah Epstein
Preemptive scheduling on a small number of hierarchical machines. Inf. Comput. 206 (5) (2008)
György Dósa
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9. ESCAPE (2007)
Yong He, György Dósa
Extension of algorithm list scheduling for a semi-online scheduling problem. Central Eur. J. Oper. Res. 15 (1) (2007)
Weiya Zhong, György Dósa, Zhiyi Tan
On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182 (3) (2007)
György Dósa, Yong He
Scheduling with machine cost and rejection. J. Comb. Optim. 12 (4) (2006)
György Dósa, Yong He
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines. Computing 76 (1-2) (2006)
György Dósa, Yong He
Bin packing problems with rejection penalties and their dual problems. Inf. Comput. 204 (5) (2006)
Yong He, György Dósa
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discret. Appl. Math. 150 (1-3) (2005)
Yong He, György Dósa
Bin Packing and Covering Problems with Rejection. COCOON (2005)
György Dósa, Yong He
Better Online Algorithms for Scheduling with Machine Cost. SIAM J. Comput. 33 (5) (2004)
György Dósa, Yong He
Semi-Online Algorithms for Parallel Machine Scheduling Problems. Computing 72 (3-4) (2004)