György Dósa

According to our database, György Dósa authored at least 81 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

The board packing problem.

Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza

Eur. J. Oper. Res., August, 2023

The bin covering with delivery problem, extended investigations for the online case.

Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark

Central Eur. J. Oper. Res., March, 2023

2022

Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.

Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss

SIAM J. Discret. Math., 2022

Guillotine cutting is asymptotically optimal for packing consecutive squares.

János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza

Optim. Lett., 2022

Lower bounds for batched bin packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

J. Comb. Optim., 2022

A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.

József Békési, György Dósa, Gábor Galambos

Eur. J. Oper. Res., 2022

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.

János Balogh, György Dósa, Leah Epstein, Lukasz Jez

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.

György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza

Theor. Comput. Sci., 2021

Coloring Properties of Mixed Cycloids.

György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin

Symmetry, 2021

A new heuristic and an exact approach for a production planning problem.

Peter Auer, György Dósa, Tibor Dulai, Armin Fügenschuh, Peggy Näser, Ronald Ortner, Agnes Werner-Stark

Central Eur. J. Oper. Res., 2021

A New Lower Bound for Classic Online Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Algorithmica, 2021

2020

Online bin packing with cardinality constraints resolved.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

J. Comput. Syst. Sci., 2020

Quality of equilibria for selfish bin packing with cost sharing variants.

György Dósa, Leah Epstein

Discret. Optim., 2020

Online Scheduling with Machine Cost and a Quadratic Objective Function.

János Csirik, György Dósa, Dávid Kószó

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Restricted assignment scheduling with resource constraints.

György Dósa, Hans Kellerer, Zsolt Tuza

Theor. Comput. Sci., 2019

Quality of strong equilibria for selfish bin packing with uniform cost sharing.

György Dósa, Leah Epstein

J. Sched., 2019

Lower Bounds for Several Online Variants of Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Theory Comput. Syst., 2019

The optimal absolute ratio for online bin packing.

János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee

J. Comput. Syst. Sci., 2019

Pareto optimal equilibria for selfish bin packing with uniform cost sharing.

György Dósa, Leah Epstein

J. Comb. Optim., 2019

A new lower bound on the price of anarchy of selfish bin packing.

György Dósa, Leah Epstein

Inf. Process. Lett., 2019

Using weight decision for decreasing the price of anarchy in selfish bin packing games.

György Dósa, Hans Kellerer, Zsolt Tuza

Eur. J. Oper. Res., 2019

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.

György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek

Central Eur. J. Oper. Res., 2019

2018

The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.

György Dósa, Leah Epstein

J. Comput. Syst. Sci., 2018

Multiprofessor scheduling.

György Dósa, Zsolt Tuza

Discret. Appl. Math., 2018

The Intermediate Price of Anarchy (IPoA) in bin packing games.

György Dósa

Discret. Appl. Math., 2018

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.

György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek

Central Eur. J. Oper. Res., 2018

A General Bin Packing Game: Interest Taken into Account.

Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza

Algorithmica, 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.

Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý

Algorithmica, 2018

The Convergence Time for Selfish Bin Packing.

György Dósa, Leah Epstein

Acta Cybern., 2018

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.

György Dósa, Hans Kellerer, Zsolt Tuza

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

A New and Improved Algorithm for Online Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Performance Guarantees for One Dimensional Bin Packing.

János Csirik, György Dósa

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Batched bin packing revisited.

György Dósa

J. Sched., 2017

2016

First Fit Algorithm for Bin Packing.

György Dósa

Encyclopedia of Algorithms, 2016

New models of graph-bin packing.

Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza

Theor. Comput. Sci., 2016

Bounds for online bin packing with cardinality constraints.

József Békési, György Dósa, Leah Epstein

Inf. Comput., 2016

Lower bound for 3-batched bin packing.

János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan

Discret. Optim., 2016

2015

The tight absolute bound of First Fit in the parameterized case.

György Dósa

Theor. Comput. Sci., 2015

Offline black and white bin packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza

Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza

Theory Comput. Syst., 2015

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs.

Xin Chen, Ning Ding, György Dósa, Xin Han, He Jiang

Int. J. Comput. Math., 2015

Online Algorithms for a Generalized Parallel Machine Scheduling Problem.

