Personal data

Personal data

Name: János Balogh

Citizenship: Hungarian

Occupation: Faculty of Science and Informatics, Institute of Informatics, University of Szeged

Postal address: H-6720 Szeged, Árpád tér 2., Hungary

E-mail address: baloghj at inf dot u-szeged dot hu, earlier balogh@jgypk.szte.hu

URL: http://www.inf.u-szeged.hu/~baloghj, earlier http.//www.jgypk.hu/~balogh

Education

2009. PhD in Computer Science, University of Szeged, Szeged, Hungary. Qualification: summa cum laude. Title of my thesis: "Some applications of global optimization and semi-on-line bin packing". Advisor: Tibor Csendes

1994. M.Sc. in mathematics and computer sciences, József Attila University, Szeged, Hungary. Qualification of my degree: 5.00 (excellent). Title of my thesis: "Maximal flows and minimal circulations; algorithms and applications". Advisor: Péter Hajnal

Employment

2019-present Associate professor at the Faculty of Science and Informatics, Institute of Informatics, University of Szeged

2011-2019 Associate professor at the Gyula Juhász Faculty of Education, University of Szeged

2004-2011 Adjunct professor at the Gyula Juhász Faculty of Education, University of Szeged

1999-2004 Teaching assistant, at the Gyula Juhász Teachers’ Training College, University of Szeged

1996-1999 Graduate work and teaching assistant (Ph.D. student) at József Attila University, Szeged, Hungary

1993-1996 Programmer and research assistant at the Departments of Informatics in József Attila University, Szeged, Hungary

Language exams

Hungarian official intermediate language exam in English (written, spoken and reading)

Hungarian official intermediate language exam in Spanish (written, spoken and reading)

Teaching experience

1993-present: Algorithms, Computer Architectures, Computer Networks, Internet Applications, Introduction to the Informatics, Software Packages, Operating systems

Research areas

Discrete optimization; on-line and semi-on-line algorithms, bin packing, optimization problems in the scheduling of public transportation, heuristics. Global optimization; phase stability problem.

Publications

Full papers in referred journals and serials:

Other full papers in conf. proceedings:

Research reports:

Scientific abstracts:

Sum of j. impact factors of published papers:

Number of citations (without self-citations):

28.866

653, out of which fully independent: 543

Selected publications

1. János Balogh, Leah Epstein and Asaf Levin, More on ordered open end bin packing, Journal of Scheduling, in press, 2021+. DOI: https://doi.org/10.1007/s10951-021-00709-3 (Impact Factor: 1.802 -- 2020.)

2. János Balogh, Ilan Reuven Cohen, Leah Epstein, and Asaf Levin, Truly Asymptotic Lower Bounds for Online Vector Bin Packing, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021), LIPIcs, Vol. 207, Article No. 8, pp. 8:1–8:18, 2021. DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.8 https://drops.dagstuhl.de/opus/volltexte/2021/14701/pdf/LIPIcs-APPROX8.pdf

3. János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin, A New Lower Bound for Classic Online Bin Packing, Algorithmica, 83(7), 2047–2062, 2021. DOI: https://doi.org/10.1007/s00453-021-00818-7 (Impact Factor: 0.650 -- 2019.)

4. János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin, Online bin packing with cardinality constraints resolved, Journal of Computer and System Sciences, 112, 34–49, 2020. DOI: https://doi.org/10.1016/j.jcss.2020.03.002 (Impact Factor: 1.494 -- 2019.)

5. János Balogh, Leah Epstein, and Asaf Levin, Lower bounds for online bin covering type problems, Journal of Scheduling, 22(4), 487–497, 2019. Springer US. DOI: https://doi.org/10.1007/s10951-018-0590-0 (IF2019:= 1.765.) URL: https://link.springer.com/article/10.1007/s10951-018-0590-0

6. Balogh, J., J. Békési, Gy. Dósa, L. Epstein and A. Levin, Lower bounds for several online variants of bin packing, Theory of Computing Systems, 63(8), 1757-1780, 2019. DOI: https://doi.org/10.1007/s00224-019-09915-1 (IF2019:= 0.497 -- 2019.) URL: https://link.springer.com/article/10.1007%2Fs00224-019-09915-1

7. Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, A new and improved algorithm for online bin packing, 26th Annual European Symposium on Algorithms (ESA 2018), LIPIcs, Vol. 112, pp. 5:1–5:14, 2018. ISBN 978-3-95977-081-1 DOI: 10.4230/LIPIcs.ESA.2018.5 URL: http://drops.dagstuhl.de/opus/volltexte/2018/9468 (Also: CoRR abs/1707.01728, 46 pages, 2017.07.06. Online URL: https://arxiv.org/abs/1707.01728)

8. Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Online bin packing with cardinality constraints resolved, Proc. of 25th Annual European Symposium on Algorithms (ESA 2017), LIPIcs, Vol. 87, pp. 10:1--10:14, 2017. ISBN 978-3-95977-049-1 DOI: 10.4230/LIPIcs.ESA.2017.10 URL: http://drops.dagstuhl.de/opus/volltexte/2017/7851/

9. Balogh, J., J. Békési, G. Galambos, Gy. Dósa, and Z. Tan, Lower Bound for 3-Batched Bin Packing, Discrete Optimization, 21(2016): 14–24. DOI: 10.1016/j.disopt.2016.04.007 http://dx.doi.org/10.1016/j.disopt.2016.04.007 (IF2016:=0.469.)

10. Balogh, J., J. Békési, Gy. Dósa, J. Sgall, and R. van Stee, The optimal absolute ratio for online bin packing, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’15), ACM-SIAM, 2015, pp. 1425-1438. ISBN: 978-1-61197-374-7 eISBN: 978-1-61197-373-0 DOI: http://dx.doi.org/10.1137/1.9781611973730.94

11. Balogh, J., J. Békési, Gy. Dósa, L. Epstein, H. Kellerer, and Zs. Tuza, Online Results for Black and White Bin Packing, Theory of Computing Systems, 56(1):137-155, 2015. DOI: 10.1007/s00224-014-9538-8 (IF2015:=0.719.)

12. Balogh, J., J. Békési, G. Galambos, and G. Reinelt, On-line bin packing with restricted repacking, Journal of Combinatorial Optimization, 27(1):115-131, 2014. DOI: 10.1007/s10878-012-9489-4 (IF2014:=0.939.)

13. Balogh, J. and J. Békési, Semi-on-line bin packing: a short overview and a new lower bound, Central European Journal of Operations Research, 21(4):685-698, 2013. DOI: 10.1007/s10100-012-0266-3 (IF2013:=0.787.)

14. Balogh, J., J. Békési, and G. Galambos, New Lower Bounds for Certain Classes of Bin Packing Algorithms, Theoretical Computer Science, 440-441(2012), 1-13. (IF2012:=0.489.)

15. Balogh, J., J. Békési, G. Galambos, and M.Cs. Markót, Improved lower bounds for semi-on-line bin packing problems, Computing, 84(2009), 139-148. (IF2009:=1.033.)

16. Balogh, J., J. Békési, G. Galambos, and G. Reinelt, Lower bound for the on-line bin packing problem with restricted repacking, SIAM Journal on Computing, 38(2008), 398-410. (IF2008:=1.459.)

17. Balogh, J., T. Csendes, and T. Rapcsák, Some global optimization problems on Stiefel manifolds, Journal of Global Optimization, 30(2004), 91-101. (IF2004:=0.693.)

Visits, foreign cooperations

1997, 1998, 1999: University of Almería, Spain, with Tempus Mobility Grant. (3 x 3 months).

2000: Technical University of Graz, Austria (1 week).

2003: University of Almería, Spain, with OMFB Hungarian-Spanish Bilateral Project, Grant SP-25/01. (2 weeks).

2004: University of Graz, Austria, with APPOL-2 Thematic Network Project (1 week).

2005: Bulgarian Academy of Sciences, Sofia, Bulgaria, with MTA Hungarian-Bulgarian Collaboration, project BGA-20 (2 weeks).

2005, 2006, 2008, 2010, and 2011: University of Heidelberg, Germany, with MÖB-DAAD Hungarian-German Research Exchange Program (5 x 10 days)

2012, 2016: University of Graz, Austria, with AÖU-OMAA Research Project, No. 82öu9 and No. 91öu2 (2 x 10 days).

Scientific projects

