Citation: P. Dellolmo et al., A 13 12 APPROXIMATION ALGORITHM FOR BIN PACKING WITH EXTENDIBLE BINS/, Information processing letters, 65(5), 1998, pp. 229-233
Citation: P. Dellolmo et al., COMPARABILITY GRAPH AUGMENTATION FOR SOME MULTIPROCESSOR SCHEDULING PROBLEMS, Discrete applied mathematics, 72(1-2), 1997, pp. 71-84
Citation: Y. Manoussakis et Z. Tuza, OPTIMAL ROUTINGS IN COMMUNICATION-NETWORKS WITH LINEARLY BOUNDED FORWARDING INDEX, Networks, 28(4), 1996, pp. 177-180
Citation: S. Poljak et Z. Tuza, THE EXPECTED RELATIVE ERROR OF THE POLYHEDRAL APPROXIMATION OF THE MAX-CUT PROBLEM, Operations research letters, 16(4), 1994, pp. 191-198
Citation: M. Hujter et Z. Tuza, THE NUMBER OF MAXIMAL INDEPENDENT SETS IN TRIANGLE-FREE GRAPHS, SIAM journal on discrete mathematics, 6(2), 1993, pp. 284-288
Citation: Y. Caro et Z. Tuza, ON KAPPA-LOCAL AND KAPPA-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS, Quarterly Journal of Mathematics, 44(176), 1993, pp. 385-398