@inproceedings{MTMT:34314902,
	title = {Automatic Planning of Vehicle and Driver Schedules for Public Transportation: A Case Study},
	url = {https://m2.mtmt.hu/api/publication/34314902},
	author = {Békési, József and Galambos, Gábor and Imre, Papp},
	booktitle = {Proceedings of the 17th International Symposium on Operational Research in Slovenia, SOR 2023},
	unique-id = {34314902},
	year = {2023},
	pages = {93-96}
}

@article{MTMT:34436732,
	title = {Páros munkák ütemezése korai és késői befejezés büntetésével - egy bonyolultságelméleti eredmény},
	url = {https://m2.mtmt.hu/api/publication/34436732},
	author = {Békési, József and Dósa, György and Galambos, Gábor},
	doi = {10.37070/AML.2022.39.1.02},
	journal-iso = {ALK MAT LAP},
	journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
	volume = {39},
	unique-id = {34436732},
	issn = {0133-3399},
	year = {2022},
	pages = {45-58},
	orcid-numbers = {Dósa, György/0000-0002-4909-6694}
}

@{MTMT:33544946,
	title = {A Neural Network Based Classification Algorithm for Asthma Using Capnography},
	url = {https://m2.mtmt.hu/api/publication/33544946},
	author = {Békési, József and Galambos, Gábor and Kelemen, András and Imre, Papp and Tolnai, József},
	booktitle = {Proceedings of the 25th International Multiconference INFORMATION SOCIETY Volume I},
	unique-id = {33544946},
	year = {2022},
	pages = {619-622},
	orcid-numbers = {Tolnai, József/0000-0002-7648-764X}
}

@book{MTMT:33544923,
	title = {Proceedings of the 25th International Multiconference INFORMATION SOCIETY Volume I. Middle-European Conference on Applied Theoretical Computer Science},
	url = {https://m2.mtmt.hu/api/publication/33544923},
	isbn = {9789612642488},
	editor = {Mitja, Luštrek and Matjaž, Gams and Rok, Piltaver and Toma, Strle and Borut, Trpin and Olga, Markič and Dunja, Mladenić and Marko, Grobelnik and Vladimir, A. Fomichov and Olga, S. Fomichova and Borut, Žalik and Špela, Stres and Robert, Blatnik and Janez, Malačič and Mari, Jože Osredkar and Uroš, Rajkovič and Borut, Batagelj and Nina, Reščič and Oscar, Mayora and Daniel, Denkovski and Andrej, Brodnik and Galambos, Gábor and Branko, Kavšek},
	publisher = {JSi},
	unique-id = {33544923},
	year = {2022}
}

@article{MTMT:32515946,
	title = {A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays},
	url = {https://m2.mtmt.hu/api/publication/32515946},
	author = {Békési, József and Dósa, György and Galambos, Gábor},
	doi = {10.1016/j.ejor.2021.06.002},
	journal-iso = {EJOR},
	journal = {EUROPEAN JOURNAL OF OPERATIONAL RESEARCH},
	volume = {297},
	unique-id = {32515946},
	issn = {0377-2217},
	year = {2022},
	eissn = {1872-6860},
	pages = {844-852},
	orcid-numbers = {Dósa, György/0000-0002-4909-6694}
}

@book{MTMT:30924739,
	title = {Zbornik 22. mednarodne multikonference INFORMACIJSKA DRUŽBA – IS 2019 Zvezek I = Proceedings of the 22nd International Multiconference INFORMATION SOCIETY – IS 2019, Volume I. Srednje-ervropska konferenca o uporabnem teoretičnem računalništvu = Middle-European Conference on Applied Theoretical Computer Science},
	url = {https://m2.mtmt.hu/api/publication/30924739},
	isbn = {9789612641726},
	editor = {Brodnik, A and Galambos, Gábor and Kavšek, B},
	publisher = {JSi},
	unique-id = {30924739},
	year = {2019}
}

@article{MTMT:3272000,
	title = {Tight bounds for NF-based bounded-space online bin packing algorithms},
	url = {https://m2.mtmt.hu/api/publication/3272000},
	author = {Békési, József and Galambos, Gábor},
	doi = {10.1007/s10878-017-0175-4},
	journal-iso = {J COMB OPTIM},
	journal = {JOURNAL OF COMBINATORIAL OPTIMIZATION},
	volume = {35},
	unique-id = {3272000},
	issn = {1382-6905},
	abstract = {In Zheng et al. (J Comb Optim 30(2):360–369, 2015) modelled a surgery problem by the one-dimensional bin packing, and developed a semi-online algorithm to give an efficient feasible solution. In their algorithm they used a buffer to temporarily store items, having a possibility to lookahead in the list. Because of the considered practical problem they investigated the 2-parametric case, when the size of the items is at most 1/2. Using an NF-based online algorithm the authors proved an ACR of 13/9 = 1.44 … for any given buffer size not less than 1. They also gave a lower bound of 4/3 = 1.33 … for the bounded-space algorithms that use NF-based rules. Later, in Zhang et al. (J Comb Optim 33(2):530–542, 2017) an algorithm was given with an ACR of 1.4243, and the authors improved the lower bound to 1.4230. In this paper we present a tight lower bound of h∞ (r) for the r-parametric problem when the buffer capacity is 3. Since h∞ (2) = 1.42312 …, our result—as a special case—gives a tight bound for the algorithm-class given in 2017. To prove that the lower bound is tight, we present an NF-based online algorithm that considers the r-parametric problem, and uses a buffer with capacity of 3. We prove that this algorithm has an ACR that is equal to the lower bounds for arbitrary r. © Springer Science+Business Media, LLC 2017.},
	keywords = {Optimization; LOWER BOUNDS; Mathematical techniques; Combinatorial mathematics; lower bound; semi-online; Asymptotic competitive ratio; Next-fit; Bounded spaces; Bounded-space; Semi-online bin-packing},
	year = {2018},
	eissn = {1573-2886},
	pages = {350-364}
}

@article{MTMT:3170067,
	title = {Matrix transpose on meshes with buses},
	url = {https://m2.mtmt.hu/api/publication/3170067},
	author = {Békési, József and Galambos, Gábor},
	doi = {10.1016/j.jpdc.2016.05.015},
	journal-iso = {J PARALLEL DISTR COM},
	journal = {JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING},
	volume = {96},
	unique-id = {3170067},
	issn = {0743-7315},
	year = {2016},
	eissn = {1096-0848},
	pages = {194-201}
}

@article{MTMT:3076539,
	title = {Lower bound for 3-batched bin packing},
	url = {https://m2.mtmt.hu/api/publication/3076539},
	author = {Balogh, János and Békési, József and Galambos, Gábor and Dósa, György and Tan, Zhiyi},
	doi = {10.1016/j.disopt.2016.04.007},
	journal-iso = {DISCRETE OPTIM},
	journal = {DISCRETE OPTIMIZATION},
	volume = {21},
	unique-id = {3076539},
	issn = {1572-5286},
	abstract = {Abstract In this paper we will consider a special relaxation of the well-known online bin packing problem. In a batched bin packing problem (BBPP)–defined by Gutin et al. (2005)–the elements come in batches and one batch is available for packing in a given time. If we have K ≥ 2 batches then we denote the problem by K -BBPP. In Gutin et al. (2005) the authors gave a 1.3871 … lower bound for the asymptotic competitive ratio (ACR) of any on-line 2 -BBBP algorithm. In this paper we investigate the 3-BBPP, and we give 1.51211 … lower bound for its ACR.},
	keywords = {Worst-case behavior; lower bound; Batched bin packing},
	year = {2016},
	eissn = {1873-636X},
	pages = {14-24},
	orcid-numbers = {Dósa, György/0000-0002-4909-6694}
}

@inproceedings{MTMT:2880060,
	title = {Parallelization of video compressing with FFmpeg and OpenMP in supercomputing environment},
	url = {https://m2.mtmt.hu/api/publication/2880060},
	author = {Kelemen, András and Békési, József and Galambos, Gábor and Krész, Miklós},
	booktitle = {ICAI 2014: Proceedings of the 9th International Conference on Applied Informatics, vol. 1-2},
	doi = {10.14794/ICAI.9.2014.1.231},
	unique-id = {2880060},
	year = {2014},
	pages = {231-237}
}