Gábor Galambos
According to our database1,
Gábor Galambos
authored at least 37 papers
between 1986 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
1
1
1
2
1
1
2
1
2
1
2
1
1
1
2
2
1
2
1
4
2
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.
Eur. J. Oper. Res., 2022
2021
2019
Informatica (Slovenia), 2019
2018
J. Comb. Optim., 2018
2016
2015
Informatica (Slovenia), 2015
2014
Math. Methods Oper. Res., 2014
2012
Theor. Comput. Sci., 2012
2009
Oper. Res. Lett., 2009
2008
SIAM J. Comput., 2008
2004
Math. Methods Oper. Res., 2004
2001
Inf. Process. Lett., 2001
2000
1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1997
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput., 1997
1996
1995
Math. Methods Oper. Res., 1995
Proceedings of the Combinatorics and Computer Science, 1995
1994
Computing, 1994
1993
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.
SIAM J. Comput., 1993
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.
Discret. Appl. Math., 1993
1991
J. Algorithms, 1991
Acta Cybern., 1991
1987
Computing, 1987
Acta Cybern., 1987
1986