Judit Nagy-György

22 papers Journal 20Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Book free 3-uniform hypergraphs.
Discret. Math.
Debarun Ghosh, Ervin Györi, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora
2024 J jnl
On the Advice Complexity of Online Matching on the Line.
CoRR
Béla Csaba, Judit Nagy-György
2024 J jnl
On the Advice Complexity of Online Matching on the Line.
Discret. Math. Theor. Comput. Sci.
Béla Csaba, Judit Nagy-György
2023 J jnl
On the Advice Complexity of Online Unit Clustering.
CoRR
Judit Nagy-György
2019 J jnl
Embedding Graphs Having Ore-Degree at Most Five.
SIAM J. Discret. Math.
Béla Csaba, Judit Nagy-György
2018 J jnl
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs.
Acta Cybern.
Judit Nagy-György
2016 J jnl
New models of graph-bin packing.
Theor. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2016 J jnl
On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity.
Acta Cybern.
Szabolcs Iván, Judit Nagy-György
2015 J jnl
Online File Caching with Rejection Penalties.
Algorithmica
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2014 — conf
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
DCFS
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
2014 J jnl
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.
CoRR
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
2014 J jnl
On nonpermutational transformation semigroups with an application to syntactic complexity.
CoRR
Szabolcs Iván, Judit Nagy-György
2014 J jnl
The online k-server problem with rejection.
Discret. Optim.
Emese Bittner, Csanád Imreh, Judit Nagy-György
2013 J jnl
On the structure and syntactic complexity of generalized definite languages
CoRR
Szabolcs Iván, Judit Nagy-György
2011 — conf
On Variants of File Caching.
ICALP (1)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2011 J jnl
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2010 J jnl
Online coloring graphs with high girth and high odd girth.
Oper. Res. Lett.
Judit Nagy-György
2009 J jnl
Improved upper bounds on synchronizing nondeterministic automata.
Inf. Process. Lett.
Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György
2009 J jnl
Randomized algorithm for the k-server problem on decomposable spaces.
J. Discrete Algorithms
Judit Nagy-György
2008 J jnl
Online hypergraph coloring.
Inf. Process. Lett.
Judit Nagy-György, Csanád Imreh
2007 J jnl
Online scheduling with machine cost and rejection.
Discret. Appl. Math.
Judit Nagy-György, Csanád Imreh
2007 J jnl
Randomized algorithm for the k-server problem on decomposable spaces
CoRR
Judit Nagy-György