default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Judit Nagy-György
@article{DBLP:journals/dm/GhoshGNPXZ24,
author = {Debarun Ghosh and
Ervin Gy{\"{o}}ri and
Judit Nagy{-}Gy{\"{o}}rgy and
Addisu Paulos and
Chuanqi Xiao and
Oscar Zamora},
title = {Book free 3-uniform hypergraphs},
journal = {Discret. Math.},
volume = {347},
number = {3},
pages = {113828},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113828},
doi = {10.1016/J.DISC.2023.113828},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GhoshGNPXZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2408-11161,
author = {B{\'{e}}la Csaba and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {On the Advice Complexity of Online Matching on the Line},
journal = {CoRR},
volume = {abs/2408.11161},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2408.11161},
doi = {10.48550/ARXIV.2408.11161},
eprinttype = {arXiv},
eprint = {2408.11161},
timestamp = {Tue, 24 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2408-11161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-14730,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {On the Advice Complexity of Online Unit Clustering},
journal = {CoRR},
volume = {abs/2309.14730},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.14730},
doi = {10.48550/ARXIV.2309.14730},
eprinttype = {arXiv},
eprint = {2309.14730},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-14730.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CsabaN19,
author = {B{\'{e}}la Csaba and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {Embedding Graphs Having Ore-Degree at Most Five},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {1},
pages = {474--508},
year = {2019},
url = {https://doi.org/10.1137/17M1155442},
doi = {10.1137/17M1155442},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CsabaN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/Nagy-Gyorgy18,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable
Hypergraphs},
journal = {Acta Cybern.},
volume = {23},
number = {3},
pages = {929--938},
year = {2018},
url = {https://doi.org/10.14232/actacyb.23.3.2018.13},
doi = {10.14232/ACTACYB.23.3.2018.13},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/actaC/Nagy-Gyorgy18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/IvanN16,
author = {Szabolcs Iv{\'{a}}n and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {On Nonpermutational Transformation Semigroups with an Application
to Syntactic Complexity},
journal = {Acta Cybern.},
volume = {22},
number = {3},
pages = {687--701},
year = {2016},
url = {https://doi.org/10.14232/actacyb.22.3.2016.9},
doi = {10.14232/ACTACYB.22.3.2016.9},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/actaC/IvanN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BujtasDINT16,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {New models of graph-bin packing},
journal = {Theor. Comput. Sci.},
volume = {640},
pages = {94--103},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.06.008},
doi = {10.1016/J.TCS.2016.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BujtasDINT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinILN15,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {Online File Caching with Rejection Penalties},
journal = {Algorithmica},
volume = {71},
number = {2},
pages = {279--306},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9793-0},
doi = {10.1007/S00453-013-9793-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinILN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BittnerIN14,
author = {Emese Bittner and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {The online k-server problem with rejection},
journal = {Discret. Optim.},
volume = {13},
pages = {1--15},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2014.03.002},
doi = {10.1016/J.DISOPT.2014.03.002},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BittnerIN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/IvanLNST14,
author = {Szabolcs Iv{\'{a}}n and
{\'{A}}d{\'{a}}m D{\'{a}}niel Lelkes and
Judit Nagy{-}Gy{\"{o}}rgy and
Bal{\'{a}}zs Sz{\"{o}}r{\'{e}}nyi and
Gy{\"{o}}rgy Tur{\'{a}}n},
editor = {Helmut J{\"{u}}rgensen and
Juhani Karhum{\"{a}}ki and
Alexander Okhotin},
title = {Biclique Coverings, Rectifier Networks and the Cost of {\(\epsilon\)}-Removal},
booktitle = {Descriptional Complexity of Formal Systems - 16th International Workshop,
{DCFS} 2014, Turku, Finland, August 5-8, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8614},
pages = {174--185},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09704-6\_16},
doi = {10.1007/978-3-319-09704-6\_16},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/IvanLNST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IvanN14,
author = {Szabolcs Iv{\'{a}}n and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {On nonpermutational transformation semigroups with an application
to syntactic complexity},
journal = {CoRR},
volume = {abs/1402.7289},
year = {2014},
url = {http://arxiv.org/abs/1402.7289},
eprinttype = {arXiv},
eprint = {1402.7289},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IvanN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IvanLNST14,
author = {Szabolcs Iv{\'{a}}n and
{\'{A}}d{\'{a}}m D{\'{a}}niel Lelkes and
Judit Nagy{-}Gy{\"{o}}rgy and
Bal{\'{a}}zs Sz{\"{o}}r{\'{e}}nyi and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Biclique coverings, rectifier networks and the cost of {\textdollar}{\textbackslash}varepsilon{\textdollar}-removal},
journal = {CoRR},
volume = {abs/1406.0017},
year = {2014},
url = {http://arxiv.org/abs/1406.0017},
eprinttype = {arXiv},
eprint = {1406.0017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IvanLNST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5714,
author = {Szabolcs Iv{\'{a}}n and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {On the structure and syntactic complexity of generalized definite
languages},
journal = {CoRR},
volume = {abs/1304.5714},
year = {2013},
url = {http://arxiv.org/abs/1304.5714},
eprinttype = {arXiv},
eprint = {1304.5714},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5714.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BujtasDINT11,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {The Graph-Bin Packing Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {22},
number = {8},
pages = {1971--1993},
year = {2011},
url = {https://doi.org/10.1142/S012905411100915X},
doi = {10.1142/S012905411100915X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BujtasDINT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EpsteinILN11,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin and
Judit Nagy{-}Gy{\"{o}}rgy},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {On Variants of File Caching},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {195--206},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_17},
doi = {10.1007/978-3-642-22006-7\_17},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EpsteinILN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Nagy-Gyorgy10,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {Online coloring graphs with high girth and high odd girth},
journal = {Oper. Res. Lett.},
volume = {38},
number = {3},
pages = {185--187},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2009.12.005},
doi = {10.1016/J.ORL.2009.12.005},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Nagy-Gyorgy10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GazdagIN09,
author = {Zsolt Gazdag and
Szabolcs Iv{\'{a}}n and
Judit Nagy{-}Gy{\"{o}}rgy},
title = {Improved upper bounds on synchronizing nondeterministic automata},
journal = {Inf. Process. Lett.},
volume = {109},
number = {17},
pages = {986--990},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.007},
doi = {10.1016/J.IPL.2009.05.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GazdagIN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Nagy-Gyorgy09,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {Randomized algorithm for the k-server problem on decomposable spaces},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {411--419},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.02.005},
doi = {10.1016/J.JDA.2009.02.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Nagy-Gyorgy09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nagy-GyorgyI08,
author = {Judit Nagy{-}Gy{\"{o}}rgy and
Csan{\'{a}}d Imreh},
title = {Online hypergraph coloring},
journal = {Inf. Process. Lett.},
volume = {109},
number = {1},
pages = {23--26},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.08.009},
doi = {10.1016/J.IPL.2008.08.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Nagy-GyorgyI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Nagy-GyorgyI07,
author = {Judit Nagy{-}Gy{\"{o}}rgy and
Csan{\'{a}}d Imreh},
title = {Online scheduling with machine cost and rejection},
journal = {Discret. Appl. Math.},
volume = {155},
number = {18},
pages = {2546--2554},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.07.004},
doi = {10.1016/J.DAM.2007.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Nagy-GyorgyI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0708-2351,
author = {Judit Nagy{-}Gy{\"{o}}rgy},
title = {Randomized algorithm for the k-server problem on decomposable spaces},
journal = {CoRR},
volume = {abs/0708.2351},
year = {2007},
url = {http://arxiv.org/abs/0708.2351},
eprinttype = {arXiv},
eprint = {0708.2351},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0708-2351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-26 01:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
