We stand with Ukraine  

Judit Nagy-György

Orcid: 0000-0001-5550-6904

According to our database1, Judit Nagy-György authored at least 19 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
2
1
1
1
2
1
2
1
1
1
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Book free 3-uniform hypergraphs.
[BibTeX]
[DOI]
Debarun Ghosh
,
Ervin Györi
,
Judit Nagy-György
,
Addisu Paulos
,
Chuanqi Xiao
,
Oscar Zamora
Discret. Math., March, 2024

On the Advice Complexity of Online Matching on the Line.
[BibTeX]
[DOI]
Béla Csaba
,
Judit Nagy-György
Discret. Math. Theor. Comput. Sci., 2024

2023
On the Advice Complexity of Online Unit Clustering.
[BibTeX]
[DOI]
Judit Nagy-György
CoRR, 2023

2019
Embedding Graphs Having Ore-Degree at Most Five.
[BibTeX]
[DOI]
Béla Csaba
,
Judit Nagy-György
SIAM J. Discret. Math., 2019

2018
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs.
[BibTeX]
[DOI]
Judit Nagy-György
Acta Cybern., 2018

2016
New models of graph-bin packing.
[BibTeX]
[DOI]
Csilla Bujtás
,
György Dósa
,
Csanád Imreh
,
Judit Nagy-György
,
Zsolt Tuza
Theor. Comput. Sci., 2016

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity.
[BibTeX]
[DOI]
Szabolcs Iván
,
Judit Nagy-György
Acta Cybern., 2016

2015
Online File Caching with Rejection Penalties.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
,
Judit Nagy-György
Algorithmica, 2015

2014
The online k-server problem with rejection.
[BibTeX]
[DOI]
Emese Bittner
,
Csanád Imreh
,
Judit Nagy-György
Discret. Optim., 2014

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.
[BibTeX]
[DOI]
Szabolcs Iván
,
Ádám Dániel Lelkes
,
Judit Nagy-György
,
Balázs Szörényi
,
György Turán
CoRR, 2014

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
[BibTeX]
[DOI]
Szabolcs Iván
,
Ádám Dániel Lelkes
,
Judit Nagy-György
,
Balázs Szörényi
,
György Turán
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
On the structure and syntactic complexity of generalized definite languages
[BibTeX]
[DOI]
Szabolcs Iván
,
Judit Nagy-György
CoRR, 2013

2011
The Graph-Bin Packing Problem.
[BibTeX]
[DOI]
Csilla Bujtás
,
György Dósa
,
Csanád Imreh
,
Judit Nagy-György
,
Zsolt Tuza
Int. J. Found. Comput. Sci., 2011

On Variants of File Caching.
[BibTeX]
[DOI]
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
,
Judit Nagy-György
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Online coloring graphs with high girth and high odd girth.
[BibTeX]
[DOI]
Judit Nagy-György
Oper. Res. Lett., 2010

2009
Randomized algorithm for the k-server problem on decomposable spaces.
[BibTeX]
[DOI]
Judit Nagy-György
J. Discrete Algorithms, 2009

Improved upper bounds on synchronizing nondeterministic automata.
[BibTeX]
[DOI]
Zsolt Gazdag
,
Szabolcs Iván
,
Judit Nagy-György
Inf. Process. Lett., 2009

2008
Online hypergraph coloring.
[BibTeX]
[DOI]
Judit Nagy-György
,
Csanád Imreh
Inf. Process. Lett., 2008

2007
Online scheduling with machine cost and rejection.
[BibTeX]
[DOI]
Judit Nagy-György
,
Csanád Imreh
Discret. Appl. Math., 2007


  Loading...