The following pages link to Judit Nagy-György (Q989549):
Displaying 19 items.
- (Q974989) (redirect page) (← links)
- Online coloring graphs with high girth and high odd girth (Q974990) (← links)
- Online hypergraph coloring (Q975516) (← links)
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
- Clustering algorithm exploring road geometry in a video-based driver assistant system (Q1982824) (← links)
- The online \(k\)-server problem with rejection (Q2339820) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Online scheduling with machine cost and rejection (Q2462392) (← links)
- New models of graph-bin packing (Q2629236) (← links)
- On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity (Q2820787) (← links)
- On Variants of File Caching (Q3012805) (← links)
- (Q3060859) (← links)
- Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs (Q4584661) (← links)
- Biclique Coverings, Rectifier Networks and the Cost of ε-Removal (Q5496187) (← links)
- Online hypergraph coloring with rejection (Q5501518) (← links)
- Book free 3-uniform hypergraphs (Q6177430) (← links)
