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 - Ochieng, Peter Juma AU - Maróti, Zoltán AU - Dombi, József AU - Krész, Miklós AU - Békési, József AU - Kalmár, Tibor TI - Adaptive Savitzky–Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data JF - INFORMATION (BASEL) J2 - INFORMATION-BASEL VL - 14 PY - 2023 IS - 2 PG - 21 SN - 2078-2489 DO - 10.3390/info14020128 UR - https://m2.mtmt.hu/api/publication/33643183 ID - 33643183 AB - Copy number variation (CNV) is a form of structural variation in the human genome that provides medical insight into complex human diseases; while whole-genome sequencing is becoming more affordable, whole-exome sequencing (WES) remains an important tool in clinical diagnostics. Because of its discontinuous nature and unique characteristics of sparse target-enrichment-based WES data, the analysis and detection of CNV peaks remain difficult tasks. The Savitzky–Golay (SG) smoothing is well known as a fast and efficient smoothing method. However, no study has documented the use of this technique for CNV peak detection. It is well known that the effectiveness of the classical SG filter depends on the proper selection of the window length and polynomial degree, which should correspond with the scale of the peak because, in the case of peaks with a high rate of change, the effectiveness of the filter could be restricted. Based on the Savitzky–Golay algorithm, this paper introduces a novel adaptive method to smooth irregular peak distributions. The proposed method ensures high-precision noise reduction by dynamically modifying the results of the prior smoothing to automatically adjust parameters. Our method offers an additional feature extraction technique based on density and Euclidean distance. In comparison to classical Savitzky–Golay filtering and other peer filtering methods, the performance evaluation demonstrates that adaptive Savitzky–Golay filtering performs better. According to experimental results, our method effectively detects CNV peaks across all genomic segments for both short and long tags, with minimal peak height fidelity values (i.e., low estimation bias). As a result, we clearly demonstrate how well the adaptive Savitzky–Golay filtering method works and how its use in the detection of CNV peaks can complement the existing techniques used in CNV peak analysis. LA - English DB - MTMT ER - TY - JOUR AU - Györgyi, Péter AU - Kis, Tamás AU - Tamási, Tímea AU - Békési, József TI - Joint replenishment meets scheduling JF - JOURNAL OF SCHEDULING J2 - J SCHEDULING VL - 26 PY - 2023 IS - 1 SP - 77 EP - 94 PG - 18 SN - 1094-6136 DO - 10.1007/s10951-022-00768-0 UR - https://m2.mtmt.hu/api/publication/33370872 ID - 33370872 AB - In this paper, we consider a combination of the joint replenishment problem (JRP) and single-machine scheduling with release dates. There is a single machine and one or more item types. Each job has a release date, a positive processing time, and it requires a subset of items. A job can be started at time t only if all the required item types were replenished between the release date of the job and time point t . The ordering of item types for distinct jobs can be combined. The objective is to minimize the total ordering cost plus a scheduling criterion, such as total weighted completion time or maximum flow time, where the cost of ordering a subset of items simultaneously is the sum of a joint ordering cost, and an additional item ordering cost for each item type in the subset. We provide several complexity results for the offline problem, and competitive analysis for online variants with min–sum and min–max criteria, respectively. 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 - CONF AU - Kis, Tamás AU - Györgyi, Péter AU - Tamási, Tímea AU - Békési, József TI - Joint replenishment meets scheduling T2 - Proceedings of the 15th Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP 2022 C1 - Oropa PY - 2022 SP - 135 EP - 138 PG - 4 UR - https://m2.mtmt.hu/api/publication/33597624 ID - 33597624 LA - English 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 - 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 - JOUR AU - Balogh, János AU - Békési, József AU - Dósa, György AU - Epstein, Leah AU - Levin, Asaf TI - Lower bounds for batched bin packing JF - JOURNAL OF COMBINATORIAL OPTIMIZATION J2 - J COMB OPTIM VL - 43 PY - 2022 IS - 3 SP - 613 EP - 629 PG - 17 SN - 1382-6905 DO - 10.1007/s10878-021-00797-z UR - https://m2.mtmt.hu/api/publication/32162293 ID - 32162293 N1 - Funding Agency and Grant Number: project "Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network" [EFOP-3.6.2-16-2017-00015]; project "Integrated program for training new generation of scientists in the fields of computer science" [EFOP-3.6.3-VEKOP-16-2017-00002]; European UnionEuropean Commission; European Social FundEuropean Social Fund (ESF); National Research, Development and Innovation Office NKFIHNational Research, Development & Innovation Office (NRDIO) - Hungary [SNN 129178]; Szechenyi 2020 [EFOP-3.6.1-16-2016-00015]; ISF - Israeli Science FoundationIsrael Science Foundation [308/18]; EUEuropean Commission [EFOP-3.6.3-VEKOP-16-2017-0002]; National Research, Development and Innovation Office-NKFIHNational Research, Development & Innovation Office (NRDIO) - Hungary [SNN 129364] Funding text: J. Baloghwas supported by the project "Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network" EFOP-3.6.2-16-2017-00015, and by the project "Integrated program for training new generation of scientists in the fields of computer science", EFOP-3.6.3-VEKOP-16-2017-00002. The project has been supported by the European Union and co-funded by the European Social Fund. J. Bekesi was supported by the EU-funded Hungarian grant "Integrated program for training new generation of scientists in the fields of computer science" EFOP-3.6.3-VEKOP-16-2017-0002, and by National Research, Development and Innovation Office NKFIH under the Grant SNN 129178. Gy. Dosa was supported by National Research, Development and Innovation Office-NKFIH under the Grant SNN 129364 and by Szechenyi 2020 under the EFOP-3.6.1-16-2016-00015. A. Levin was partially supported by Grant Number 308/18 of ISF -Israeli Science Foundation. LA - English DB - MTMT ER - TY - JOUR AU - Balogh, János AU - Békési, József AU - Dósa, György AU - Epstein, Leah AU - Levin, Asaf TI - A New Lower Bound for Classic Online Bin Packing JF - ALGORITHMICA J2 - ALGORITHMICA VL - 83 PY - 2021 IS - 7 SP - 2047 EP - 2062 PG - 16 SN - 0178-4617 DO - 10.1007/s00453-021-00818-7 UR - https://m2.mtmt.hu/api/publication/32162306 ID - 32162306 N1 - Institute of Informatics, University of Szeged, Szeged, Hungary Department of Mathematics, University of Pannonia, Veszprem, Hungary Department of Mathematics, University of Haifa, Haifa, Israel Faculty of Industrial Engineering and Management, The Technion, Haifa, Israel Cited By :5 Export Date: 13 April 2022 CODEN: ALGOE Correspondence Address: Epstein, L.; Department of Mathematics, Israel; email: lea@math.haifa.ac.il Funding details: German-Israeli Foundation for Scientific Research and Development, GIF, I-1366-407.6/2016 Funding details: Hungarian Scientific Research Fund, OTKA, SNN 129178, SNN 129364 Funding details: Israel Science Foundation, ISF, 308/18 Funding details: European Social Fund, ESF, EFOP-3.6.1-16-2016-00015, EFOP-3.6.2-16-2017-00015 LA - English DB - MTMT ER - TY - JOUR AU - Békési, József AU - Nagy, Albert TI - Combined Vehicle and Driver Scheduling with Fuel Consumption and Parking Constraints: a Case Study JF - ACTA POLYTECHNICA HUNGARICA J2 - ACTA POLYTECH HUNG VL - 17 PY - 2020 IS - 7 SP - 45 EP - 65 PG - 21 SN - 1785-8860 DO - 10.12700/APH.17.7.2020.7.3 UR - https://m2.mtmt.hu/api/publication/31649321 ID - 31649321 LA - English DB - MTMT ER -