List of publications

Research papers in mathematics and computer science:

  1. B. Csaba, J. Nagy-György, On the Advice Complexity of Online Matching on the Line, Discrete Optimization and Theoretical Computer Science, 26(3) paper 21. (9 p.), 2024.
  2. D. Ghosh, E. Győri, J. Nagy-György, A. Paulos, C. Xiao, O. Zamora, Book free 3-uniform hypergraphs, Discrete Mathematics 347(3): 113828 (5 p.), 2024.
  3. B. Csaba, J. Nagy-György, Embedding Graphs Having Ore-Degree at Most Five, SIAM Journal on Discrete Mathematics 33(1): 474–508, 2019.
  4. N. Bogya, R. Fazekas, J.Nagy-Gyorgy, Zs. Vizi: Clustering Algorithm Exploring road geometry in a video-based driver assistant system, Progress in Industrial Mathematics at ECMI 2018, pp 589–595, 2019.
  5. J Nagy-György, On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs, Acta Cybernetica, 23(3): pp 929–938, 2018.
  6. Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György, Zs. Tuza, New models of the graph-bin packing, Theoretical Computer Science 640:  94–103, 2016.
  7. Sz. Iván, J. Nagy-György, On nonpermutational transformation semigroups with an application to syntactic complexity, Acta Cybernetica 22: 687–701, 2016.
  8. Cs. Imreh, J. Nagy-György, Online hypergraph coloring with rejection, Acta Univ. Sapientiate, Informatica, 7(1):  5–17, 2015.
  9. L. Epstein, Cs. Imreh, A. Levin, J. Nagy-György, Online File Caching with Rejection Penalties, ALGORITHMICA 71:279–306, 2015.
  10. Sz. Iván, Á. D. Lelkes, J. Nagy-György, B. Szörényi , Gy. Turán, Biclique Coverings, Rectifier Networks and the Cost of ε-Removal, in: H. Jürgensen et al. (Eds.): DCFS 2014, LNCS 8614, pp. 174–185, 2014.
  11. E. Bittner, Cs. Imreh, J. Nagy-György, Online k-server problem with rejection, Discrete Optimization 13: 1–15, 2014.
  12. Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György, Zs. Tuza, The Graph-Bin Packing Problem, International Journal of Foundations of Computer Science, 22 (8), pp. 1971–1993, 2011.
  13. L. Epstein, Cs. Imreh, A. Levin, J. Nagy-György, On variants of file caching, Proc. of the 38th ICALP, part 1, 195–206, 2011.
  14. J. Nagy-György, Online coloring graphs with high girth and high odd girth, Operations Research Letters 38, pp. 185–187, 2010.
  15.  B. Csaba, I. Levitt, J. Nagy-György, E. Szemerédi, Tight bounds for embedding bounded degree trees, Bolyai Society Mathematical Studies, X., Fete of Combinatorics, pp. 1–44, 2010.
  16. Zs. Gazdag, Sz. Iván, J. Nagy-György, Improved upper bounds on synchronizing nondeterministic automata, Information Processing Letters 109 (2009), pp. 986–990, 2009.
  17. J. Nagy-György, Randomized algorithm for the k-server problem on decomposable spaces, Journal of Discrete Algorithms 7, pp. 411–419, 2009.
  18. Cs. Imreh, J. Nagy-György, Online hypergraph coloring, Information Processing Letters 109, pp. 23–26, 2008.
  19. J. Nagy-György, Cs. Imreh, Online scheduling with machine cost and rejection, Discrete Applied Mathematics 155, pp. 2546–2554, 2007.

Jegyzet, könyvfejezet (miscellaneous in hungarian):

Thesises: