default search action
Judit Nagy-György
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Debarun Ghosh
, Ervin Györi
Book free 3-uniform hypergraphs. Discret. Math. 347(3): 113828 (2024) - [i6]Béla Csaba, Judit Nagy-György:
On the Advice Complexity of Online Matching on the Line. CoRR abs/2408.11161 (2024) - 2023
- [i5]Judit Nagy-György:
On the Advice Complexity of Online Unit Clustering. CoRR abs/2309.14730 (2023)
2010 – 2019
- 2019
- [j12]Béla Csaba
Embedding Graphs Having Ore-Degree at Most Five. SIAM J. Discret. Math. 33(1): 474-508 (2019) - 2018
- [j11]Judit Nagy-György
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs. Acta Cybern. 23(3): 929-938 (2018) - 2016
- [j10]Szabolcs Iván
On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity. Acta Cybern. 22(3): 687-701 (2016) - [j9]Csilla Bujtás
New models of graph-bin packing. Theor. Comput. Sci. 640: 94-103 (2016) - 2015
- [j8]Leah Epstein, Csanád Imreh, Asaf Levin
Online File Caching with Rejection Penalties. Algorithmica 71(2): 279-306 (2015) - 2014
- [j7]Emese Bittner, Csanád Imreh, Judit Nagy-György
The online k-server problem with rejection. Discret. Optim. 13: 1-15 (2014) - [c2]Szabolcs Iván
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS 2014: 174-185 - [i4]Szabolcs Iván, Judit Nagy-György:
On nonpermutational transformation semigroups with an application to syntactic complexity. CoRR abs/1402.7289 (2014) - [i3]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR abs/1406.0017 (2014) - 2013
- [i2]Szabolcs Iván, Judit Nagy-György:
On the structure and syntactic complexity of generalized definite languages. CoRR abs/1304.5714 (2013) - 2011
- [j6]Csilla Bujtás
The Graph-Bin Packing Problem. Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) - [c1]Leah Epstein, Csanád Imreh, Asaf Levin
On Variants of File Caching. ICALP (1) 2011: 195-206 - 2010
- [j5]Judit Nagy-György
Online coloring graphs with high girth and high odd girth. Oper. Res. Lett. 38(3): 185-187 (2010)
2000 – 2009
- 2009
- [j4]Zsolt Gazdag, Szabolcs Iván
Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109(17): 986-990 (2009) - [j3]Judit Nagy-György
Randomized algorithm for the k-server problem on decomposable spaces. J. Discrete Algorithms 7(4): 411-419 (2009) - 2008
- [j2]Judit Nagy-György
Online hypergraph coloring. Inf. Process. Lett. 109(1): 23-26 (2008) - 2007
- [j1]Judit Nagy-György
Online scheduling with machine cost and rejection. Discret. Appl. Math. 155(18): 2546-2554 (2007) - [i1]Judit Nagy-György:
Randomized algorithm for the k-server problem on decomposable spaces. CoRR abs/0708.2351 (2007)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
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: