| Publication | Date of Publication | Type |
|---|
More on online cardinality constrained bin packing with small cardinality bounds
Theoretical Computer Science | 2026-03-05 | Paper |
No tiling of the 70 70 square with consecutive squares
Theoretical Computer Science | 2025-12-15 | Paper |
Covering a square with consecutive squares
Annals of Operations Research | 2025-08-05 | Paper |
Improved approximation algorithms for bin packing with conflicts
International Journal of Foundations of Computer Science | 2025-07-23 | Paper |
Extremal behavior of the greedy algorithm for a triangle scheduling problem
Computers & Operations Research | 2025-05-26 | Paper |
On minimizing total earliness and tardiness of coupled-tasks - a complexity result
Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei | 2024-09-11 | Paper |
The board packing problem
European Journal of Operational Research | 2023-07-10 | Paper |
The bin covering with delivery problem, extended investigations for the online case
CEJOR. Central European Journal of Operations Research | 2023-06-22 | Paper |
Constant-ratio approximation for robust bin packing with budgeted uncertainty
SIAM Journal on Discrete Mathematics | 2022-11-09 | Paper |
Guillotine cutting is asymptotically optimal for packing consecutive squares
Optimization Letters | 2022-11-01 | Paper |
Lower bounds on the performance of online algorithms for relaxed packing problems
(available as arXiv preprint) | 2022-08-30 | Paper |
Lower bounds for batched bin packing
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Lower bounds on the performance of online algorithms for relaxed packing problems
(available as arXiv preprint) | 2022-01-16 | Paper |
A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
European Journal of Operational Research | 2021-12-13 | Paper |
A new heuristic and an exact approach for a production planning problem
CEJOR. Central European Journal of Operations Research | 2021-11-24 | Paper |
A new and improved algorithm for online bin packing
(available as arXiv preprint) | 2021-08-04 | Paper |
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Theoretical Computer Science | 2021-07-22 | Paper |
A new lower bound for classic online bin packing
Algorithmica | 2021-06-30 | Paper |
Quality of equilibria for selfish bin packing with cost sharing variants
Discrete Optimization | 2021-01-15 | Paper |
A new lower bound for classic online bin packing
Approximation and Online Algorithms | 2020-08-24 | Paper |
Online scheduling with machine cost and a quadratic objective function
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences | 2020-06-09 | Paper |
| Online bin packing with cardinality constraints resolved | 2020-05-27 | Paper |
Quality of strong equilibria for selfish bin packing with uniform cost sharing
Journal of Scheduling | 2020-03-06 | Paper |
Lower bounds for several online variants of bin packing
Theory of Computing Systems | 2019-12-19 | Paper |
A new lower bound on the price of anarchy of selfish bin packing
Information Processing Letters | 2019-09-20 | Paper |
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
CEJOR. Central European Journal of Operations Research | 2019-09-02 | Paper |
Using weight decision for decreasing the price of anarchy in selfish bin packing games
European Journal of Operational Research | 2019-06-25 | Paper |
Pareto optimal equilibria for selfish bin packing with uniform cost sharing
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
The optimal absolute ratio for online bin packing
Journal of Computer and System Sciences | 2019-05-03 | Paper |
Improved bounds for batch scheduling with nonidentical job sizes
Naval Research Logistics | 2019-05-02 | Paper |
Restricted assignment scheduling with resource constraints
Theoretical Computer Science | 2019-01-25 | Paper |
| Bin packing games with weight decision: how to get a small value for the price of anarchy | 2019-01-15 | Paper |
The convergence time for selfish bin packing
Acta Cybernetica | 2018-09-03 | Paper |
Lower bounds for several online variants of bin packing
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
CEJOR. Central European Journal of Operations Research | 2018-06-15 | Paper |
The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
Journal of Computer and System Sciences | 2018-06-06 | Paper |
Lower bound for 3-batched bin packing
Discrete Optimization | 2018-05-24 | Paper |
A general bin packing game: interest taken into account
Algorithmica | 2018-05-18 | Paper |
The intermediate price of anarchy (IPoA) in bin packing games
Discrete Applied Mathematics | 2018-04-20 | Paper |
Colored bin packing: online algorithms and lower bounds
Algorithmica | 2018-02-28 | Paper |
Multiprofessor scheduling
Discrete Applied Mathematics | 2017-12-20 | Paper |
The optimal absolute ratio for online bin packing
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Batched bin packing revisited
Journal of Scheduling | 2017-08-18 | Paper |
A new and improved algorithm for online bin packing
(available as arXiv preprint) | 2017-07-06 | Paper |
| scientific article; zbMATH DE number 6678949 (Why is no real title available?) | 2017-01-30 | Paper |
Bounds for online bin packing with cardinality constraints
Information and Computation | 2016-07-07 | Paper |
New models of graph-bin packing
Theoretical Computer Science | 2016-07-05 | Paper |
Bin covering with a general profit function: approximability results
CEJOR. Central European Journal of Operations Research | 2016-06-29 | Paper |
Bin packing game with an interest matrix
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Offline black and white bin packing
Theoretical Computer Science | 2015-07-24 | Paper |
The tight absolute bound of First Fit in the parameterized case
Theoretical Computer Science | 2015-07-24 | Paper |
Online results for black and white bin packing
Theory of Computing Systems | 2015-05-12 | Paper |
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
International Journal of Computer Mathematics | 2015-04-27 | Paper |
The Convergence Time for Selfish Bin Packing
Algorithmic Game Theory | 2015-01-14 | Paper |
Online minimum makespan scheduling with a buffer
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Colorful bin packing
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Optimal analysis of best fit bin packing
Automata, Languages, and Programming | 2014-07-01 | Paper |
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
Theoretical Computer Science | 2014-01-13 | Paper |
The generalization of scheduling with machine cost
Theoretical Computer Science | 2014-01-13 | Paper |
2D knapsack: packing squares
Theoretical Computer Science | 2013-12-19 | Paper |
Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization | 2013-12-02 | Paper |
Bin covering with delivery and solving it with evolution of algorithms
Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei | 2013-11-07 | Paper |
Black and white bin packing
Approximation and Online Algorithms | 2013-09-13 | Paper |
A note on a selfish bin packing problem
Journal of Global Optimization | 2013-08-07 | Paper |
| On minimal solutions of systems of linear equations with applications | 2013-04-05 | Paper |
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters | 2013-03-20 | Paper |
Online scheduling with one rearrangement at the end: revisited
Information Processing Letters | 2012-10-23 | Paper |
On the absolute approximation ratio for first fit and related results
Discrete Applied Mathematics | 2012-08-10 | Paper |
Online minimum makespan scheduling with a buffer
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
New upper and lower bounds for online scheduling with machine cost
Discrete Optimization | 2012-06-20 | Paper |
The graph-bin packing problem
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science | 2012-01-09 | Paper |
Preemptive online scheduling with reordering
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
2D knapsack: packing squares
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Online scheduling with rearrangement on two related machines
Theoretical Computer Science | 2011-02-21 | Paper |
Online scheduling with a buffer on related machines
Journal of Combinatorial Optimization | 2010-10-26 | Paper |
Preemptive Online Scheduling with Reordering
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Extension of algorithm list scheduling for a semi-online scheduling problem
CEJOR. Central European Journal of Operations Research | 2009-04-14 | Paper |
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Preemptive scheduling on a small number of hierarchical machines
Information and Computation | 2008-05-19 | Paper |
Scheduling with machine cost and rejection
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
On the machine scheduling problem with job delivery coordination
European Journal of Operational Research | 2007-06-13 | Paper |
| Two almost easy problems | 2007-03-29 | Paper |
| scientific article; zbMATH DE number 5138821 (Why is no real title available?) | 2007-03-29 | Paper |
| The general algorithm \(\text{LPT}(k)\) for scheduling identical parallel machines | 2007-03-29 | Paper |
Bin packing problems with rejection penalties and their dual problems
Information and Computation | 2006-06-30 | Paper |
| Graham's example is the only tight one for \(P \parallel C_{max}\) | 2006-03-09 | Paper |
Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
Computing | 2006-03-02 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2162223 (Why is no real title available?) | 2005-04-28 | Paper |
Better Online Algorithms for Scheduling with Machine Cost
SIAM Journal on Computing | 2005-02-21 | Paper |
Semi-online algorithms for parallel machine scheduling problems
Computing | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 1870573 (Why is no real title available?) | 2003-02-18 | Paper |
Generalized multifit-type methods. II
Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei | 2001-06-12 | Paper |
| scientific article; zbMATH DE number 1446769 (Why is no real title available?) | 2000-05-14 | Paper |
| scientific article; zbMATH DE number 1446768 (Why is no real title available?) | 2000-05-14 | Paper |
| scientific article; zbMATH DE number 1336411 (Why is no real title available?) | 1999-09-14 | Paper |
| scientific article; zbMATH DE number 1134655 (Why is no real title available?) | 1998-03-26 | Paper |
