Artículos con órdenes de acceso público - Zsolt TuzaMás información
No disponibles en ningún lugar: 18
Improved bounds for batch scheduling with nonidentical job sizes
G Dosa, Z Tan, Z Tuza, Y Yan, CS Lányi
Naval Research Logistics (NRL) 61 (5), 351-358, 2014
Órdenes: National Natural Science Foundation of China, Hungarian Scientific Research Fund
Black and white bin packing
J Balogh, J Békési, G Dosa, H Kellerer, Z Tuza
International Workshop on Approximation and Online Algorithms, 131-144, 2012
Órdenes: Hungarian Scientific Research Fund
Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations
G Dosa, Z Tuza, D Ye
Journal of Combinatorial Optimization 26 (3), 416-436, 2013
Órdenes: Hungarian Scientific Research Fund
The graph-bin packing problem
C Bujtás, G Dósa, C Imreh, J Nagy-György, Z Tuza
International Journal of Foundations of Computer Science 22 (08), 1971-1993, 2011
Órdenes: Hungarian Scientific Research Fund
Bin covering with a general profit function: approximability results
A Benkő, G Dósa, Z Tuza
Central European Journal of Operations Research 21 (4), 805-816, 2013
Órdenes: Hungarian Scientific Research Fund
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
G Dósa, MG Speranza, Z Tuza
Journal of combinatorial optimization 21, 458-480, 2011
Órdenes: Hungarian Scientific Research Fund
Complexity of most vital nodes for independent set in graphs related to tree structures
C Bazgan, S Toubaline, Z Tuza
Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011
Órdenes: Hungarian Scientific Research Fund
Smallest Set-Transversals of k-Partitions
C Bujtás, Z Tuza
Graphs and Combinatorics 25 (6), 807-816, 2009
Órdenes: Hungarian Scientific Research Fund
Bin packing game with an interest matrix
Z Wang, X Han, G Dósa, Z Tuza
International Computing and Combinatorics Conference, 57-69, 2015
Órdenes: National Natural Science Foundation of China
Colorability of mixed hypergraphs and their chromatic inversions
M Hegyháti, Z Tuza
Journal of Combinatorial Optimization 25 (4), 737-751, 2013
Órdenes: Hungarian Scientific Research Fund
Geometric representation for semi on-line scheduling on uniform processors
E Angelelli, MG Speranza, J Szoldatics, Z Tuza
Optimization Methods & Software 25 (3), 421-428, 2010
Órdenes: Hungarian Scientific Research Fund
Circular coloring of graphs via linear programming and tabu search
M Barany, Z Tuza
Central European Journal of Operations Research 23, 833-848, 2015
Órdenes: Hungarian Scientific Research Fund
Orientations of graphs with prescribed weighted out-degrees
M Stiebitz, Z Tuza, M Voigt
Graphs and combinatorics 31, 265-280, 2015
Órdenes: Hungarian Scientific Research Fund
Connected domination in random graphs
G Bacsó, J Túri, Z Tuza
Indian Journal of Pure and Applied Mathematics 54 (2), 439-446, 2023
Órdenes: National Office for Research, Development and Innovation, Hungary
Comparison of sum choice number with chromatic sum
A Kemnitz, M Marangio, Z Tuza, M Voigt
Discrete mathematics 344 (7), 112391, 2021
Órdenes: National Office for Research, Development and Innovation, Hungary
Bin Packing Games with Weight Decision: how to get a small value for the Price of Anarchy
G Dosa, H Kellerer, Z Tuza
International Workshop on Approximation and Online Algorithms, 204-217, 2018
Órdenes: National Office for Research, Development and Innovation, Hungary
[1,1,t]-Colorings of Complete Graphs
A Kemnitz, M Marangio, Z Tuza
Graphs and Combinatorics 29 (4), 1041-1050, 2013
Órdenes: Hungarian Scientific Research Fund
The equal–sum–free subset problem
G Bacsó, Z Tuza
Acta Scientiarum Mathematicarum 86 (1), 73-79, 2020
Órdenes: European Commission, National Office for Research, Development and …
Disponibles en algún lugar: 107
Proper connection of graphs
V Borozan, S Fujita, A Gerek, C Magnant, Y Manoussakis, L Montero, ...
Discrete Mathematics 312 (17), 2550-2560, 2012
Órdenes: Hungarian Scientific Research Fund
Tight absolute bound for first fit decreasing bin-packing: FFD(L) ⩽ 11/9OPT(L) + 6/9
G Dósa, R Li, X Han, Z Tuza
Theoretical Computer Science 510, 13-61, 2013
Órdenes: Hungarian Scientific Research Fund
La información de publicación y financiación se determina de forma automática mediante un programa informático