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

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Book free 3-uniform hypergraphs.
Discret. Math., March, 2024

On the Advice Complexity of Online Matching on the Line.
CoRR, 2024

2023
On the Advice Complexity of Online Unit Clustering.
CoRR, 2023

2019
Embedding Graphs Having Ore-Degree at Most Five.
SIAM J. Discret. Math., 2019

2018
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs.
Acta Cybern., 2018

2016
New models of graph-bin packing.
Theor. Comput. Sci., 2016

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity.
Acta Cybern., 2016

2015
Online File Caching with Rejection Penalties.
Algorithmica, 2015

2014
The online k-server problem with rejection.
Discret. Optim., 2014

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.
CoRR, 2014

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
On the structure and syntactic complexity of generalized definite languages
CoRR, 2013

2011
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011

On Variants of File Caching.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Online coloring graphs with high girth and high odd girth.
Oper. Res. Lett., 2010

2009
Randomized algorithm for the k-server problem on decomposable spaces.
J. Discrete Algorithms, 2009

Improved upper bounds on synchronizing nondeterministic automata.
Inf. Process. Lett., 2009

2008
Online hypergraph coloring.
Inf. Process. Lett., 2008

2007
Online scheduling with machine cost and rejection.
Discret. Appl. Math., 2007


  Loading...