@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:33643183,
	title = {Adaptive Savitzky–Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data},
	url = {https://m2.mtmt.hu/api/publication/33643183},
	author = {Ochieng, Peter Juma and Maróti, Zoltán and Dombi, József and Krész, Miklós and Békési, József and Kalmár, Tibor},
	doi = {10.3390/info14020128},
	journal-iso = {INFORMATION-BASEL},
	journal = {INFORMATION (BASEL)},
	volume = {14},
	unique-id = {33643183},
	abstract = {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.},
	year = {2023},
	eissn = {2078-2489},
	orcid-numbers = {Ochieng, Peter Juma/0000-0001-6497-6481; Maróti, Zoltán/0000-0002-0515-117X; Dombi, József/0000-0001-9459-912X; Krész, Miklós/0000-0002-7547-1128; Békési, József/0000-0003-3820-9777; Kalmár, Tibor/0000-0002-0419-2009}
}

@article{MTMT:33370872,
	title = {Joint replenishment meets scheduling},
	url = {https://m2.mtmt.hu/api/publication/33370872},
	author = {Györgyi, Péter and Kis, Tamás and Tamási, Tímea and Békési, József},
	doi = {10.1007/s10951-022-00768-0},
	journal-iso = {J SCHEDULING},
	journal = {JOURNAL OF SCHEDULING},
	volume = {26},
	unique-id = {33370872},
	issn = {1094-6136},
	abstract = {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.},
	year = {2023},
	eissn = {1099-1425},
	pages = {77-94},
	orcid-numbers = {Györgyi, Péter/0000-0002-2380-5528; Kis, Tamás/0000-0002-2759-1264}
}

@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}
}

@CONFERENCE{MTMT:33597624,
	title = {Joint replenishment meets scheduling},
	url = {https://m2.mtmt.hu/api/publication/33597624},
	author = {Kis, Tamás and Györgyi, Péter and Tamási, Tímea and Békési, József},
	booktitle = {Proceedings of the 15th Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP 2022},
	unique-id = {33597624},
	year = {2022},
	pages = {135-138},
	orcid-numbers = {Kis, Tamás/0000-0002-2759-1264; Györgyi, Péter/0000-0002-2380-5528}
}

@{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}
}

@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}
}

@article{MTMT:32162293,
	title = {Lower bounds for batched bin packing},
	url = {https://m2.mtmt.hu/api/publication/32162293},
	author = {Balogh, János and Békési, József and Dósa, György and Epstein, Leah and Levin, Asaf},
	doi = {10.1007/s10878-021-00797-z},
	journal-iso = {J COMB OPTIM},
	journal = {JOURNAL OF COMBINATORIAL OPTIMIZATION},
	volume = {43},
	unique-id = {32162293},
	issn = {1382-6905},
	year = {2022},
	eissn = {1573-2886},
	pages = {613-629},
	orcid-numbers = {Dósa, György/0000-0002-4909-6694; Epstein, Leah/0000-0002-6761-8521}
}

@article{MTMT:32162306,
	title = {A New Lower Bound for Classic Online Bin Packing},
	url = {https://m2.mtmt.hu/api/publication/32162306},
	author = {Balogh, János and Békési, József and Dósa, György and Epstein, Leah and Levin, Asaf},
	doi = {10.1007/s00453-021-00818-7},
	journal-iso = {ALGORITHMICA},
	journal = {ALGORITHMICA},
	volume = {83},
	unique-id = {32162306},
	issn = {0178-4617},
	year = {2021},
	eissn = {1432-0541},
	pages = {2047-2062},
	orcid-numbers = {Dósa, György/0000-0002-4909-6694; Epstein, Leah/0000-0002-6761-8521}
}

@article{MTMT:31649321,
	title = {Combined Vehicle and Driver Scheduling with Fuel Consumption and Parking Constraints: a Case Study},
	url = {https://m2.mtmt.hu/api/publication/31649321},
	author = {Békési, József and Nagy, Albert},
	doi = {10.12700/APH.17.7.2020.7.3},
	journal-iso = {ACTA POLYTECH HUNG},
	journal = {ACTA POLYTECHNICA HUNGARICA},
	volume = {17},
	unique-id = {31649321},
	issn = {1785-8860},
	year = {2020},
	eissn = {1785-8860},
	pages = {45-65}
}