| Publication | Date of Publication | Type |
|---|
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 |
| Worst-case analysis for on-line data compression | 2024-07-05 | 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 |
Operations research in Hungary: VOCAL 2018
CEJOR. Central European Journal of Operations Research | 2021-08-13 | Paper |
Lower bound for 3-batched bin packing
Discrete Optimization | 2018-05-24 | Paper |
Tight bounds for NF-based bounded-space online bin packing algorithms
Journal of Combinatorial Optimization | 2018-03-01 | Paper |
Scheduling problems in the operative planning of public bus transportation
Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei | 2016-11-25 | Paper |
A branch-and-bound algorithm for the coupled task problem
Mathematical Methods of Operations Research | 2014-09-08 | Paper |
On-line bin packing with restricted repacking
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
| scientific article; zbMATH DE number 6118219 (Why is no real title available?) | 2012-12-23 | Paper |
| On a multidimensional semi-on-line bin packing problem | 2012-08-29 | Paper |
New lower bounds for certain classes of bin packing algorithms
Theoretical Computer Science | 2012-08-08 | Paper |
New Lower Bounds for Certain Classes of Bin Packing Algorithms
Approximation and Online Algorithms | 2011-02-15 | Paper |
Improved analysis of an algorithm for the coupled task problem with UET jobs
Operations Research Letters | 2009-05-07 | Paper |
Improved lower bounds for semi-online bin packing problems
Computing | 2009-04-27 | Paper |
Lower Bound for the Online Bin Packing Problem with Restricted Repacking
SIAM Journal on Computing | 2009-03-16 | Paper |
| Algorithms for the on-line bin packing problem with repacking | 2007-10-26 | Paper |
| Matrix transpose on meshes with buses | 2007-03-29 | Paper |
An exact algorithm for scheduling identical coupled tasks
Mathematical Methods of Operations Research | 2005-02-11 | Paper |
Worst-case analysis of the iterated longest fragment algorithm
Information Processing Letters | 2002-07-14 | Paper |
A 5/4 linear time bin packing algorithm
Journal of Computer and System Sciences | 2001-05-28 | Paper |
Analysis of permutation routing algorithms
European Journal of Operational Research | 2000-09-14 | Paper |
Greedy Algorithms for On-Line Data Compression
Journal of Algorithms | 1998-09-08 | Paper |
| scientific article; zbMATH DE number 1187116 (Why is no real title available?) | 1998-08-10 | Paper |
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
SIAM Journal on Computing | 1997-05-26 | Paper |
The fractional greedy algorithm for data compression
Computing | 1996-08-05 | Paper |
On-line bin packing ? A restricted survey
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1995-09-04 | Paper |
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
Computing | 1995-08-01 | Paper |
| scientific article; zbMATH DE number 764405 (Why is no real title available?) | 1995-07-25 | Paper |
Minimizing the weighted number of late jobs in UET open shops
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research | 1995-06-25 | Paper |
| scientific article; zbMATH DE number 566079 (Why is no real title available?) | 1995-01-22 | Paper |
An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
SIAM Journal on Computing | 1993-05-17 | Paper |
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
Discrete Applied Mathematics | 1993-05-16 | Paper |
Repacking helps in bounded space on-line bin-packing
Computing | 1993-05-04 | Paper |
| scientific article; zbMATH DE number 33204 (Why is no real title available?) | 1992-06-28 | Paper |
Probabilistic analysis of algorithms for dual bin packing problems
Journal of Algorithms | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4154224 (Why is no real title available?) | 1988-01-01 | Paper |
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4003529 (Why is no real title available?) | 1987-01-01 | Paper |
A probabilistic analysis of the next fit decreasing bin packing heuristic
Operations Research Letters | 1986-01-01 | Paper |
Parametric Lower Bound for On-Line Bin-Packing
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
An O(n) bin-packing algorithm for uniformly distributed data
Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4051348 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3970110 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3916002 (Why is no real title available?) | 1984-01-01 | Paper |