1. AÖU Osztrák-Magyar Akció Alapítvány – Aktion Österreich-Ungarn, project No. 91öu2, "Approximationsalgorithmen für Zeitplanfragen und Verpackungsprobleme" (research project with the Institut für Statistik und Operations Research of Karl-Franzens Universität), 2015.09.01-2016.08.31., 2810 EUR + 340000 HUF, 4 persons.

2. TÉT_12_CN-1-2012-0028, Hungarian-Chinese Bilateral Scientific and Technological Cooperation, "Analysis of packing and scheduling algorithms and their applications", Támogatás összege:4 800 000 HUF, résztvevők száma: 16, időszak: 2013.09.01-2015.05.01.

3. AÖU Osztrák-Magyar Akció Alapítvány – Stiftung Aktion Österreich-Ungarn, project No. 82öu9, "Approximationsalgorithmen für Scheduling- und Packungsprobleme" (research project with the Karl-Franzens-Universitaet Graz), 2011.06.01.-2012.05.31., 1 096 000 HUF +110 EUR, 4 persons.

4. DAAD-MÖB German-Hungarian Project Based Personnel Exchange Programme, project No. P-MÖB/837, 2010-2011, "Discrete Optimization Algorithms in Scheduling and Data Mining" (research project with the University of Heidelberg), 1.150.000 HUF, 9 persons.

5. MTA Hungarian-Bulgarian Collaboration, project 17, 2010-2012, "Development of new efficient optimization methods for chemical engineering simulation and design applications" ("Új, hatékony optimalizálási módszerek fejlesztése és alkalmazása vegyipari szimulációs és tervezési feladatokra"), 4 persons.

6. DAAD-MÖB German-Hungarian Bilateral, 2008-2009, "Exact and Approximative Algorithms for Clustering Problems" (research project, University of Heidelberg), 1.320.000 HUF, 11 persons.

7. MTA Hungarian-Bulgarian Collaboration, BGA-20, 2007-2009, "Development of new efficient optimization methods for chemical engineering simulation and design applications" ("Új, hatékony optimalizálási módszerek fejlesztése és alkalmazása vegyipari szimulációs és tervezési feladatokra"), 4 persons.

8. OTKA T 048377, 2005-2008, "Development of reliable nonlinear optimization methods and their application to hard problems", 6 persons.

9. MTA Hungarian-Bulgarian Collaboration, BGA-20, 2003-2005, "Új, hatékony optimalizálási módszerek fejlesztése vegyipari szimulációs és tervezési alkalmazásokra", 4 persons.

10. OTKA T 034350, 2001-2004, "Developments of global optimization procedures", 8 persons.

11. OMFB Hungarian-Spanish Bilateral, SP-25/01, 2001-2003, "Reliable methods of global optimization and their parallel implementation", 11 persons.

12. MTA Hungarian-Bulgarian Collaboration, BGA-20, 2000-2002, "Optimization in chemical phase equilibrium problems", 4 persons.

Honours

1992-93. Scholarship of the Hungarian Republic

2006. Excellent talk award, CSCS 2006 Conference

2012. Pro Juventute (Uniersity of Szeged, Faculty of Education)

2012. Rapcsák Tamás Prize

Other scientific activities

· Reviewer of the Hungarian Research Fund OTKA.

· Referee work for scientific conferences: WAOA2012, MATCOS-13, MATCOS-16, STACS 2015, ISAAC 2015, and ICALP 2018 conferences.

· Referee work for scientific journals: Acta Cybernetica, Algorithmica, Annals of Operations Research, Applied Mathematical Modelling, Central European Journal of Operations Research, Chemical Engineering Communications, Chemical and Biochemical Engineering Quarterly Journal, Computers and Operations Research, Discrete Applied Mathematics, Discrete Optimization, Fluid Phase Equlibria, Information Processing Letters, INFORMS Journal on Computing, Journal of Applied Mathematics, Journal of Combinatorial Optimization, Journal of Computer and System Sciences, Journal of Global Optimization, Journal of Optimization Theory and Applications, Journal of Scheduling, Mathematical Methods of Operations Research, Miskolc Mathematical Notes, Naval Research Logistics, Operations Research Letters, Optimization Letters, Pollack Periodica, Theoretical Computer Science, and Transportation Research Part E: Logistics and Transportation Review.

· Member of the defence committee for the following PhD dissertation: Abdulfatah M. Emhamed (BME, Budapest, 2009).