György Dósa

102 papers A* 1A 4B 6C 1Misc 3Journal 78Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Lower bounds on the performance of online algorithms for relaxed packing problems.
Discret. Optim.
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2026 J jnl
More on online cardinality constrained bin packing with small cardinality bounds.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2026 J jnl
No tiling of the 70 × 70 square with consecutive squares.
Theor. Comput. Sci.
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2025 J jnl
Covering a square with consecutive squares.
Ann. Oper. Res.
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, István Szalkai, Zsolt Tuza
2025 J jnl
Improved Approximation Algorithms for Bin Packing with Conflicts.
Int. J. Found. Comput. Sci.
Zhihua Huang, An Zhang, György Dósa, Yong Chen, Chenling Xiong
2025 J jnl
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard.
Algorithms
György Dósa, András Éles, Angshuman Robin Goswami, István Szalkai, Zsolt Tuza
2024 J jnl
Extremal behavior of the Greedy algorithm for a triangle scheduling problem.
Comput. Oper. Res.
János Balogh, József Békési, Nóra Büki, György Dósa, Zsolt Tuza
2024 Misc conf
No Tiling of the 70 × 70 Square with Consecutive Squares.
FUN
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2023 J jnl
The bin covering with delivery problem, extended investigations for the online case.
Central Eur. J. Oper. Res.
Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark
2023 J jnl
The board packing problem.
Eur. J. Oper. Res.
Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
2022 J jnl
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.
Eur. J. Oper. Res.
József Békési, György Dósa, Gábor Galambos
2022 J jnl
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.
SIAM J. Discret. Math.
Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss
2022 J jnl
Guillotine cutting is asymptotically optimal for packing consecutive squares.
Optim. Lett.
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
2022 C conf
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.
IWOCA
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2022 J jnl
Lower bounds for batched bin packing.
J. Comb. Optim.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2022 J jnl
Lower bounds on the performance of online algorithms for relaxed packing problems.
CoRR
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
2021 J jnl
A New Lower Bound for Classic Online Bin Packing.
Algorithmica
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2021 J jnl
A new heuristic and an exact approach for a production planning problem.
Central Eur. J. Oper. Res.
Peter Auer, György Dósa, Tibor Dulai, Armin Fügenschuh, Peggy Näser, Ronald Ortner, Agnes Werner-Stark
2021 J jnl
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.
Theor. Comput. Sci.
György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza
2021 J jnl
Coloring Properties of Mixed Cycloids.
Symmetry
György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin
2020 B conf
Online Scheduling with Machine Cost and a Quadratic Objective Function.
SOFSEM
János Csirik, György Dósa, Dávid Kószó
2020 J jnl
Online bin packing with cardinality constraints resolved.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2020 J jnl
Quality of equilibria for selfish bin packing with cost sharing variants.
Discret. Optim.
György Dósa, Leah Epstein
2019 B conf
A New Lower Bound for Classic Online Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
A new lower bound on the price of anarchy of selfish bin packing.
Inf. Process. Lett.
György Dósa, Leah Epstein
2019 J jnl
Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
Pareto optimal equilibria for selfish bin packing with uniform cost sharing.
J. Comb. Optim.
György Dósa, Leah Epstein
2019 J jnl
Quality of strong equilibria for selfish bin packing with uniform cost sharing.
J. Sched.
György Dósa, Leah Epstein
2019 J jnl
Restricted assignment scheduling with resource constraints.
Theor. Comput. Sci.
György Dósa, Hans Kellerer, Zsolt Tuza
2019 J jnl
The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2019 J jnl
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res.
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
2019 J jnl
Using weight decision for decreasing the price of anarchy in selfish bin packing games.
Eur. J. Oper. Res.
György Dósa, Hans Kellerer, Zsolt Tuza
2018 J jnl
A General Bin Packing Game: Interest Taken into Account.
Algorithmica
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
2018 A conf
A New and Improved Algorithm for Online Bin Packing.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 J jnl
A new lower bound for classic online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 B conf
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
WAOA
György Dósa, Hans Kellerer, Zsolt Tuza
2018 J jnl
Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
2018 J jnl
Multiprofessor scheduling.
Discret. Appl. Math.
György Dósa, Zsolt Tuza
2018 — ch.
Performance Guarantees for One Dimensional Bin Packing.
Handbook of Approximation Algorithms and Metaheuristics (1)
János Csirik, György Dósa
2018 J jnl
The Convergence Time for Selfish Bin Packing.
Acta Cybern.
György Dósa, Leah Epstein
2018 J jnl
The Intermediate Price of Anarchy (IPoA) in bin packing games.
Discret. Appl. Math.
György Dósa
2018 J jnl
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.
J. Comput. Syst. Sci.
György Dósa, Leah Epstein
2018 J jnl
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res.
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
2017 J jnl
A new and improved algorithm for online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
Batched bin packing revisited.
J. Sched.
György Dósa
2017 B conf
Lower Bounds for Several Online Variants of Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
Lower bounds for several online variants of bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 A conf
Online Bin Packing with Cardinality Constraints Resolved.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2016 J jnl
Bounds for online bin packing with cardinality constraints.
Inf. Comput.
József Békési, György Dósa, Leah Epstein
2016 — ch.
First Fit Algorithm for Bin Packing.
Encyclopedia of Algorithms
György Dósa
2016 J jnl
Lower bound for 3-batched bin packing.
Discret. Optim.
János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan
2016 J jnl
New models of graph-bin packing.
Theor. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2016 J jnl
Online bin packing with cardinality constraints resolved.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2015 Misc conf
Bin Packing Game with an Interest Matrix.
COCOON
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
2015 J jnl
Offline black and white bin packing.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
2015 — conf
Online Algorithms for a Generalized Parallel Machine Scheduling Problem.
MACRo
István Szalkai, György Dósa
2015 J jnl
Online Algorithms for a Generalized Parallel Machine Scheduling Problem.
CoRR
István Szalkai, György Dósa
2015 J jnl
Online Results for Black and White Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza
2015 J jnl
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs.
Int. J. Comput. Math.
Xin Chen, Ning Ding, György Dósa, Xin Han, He Jiang
2015 A* conf
The optimal absolute ratio for online bin packing.
SODA
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2015 J jnl
The tight absolute bound of First Fit in the parameterized case.
Theor. Comput. Sci.
György Dósa
2014 — conf
Colorful Bin Packing.
SWAT
György Dósa, Leah Epstein
2014 J jnl
Colorful bin packing.
CoRR
György Dósa, Leah Epstein
2014 J jnl
Online Minimum makespan Scheduling with a Buffer.
Int. J. Found. Comput. Sci.
Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han
2014 J jnl
Online bin packing with cardinality constraints revisited.
CoRR
György Dósa, Leah Epstein
2014 — conf
Optimal Analysis of Best Fit Bin Packing.
ICALP (1)
György Dósa, Jirí Sgall
2014 B conf
The Convergence Time for Selfish Bin Packing.
SAGT
György Dósa, Leah Epstein
2013 J jnl
2D knapsack: Packing squares.
Theor. Comput. Sci.
Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko
2013 J jnl
A note on a selfish bin packing problem.
J. Glob. Optim.
Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang
2013 J jnl
Bin covering with a general profit function: approximability results.
Central Eur. J. Oper. Res.
Attila Benko, György Dósa, Zsolt Tuza
2013 J jnl
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.
J. Comb. Optim.
György Dósa, Zsolt Tuza, Deshi Ye
2013 A conf
First Fit bin packing: A tight analysis.
STACS
György Dósa, Jirí Sgall
2013 J jnl
Semi-online hierarchical scheduling problems with buffer or rearrangements.
Inf. Process. Lett.
Xin Chen, Zhenzhen Xu, György Dósa, Xin Han, He Jiang
2013 J jnl
The generalization of scheduling with machine cost.
Theor. Comput. Sci.
György Dósa, Csanád Imreh
2013 J jnl
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
Theor. Comput. Sci.
György Dósa, Rongheng Li, Xin Han, Zsolt Tuza
2012 J jnl
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms
CoRR
György Dósa, Zsolt Tuza
2012 B conf
Black and White Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
2012 J jnl
Generalized selfish bin packing
CoRR
György Dósa, Leah Epstein
2012 J jnl
On the absolute approximation ratio for First Fit and related results.
Discret. Appl. Math.
Joan Boyar, György Dósa, Leah Epstein
2012 — conf
Online Minimum Makespan Scheduling with a Buffer.
FAW-AAIM
Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han
2012 J jnl
Online scheduling with one rearrangement at the end: Revisited.
Inf. Process. Lett.
Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik-Lányi
2011 — conf
2D Knapsack: Packing Squares.
FAW-AAIM
Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko
2011 J jnl
Online scheduling with rearrangement on two related machines.
Theor. Comput. Sci.
György Dósa, Yuxin Wang, Xin Han, He Guo
2011 J jnl
Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci.
Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han
2011 J jnl
Preemptive Online Scheduling with Reordering.
SIAM J. Discret. Math.
György Dósa, Leah Epstein
2011 J jnl
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2011 J jnl
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim.
György Dósa, Maria Grazia Speranza, Zsolt Tuza
2010 — conf
Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
BIC-TA
Attila Benko, György Dósa, Zsolt Tuza
2010 J jnl
New upper and lower bounds for online scheduling with machine cost.
Discret. Optim.
György Dósa, Zhiyi Tan
2010 J jnl
Online scheduling with a buffer on related machines.
J. Comb. Optim.
György Dósa, Leah Epstein
2009 A conf
Preemptive Online Scheduling with Reordering.
ESA
György Dósa, Leah Epstein
2008 J jnl
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput.
György Dósa, Leah Epstein
2007 J jnl
Extension of algorithm list scheduling for a semi-online scheduling problem.
Central Eur. J. Oper. Res.
Yong He, György Dósa
2007 J jnl
On the machine scheduling problem with job delivery coordination.
Eur. J. Oper. Res.
Weiya Zhong, György Dósa, Zhiyi Tan
2007 — conf
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.
ESCAPE
György Dósa
2006 J jnl
Bin packing problems with rejection penalties and their dual problems.
Inf. Comput.
György Dósa, Yong He
2006 J jnl
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines.
Computing
György Dósa, Yong He
2006 J jnl
Scheduling with machine cost and rejection.
J. Comb. Optim.
György Dósa, Yong He
2005 Misc conf
Bin Packing and Covering Problems with Rejection.
COCOON
Yong He, György Dósa
2005 J jnl
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.
Discret. Appl. Math.
Yong He, György Dósa
2004 J jnl
Better Online Algorithms for Scheduling with Machine Cost.
SIAM J. Comput.
György Dósa, Yong He
2004 J jnl
Semi-Online Algorithms for Parallel Machine Scheduling Problems.
Computing
György Dósa, Yong He