István Szalkai, György Dósa

Proceedings of the International Conference on Recent Achievements in Mechatronics, 2015

Bin Packing Game with an Interest Matrix.

Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Online Minimum makespan Scheduling with a Buffer.

Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han

Int. J. Found. Comput. Sci., 2014

Online bin packing with cardinality constraints revisited.

György Dósa, Leah Epstein

CoRR, 2014

Colorful Bin Packing.

György Dósa, Leah Epstein

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Optimal Analysis of Best Fit Bin Packing.

György Dósa, Jirí Sgall

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

2D knapsack: Packing squares.

Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko

Theor. Comput. Sci., 2013

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.

György Dósa, Rongheng Li, Xin Han, Zsolt Tuza

Theor. Comput. Sci., 2013

The generalization of scheduling with machine cost.

György Dósa, Csanád Imreh

Theor. Comput. Sci., 2013

A note on a selfish bin packing problem.

Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang

J. Glob. Optim., 2013

Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.

György Dósa, Zsolt Tuza, Deshi Ye

J. Comb. Optim., 2013

Semi-online hierarchical scheduling problems with buffer or rearrangements.

Xin Chen, Zhenzhen Xu, György Dósa, Xin Han, He Jiang

Inf. Process. Lett., 2013

Bin covering with a general profit function: approximability results.

Attila Benko, György Dósa, Zsolt Tuza

Central Eur. J. Oper. Res., 2013

First Fit bin packing: A tight analysis.

György Dósa, Jirí Sgall

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Online scheduling with one rearrangement at the end: Revisited.

Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik-Lányi

Inf. Process. Lett., 2012

On the absolute approximation ratio for First Fit and related results.

Joan Boyar, György Dósa, Leah Epstein

Discret. Appl. Math., 2012

Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms

György Dósa, Zsolt Tuza

CoRR, 2012

Generalized selfish bin packing

György Dósa, Leah Epstein

CoRR, 2012

Black and White Bin Packing.

János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Online Minimum Makespan Scheduling with a Buffer.

Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Online scheduling with rearrangement on two related machines.

György Dósa, Yuxin Wang, Xin Han, He Guo

Theor. Comput. Sci., 2011

Optimal algorithms for online scheduling with bounded rearrangement at the end.

Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han

Theor. Comput. Sci., 2011

Preemptive Online Scheduling with Reordering.

György Dósa, Leah Epstein

SIAM J. Discret. Math., 2011

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.

György Dósa, Maria Grazia Speranza, Zsolt Tuza

J. Comb. Optim., 2011

The Graph-Bin Packing Problem.

Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza

Int. J. Found. Comput. Sci., 2011

2D Knapsack: Packing Squares.

Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Online scheduling with a buffer on related machines.

György Dósa, Leah Epstein

J. Comb. Optim., 2010

New upper and lower bounds for online scheduling with machine cost.

György Dósa, Zhiyi Tan

Discret. Optim., 2010

Bin Packing/Covering with Delivery, solved with the evolution of algorithms.

Attila Benko, György Dósa, Zsolt Tuza

Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2008

Preemptive scheduling on a small number of hierarchical machines.

György Dósa, Leah Epstein

Inf. Comput., 2008

2007

On the machine scheduling problem with job delivery coordination.

Weiya Zhong, György Dósa, Zhiyi Tan

Eur. J. Oper. Res., 2007

Extension of algorithm list scheduling for a semi-online scheduling problem.

Yong He, György Dósa

Central Eur. J. Oper. Res., 2007

The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.

György Dósa

Proceedings of the Combinatorics, 2007

2006

Scheduling with machine cost and rejection.

György Dósa, Yong He

J. Comb. Optim., 2006

Bin packing problems with rejection penalties and their dual problems.

György Dósa, Yong He

Inf. Comput., 2006

Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines.

György Dósa, Yong He

Computing, 2006

2005

Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.

Yong He, György Dósa

Discret. Appl. Math., 2005

Bin Packing and Covering Problems with Rejection.

Yong He, György Dósa

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Better Online Algorithms for Scheduling with Machine Cost.

György Dósa, Yong He

SIAM J. Comput., 2004

Semi-Online Algorithms for Parallel Machine Scheduling Problems.

György Dósa, Yong He

Computing, 2004