György Dósa

According to our database1, György Dósa authored at least 78 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Restricted assignment scheduling with resource constraints.
Theor. Comput. Sci., 2019

Quality of strong equilibria for selfish bin packing with uniform cost sharing.
J. Scheduling, 2019

Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst., 2019

The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci., 2019

Pareto optimal equilibria for selfish bin packing with uniform cost sharing.
J. Comb. Optim., 2019

A new lower bound on the price of anarchy of selfish bin packing.
Inf. Process. Lett., 2019

Using weight decision for decreasing the price of anarchy in selfish bin packing games.
European Journal of Operational Research, 2019

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

2018
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.
J. Comput. Syst. Sci., 2018

Multiprofessor scheduling.
Discrete Applied Mathematics, 2018

The Intermediate Price of Anarchy (IPoA) in bin packing games.
Discrete Applied Mathematics, 2018

A new lower bound for classic online bin packing.
CoRR, 2018

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

A General Bin Packing Game: Interest Taken into Account.
Algorithmica, 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica, 2018

The Convergence Time for Selfish Bin Packing.
Acta Cybern., 2018

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

A New and Improved Algorithm for Online Bin Packing.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Performance Guarantees for One Dimensional Bin Packing.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Batched bin packing revisited.
J. Scheduling, 2017

Lower bounds for several online variants of bin packing.
CoRR, 2017

A new and improved algorithm for online bin packing.
CoRR, 2017

Lower Bounds for Several Online Variants of Bin Packing.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Online Bin Packing with Cardinality Constraints Resolved.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
First Fit Algorithm for Bin Packing.
Encyclopedia of Algorithms, 2016

New models of graph-bin packing.
Theor. Comput. Sci., 2016

Bounds for online bin packing with cardinality constraints.
Inf. Comput., 2016

Lower bound for 3-batched bin packing.
Discrete Optimization, 2016

Online bin packing with cardinality constraints resolved.
CoRR, 2016

2015
The tight absolute bound of First Fit in the parameterized case.
Theor. Comput. Sci., 2015

Offline black and white bin packing.
Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs.
Int. J. Comput. Math., 2015

Online Algorithms for a Generalized Parallel Machine Scheduling Problem.
CoRR, 2015

The optimal absolute ratio for online bin packing.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Online Algorithms for a Generalized Parallel Machine Scheduling Problem.
Proceedings of the International Conference on Recent Achievements in Mechatronics, 2015

Bin Packing Game with an Interest Matrix.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Online Minimum makespan Scheduling with a Buffer.
Int. J. Found. Comput. Sci., 2014

Colorful bin packing.
CoRR, 2014

Online bin packing with cardinality constraints revisited.
CoRR, 2014

Colorful Bin Packing.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

The Convergence Time for Selfish Bin Packing.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Optimal Analysis of Best Fit Bin Packing.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
2D knapsack: Packing squares.
Theor. Comput. Sci., 2013

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

The generalization of scheduling with machine cost.
Theor. Comput. Sci., 2013

A note on a selfish bin packing problem.
J. Global Optimization, 2013

Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.
J. Comb. Optim., 2013

Semi-online hierarchical scheduling problems with buffer or rearrangements.
Inf. Process. Lett., 2013

Bin covering with a general profit function: approximability results.
CEJOR, 2013

First Fit bin packing: A tight analysis.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Online scheduling with one rearrangement at the end: Revisited.
Inf. Process. Lett., 2012

On the absolute approximation ratio for First Fit and related results.
Discrete Applied Mathematics, 2012

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

Generalized selfish bin packing
CoRR, 2012

Black and White Bin Packing.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Online Minimum Makespan Scheduling with a Buffer.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Online scheduling with rearrangement on two related machines.
Theor. Comput. Sci., 2011

Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci., 2011

Preemptive Online Scheduling with Reordering.
SIAM J. Discrete Math., 2011

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

The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011

2D Knapsack: Packing Squares.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Online scheduling with a buffer on related machines.
J. Comb. Optim., 2010

New upper and lower bounds for online scheduling with machine cost.
Discrete Optimization, 2010

Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009
Preemptive Online Scheduling with Reordering.
Proceedings of the Algorithms, 2009

2008
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput., 2008

2007
On the machine scheduling problem with job delivery coordination.
European Journal of Operational Research, 2007

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

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

2006
Scheduling with machine cost and rejection.
J. Comb. Optim., 2006

Bin packing problems with rejection penalties and their dual problems.
Inf. Comput., 2006

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

2005
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.
Discrete Applied Mathematics, 2005

Bin Packing and Covering Problems with Rejection.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Better Online Algorithms for Scheduling with Machine Cost.
SIAM J. Comput., 2004

Semi-Online Algorithms for Parallel Machine Scheduling Problems.
Computing, 2004


  Loading...