Csaba Béla; Nagy-György Judit:
Embedding Graphs Having Ore-Degree at Most Five.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 33 (1).
pp. 474-508.
ISSN 0895-4801
(2019)
Iván Szabolcs; Nagy-György Judit:
On nonpermutational transformation semigroups with an application to syntactic complexity.
Acta Cybernetica (Szeged), 22 (3).
pp. 687-701.
ISSN 0324-721X
(2016)
Epstein Leah; Imreh Csanád; Levin Asaf; Nagy-György Judit:
Online File Caching with Rejection Penalties.
ALGORITHMICA, 71 (2).
pp. 279-306.
ISSN 0178-4617
(2015)
Imreh Csanád; Nagy-György Judit:
Online hypergraph coloring with rejection.
ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 7 (1).
pp. 5-17.
ISSN 1844-6086
(2015)
Iván Szabolcs; Lelkes Ádám D.; Nagy-György Judit; Szörényi Balázs; Turán György:
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.
Lecture Notes in Computer Science, 8614.
pp. 174-185.
ISSN 0302-9743
(2014)
Bittner E.; Imreh Csanád; Nagy-György Judit:
The online k-server problem with rejection.
DISCRETE OPTIMIZATION, 13.
pp. 1-15.
ISSN 1572-5286
(2014)
Bujtás Csilla; Dósa György; Imreh Csanád; Nagy-György Judit; Tuza Zsolt:
The graph-bin packing problem.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 22 (8).
pp. 1971-1993.
ISSN 0129-0541
(2011)
Csaba Béla; Nagy-György Judit; Levitt Ian; Szemerédi Endre:
Tight bounds for embedding bounded degree trees.
In:
Fete of Combinatorics and Computer Science.
Bolyai Society Mathematical Studies
(20).
Springer Verlag - Bolyai Mathematical Society, Berlin; Budapest, pp. 95-137.
(2010)
ISBN 978-3-642-13579-8
Nagy-György Judit:
Randomized algorithm for the k-server problem on decomposable spaces.
JOURNAL OF DISCRETE ALGORITHMS, 7 (4).
pp. 411-419.
ISSN 1570-8667
(2009)
Nagy-György Judit; Imreh Csanád:
Online scheduling with machine cost and rejection.
DISCRETE APPLIED MATHEMATICS, 155 (18).
pp. 2546-2554.
ISSN 0166-218X
(2007)