TY - CHAP AU - Békési, József AU - Galambos, Gábor AU - Imre, Papp ED - Drobne, S. ED - Stirn, L.Z. ED - Borstnar, M.K. ED - Povh, J. ED - Povh, J. ED - Zerovnik, J. TI - Automatic Planning of Vehicle and Driver Schedules for Public Transportation: A Case Study T2 - Proceedings of the 17th International Symposium on Operational Research in Slovenia, SOR 2023 PB - Slovenian Society Informatika CY - Ljubljana SN - 9789616165617 PY - 2023 SP - 93 EP - 96 PG - 4 UR - https://m2.mtmt.hu/api/publication/34314902 ID - 34314902 LA - English DB - MTMT ER - TY - JOUR AU - Békési, József AU - Dósa, György AU - Galambos, Gábor TI - Páros munkák ütemezése korai és késői befejezés büntetésével - egy bonyolultságelméleti eredmény JF - ALKALMAZOTT MATEMATIKAI LAPOK J2 - ALK MAT LAP VL - 39 PY - 2022 IS - 1 SP - 45 EP - 58 PG - 14 SN - 0133-3399 DO - 10.37070/AML.2022.39.1.02 UR - https://m2.mtmt.hu/api/publication/34436732 ID - 34436732 LA - Hungarian DB - MTMT ER - TY - CHAP AU - Békési, József AU - Galambos, Gábor AU - Kelemen, András AU - Imre, Papp AU - Tolnai, József ED - Mitja, Luštrek ED - Matjaž, Gams ED - Rok, Piltaver ED - Toma, Strle ED - Borut, Trpin ED - Olga, Markič ED - Dunja, Mladenić ED - Marko, Grobelnik ED - Vladimir, A. Fomichov ED - Olga, S. Fomichova ED - Borut, Žalik ED - Špela, Stres ED - Robert, Blatnik ED - Janez, Malačič ED - Mari, Jože Osredkar ED - Uroš, Rajkovič ED - Borut, Batagelj ED - Nina, Reščič ED - Oscar, Mayora ED - Daniel, Denkovski ED - Andrej, Brodnik ED - Galambos, Gábor ED - Branko, Kavšek TI - A Neural Network Based Classification Algorithm for Asthma Using Capnography T2 - Proceedings of the 25th International Multiconference INFORMATION SOCIETY Volume I PB - Institut Jožef Stefan CY - Ljubljana SN - 9789612642556 PY - 2022 SP - 619 EP - 622 PG - 4 UR - https://m2.mtmt.hu/api/publication/33544946 ID - 33544946 LA - English DB - MTMT ER - TY - BOOK ED - Mitja, Luštrek ED - Matjaž, Gams ED - Rok, Piltaver ED - Toma, Strle ED - Borut, Trpin ED - Olga, Markič ED - Dunja, Mladenić ED - Marko, Grobelnik ED - Vladimir, A. Fomichov ED - Olga, S. Fomichova ED - Borut, Žalik ED - Špela, Stres ED - Robert, Blatnik ED - Janez, Malačič ED - Mari, Jože Osredkar ED - Uroš, Rajkovič ED - Borut, Batagelj ED - Nina, Reščič ED - Oscar, Mayora ED - Daniel, Denkovski ED - Andrej, Brodnik ED - Galambos, Gábor ED - Branko, Kavšek TI - Proceedings of the 25th International Multiconference INFORMATION SOCIETY Volume I. Middle-European Conference on Applied Theoretical Computer Science TS - Middle-European Conference on Applied Theoretical Computer Science PB - Institut Jožef Stefan CY - Ljubljana PY - 2022 SP - 710 SN - 9789612642556 UR - https://m2.mtmt.hu/api/publication/33544923 ID - 33544923 LA - English DB - MTMT ER - TY - JOUR AU - Békési, József AU - Dósa, György AU - Galambos, Gábor TI - A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays JF - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH J2 - EJOR VL - 297 PY - 2022 IS - 3 SP - 844 EP - 852 PG - 9 SN - 0377-2217 DO - 10.1016/j.ejor.2021.06.002 UR - https://m2.mtmt.hu/api/publication/32515946 ID - 32515946 N1 - Export Date: 13 April 2022 CODEN: EJORD Correspondence Address: Békési, J.email: bekesi@inf.u-szeged.hu Funding details: European Commission, EC, EFOP-3.6.1-16-2016-00015 Funding details: National Research, Development and Innovation Office, SNN 129364 Funding text 1: Gy. D?sa was supported by the EU-funded Hungarian grant [grant number EFOP-3.6.1-16-2016-00015]; and the National Research, Development and Innovation Office NKFIH [grant number SNN 129364]. LA - English DB - MTMT ER - TY - BOOK ED - Brodnik, A ED - Galambos, Gábor ED - Kavšek, B TI - 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 TS - Srednje-ervropska konferenca o uporabnem teoretičnem računalništvu = Middle-European Conference on Applied Theoretical Computer Science T3 - Informacijska družba, ISSN 2630-371X PB - Institut Jožef Stefan CY - Ljubljana PY - 2019 SN - 9789612641719 UR - https://m2.mtmt.hu/api/publication/30924739 ID - 30924739 LA - English DB - MTMT ER - TY - JOUR AU - Békési, József AU - Galambos, Gábor TI - Tight bounds for NF-based bounded-space online bin packing algorithms JF - JOURNAL OF COMBINATORIAL OPTIMIZATION J2 - J COMB OPTIM VL - 35 PY - 2018 IS - 2 SP - 350 EP - 364 PG - 15 SN - 1382-6905 DO - 10.1007/s10878-017-0175-4 UR - https://m2.mtmt.hu/api/publication/3272000 ID - 3272000 N1 - Scopusban még duplumként bent van a cikk in press változata is (azonosító: 85029540571). [Z.R. SZTE admin5] AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Békési, József AU - Galambos, Gábor TI - Matrix transpose on meshes with buses JF - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING J2 - J PARALLEL DISTR COM VL - 96 PY - 2016 SP - 194 EP - 201 PG - 8 SN - 0743-7315 DO - 10.1016/j.jpdc.2016.05.015 UR - https://m2.mtmt.hu/api/publication/3170067 ID - 3170067 LA - English DB - MTMT ER - TY - JOUR AU - Balogh, János AU - Békési, József AU - Galambos, Gábor AU - Dósa, György AU - Tan, Zhiyi TI - Lower bound for 3-batched bin packing JF - DISCRETE OPTIMIZATION J2 - DISCRETE OPTIM VL - 21 PY - 2016 SP - 14 EP - 24 PG - 11 SN - 1572-5286 DO - 10.1016/j.disopt.2016.04.007 UR - https://m2.mtmt.hu/api/publication/3076539 ID - 3076539 N1 - Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged, POB 396, Szeged, H-6701, Hungary Department of Mathematics, University of Pannonia, Egyetem u. 10, Veszprém, H-8200, Hungary Department of Mathematics, College of Science, Zhejiang University, Hangzhou, Zhejiang, 310027, China Cited By :9 Export Date: 13 April 2022 Correspondence Address: Balogh, J.; Department of Applied Informatics, POB 396, Hungary; email: balogh@jgypk.u-szeged.hu AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Kelemen, András AU - Békési, József AU - Galambos, Gábor AU - Krész, Miklós ED - Emőd, Kovács ED - Gábor, Kusper ED - Kunkli, Roland Imre ED - Tibor, Tómács TI - Parallelization of video compressing with FFmpeg and OpenMP in supercomputing environment T2 - ICAI 2014: Proceedings of the 9th International Conference on Applied Informatics, vol. 1-2 PB - Eszterházy Károly Tanárképző Főiskola (EKTF) CY - Eger SN - 9786155297182 PY - 2014 SP - 231 EP - 237 PG - 7 DO - 10.14794/ICAI.9.2014.1.231 UR - https://m2.mtmt.hu/api/publication/2880060 ID - 2880060 LA - English DB - MTMT ER -