Gábor Galambos

Available identifiers

zbMath Open galambos.gaborMaRDI QIDQ406639

List of research outcomes

Publication	Date of Publication	Type
A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays	2021-12-13	Paper
Operations research in Hungary: VOCAL 2018	2021-08-13	Paper
Lower bound for 3-batched bin packing	2018-05-24	Paper
Tight bounds for NF-based bounded-space online bin packing algorithms	2018-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q2834257	2016-11-25	Paper
A branch-and-bound algorithm for the coupled task problem	2014-09-08	Paper
On-line bin packing with restricted repacking	2014-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q3145801	2012-12-23	Paper
https://portal.mardi4nfdi.de/entity/Q2909025	2012-08-29	Paper
New lower bounds for certain classes of bin packing algorithms	2012-08-08	Paper
New Lower Bounds for Certain Classes of Bin Packing Algorithms	2011-02-15	Paper
Improved analysis of an algorithm for the coupled task problem with UET jobs	2009-05-07	Paper
Improved lower bounds for semi-online bin packing problems	2009-04-27	Paper
Lower Bound for the Online Bin Packing Problem with Restricted Repacking	2009-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q5422515	2007-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q3428831	2007-03-29	Paper
An exact algorithm for scheduling identical coupled tasks	2005-02-11	Paper
Worst-case analysis of the iterated longest fragment algorithm	2002-07-14	Paper
A 5/4 linear time bin packing algorithm	2001-05-28	Paper
Analysis of permutation routing algorithms	2000-09-14	Paper
Greedy Algorithms for On-Line Data Compression	1998-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q3840319	1998-08-10	Paper
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"	1997-05-26	Paper
The fractional greedy algorithm for data compression	1996-08-05	Paper
On-line bin packing ? A restricted survey	1995-09-04	Paper
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms	1995-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q4836291	1995-07-25	Paper
Minimizing the weighted number of late jobs in UET open shops	1995-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4291430	1995-01-22	Paper
An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling	1993-05-17	Paper
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case	1993-05-16	Paper
Repacking helps in bounded space on-line bin-packing	1993-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q3988808	1992-06-28	Paper
Probabilistic analysis of algorithms for dual bin packing problems	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3483093	1988-01-01	Paper
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4728248	1987-01-01	Paper
An O(n) bin-packing algorithm for uniformly distributed data	1986-01-01	Paper
A probabilistic analysis of the next fit decreasing bin packing heuristic	1986-01-01	Paper
Parametric Lower Bound for On-Line Bin-Packing	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3787789	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3736905	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3691401	1984-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gábor Galambos