SZTAKI: Personal information

Magyar
SZTAKIWeb English Search Phonebook Tuza Zsolt
Zsolt Tuza, Prof, research advisor Address: 1111 Budapest, Kende u. 13-17. Room number: K 523 Phone: +36 1 279 6110 Fax: +36 1 466 7503 E-mail: tuzaEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.hu Education: Eötvös Loránd University, Budapest Inclusive dates of attendance: 1973-1978 Masters degree received: 1978 Specialization: Mathematics Supervisor: Gyula O. H. Katona Positions held: Since 1978: at the Computer and Automation Research Institute of the Hungarian Academy of Sciences Since 1993: research professor (French equivalent: directeur de recherche de 1ere classe) Since 2000: professor at the Department of Computer Science, University of Veszprém (http://www.dcs.vein.hu) External research fellow (honorary title) at the Rényi Institute of the Hungarian Academy of Sciences (http://www.renyi.hu) Part-time teaching at Pázmány Péter Catholic University, Budapest Visiting professor for short terms: at several universities, in Austria, Denmark, France, Germany, Israel, Italy, The Netherlands and the USA Membership in editorial boards: Discussiones Mathematicae, Graph Theory Discrete Mathematics and Theoretical Computer Science (electronic journal) Publications of the Faculty of Electrical Engineering, University of Belgrade, Ser. Math. Mathematical Notes, Miskolc Invited speaker at many international conferences on combinatorics and theoretical computer science Academic degrees awarded by the Hungarian Academy of Sciences: "Candidate of Mathematical Sciences" (upper-equivalent to PhD, awarded in 1986) "Doctor of Mathematical Sciences" (no US equivalent, awarded in 1992) Qualification for teaching as full professor: "Habilitation in Applied Mathematics" (Budapest Technical University, awarded in 1995) Prizes won: First Prize at the International Mathematical Olympiad (1972) "Institute Prize" and "Publication Award" - Awards of the Computer and Automation Institute for outstanding research work (received several times, first in 1982) Participation in program committees of international conferences: Irregularities of Partitions (Fertőd, 1986) Extremal Set Theory (Visegrád, 1991) Combinatorics (Keszthely, 1993) European Symposium on Algorithms (Graz, 1997) Graph Coloring (co-chair - DIMACS/Rutgers University, New Jersey, 1998) 260 scientific papers, in the following areas: graph theory (vertex and edge coloring, independence, decomposition, clique cover, Ramsey theory, graph domination, maximum cut, random graphs, tournaments, edge labeling) networks (routings, path systems) hypergraph theory (extremal problems, packing and covering, Helly property, Steiner systems, block designs, mixed hypergraph coloring) theoretical computer science (complexity of algorithms, Boolean functions, formal languages, approximation algorithms) operations research (scheduling, bin packing) algebra (polynomial identities over matrix rings) algebraic logic (representations, axiomatizability) applications in biology (formal models of cell division), chemical engineering (structural process control by discrete methods, model simplification), and spatiotemporal databases Languages learnt: Hungarian, English, Russian, French, German Publications [order by time] [order by categories ] [order by authors] Aigner, M Searching for acyclic orientations of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1995. Published by: DISCRETE MATHEMATICS (Volume no.: 144, Issue no.: 1-3, Page: 3-10) Irregular assignments and vertex distinguishing edge-colorings of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 1-9) Aistie-Vidal, A Construction of non-isomorphic regular tournaments Authors: Aistie-Vidal, A; Dugat, V; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 11-23) Al-Yakoob, SM Domination number of graphs with bounded diameter. Authors: Al-Yakoob, SM; Tuza, ZS Date: 2002. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 40, Page: 183-191) Alon, N Choosability and fractional chromatic numbers. Authors: Alon, N; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 165-166, Page: 31-38) The acyclic orientation game on random graphs Authors: Alon, N; Tuza, ZS Date: 1995. Published by: RANDOM STRUCTURES & ALGORITHMS (Volume no.: 6, Issue no.: 2-3, Page: 261-268) Amoura, AK A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Authors: Amoura, AK; Bampis, E; Manoussakis, Y; Tuza, ZS Date: 1999. Published by: PARALLEL COMPUTING (Volume no.: 25, Issue no.: 1, Page: 49-61) Andersen, LD Largest non-unique subgraphs Authors: Andersen, LD; Vestergaard, PD; Tuza, Zsolt Date: 2006. Published by: Graphs and Combinatorics (Volume no.: 22, Page: 453-470) Angelelli, E New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks Authors: Angelelli, E; Speranza, MG; Tuza, Zsolt Date: 2006. Published by: Discrete Mathematics and Theoretical Computer Science (Volume no.: 8, Page: 1-16) The on-line multiprocessor scheduling problem with known sum of the tasks Authors: Angelelli, E; Nagy, ; Spernaza, MG; Tuza, ZS Date: 2004. Published by: JOURNAL OF SCHEDULING (Volume no.: 7, Page: 421-428) Semi-on-line scheduling on two parallel processors with an upper bound on the items Authors: Angelelli, E; Speranza, MG; Tuza, ZS Date: 2003. Published by: ALGORITHMICA (Volume no.: 37, Issue no.: 4, Page: 243-262) Angelelli, E. Geometric representation for semi on-line scheduling on uniform processors. Authors: Angelelli, E.; Speranza, M. G.; Szoldatics, J.; Tuza, Zsolt Date: 2010. Published by: Optimization Methods & Software (Volume no.: 25, Issue no.: 3, Page: 421-428.) Semi on-line scheduling on three processors with known sum of the tasks. Authors: Angelelli, E.; Speranza, M. G.; Tuza, Zsolt Date: 2007. Published by: Journal of Scheduling (Volume no.: 10, Issue no.: 4-5, Page: 263-269.) Angelelli, Enrico Semi-online scheduling on two uniform processors. Authors: Angelelli, Enrico; Speranza, Maria Grazia; Tuza, Zsolt Date: 2008. Published by: Theoretical Computer Science (Volume no.: 393, Issue no.: 1-3, Page: 211-219.) Bacsó, G. Optimal guard sets and the Helly property Authors: Bacsó, G.; Tuza, Zs. Date: 2011. Published by: European Journal of Combinatorics (Volume no.: 32, Issue no.: 1, Page: 28-32) Bacsó, G Graph domination in distance two Authors: Bacsó, G; Tálos, A; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 121-128) Dominating bipartite subgraphs in graphs Authors: Bacsó, G; Michalak, D; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 85-94) Graphs without induced P5 and C5 Authors: Bacsó, G; Tuza, ZS Date: 2004. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 24, Page: 503-507) Unique colorings of bi-hypergraphs Authors: Bacsó, G; Tuza, ZS; Voroshin, V Date: 2003. Published by: AUSTRALASIAN JOURNAL OF COMBINATORICS (Volume no.: 27, Page: 33-45) Structural domination of graphs. Authors: Bacsó, G; Tuza, ZS Date: 2002. Published by: ARS COMBINATORIA (Volume no.: 63, Page: 235-256) Dominating subgraphs of small diameter. Authors: Bacsó, G; Tuza, ZS Date: 1999. Published by: JOURNAL OF COMBINATORICS, INFORMATION AND SYSTEM SCIENCES (Volume no.: 22, Issue no.: 1, Page: 51-62) Domination properties and induced subgraphs Authors: Bacsó, G; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 111, Issue no.: 1-3, Page: 37-40) Bacsó, Gábor Optimal guard sets and the Helly property. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2011. Published by: European Journal of Combinatorics (Volume no.: 32, Page: 28-32.) Infinite versus finite graph domination. Authors: Bacsó, Gábor; Jung, H. A.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 9, Page: 1495-1500.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2010. Published by: Advances in discrete mathematics and applications. Mysore, 2008. (Ramanujan Mathematical Society lecture notes series 13.) (Page: 45-57.) Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics and Theoretical Computer Science (Volume no.: 11, Issue no.: 2, Page: 15-24.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: ICDM 2008. International conference on discrete mathematics. Mysore, 2008. (Page: 67-78.) Upper chromatic number of finite projective planes. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2008. Published by: Journal of Combinatorial Designs (Volume no.: 16, Issue no.: 3, Page: 221-230.) Characterization of graphs dominated by induced paths. Authors: Bacsó, Gábor; Tuza, Zsolt; Voigt, M. Date: 2007. Published by: Discrete Mathematics (Volume no.: 307, Issue no.: 7--8, Page: 822-826.) The cost chromatic number and hypergraph parameters Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2006. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 26, Issue no.: 3, Page: 369-376) Bampis, E A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Authors: Amoura, AK; Bampis, E; Manoussakis, Y; Tuza, ZS Date: 1999. Published by: PARALLEL COMPUTING (Volume no.: 25, Issue no.: 1, Page: 49-61) Barefoot, CA Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Bazgan, C Degree-constrained decompositions of graphs: boundered treewidth and planarity Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Theoretical Computer Science (Volume no.: 355, Page: 389-395) The satisfactory partition problem Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Discrete Applied Mathematics (Volume no.: 154, Page: 1236-1245) Complexity and approximation of satisfactory partition problems Authors: Bazgan, C; Tuza, Zs; Vanderpooten, D Date: 2005. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 3595, Page: 829-838) On the existence and determination of satisfactory partitions in a graph Authors: Bazgan, C; Vanderpooten, D; Tuza, ZS Date: 2003. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 2906, Page: 444-453) Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 2002. Published by: JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Volume no.: 64, Issue no.: 2, Page: 160-170) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1999. Published by: JOURNAL OF ALGORITHMS (Volume no.: 31, Issue no.: 1, Page: 249-268) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: STACS 98. 15th annual symposium on theoretical aspects of computer science. Proceedings. Paris, 1998. (Lecture notes in computer science, 1373.) (Page: 276-286) Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: Automata, languages and programming. (Lecture notes in computer science, 1443.) (Page: 387-396) Bazgan, C. The most vital nodes with respect to independent set and vertex cover. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 1933-1946.) Complexity of most vital nodes for independent set in graphs related to tree structures. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Editor: Iliopoulos, C.S.; Smyth, W.F. Date: 2011. Published by: IWOCA 2010. 21st international workshop on combinatorial algorithms. London, 2010. (Lecture notes in computer science 6460.) (Page: 154-166.) Complexity and approximation of the constrained forest problem. Authors: Bazgan, C.; Couetoux, B.; Tuza, Zsolt Date: 2011. Published by: Theoretical Computer Science (Volume no.: 412, Page: 4081-4091.) Satisfactory graph partition, variants, and generalizations. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2010. Published by: European Journal of Operational Research (Volume no.: 206, Issue no.: 2, Page: 271-280.) Covering a graph with a constrained forest (extended abstract). Authors: Bazgan, C.; Couëtoux, B.; Tuza, Zsolt Date: 2009. 12. 16. Published by: ISAAC 2009. Algorithms and computation. 20th international symposium. Honolulu, 2009. (Lecture notes in computer science 5878.) (Page: 892-901.) Efficient algorithms for decomposing graphs under degree constraints. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 8, Page: 979-988.) Bazgan, Cristina Approximation of satisfactory bisection problems. Authors: Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel Date: 2008. Published by: Journal of Computer and System Sciences (Volume no.: 74, Issue no.: 5, Page: 875-883.) Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. Authors: Bazgan, Cristina; Tuza, Zsolt Date: 2008. Published by: Journal of Discrete Algorithms (Volume no.: 6, Issue no.: 3, Page: 510-519.) Bertram, E Local and global average degree in graphs and multigraphs Authors: Bertram, E; Erdős, P; Horák, P; Sirán, J; Tuza, ZS Date: 1995. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 18, Issue no.: 7, Page: 647-661) Blázsik, Z Graphs with no induced C4 and 2K2 Authors: Blázsik, Z; Hujter, M; Pluhár, A; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 115, Issue no.: 1-3, Page: 51-55) Bodlaender, HL Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Bondy, JA A weighted generalization of Turán's theorem. Authors: Bondy, JA; Tuza, ZS Date: 1997. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 25, Issue no.: 4, Page: 267-275) Boroviecki, M. Game list colouring of graphs. Authors: Boroviecki, M.; Sidorowicz, E.; Tuza, Zsolt Date: 2007. Published by: Electronic Journal of Combinatorics (Volume no.: 14, Issue no.: 1, Page: R26) Borowiecki, M Schütte's tournament problem and intersecting families of sets Authors: Borowiecki, M; Grytczuk, J; Haluszczak, M; Tuza, ZS Date: 2003. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 12, Issue no.: 4, Page: 359-364) Remarks on the existence of uniquely partitionable planar graphs. Authors: Borowiecki, M; Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 19, Issue no.: 2, Page: 159-166) Bujtás, Cs Mixed colorings of hypergraphs Authors: Bujtás, Cs; Tuza, Zsolt Date: 2006. Published by: Electronic Notes in Discrete Mathematics (Volume no.: 24, Page: 273-275) Bujtás, Cs. Color-bounded hypergraphs, V: Host graphs and subdivisions. Authors: Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2011. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 31, Issue no.: 2, Page: 223-238.) Combinatorial batch codes: extremal problems under Hall-type conditions. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Electronic Notes in Discrete Mathematics (Volume no.: 38, Page: 201-206.) Maximum number of colors: C-coloring and related problems. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Journal of Geometry (Volume no.: 101, Page: 83-97.) Optimal combinatorial batch codes derived from dual systems. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Miskolc Mathematical Notes (Volume no.: 12, Issue no.: 1, Page: 11-23.) Optimal batch codes: many items or low retrieval requirement. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Advances in Mathematics of Communications (Volume no.: 5, Issue no.: 3, Page: 529-541.) Improper C-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Pushpalatha, L.; Vasundhara, R.C. Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 174-186.) The graph-bin packing problem. Authors: Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zsolt Date: 2011. Published by: International Journal of Foundations of Computer Science (Volume no.: 22, Issue no.: 8, Page: 1971-1993.) Voloshin's conjecture for C-perfect hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Australasian Journal of Combinatorics (Volume no.: 48, Page: 253-267.) 3-consecutive c-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Subramanya, M. S.; Dominic, Ch. Date: 2010. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 30, Issue no.: 3, Page: 393-405.) C-perfect hypergraphs. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 2, Page: 132-149.) Color-bounded hypergraphs, IV: stable colorings of hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 9, Page: 1463-1474.) Smallest set-transversals of k-partitions. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Graphs and Combinatorics (Volume no.: 25, Issue no.: 6, Page: 807-816.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2010. Published by: Advances in discrete mathematics and applications. Mysore, 2008. (Ramanujan Mathematical Society lecture notes series 13.) (Page: 45-57.) Coloring intervals with four types of constraints. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: 6th Japanese-Hungarian symposium on discrete mathematics and its applications. Budapest, 2009. (Page: 393-401.) Download article: [pdf] Color-bounded hypergraphs, II: interval hypergraphs and hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 6391-6401.) Color-bounded hypergraphs, I: general results. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 4890-4902.) Orderings of uniquely colorable hypergraphs. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 11, Page: 1395-1407.) Color-bounded hyper-graphs, III: Model comparison. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2007. Published by: Applicable Analysis and Discrete Mathematics (Volume no.: 1, Issue no.: 1, Page: 36-55.) Bujtás, Csilla Uniform mixed hypergraphs: the possible numbers of colors. Authors: Bujtás, Csilla; Tuza, Zsolt Date: 2008. Published by: Graphs and Combinatorics (Volume no.: 24, Issue no.: 1, Page: 1-12.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: ICDM 2008. International conference on discrete mathematics. Mysore, 2008. (Page: 67-78.) Bylka, S Maximum cuts: improvementsand local algorithmic analogues of the Edwards-Erdős inequality. Authors: Bylka, S; Idzik, A; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 194, Issue no.: 1-3, Page: 39-58) Bérces, M A temporal extension of the spatial relational model PLA and some interoperability problems Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, Zsolt Editor: Elmenreich, W Date: 2005. Published by: Intelligent systems at the service of mankind. Vol. 2. (Page: 41-52) On the Interoperability problems of the spatiotemporal relational model, PLAT Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Computational Cybernetics. Proceedings of the 2nd IEEE international conference ICCC 2004, Vienna (Page: 415-420) A temporal extension of a spatial relational model Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Intelligent Engineering Systems. Proceedings of the IEEE international conference INES 2004, Cluj-Napoca (Page: 585-589) Bíró, M Cross fertilisation of graph theory and aircraft maintenance Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: AGIFORS thirty-second annual symposium. Airline Group of the International Federation of Operational Research Societies. Budapest, 1992 (Page: 307-318) Precoloring extension I. Interval graphs Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 100, Issue no.: 1-3, Page: 267-279) Böhme, Th. Learning of winning strategies for terminal games with linear-size memory. Authors: Böhme, Th.; Göring, F.; Tuza, Zsolt; Unger, H. Date: 2009. Published by: International Journal of Game Theory (Volume no.: 38, Page: 155-168.) Caro, Y On k-local and k-mean colorings of graphs and hypergraphs Authors: Caro, Y; Tuza, ZS Date: 1993. Published by: QUARTERLY JOURNAL OF MATHEMATICS (Volume no.: 44, Issue no.: 2, Page: 385-398) Bounded degrees and prescribed distances in graphs Authors: Caro, Y; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 111, Issue no.: 1-3, Page: 87-93) Caro, Yair On rainbow connection. Authors: Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael Date: 2008. Published by: Electronic Journal of Combinatorics (Volume no.: 15, Issue no.: 1, Page: #R57) Chang, GJ Algorithmic aspects of neighborhood numbers Authors: Chang, GJ; Farber, M; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 6, Issue no.: 1, Page: 24-29) Chartrand, G. A note on graphs with prescribed complete coloring numbers. Authors: Chartrand, G.; Okamoto, F.; Tuza, Zsolt; Zhang, P. Date: 2010. Published by: Journal of Combinatorial Mathematics and Combinatorial Computing (Volume no.: 73, Page: 77-84.) Chou, WS Paths through fixed vertices in edge-colored graphs Authors: Chou, WS; Manoussakis, Y; Megalalaki, O; Spyratos, M; Tuza, ZS Date: 1994. Published by: MATHEMATIQUES INFORMATIQUE ET SCIENCES HUMAINES (Volume no.: 32, Issue no.: 127, Page: 49-58) Clark, LH Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Couetoux, B. Complexity and approximation of the constrained forest problem. Authors: Bazgan, C.; Couetoux, B.; Tuza, Zsolt Date: 2011. Published by: Theoretical Computer Science (Volume no.: 412, Page: 4081-4091.) Couëtoux, B. Covering a graph with a constrained forest (extended abstract). Authors: Bazgan, C.; Couëtoux, B.; Tuza, Zsolt Date: 2009. 12. 16. Published by: ISAAC 2009. Algorithms and computation. 20th international symposium. Honolulu, 2009. (Lecture notes in computer science 5878.) (Page: 892-901.) Crull, B The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Cundiff, T The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Dell'olmo, P A 13/12 approximation algorithm for bin packing with extendable bins. Authors: Dell'olmo, P; Kellerer, H; Speranza, MG; Tuza, ZS Date: 1998. Published by: INFORMATION PROCESSING LETTERS (Volume no.: 65, Issue no.: 5, Page: 229-233) Efficiency and effectiveness of normal schedules on three dedicated processors. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 164, Page: 67-79) Comparability graph augmentation for some multiprocessor scheduling problems. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 72, Issue no.: 1-2, Page: 71-84) Deogun, JS Weighted edge-decompositions of graphs Authors: Deogun, JS; Tuza, Zs; Scott, SD; Li, L Date: 2005. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 53, Page: 197-208) Graph-theoretic methods and recent applications in computer science Authors: Deogun, JS; Tuza, Zs Date: 2005. Published by: Formal methods in computing. (Page: 55-96) Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Dominic, Ch. 3-consecutive c-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Subramanya, M. S.; Dominic, Ch. Date: 2010. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 30, Issue no.: 3, Page: 393-405.) Dominich, S Formal theory of connectionist web retrieval Authors: Dominich, S; Skrop, A; Tuza, Zsolt Editor: Herrera-Viedma, E Date: 2006. Published by: Soft computing in web information retrieval (Page: 163-194) Computational aspects of connectionist interaction information retrieval Authors: Dominich, S; Tuza, ZS Date: 2003. Published by: Mathematical/formal methods in information retrieval. 26th annual international ACM SIGIR conference. Toronto, 2003 (Page: 1-9) Dugat, V Construction of non-isomorphic regular tournaments Authors: Aistie-Vidal, A; Dugat, V; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 11-23) Dósa, Gy. Better bounds for the bin packing problem with the "Largest Item in the Bottom" constraint. Authors: Dósa, Gy.; Tuza, Zsolt; Ye, Deshi Editor: Brodnik, A.; Galambos, G. Date: 2011. Published by: MATCOS-10. Proceedings of the 2010 mini-conference on applied theoretical computer science. Koper, 2010. (Page: 65-68.) The graph-bin packing problem. Authors: Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zsolt Date: 2011. Published by: International Journal of Foundations of Computer Science (Volume no.: 22, Issue no.: 8, Page: 1971-1993.) Entringer, RC Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Erdős, P Ramsey-remainder. Authors: Erdős, P; Tuza, ZS; Valtr, P Date: 1996. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 17, Issue no.: 6, Page: 519-532) Covering and independence in triangle structures. Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 89-101) Vertex coverings of the edge set in a connected graph Authors: Erdős, P; Tuza, ZS Date: 1995. Published by: Graph theory, combinatorics, and applications. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs. Kalamazoo, 1992. Vol. 2. (Page: 1179-1187) Local and global average degree in graphs and multigraphs Authors: Bertram, E; Erdős, P; Horák, P; Sirán, J; Tuza, ZS Date: 1995. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 18, Issue no.: 7, Page: 647-661) Rainbow subgraphs in edge-colorings of complete graphs Authors: Erdős, P; Tuza, ZS Date: 1993. Published by: Quo vadis, graph theory? International conference on the future of graph theory. Fairbanks, 1990. (Annals of discrete mathematics 55.) (Page: 81-88) Small transversals in uniform hypergraphs Authors: Erdős, P; Fon der Flass, D; Kostochka, AV; Tuza, ZS Date: 1992. Published by: SIBERIAN ADVANCES IN MATHEMATICS (Volume no.: 2, Issue no.: 1, Page: 82-88) Covering the cliques of a graph with vertices Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 108, Issue no.: 1-3, Page: 279-289) Farber, M An upper bound on the number of cliques in a graph Authors: Farber, M; Hujter, M; Tuza, ZS Date: 1993. Published by: NETWORKS (Volume no.: 23, Issue no.: 3, Page: 207-210) Algorithmic aspects of neighborhood numbers Authors: Chang, GJ; Farber, M; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 6, Issue no.: 1, Page: 24-29) Feltman, P The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Fernandez de la Vega, W. Groupies in random graphs. Authors: Fernandez de la Vega, W.; Tuza, Zsolt Date: 2009. Published by: Information Processing Letters (Volume no.: 109, Page: 339-340.) Fon der Flass, D Small transversals in uniform hypergraphs Authors: Erdős, P; Fon der Flass, D; Kostochka, AV; Tuza, ZS Date: 1992. Published by: SIBERIAN ADVANCES IN MATHEMATICS (Volume no.: 2, Issue no.: 1, Page: 82-88) Fouquet, J-L On magnitude networks. Authors: Fouquet, J-L; Hahn, G; Tuza, ZS; Woodrow, RE Date: 1998. Published by: CONGRESSUS NUMERANTIUM (Volume no.: 133, Page: 75-84) Gallai, T Covering and independence in triangle structures. Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 89-101) Covering the cliques of a graph with vertices Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 108, Issue no.: 1-3, Page: 279-289) Gimbel, J Switching distance in graphs. Authors: Gimbel, J; Henning, MA; Tuza, ZS Date: 1997. Published by: ARS COMBINATORIA (Volume no.: 47, Page: 109-119) Gionfriddo, M The color cost of a caterpillar. Authors: Gionfriddo, M; Harary, F; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 174, Issue no.: 1-3, Page: 125-130) Solution to a problem of Speranza on Ms-colourings of directed graphs Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA (Volume no.: 8, Issue no.: 7, Page: 283-286) On conjectures of Berge and Chvátal Authors: Gionfriddo, M; Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 124, Issue no.: 1-3, Page: 79-86) Blocking sets in SQS (2v) Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 3, Page: 77-86) Gnuyen, VN 4-chroamatic graphs with large odd girth Authors: Gnuyen, VN; Tuza, ZS Date: 1995. Published by: DISCRETE MATHEMATICS (Volume no.: 138, Issue no.: 1-3, Page: 387-392) Grytczuk, J Schütte's tournament problem and intersecting families of sets Authors: Borowiecki, M; Grytczuk, J; Haluszczak, M; Tuza, ZS Date: 2003. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 12, Issue no.: 4, Page: 359-364) Göring, F On short cycles through prescribed vertices of a graph Authors: Göring, F; Harant, J; Hexel, E; Tuza, ZS Date: 2004. Published by: DISCRETE MATHEMATICS (Volume no.: 286, Page: 67-74) Göring, F. Learning of winning strategies for terminal games with linear-size memory. Authors: Böhme, Th.; Göring, F.; Tuza, Zsolt; Unger, H. Date: 2009. Published by: International Journal of Game Theory (Volume no.: 38, Page: 155-168.) Hahn, G On magnitude networks. Authors: Fouquet, J-L; Hahn, G; Tuza, ZS; Woodrow, RE Date: 1998. Published by: CONGRESSUS NUMERANTIUM (Volume no.: 133, Page: 75-84) Haluszczak, M Schütte's tournament problem and intersecting families of sets Authors: Borowiecki, M; Grytczuk, J; Haluszczak, M; Tuza, ZS Date: 2003. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 12, Issue no.: 4, Page: 359-364) Hangos, Katalin Some complexity problems on single input double output controllers. Authors: Hangos, Katalin; Tuza, Zsolt; Yeo, A. Date: 2009. Published by: Discrete Applied Mathematics (Volume no.: 157, Issue no.: 5, Page: 1146-1158.) Hangos, KM The effect of model simplification assumptions on the differential index of lumped process models Authors: Hangos, KM; Szederkényi, G; Tuza, ZS Date: 2004. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 28, Page: 129-137) Structure simplification of dynamic process models Authors: Leitold, A; Hangos, KM; Tuza, ZS Date: 2002. Published by: JOURNAL OF PROCESS CONTROL (Volume no.: 12, Page: 69-83) The effect of modelling assumptions on the differential index of lumped process models. Authors: Tuza, ZS; Szederkényi, G; Hangos, KM Date: 2002. Published by: European symposium on computer aided process engineering - 12. (Computer-aided chemical engineering 10) (Page: 979-984) Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) Authors: Hangos, KM; Tuza, ZS; Yeo, A Date: 2001. Published by: Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) (Page: 27) Optimal control structure selection for process systems. Authors: Hangos, KM; Tuza, ZS Date: 2001. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 25, Page: 1521-1536) Process model structure simplification. Authors: Hangos, KM; Tuza, ZS Date: 1999. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 23, Issue no.: Suppl., Page: S 343-S 346) Process structure driven control structure selection. Authors: Hangos, KM; Tuza, ZS Date: 1996. Published by: Preprints of the 13th world congress of International Federation of Automatic Control. San Francisco, 1996. Vol. M. Chemical process control, mineral, metal, mining. (Page: 187-192) Computational aspects of graph theoretic methods in control. Authors: Hangos, KM; Tuza, ZS Date: 1996. Published by: Preprints of the second European IEEE workshop on computer-intensive methods in control and signal processing. CMP'96. Prague, 1996. (Page: 25-36) Harant, J On short cycles through prescribed vertices of a graph Authors: Göring, F; Harant, J; Hexel, E; Tuza, ZS Date: 2004. Published by: DISCRETE MATHEMATICS (Volume no.: 286, Page: 67-74) Harary, F The color cost of a caterpillar. Authors: Gionfriddo, M; Harary, F; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 174, Issue no.: 1-3, Page: 125-130) Two graph-colouring games Authors: Harary, F; Tuza, ZS Date: 1993. Published by: BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY (Volume no.: 48, Issue no.: 1, Page: 141-149) Hell, P Packing problems in edge-colored graphs Authors: Hell, P; Mannoussakis, Y; Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 52, Page: 295-306) Henning, MA Switching distance in graphs. Authors: Gimbel, J; Henning, MA; Tuza, ZS Date: 1997. Published by: ARS COMBINATORIA (Volume no.: 47, Page: 109-119) Hexel, E On short cycles through prescribed vertices of a graph Authors: Göring, F; Harant, J; Hexel, E; Tuza, ZS Date: 2004. Published by: DISCRETE MATHEMATICS (Volume no.: 286, Page: 67-74) Hornák, M. On-line arbitrarily vertex decomposable trees. Authors: Hornák, M.; Tuza, Zsolt; Wozniak, M. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 11, Page: 1420-1429.) Horák, P Local and global average degree in graphs and multigraphs Authors: Bertram, E; Erdős, P; Horák, P; Sirán, J; Tuza, ZS Date: 1995. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 18, Issue no.: 7, Page: 647-661) Large s-representable set systems with low maximum degree Authors: Horák, P; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 122, Issue no.: 1-3, Page: 205-217) Hujter, M Sharpness of some intersection theorems. Authors: Hujter, M; Spissich, L; Tuza, ZS Date: 2000. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 21, Issue no.: 7, Page: 913-916) Precoloring extension III. Classes of perfect graphs. Authors: Hujter, M; Tuza, ZS Date: 1996. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 5, Issue no.: 1, Page: 35-56) Precoloring extension. II. Graph classes related to perfect graphs Authors: Hujter, M; Tuza, ZS Date: 1993. Published by: ACTA MATHEMATICAE UNIVERSITATIS COMENIANAE (Volume no.: 62, Issue no.: 1, Page: 1-11) The number of maximal independent sets in triangle-free graphs Authors: Hujter, M; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 6, Issue no.: 2, Page: 284-288) An upper bound on the number of cliques in a graph Authors: Farber, M; Hujter, M; Tuza, ZS Date: 1993. Published by: NETWORKS (Volume no.: 23, Issue no.: 3, Page: 207-210) Graphs with no induced C4 and 2K2 Authors: Blázsik, Z; Hujter, M; Pluhár, A; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 115, Issue no.: 1-3, Page: 51-55) Cross fertilisation of graph theory and aircraft maintenance Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: AGIFORS thirty-second annual symposium. Airline Group of the International Federation of Operational Research Societies. Budapest, 1992 (Page: 307-318) Precoloring extension I. Interval graphs Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 100, Issue no.: 1-3, Page: 267-279) Hurlbert, GH The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Idzik, A Heredity properties of connectedness in edge-coloured complete graphs. Authors: Idzik, A; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 235, Issue no.: 1-3, Page: 306-301) Maximum cuts: improvementsand local algorithmic analogues of the Edwards-Erdős inequality. Authors: Bylka, S; Idzik, A; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 194, Issue no.: 1-3, Page: 39-58) Imreh, Cs. The graph-bin packing problem. Authors: Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zsolt Date: 2011. Published by: International Journal of Foundations of Computer Science (Volume no.: 22, Issue no.: 8, Page: 1971-1993.) Jang, T Chromatic spectrum is broken. Authors: Jang, T; Mubayi, D; Tuza, ZS; Voloshin, VI; West, D Date: 1999. Published by: 6th Twente workshop on graphs and combinatorial optimization. Preprint. Enschede, 1999. (Page: 94-97) Jansen, K Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Jendrol', S On light cycles in plane triangulations. Authors: Jendrol', S; Madaras, T; Soták, R; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 197-198, Page: 453-467) Jendrol, S The irregularity strength and cost of the union of cliques. Authors: Jendrol, S; Tkác, M; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 179-186) Jiang, T The chromatic spectrum of mixed hypergraphs. Authors: Jiang, T; Mubayi, D; Tuza, ZS; Voloshin, V; West, DB Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 18, Issue no.: 2, Page: 309-318) Jipsen, P Small representations of the relation algebra En+1(1,2,3) Authors: Jipsen, P; Maddux, RD; Tuza, ZS Date: 1995. Published by: ALGEBRA UNIVERSALIS (Volume no.: 33, Issue no.: 1, Page: 136-139) Jose, B. K. Hypergraph domination and strong independence. Authors: Jose, B. K.; Tuza, Zsolt Date: 2009. Published by: Applicable Analysis and Discrete Mathematics (Volume no.: 3, Page: 347-358.) Jung, H. A. Infinite versus finite graph domination. Authors: Bacsó, Gábor; Jung, H. A.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 9, Page: 1495-1500.) Kellerer, H A 13/12 approximation algorithm for bin packing with extendable bins. Authors: Dell'olmo, P; Kellerer, H; Speranza, MG; Tuza, ZS Date: 1998. Published by: INFORMATION PROCESSING LETTERS (Volume no.: 65, Issue no.: 5, Page: 229-233) Semi on-line algorithms for the partition problem. Authors: Kellerer, H; Kotov, V; Speranza, MG; Tuza, ZS Date: 1997. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 21, Issue no.: 5, Page: 235-242) Keszler, Anita Graph based solution for segmentation tasks in case of out-of-focus, noisy and corrupted images. Authors: Keszler, Anita; Szirányi, Tamás; Tuza, Zsolt Department: Distributed Events Analysis Research Group Date: 2011. Published by: IMAGAPP & IVAPP 2011. - Proceedings of the international conference on imaging theory and applications and international conference on information visualization theory and applications. Vilamoura, Algarve, 2011. (Page: 100-105.) Kierstead, H Marking games and the oriented game chromatic number of partial k-trees Authors: Kierstead, H; Tuza, ZS Date: 2003. Published by: GRAPHS AND COMBINATORICS (Volume no.: 19, Issue no.: 1, Page: 121-129) Kloks, T Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Kohl, A List version of L(d,s)-labelings Authors: Kohl, A; Schreyer, J; Tuza, Zs; Voigt, M Date: 2005. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 349, Page: 92-98) Kornai, A Narrowness, pathwidth and their application in natural language processing Authors: Kornai, A; Tuza, ZS Date: 1992. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 36, Issue no.: 1, Page: 87-92) Kostochka, AV Small transversals in uniform hypergraphs Authors: Erdős, P; Fon der Flass, D; Kostochka, AV; Tuza, ZS Date: 1992. Published by: SIBERIAN ADVANCES IN MATHEMATICS (Volume no.: 2, Issue no.: 1, Page: 82-88) Kotov, V Semi on-line algorithms for the partition problem. Authors: Kellerer, H; Kotov, V; Speranza, MG; Tuza, ZS Date: 1997. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 21, Issue no.: 5, Page: 235-242) Kratochvil, J Intersection dimensions of graph classes Authors: Kratochvil, J; Tuza, ZS Date: 1994. Published by: GRAPHS AND COMBINATORICS (Volume no.: 10, Issue no.: 2, Page: 159-168) Algorithmic complexity of list colorings Authors: Kratochvil, J; Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 50, Issue no.: 3, Page: 297-302) Kratochvíl, J On the complexity of bicoloring clique hypergraphs of graphs. Authors: Kratochvíl, J; Tuza, ZS Date: 2002. Published by: JOURNAL OF ALGORITHMS (Volume no.: 45, Issue no.: 1, Page: 40-54) Complexity of coloring graphs without forbidden induced subgraphs. Authors: Král, D; Kratochvíl, J; Tuza, ZS; Woegiger, G Date: 2001. Published by: Graph-theoretic concepts in computer science. 27th international workshop. WG 2001 Boltenhagen, 2001. Proceedings. ( Lecture notes in computer science 2204.) (Page: 254-262) On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract). Authors: Kratochvíl, J; Tuza, Z Date: 2000. Published by: Proceedings of the eleventh annual ACM-SIAM Symposium on discrete algorithms. San Francisco, 2000. (Page: 40-41) Rankings of directed graphs. Authors: Kratochvíl, J; Tuza, ZS Date: 1999. Published by: Graph-theoretical concepts of computer science. 24th international workshop, WG'98. Proceedings. Smolenice, 1998. (Lecture notes in computer science, 1517.) (Page: 114-123) New trends in the theory of graph colorings: Choosability and list colorings. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1999. Published by: Contemporary trends in discrete mathematics: from DIMACS and DIMATIA to the future. (DIMACS series in discrete mathematics and theoretical computer science, 49.) (Page: 183-197) Complexity of choosing subsets from color sets. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: DISCRETE MATHEMATICS (Volume no.: 191, Issue no.: 1-3, Page: 139-148) Brooks-type theorems for choosability with separation. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 27, Issue no.: 1, Page: 43-49) One more occurrence of variables makes satisfiability jump from trivial to NP-complete Authors: Kratochvíl, J; Savicky, P; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON COMPUTING (Volume no.: 22, Issue no.: 1, Page: 203-210) Kratovchíl, J Rankings of directed graphs. Authors: Kratovchíl, J; Tuza, ZS Date: 1999. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 12, Issue no.: 3, Page: 374-384) Kratsch, D Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Král, D Complexity of coloring graphs without forbidden induced subgraphs. Authors: Král, D; Kratochvíl, J; Tuza, ZS; Woegiger, G Date: 2001. Published by: Graph-theoretic concepts in computer science. 27th international workshop. WG 2001 Boltenhagen, 2001. Proceedings. ( Lecture notes in computer science 2204.) (Page: 254-262) Kéri, Gerzson Egy minimax probléma halmazrendszerekre Authors: Kéri, Gerzson; Tuza, Zsolt Date: 2006. Published by: Matematikai Lapok (Volume no.: 12 (2004-2005), Issue no.: 1, Page: 20-30) Download article: [pdf] Körner, J Perfect couples of graphs Authors: Körner, J; Simonyi, G; Tuza, ZS Date: 1992. Published by: COMBINATORICA (Volume no.: 12, Issue no.: 2, Page: 179-192) Lee, A Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Authors: Lee, A; Révész, G; Szigeti, J; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 230, Issue no.: 1-3, Page: 49-61) Leitold, A Structure simplification of dynamic process models Authors: Leitold, A; Hangos, KM; Tuza, ZS Date: 2002. Published by: JOURNAL OF PROCESS CONTROL (Volume no.: 12, Page: 69-83) Lev, Arie On rainbow connection. Authors: Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael Date: 2008. Published by: Electronic Journal of Combinatorics (Volume no.: 15, Issue no.: 1, Page: #R57) Li, L Weighted edge-decompositions of graphs Authors: Deogun, JS; Tuza, Zs; Scott, SD; Li, L Date: 2005. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 53, Page: 197-208) Lindenmayer, A Locally generated colourings of hexagonal cell division patterns: application to retinal cell differentiation Authors: Tuza, ZS; Lindenmayer, A Date: 1992. Published by: Lindenmayer systems. Impacts on theoretical computer science, computer graphics and developmental biology (Page: 333-350) Ludányi, Z A temporal extension of the spatial relational model PLA and some interoperability problems Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, Zsolt Editor: Elmenreich, W Date: 2005. Published by: Intelligent systems at the service of mankind. Vol. 2. (Page: 41-52) On the Interoperability problems of the spatiotemporal relational model, PLAT Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Computational Cybernetics. Proceedings of the 2nd IEEE international conference ICCC 2004, Vienna (Page: 415-420) A temporal extension of a spatial relational model Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Intelligent Engineering Systems. Proceedings of the IEEE international conference INES 2004, Cluj-Napoca (Page: 585-589) Madaras, T On light cycles in plane triangulations. Authors: Jendrol', S; Madaras, T; Soták, R; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 197-198, Page: 453-467) Maddux, RD Small representations of the relation algebra En+1(1,2,3) Authors: Jipsen, P; Maddux, RD; Tuza, ZS Date: 1995. Published by: ALGEBRA UNIVERSALIS (Volume no.: 33, Issue no.: 1, Page: 136-139) Mannoussakis, Y Packing problems in edge-colored graphs Authors: Hell, P; Mannoussakis, Y; Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 52, Page: 295-306) Manoussakis, Y Ramsey numbers for tournaments. Authors: Manoussakis, Y; Tuza, ZS Date: 2001. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 263, Issue no.: 1-2, Page: 75-85) A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Authors: Amoura, AK; Bampis, E; Manoussakis, Y; Tuza, ZS Date: 1999. Published by: PARALLEL COMPUTING (Volume no.: 25, Issue no.: 1, Page: 49-61) Optimal routings in communication networks with linearly bounded forwarding index. Authors: Manoussakis, Y; Tuza, ZS Date: 1996. Published by: NETWORKS (Volume no.: 28, Page: 177-180) Minimal colorings for properly colored subgraphs. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS; Voigt, M Date: 1996. Published by: GRAPHS AND COMBINATORICS (Volume no.: 12, Issue no.: 4, Page: 345-360) Cycles of given color patterns. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS Date: 1996. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 21, Issue no.: 2, Page: 153-162) The forwarding index of directed networks. Authors: Manoussakis, Y; Tuza, ZS Date: 1996. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 68, Issue no.: 3, Page: 279-291) Paths through fixed vertices in edge-colored graphs Authors: Chou, WS; Manoussakis, Y; Megalalaki, O; Spyratos, M; Tuza, ZS Date: 1994. Published by: MATHEMATIQUES INFORMATIQUE ET SCIENCES HUMAINES (Volume no.: 32, Issue no.: 127, Page: 49-58) Mansini, R Scheduling groups of tasks with precedence constraints on three dedicated processors Authors: Mansini, R; Spernaza, MG; Tuza, ZS Date: 2004. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 134, Page: 141-168) Matos Camacho, S. Approximation algorithms for the minimum rainbow subgraph problem. Authors: Matos Camacho, S.; Schiermeyer, I.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 20, Page: 2666-2670.) Megalalaki, O Paths through fixed vertices in edge-colored graphs Authors: Chou, WS; Manoussakis, Y; Megalalaki, O; Spyratos, M; Tuza, ZS Date: 1994. Published by: MATHEMATIQUES INFORMATIQUE ET SCIENCES HUMAINES (Volume no.: 32, Issue no.: 127, Page: 49-58) Michalak, D Dominating bipartite subgraphs in graphs Authors: Bacsó, G; Michalak, D; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 85-94) Mihók, P Fractional P-colourings and P-choice-ratio. Authors: Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS (Volume no.: 18, Page: 69-77) Remarks on the existence of uniquely partitionable planar graphs. Authors: Borowiecki, M; Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 19, Issue no.: 2, Page: 159-166) Milazzo, L Strict colourings for classes of steiner triple systems. Authors: Milazzo, L; Tuza, ZS Date: 1998. Published by: DISCRETE MATHEMATICS (Volume no.: 182, Issue no.: 1-3, Page: 233-243) Upper chromatic number of Steiner triple and quadruple systems. Authors: Milazzo, L; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 174, Issue no.: 1-3, Page: 247-259) Milazzo, L. Logarithmic upper bound for the upper chromatic number of S(t,t+1,v) systems Authors: Milazzo, L.; Tuza, Zsolt Date: 2009. Published by: Ars Combinatoria (Volume no.: 92, Page: 213-223.) A class of Steiner systems S(2,4,v) with arcs of extremal size. Authors: Milazzo, L.; Tuza, Zsolt Date: 2007. Published by: Tatra Mountains Mathematical Publications (Volume no.: 36, Page: 153-162.) Milazzo, M Strict colorings of Steiner triple and quadruple systems Authors: Milazzo, M; Tuza, ZS; Voloshin, V Date: 2003. Published by: DISCRETE MATHEMATICS (Volume no.: 261, Issue no.: 1-3, Page: 399-411) Milici, S Disjoint blocking sets in cycle systems. Authors: Milici, S; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 208-209, Page: 451-462) Cycle systems without 2-colorings. Authors: Milici, S; Tuza, ZS Date: 1996. Published by: JOURNAL OF COMBINATORIAL DESIGNS (Volume no.: 4, Issue no.: 2, Page: 135-142) Coverable graphs Authors: Milici, S; Tuza, ZS Date: 1995. Published by: STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA (Volume no.: 30, Issue no.: 4, Page: 329-344) The spectrum of [lambda]-times repeated blocks for TS([upsilon], [lambda]) Authors: Milici, S; Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 129, Issue no.: 1-3, Page: 159-166) Solution to a problem of Speranza on Ms-colourings of directed graphs Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA (Volume no.: 8, Issue no.: 7, Page: 283-286) Blocking sets in SQS (2v) Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 3, Page: 77-86) Mubayi, D The chromatic spectrum of mixed hypergraphs. Authors: Jiang, T; Mubayi, D; Tuza, ZS; Voloshin, V; West, DB Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 18, Issue no.: 2, Page: 309-318) Chromatic spectrum is broken. Authors: Jang, T; Mubayi, D; Tuza, ZS; Voloshin, VI; West, D Date: 1999. Published by: 6th Twente workshop on graphs and combinatorial optimization. Preprint. Enschede, 1999. (Page: 94-97) Muller, H Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Müller, H Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) Nagy, The on-line multiprocessor scheduling problem with known sum of the tasks Authors: Angelelli, E; Nagy, ; Spernaza, MG; Tuza, ZS Date: 2004. Published by: JOURNAL OF SCHEDULING (Volume no.: 7, Page: 421-428) Nagy-György, J. The graph-bin packing problem. Authors: Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zsolt Date: 2011. Published by: International Journal of Foundations of Computer Science (Volume no.: 22, Issue no.: 8, Page: 1971-1993.) Nguyen, VN Linear-time approximation algorithms for the max cut problem Authors: Nguyen, VN; Tuza, ZS Date: 1993. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 2, Page: 201-210) Novák, AB Spatiotemporal database models for attracting students to research Authors: Novák, AB; Revesz, P; Tuza, ZS Date: 2003. Published by: International Conference in memoriam John von Neumann. Proceedings. Budapest, 2003 (Page: 247-256) Discovering spanning trees in a spatial relational model Authors: Novák, AB; Ronkay, ZS; Tuza, ZS Date: 2003. Published by: 7th IEEE conference on computational complexity, ICCC 2003. Siófok (Page: 43-46) Constructing Hamiltonian paths of some special graphs, using a relational spatial database model Authors: Novák, AB; Tuza, ZS Date: 2003. Published by: Proceedings of the 7th IEEE International Conference on Intelligent Engineering Systems, INES 2003 Assuit-Luxor (Page: 357-361) Representing directed and weighted graphs and their properties in a relational spatial database model. Authors: Novák, AB; Tuza, ZS Date: 2002. Published by: INES 2002. 6th international conference on intelligent engineering systems. Proceedings. Opatija (Page: 357-361) Novák, Á. B. Extending the spatial relational model PLA to represent trees. Authors: Novák, Á. B.; Tuza, Zsolt Editor: Machado, J.A.T.; Pátkai, B.; Rudas, I.J. Date: 2009. Published by: Intelligent engineering systems and computational cybernetics. (Page: 355-364.) Novák, ÁB A temporal extension of the spatial relational model PLA and some interoperability problems Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, Zsolt Editor: Elmenreich, W Date: 2005. Published by: Intelligent systems at the service of mankind. Vol. 2. (Page: 41-52) A method to represent restricted classes of planar graphs in the enhanced spatial relational model PLA, based on Hahn graphs Authors: Novák, ÁB; Tuza, Zsolt Date: 2006. Published by: INES 2006. 10th international conference on intelligent engineering systems. London, 2006. (Page: 118-122) Reconstruction of planar graphs from their centered triangulations in some spatio-relational models Authors: Novák, ÁB; Tuza, Zs Date: 2005. Published by: ICCC 2005. IEEE 3rd international conference on computational cybernetics. Proceedings. Mauritius, 2005. (Page: 181-185) Combining spatial and topological data in a spatiotemporal relational model Authors: Novák, ÁB; Tuza, Zs Date: 2005. Published by: INES 2005. IEEE 9th international confenrence on intelligent engineering systems. Cruising on Mediterranean Sea, 2005. (Page: 173-177) On the Interoperability problems of the spatiotemporal relational model, PLAT Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Computational Cybernetics. Proceedings of the 2nd IEEE international conference ICCC 2004, Vienna (Page: 415-420) A temporal extension of a spatial relational model Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Intelligent Engineering Systems. Proceedings of the IEEE international conference INES 2004, Cluj-Napoca (Page: 585-589) Reconstruction graphs and testing their properties in a relational spatial database. Authors: Novák, ÁB; Tuza, ZS Date: 2002. Published by: COMPUTERS & MATHEMATICS WITH APPLICATIONS (Volume no.: 43, Issue no.: 10-11, Page: 1391-1406) Representation, constraints and complexity of graphs in the PLA spatial database model. Authors: Novák, ÁB; Tuza, ZS Date: 1999. Published by: Bánki Donát Polytechnic 1879-1999. Jubilee international conference. Proceedings. Budapest, 1999. (Page: 57-60) Objects reconstruction and its complexity problems in the PLA spatial database model. Authors: Novák, ÁB; Tuza, ZS Date: 1999. Published by: INES '99. 1999 IEEE international conference on intelligent engineering systems. Proceedings. Poprad, 1999. (Page: 219-223) Okamoto, F. A note on graphs with prescribed complete coloring numbers. Authors: Chartrand, G.; Okamoto, F.; Tuza, Zsolt; Zhang, P. Date: 2010. Published by: Journal of Combinatorial Mathematics and Combinatorial Computing (Volume no.: 73, Page: 77-84.) Pluhár, A Graphs with no induced C4 and 2K2 Authors: Blázsik, Z; Hujter, M; Pluhár, A; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 115, Issue no.: 1-3, Page: 51-55) Poljak, S Maximum cuts and large bipartite subgraphs Authors: Poljak, S; Tuza, ZS Date: 1995. Published by: Combinatorial optimization. (DIMACS series in discrete mathematics and theoretical computer science 20.) (Page: 181-244) The expected relative error of the polyhedral approximation of the max-cut problem Authors: Poljak, S; Tuza, ZS Date: 1994. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 16, Issue no.: 4, Page: 191-198) Bipartite subgraphs of triangle-free graphs Authors: Poljak, S; Tuza, ZS Date: 1994. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 7, Issue no.: 2, Page: 307-313) The Max-Cut problem - a survey Authors: Poljak, S; Tuza, ZS Date: 1993. Published by: The Max-Cut problem - a survey (Page: 91) Porter, TD Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Pudwell, L The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Pushpalatha, L. Improper C-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Pushpalatha, L.; Vasundhara, R.C. Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 174-186.) Pyber, L Menger-type theorems with restrictions on path lengths Authors: Pyber, L; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 120, Issue no.: 1-3, Page: 161-174) Quattrocchi, G Partition of C4-designs into minimum and maximum number of P3-designs Authors: Quattrocchi, G; Tuza, ZS Date: 2004. Published by: GRAPHS AND COMBINATORICS (Volume no.: 20, Issue no.: 4, Page: 531-540) Radosavljevic, Z Complementary pairs of graphs orientable to line digraphs Authors: Radosavljevic, Z; Simic, S; Tuza, ZS Date: 1993. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 13, Page: 65-75) Revesz, P Spatiotemporal database models for attracting students to research Authors: Novák, AB; Revesz, P; Tuza, ZS Date: 2003. Published by: International Conference in memoriam John von Neumann. Proceedings. Budapest, 2003 (Page: 247-256) Roditty, Yehuda On rainbow connection. Authors: Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael Date: 2008. Published by: Electronic Journal of Combinatorics (Volume no.: 15, Issue no.: 1, Page: #R57) Ronkay, ZS Discovering spanning trees in a spatial relational model Authors: Novák, AB; Ronkay, ZS; Tuza, ZS Date: 2003. Published by: 7th IEEE conference on computational complexity, ICCC 2003. Siófok (Page: 43-46) Rousseau, C Some hypergraph questions suggested by a Nordic Olympiad problem. Authors: Rousseau, C; Tuza, ZS Date: 1996. Published by: THE JOURNAL of COMBINATORIAL MATHEMATICS and COMBINATORIAL COMPUTING (Volume no.: 22, Page: 183-192) Ruzsa, IZ Distance graphs with finite chromatic number. Authors: Ruzsa, IZ; Tuza, ZS; Voigt, M Date: 2002. Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 85, Issue no.: 1, Page: 181-187) Révész, G Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Authors: Lee, A; Révész, G; Szigeti, J; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 230, Issue no.: 1-3, Page: 49-61) Eulerian polynomial identities on matrix rings Authors: Szigeti, J; Tuza, ZS; Révész, G Date: 1993. Published by: JOURNAL OF ALGEBRA (Volume no.: 161, Issue no.: 1, Page: 90-101) Rödl, V Rainbow subgraphs in properly edge-colored graphs Authors: Rödl, V; Tuza, ZS Date: 1992. Published by: RANDOM STRUCTURES & ALGORITHMS (Volume no.: 3, Issue no.: 2, Page: 175-182) Sampathkumar, E. Improper C-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Pushpalatha, L.; Vasundhara, R.C. Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 174-186.) 3-consecutive c-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Subramanya, M. S.; Dominic, Ch. Date: 2010. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 30, Issue no.: 3, Page: 393-405.) Santha, M Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 2002. Published by: JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Volume no.: 64, Issue no.: 2, Page: 160-170) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1999. Published by: JOURNAL OF ALGORITHMS (Volume no.: 31, Issue no.: 1, Page: 249-268) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: STACS 98. 15th annual symposium on theoretical aspects of computer science. Proceedings. Paris, 1998. (Lecture notes in computer science, 1373.) (Page: 276-286) Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: Automata, languages and programming. (Lecture notes in computer science, 1443.) (Page: 387-396) Savicky, P One more occurrence of variables makes satisfiability jump from trivial to NP-complete Authors: Kratochvíl, J; Savicky, P; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON COMPUTING (Volume no.: 22, Issue no.: 1, Page: 203-210) Schiermeyer, I On-line rankings of graphs. Authors: Schiermeyer, I; Tuza, ZS; Voigt, M Date: 2000. Published by: DISCRETE MATHEMATICS (Volume no.: 212, Issue no.: 1-2, Page: 141-147) Schiermeyer, I. Approximation algorithms for the minimum rainbow subgraph problem. Authors: Matos Camacho, S.; Schiermeyer, I.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 20, Page: 2666-2670.) Schreyer, J List version of L(d,s)-labelings Authors: Kohl, A; Schreyer, J; Tuza, Zs; Voigt, M Date: 2005. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 349, Page: 92-98) Scott, SD Weighted edge-decompositions of graphs Authors: Deogun, JS; Tuza, Zs; Scott, SD; Li, L Date: 2005. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 53, Page: 197-208) Sidorowicz, E. Game list colouring of graphs. Authors: Boroviecki, M.; Sidorowicz, E.; Tuza, Zsolt Date: 2007. Published by: Electronic Journal of Combinatorics (Volume no.: 14, Issue no.: 1, Page: R26) Simic, S Complementary pairs of graphs orientable to line digraphs Authors: Radosavljevic, Z; Simic, S; Tuza, ZS Date: 1993. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 13, Page: 65-75) Simonyi, G Perfect couples of graphs Authors: Körner, J; Simonyi, G; Tuza, ZS Date: 1992. Published by: COMBINATORICA (Volume no.: 12, Issue no.: 2, Page: 179-192) Sirán, J Local and global average degree in graphs and multigraphs Authors: Bertram, E; Erdős, P; Horák, P; Sirán, J; Tuza, ZS Date: 1995. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 18, Issue no.: 7, Page: 647-661) Nearly uniform distribution of edges among k-subgraphs of a graph Authors: Sirán, J; Tuza, ZS Date: 1992. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 16, Issue no.: 6, Page: 591-604) Skrop, A Formal theory of connectionist web retrieval Authors: Dominich, S; Skrop, A; Tuza, Zsolt Editor: Herrera-Viedma, E Date: 2006. Published by: Soft computing in web information retrieval (Page: 163-194) Soták, R On light cycles in plane triangulations. Authors: Jendrol', S; Madaras, T; Soták, R; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 197-198, Page: 453-467) Speranza, M. G. Geometric representation for semi on-line scheduling on uniform processors. Authors: Angelelli, E.; Speranza, M. G.; Szoldatics, J.; Tuza, Zsolt Date: 2010. Published by: Optimization Methods & Software (Volume no.: 25, Issue no.: 3, Page: 421-428.) Semi on-line scheduling on three processors with known sum of the tasks. Authors: Angelelli, E.; Speranza, M. G.; Tuza, Zsolt Date: 2007. Published by: Journal of Scheduling (Volume no.: 10, Issue no.: 4-5, Page: 263-269.) Speranza, Maria Grazia Semi-online scheduling on two uniform processors. Authors: Angelelli, Enrico; Speranza, Maria Grazia; Tuza, Zsolt Date: 2008. Published by: Theoretical Computer Science (Volume no.: 393, Issue no.: 1-3, Page: 211-219.) Speranza, MG New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks Authors: Angelelli, E; Speranza, MG; Tuza, Zsolt Date: 2006. Published by: Discrete Mathematics and Theoretical Computer Science (Volume no.: 8, Page: 1-16) Semi-on-line scheduling on two parallel processors with an upper bound on the items Authors: Angelelli, E; Speranza, MG; Tuza, ZS Date: 2003. Published by: ALGORITHMICA (Volume no.: 37, Issue no.: 4, Page: 243-262) On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Authors: Speranza, MG; Tuza, ZS Date: 1999. Published by: ANNALS OF OPERATIONS RESEARCH (Volume no.: 86, Page: 491-506) A 13/12 approximation algorithm for bin packing with extendable bins. Authors: Dell'olmo, P; Kellerer, H; Speranza, MG; Tuza, ZS Date: 1998. Published by: INFORMATION PROCESSING LETTERS (Volume no.: 65, Issue no.: 5, Page: 229-233) Semi on-line algorithms for the partition problem. Authors: Kellerer, H; Kotov, V; Speranza, MG; Tuza, ZS Date: 1997. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 21, Issue no.: 5, Page: 235-242) Efficiency and effectiveness of normal schedules on three dedicated processors. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 164, Page: 67-79) Comparability graph augmentation for some multiprocessor scheduling problems. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 72, Issue no.: 1-2, Page: 71-84) Spernaza, MG Scheduling groups of tasks with precedence constraints on three dedicated processors Authors: Mansini, R; Spernaza, MG; Tuza, ZS Date: 2004. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 134, Page: 141-168) The on-line multiprocessor scheduling problem with known sum of the tasks Authors: Angelelli, E; Nagy, ; Spernaza, MG; Tuza, ZS Date: 2004. Published by: JOURNAL OF SCHEDULING (Volume no.: 7, Page: 421-428) Spissich, L Sharpness of some intersection theorems. Authors: Hujter, M; Spissich, L; Tuza, ZS Date: 2000. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 21, Issue no.: 7, Page: 913-916) Spyratos, M Minimal colorings for properly colored subgraphs. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS; Voigt, M Date: 1996. Published by: GRAPHS AND COMBINATORICS (Volume no.: 12, Issue no.: 4, Page: 345-360) Cycles of given color patterns. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS Date: 1996. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 21, Issue no.: 2, Page: 153-162) Paths through fixed vertices in edge-colored graphs Authors: Chou, WS; Manoussakis, Y; Megalalaki, O; Spyratos, M; Tuza, ZS Date: 1994. Published by: MATHEMATIQUES INFORMATIQUE ET SCIENCES HUMAINES (Volume no.: 32, Issue no.: 127, Page: 49-58) Stiebitz, M. On list critical graphs. Authors: Stiebitz, M.; Tuza, Zsolt; Voigt, M. Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 4931-4941.) Subramanya, M. S. 3-consecutive c-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Subramanya, M. S.; Dominic, Ch. Date: 2010. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 30, Issue no.: 3, Page: 393-405.) Szaniszló, Zs The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Szaniszló, Zs. Lower bound on the profile of degree pairs in cross-intersecting set systems. Authors: Szaniszló, Zs.; Tuza, Zsolt Date: 2007. Published by: Combinatorica (Volume no.: 27, Issue no.: 3, Page: 399-405.) Szederkényi, G The effect of model simplification assumptions on the differential index of lumped process models Authors: Hangos, KM; Szederkényi, G; Tuza, ZS Date: 2004. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 28, Page: 129-137) The effect of modelling assumptions on the differential index of lumped process models. Authors: Tuza, ZS; Szederkényi, G; Hangos, KM Date: 2002. Published by: European symposium on computer aided process engineering - 12. (Computer-aided chemical engineering 10) (Page: 979-984) Szigeti, J Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Authors: Lee, A; Révész, G; Szigeti, J; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 230, Issue no.: 1-3, Page: 49-61) Solving systems of linear equations over Lie nilpotent rings. Authors: Szigeti, J; Tuza, ZS Date: 1997. Published by: LINEAR & MULTILINEAR ALGEBRA (Volume no.: 42, Page: 43-51) Generalized colorings and avoidable orientations. Authors: Szigeti, J; Tuza, ZS Date: 1997. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 17, Issue no.: 1, Page: 137-145) Eulerian polynomial identities on matrix rings Authors: Szigeti, J; Tuza, ZS; Révész, G Date: 1993. Published by: JOURNAL OF ALGEBRA (Volume no.: 161, Issue no.: 1, Page: 90-101) Szirányi, Tamás Graph based solution for segmentation tasks in case of out-of-focus, noisy and corrupted images. Authors: Keszler, Anita; Szirányi, Tamás; Tuza, Zsolt Department: Distributed Events Analysis Research Group Date: 2011. Published by: IMAGAPP & IVAPP 2011. - Proceedings of the international conference on imaging theory and applications and international conference on information visualization theory and applications. Vilamoura, Algarve, 2011. (Page: 100-105.) Szoldatics, J. Geometric representation for semi on-line scheduling on uniform processors. Authors: Angelelli, E.; Speranza, M. G.; Szoldatics, J.; Tuza, Zsolt Date: 2010. Published by: Optimization Methods & Software (Volume no.: 25, Issue no.: 3, Page: 421-428.) Székely, LA Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Tkác, M The irregularity strength and cost of the union of cliques. Authors: Jendrol, S; Tkác, M; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 179-186) Toubaline, S. The most vital nodes with respect to independent set and vertex cover. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 1933-1946.) Complexity of most vital nodes for independent set in graphs related to tree structures. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Editor: Iliopoulos, C.S.; Smyth, W.F. Date: 2011. Published by: IWOCA 2010. 21st international workshop on combinatorial algorithms. London, 2010. (Lecture notes in computer science 6460.) (Page: 154-166.) Triesch, E Searching for acyclic orientations of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1995. Published by: DISCRETE MATHEMATICS (Volume no.: 144, Issue no.: 1-3, Page: 3-10) Irregular assignments and vertex distinguishing edge-colorings of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 1-9) Truszczynski, M Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets Authors: Truszczynski, M; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 103, Issue no.: 3, Page: 301-312) Tuza, Z On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract). Authors: Kratochvíl, J; Tuza, Z Date: 2000. Published by: Proceedings of the eleventh annual ACM-SIAM Symposium on discrete algorithms. San Francisco, 2000. (Page: 40-41) Tuza, Zs. Optimal guard sets and the Helly property Authors: Bacsó, G.; Tuza, Zs. Date: 2011. Published by: European Journal of Combinatorics (Volume no.: 32, Issue no.: 1, Page: 28-32) Tuza, Zs Strong branchwidth and local transversals Authors: Tuza, Zs Date: 2005. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 145, Issue no.: 2, Page: 291-296) Highly connected counterexamples to a conjecture on a-domination Authors: Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 435-440) Reconstruction of planar graphs from their centered triangulations in some spatio-relational models Authors: Novák, ÁB; Tuza, Zs Date: 2005. Published by: ICCC 2005. IEEE 3rd international conference on computational cybernetics. Proceedings. Mauritius, 2005. (Page: 181-185) Combining spatial and topological data in a spatiotemporal relational model Authors: Novák, ÁB; Tuza, Zs Date: 2005. Published by: INES 2005. IEEE 9th international confenrence on intelligent engineering systems. Cruising on Mediterranean Sea, 2005. (Page: 173-177) List version of L(d,s)-labelings Authors: Kohl, A; Schreyer, J; Tuza, Zs; Voigt, M Date: 2005. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 349, Page: 92-98) Weighted edge-decompositions of graphs Authors: Deogun, JS; Tuza, Zs; Scott, SD; Li, L Date: 2005. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 53, Page: 197-208) Graph-theoretic methods and recent applications in computer science Authors: Deogun, JS; Tuza, Zs Date: 2005. Published by: Formal methods in computing. (Page: 55-96) The cover pebbling number of graphs Authors: Crull, B; Cundiff, T; Feltman, P; Hurlbert, GH; Pudwell, L; Szaniszló, Zs; Tuza, Zs Date: 2005. Published by: DISCRETE MATHEMATICS (Volume no.: 296, Issue no.: 1, Page: 15-23) Complexity and approximation of satisfactory partition problems Authors: Bazgan, C; Tuza, Zs; Vanderpooten, D Date: 2005. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 3595, Page: 829-838) Graph domination in distance two Authors: Bacsó, G; Tálos, A; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 121-128) Dominating bipartite subgraphs in graphs Authors: Bacsó, G; Michalak, D; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 85-94) Tuza, ZS Partition of C4-designs into minimum and maximum number of P3-designs Authors: Quattrocchi, G; Tuza, ZS Date: 2004. Published by: GRAPHS AND COMBINATORICS (Volume no.: 20, Issue no.: 4, Page: 531-540) On the Interoperability problems of the spatiotemporal relational model, PLAT Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Computational Cybernetics. Proceedings of the 2nd IEEE international conference ICCC 2004, Vienna (Page: 415-420) A temporal extension of a spatial relational model Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, ZS Date: 2004. Published by: Intelligent Engineering Systems. Proceedings of the IEEE international conference INES 2004, Cluj-Napoca (Page: 585-589) Scheduling groups of tasks with precedence constraints on three dedicated processors Authors: Mansini, R; Spernaza, MG; Tuza, ZS Date: 2004. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 134, Page: 141-168) On short cycles through prescribed vertices of a graph Authors: Göring, F; Harant, J; Hexel, E; Tuza, ZS Date: 2004. Published by: DISCRETE MATHEMATICS (Volume no.: 286, Page: 67-74) Graphs without induced P5 and C5 Authors: Bacsó, G; Tuza, ZS Date: 2004. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 24, Page: 503-507) The on-line multiprocessor scheduling problem with known sum of the tasks Authors: Angelelli, E; Nagy, ; Spernaza, MG; Tuza, ZS Date: 2004. Published by: JOURNAL OF SCHEDULING (Volume no.: 7, Page: 421-428) The effect of model simplification assumptions on the differential index of lumped process models Authors: Hangos, KM; Szederkényi, G; Tuza, ZS Date: 2004. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 28, Page: 129-137) Graph coloring Authors: Tuza, ZS Date: 2003. Published by: Handbook of graph theory. (Discrete mathematics and its applications.) (Page: 341-364) Further topics in graph coloring Authors: Tuza, ZS Date: 2003. Published by: Handbook of graph theory. (Discrete mathematics and its applications) (Page: 365-388) Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types Authors: Tuza, ZS; Voloshin, V Date: 2003. Published by: COMPUTER SCIENCE JOURNAL OF MOLDOVA (Volume no.: 11, Issue no.: 1, Page: 35-42) Spatiotemporal database models for attracting students to research Authors: Novák, AB; Revesz, P; Tuza, ZS Date: 2003. Published by: International Conference in memoriam John von Neumann. Proceedings. Budapest, 2003 (Page: 247-256) Discovering spanning trees in a spatial relational model Authors: Novák, AB; Ronkay, ZS; Tuza, ZS Date: 2003. Published by: 7th IEEE conference on computational complexity, ICCC 2003. Siófok (Page: 43-46) Constructing Hamiltonian paths of some special graphs, using a relational spatial database model Authors: Novák, AB; Tuza, ZS Date: 2003. Published by: Proceedings of the 7th IEEE International Conference on Intelligent Engineering Systems, INES 2003 Assuit-Luxor (Page: 357-361) Strict colorings of Steiner triple and quadruple systems Authors: Milazzo, M; Tuza, ZS; Voloshin, V Date: 2003. Published by: DISCRETE MATHEMATICS (Volume no.: 261, Issue no.: 1-3, Page: 399-411) Marking games and the oriented game chromatic number of partial k-trees Authors: Kierstead, H; Tuza, ZS Date: 2003. Published by: GRAPHS AND COMBINATORICS (Volume no.: 19, Issue no.: 1, Page: 121-129) Computational aspects of connectionist interaction information retrieval Authors: Dominich, S; Tuza, ZS Date: 2003. Published by: Mathematical/formal methods in information retrieval. 26th annual international ACM SIGIR conference. Toronto, 2003 (Page: 1-9) Schütte's tournament problem and intersecting families of sets Authors: Borowiecki, M; Grytczuk, J; Haluszczak, M; Tuza, ZS Date: 2003. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 12, Issue no.: 4, Page: 359-364) On the existence and determination of satisfactory partitions in a graph Authors: Bazgan, C; Vanderpooten, D; Tuza, ZS Date: 2003. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 2906, Page: 444-453) Unique colorings of bi-hypergraphs Authors: Bacsó, G; Tuza, ZS; Voroshin, V Date: 2003. Published by: AUSTRALASIAN JOURNAL OF COMBINATORICS (Volume no.: 27, Page: 33-45) Semi-on-line scheduling on two parallel processors with an upper bound on the items Authors: Angelelli, E; Speranza, MG; Tuza, ZS Date: 2003. Published by: ALGORITHMICA (Volume no.: 37, Issue no.: 4, Page: 243-262) Structure simplification of dynamic process models Authors: Leitold, A; Hangos, KM; Tuza, ZS Date: 2002. Published by: JOURNAL OF PROCESS CONTROL (Volume no.: 12, Page: 69-83) Representing directed and weighted graphs and their properties in a relational spatial database model. Authors: Novák, AB; Tuza, ZS Date: 2002. Published by: INES 2002. 6th international conference on intelligent engineering systems. Proceedings. Opatija (Page: 357-361) Distance graphs with finite chromatic number. Authors: Ruzsa, IZ; Tuza, ZS; Voigt, M Date: 2002. Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 85, Issue no.: 1, Page: 181-187) Domination number of graphs with bounded diameter. Authors: Al-Yakoob, SM; Tuza, ZS Date: 2002. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 40, Page: 183-191) Domination in partitioned graphs. Authors: Tuza, ZS; Vestergaard, PD Date: 2002. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 22, Issue no.: 1, Page: 199-210) The chromatic spectrum of mixed hypergraphs. Authors: Jiang, T; Mubayi, D; Tuza, ZS; Voloshin, V; West, DB Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 18, Issue no.: 2, Page: 309-318) On the complexity of bicoloring clique hypergraphs of graphs. Authors: Kratochvíl, J; Tuza, ZS Date: 2002. Published by: JOURNAL OF ALGORITHMS (Volume no.: 45, Issue no.: 1, Page: 40-54) A note on planar 5-list colouring: non-extendability at distance 4. Authors: Tuza, ZS; Voigt, M Date: 2002. Published by: DISCRETE MATHEMATICS (Volume no.: 251, Issue no.: 1-3, Page: 169-172) A colourful theory on graphs Authors: Tuza, ZS Date: 2002. Published by: ERCIM NEWS (Volume no.: 50, Page: 38-39) The effect of modelling assumptions on the differential index of lumped process models. Authors: Tuza, ZS; Szederkényi, G; Hangos, KM Date: 2002. Published by: European symposium on computer aided process engineering - 12. (Computer-aided chemical engineering 10) (Page: 979-984) Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 2002. Published by: JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Volume no.: 64, Issue no.: 2, Page: 160-170) Uniquely colorable mixed hypergraphs. Authors: Tuza, ZS; Voloshin, VI; Zhou, H Date: 2002. Published by: DISCRETE MATHEMATICS (Volume no.: 248, Issue no.: 1-3, Page: 221-236) Reconstruction graphs and testing their properties in a relational spatial database. Authors: Novák, ÁB; Tuza, ZS Date: 2002. Published by: COMPUTERS & MATHEMATICS WITH APPLICATIONS (Volume no.: 43, Issue no.: 10-11, Page: 1391-1406) Structural domination of graphs. Authors: Bacsó, G; Tuza, ZS Date: 2002. Published by: ARS COMBINATORIA (Volume no.: 63, Page: 235-256) Minimally non-preperfect graphs of small maximum degree. Authors: Tuza, ZS; Wagler, A Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 17, Issue no.: 4, Page: 235-256) Unsolved combinatorial problems. Part I. (BRICS Lecture Series, LS-01-1) Authors: Tuza, ZS Date: 2001. Published by: Unsolved combinatorial problems. Part I. (BRICS Lecture Series, LS-01-1) (Page: 41) Complexity of coloring graphs without forbidden induced subgraphs. Authors: Král, D; Kratochvíl, J; Tuza, ZS; Woegiger, G Date: 2001. Published by: Graph-theoretic concepts in computer science. 27th international workshop. WG 2001 Boltenhagen, 2001. Proceedings. ( Lecture notes in computer science 2204.) (Page: 254-262) Oriented list colorings of graphs. Authors: Tuza, ZS; Voigt, M Date: 2001. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 36, Page: 217-229) Heredity properties of connectedness in edge-coloured complete graphs. Authors: Idzik, A; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 235, Issue no.: 1-3, Page: 306-301) Ramsey numbers for tournaments. Authors: Manoussakis, Y; Tuza, ZS Date: 2001. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 263, Issue no.: 1-2, Page: 75-85) Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Authors: Lee, A; Révész, G; Szigeti, J; Tuza, ZS Date: 2001. Published by: DISCRETE MATHEMATICS (Volume no.: 230, Issue no.: 1-3, Page: 49-61) Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) Authors: Hangos, KM; Tuza, ZS; Yeo, A Date: 2001. Published by: Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) (Page: 27) Optimal control structure selection for process systems. Authors: Hangos, KM; Tuza, ZS Date: 2001. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 25, Page: 1521-1536) Uncolorable mixed hypergraphs. Authors: Tuza, ZS; Voloshin, V Date: 2000. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 99, Issue no.: 1-3, Page: 209-227) Extremal bi-Helly families. Authors: Tuza, ZS Date: 2000. Published by: DISCRETE MATHEMATICS (Volume no.: 213, Issue no.: 1-3, Page: 321-331) On-line rankings of graphs. Authors: Schiermeyer, I; Tuza, ZS; Voigt, M Date: 2000. Published by: DISCRETE MATHEMATICS (Volume no.: 212, Issue no.: 1-2, Page: 141-147) Sharpness of some intersection theorems. Authors: Hujter, M; Spissich, L; Tuza, ZS Date: 2000. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 21, Issue no.: 7, Page: 913-916) On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Authors: Speranza, MG; Tuza, ZS Date: 1999. Published by: ANNALS OF OPERATIONS RESEARCH (Volume no.: 86, Page: 491-506) Representation, constraints and complexity of graphs in the PLA spatial database model. Authors: Novák, ÁB; Tuza, ZS Date: 1999. Published by: Bánki Donát Polytechnic 1879-1999. Jubilee international conference. Proceedings. Budapest, 1999. (Page: 57-60) Objects reconstruction and its complexity problems in the PLA spatial database model. Authors: Novák, ÁB; Tuza, ZS Date: 1999. Published by: INES '99. 1999 IEEE international conference on intelligent engineering systems. Proceedings. Poprad, 1999. (Page: 219-223) Disjoint blocking sets in cycle systems. Authors: Milici, S; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 208-209, Page: 451-462) Fractional P-colourings and P-choice-ratio. Authors: Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS (Volume no.: 18, Page: 69-77) Rankings of directed graphs. Authors: Kratochvíl, J; Tuza, ZS Date: 1999. Published by: Graph-theoretical concepts of computer science. 24th international workshop, WG'98. Proceedings. Smolenice, 1998. (Lecture notes in computer science, 1517.) (Page: 114-123) New trends in the theory of graph colorings: Choosability and list colorings. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1999. Published by: Contemporary trends in discrete mathematics: from DIMACS and DIMATIA to the future. (DIMACS series in discrete mathematics and theoretical computer science, 49.) (Page: 183-197) Chromatic spectrum is broken. Authors: Jang, T; Mubayi, D; Tuza, ZS; Voloshin, VI; West, D Date: 1999. Published by: 6th Twente workshop on graphs and combinatorial optimization. Preprint. Enschede, 1999. (Page: 94-97) On light cycles in plane triangulations. Authors: Jendrol', S; Madaras, T; Soták, R; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 197-198, Page: 453-467) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1999. Published by: JOURNAL OF ALGORITHMS (Volume no.: 31, Issue no.: 1, Page: 249-268) Dominating subgraphs of small diameter. Authors: Bacsó, G; Tuza, ZS Date: 1999. Published by: JOURNAL OF COMBINATORICS, INFORMATION AND SYSTEM SCIENCES (Volume no.: 22, Issue no.: 1, Page: 51-62) A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Authors: Amoura, AK; Bampis, E; Manoussakis, Y; Tuza, ZS Date: 1999. Published by: PARALLEL COMPUTING (Volume no.: 25, Issue no.: 1, Page: 49-61) Process model structure simplification. Authors: Hangos, KM; Tuza, ZS Date: 1999. Published by: COMPUTERS & CHEMICAL ENGINEERING (Volume no.: 23, Issue no.: Suppl., Page: S 343-S 346) Rankings of directed graphs. Authors: Kratovchíl, J; Tuza, ZS Date: 1999. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 12, Issue no.: 3, Page: 374-384) Remarks on the existence of uniquely partitionable planar graphs. Authors: Borowiecki, M; Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 19, Issue no.: 2, Page: 159-166) Maximum cuts: improvementsand local algorithmic analogues of the Edwards-Erdős inequality. Authors: Bylka, S; Idzik, A; Tuza, ZS Date: 1999. Published by: DISCRETE MATHEMATICS (Volume no.: 194, Issue no.: 1-3, Page: 39-58) On magnitude networks. Authors: Fouquet, J-L; Hahn, G; Tuza, ZS; Woodrow, RE Date: 1998. Published by: CONGRESSUS NUMERANTIUM (Volume no.: 133, Page: 75-84) Strict colourings for classes of steiner triple systems. Authors: Milazzo, L; Tuza, ZS Date: 1998. Published by: DISCRETE MATHEMATICS (Volume no.: 182, Issue no.: 1-3, Page: 233-243) Complexity of choosing subsets from color sets. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: DISCRETE MATHEMATICS (Volume no.: 191, Issue no.: 1-3, Page: 139-148) Brooks-type theorems for choosability with separation. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 27, Issue no.: 1, Page: 43-49) A 13/12 approximation algorithm for bin packing with extendable bins. Authors: Dell'olmo, P; Kellerer, H; Speranza, MG; Tuza, ZS Date: 1998. Published by: INFORMATION PROCESSING LETTERS (Volume no.: 65, Issue no.: 5, Page: 229-233) Rankings of graphs. Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Müller, H; Tuza, ZS Date: 1998. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 11, Issue no.: 1, Page: 168-181) On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: STACS 98. 15th annual symposium on theoretical aspects of computer science. Proceedings. Paris, 1998. (Lecture notes in computer science, 1373.) (Page: 276-286) Efficient approximation algorithms for the subset-sums equality problem. Authors: Bazgan, C; Santha, M; Tuza, ZS Date: 1998. Published by: Automata, languages and programming. (Lecture notes in computer science, 1443.) (Page: 387-396) Semi on-line algorithms for the partition problem. Authors: Kellerer, H; Kotov, V; Speranza, MG; Tuza, ZS Date: 1997. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 21, Issue no.: 5, Page: 235-242) List colorings and reducibility. Authors: Tuza, ZS; Voigt, M Date: 1997. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 79, Issue no.: 1-3, Page: 247-256) Graph colorings with local constraints - A survey. Authors: Tuza, ZS Date: 1997. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 17, Issue no.: 2, Page: 161-228) Solving systems of linear equations over Lie nilpotent rings. Authors: Szigeti, J; Tuza, ZS Date: 1997. Published by: LINEAR & MULTILINEAR ALGEBRA (Volume no.: 42, Page: 43-51) Generalized colorings and avoidable orientations. Authors: Szigeti, J; Tuza, ZS Date: 1997. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 17, Issue no.: 1, Page: 137-145) Upper chromatic number of Steiner triple and quadruple systems. Authors: Milazzo, L; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 174, Issue no.: 1-3, Page: 247-259) The color cost of a caterpillar. Authors: Gionfriddo, M; Harary, F; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 174, Issue no.: 1-3, Page: 125-130) Switching distance in graphs. Authors: Gimbel, J; Henning, MA; Tuza, ZS Date: 1997. Published by: ARS COMBINATORIA (Volume no.: 47, Page: 109-119) Efficiency and effectiveness of normal schedules on three dedicated processors. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 164, Page: 67-79) Comparability graph augmentation for some multiprocessor scheduling problems. Authors: Dell'olmo, P; Speranza, MG; Tuza, ZS Date: 1997. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 72, Issue no.: 1-2, Page: 71-84) A weighted generalization of Turán's theorem. Authors: Bondy, JA; Tuza, ZS Date: 1997. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 25, Issue no.: 4, Page: 267-275) Choosability and fractional chromatic numbers. Authors: Alon, N; Tuza, ZS Date: 1997. Published by: DISCRETE MATHEMATICS (Volume no.: 165-166, Page: 31-38) Lower bounds for a class of depth-two switching circuits. Authors: Tuza, ZS Date: 1996. Published by: Matrices and graphs: theory and applications to economics. (Page: 7-18) Some hypergraph questions suggested by a Nordic Olympiad problem. Authors: Rousseau, C; Tuza, ZS Date: 1996. Published by: THE JOURNAL of COMBINATORIAL MATHEMATICS and COMBINATORIAL COMPUTING (Volume no.: 22, Page: 183-192) Optimal routings in communication networks with linearly bounded forwarding index. Authors: Manoussakis, Y; Tuza, ZS Date: 1996. Published by: NETWORKS (Volume no.: 28, Page: 177-180) Minimal colorings for properly colored subgraphs. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS; Voigt, M Date: 1996. Published by: GRAPHS AND COMBINATORICS (Volume no.: 12, Issue no.: 4, Page: 345-360) Cycles of given color patterns. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS Date: 1996. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 21, Issue no.: 2, Page: 153-162) Process structure driven control structure selection. Authors: Hangos, KM; Tuza, ZS Date: 1996. Published by: Preprints of the 13th world congress of International Federation of Automatic Control. San Francisco, 1996. Vol. M. Chemical process control, mineral, metal, mining. (Page: 187-192) Computational aspects of graph theoretic methods in control. Authors: Hangos, KM; Tuza, ZS Date: 1996. Published by: Preprints of the second European IEEE workshop on computer-intensive methods in control and signal processing. CMP'96. Prague, 1996. (Page: 25-36) On a conjecture of Erdős, Rubin and Taylor. Authors: Tuza, ZS; Voight, M Date: 1996. Published by: TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS (Volume no.: 9, Page: 69-82) Every 2-choosable graph in (2m,m)-choosable. Authors: Tuza, ZS; Voigt, M Date: 1996. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 22, Issue no.: 3, Page: 245-252) Applications of the se-pair method in extremal problems, II. Authors: Tuza, ZS Date: 1996. Published by: Combinatorics, Paul Erdős is eighty. (Bolyai Society mathematical studies 2.) (Page: 459-490) Cycle systems without 2-colorings. Authors: Milici, S; Tuza, ZS Date: 1996. Published by: JOURNAL OF COMBINATORIAL DESIGNS (Volume no.: 4, Issue no.: 2, Page: 135-142) The forwarding index of directed networks. Authors: Manoussakis, Y; Tuza, ZS Date: 1996. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 68, Issue no.: 3, Page: 279-291) The irregularity strength and cost of the union of cliques. Authors: Jendrol, S; Tkác, M; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 179-186) Precoloring extension III. Classes of perfect graphs. Authors: Hujter, M; Tuza, ZS Date: 1996. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 5, Issue no.: 1, Page: 35-56) Ramsey-remainder. Authors: Erdős, P; Tuza, ZS; Valtr, P Date: 1996. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 17, Issue no.: 6, Page: 519-532) Covering and independence in triangle structures. Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 89-101) Cycle-saturated graphs of minimum size. Authors: Barefoot, CA; Clark, LH; Entringer, RC; Porter, TD; Székely, LA; Tuza, ZS Date: 1996. Published by: DISCRETE MATHEMATICS (Volume no.: 150, Issue no.: 1-3, Page: 31-48) Zero-sum block designs and graph labelings Authors: Tuza, ZS Date: 1995. Published by: JOURNAL OF COMBINATORIAL DESIGNS (Volume no.: 3, Issue no.: 2, Page: 89-99) How to make a random graph irregular Authors: Tuza, ZS Date: 1995. Published by: RANDOM STRUCTURES & ALGORITHMS (Volume no.: 6, Issue no.: 2-3, Page: 323-329) Maximum cuts and large bipartite subgraphs Authors: Poljak, S; Tuza, ZS Date: 1995. Published by: Combinatorial optimization. (DIMACS series in discrete mathematics and theoretical computer science 20.) (Page: 181-244) 4-chroamatic graphs with large odd girth Authors: Gnuyen, VN; Tuza, ZS Date: 1995. Published by: DISCRETE MATHEMATICS (Volume no.: 138, Issue no.: 1-3, Page: 387-392) Coverable graphs Authors: Milici, S; Tuza, ZS Date: 1995. Published by: STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA (Volume no.: 30, Issue no.: 4, Page: 329-344) Small representations of the relation algebra En+1(1,2,3) Authors: Jipsen, P; Maddux, RD; Tuza, ZS Date: 1995. Published by: ALGEBRA UNIVERSALIS (Volume no.: 33, Issue no.: 1, Page: 136-139) Vertex coverings of the edge set in a connected graph Authors: Erdős, P; Tuza, ZS Date: 1995. Published by: Graph theory, combinatorics, and applications. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs. Kalamazoo, 1992. Vol. 2. (Page: 1179-1187) Rankings of graphs Authors: Bodlaender, HL; Deogun, JS; Jansen, K; Kloks, T; Kratsch, D; Muller, H; Tuza, ZS Date: 1995. Published by: Graph theoretical concepts in computer science. (Lecture notes in computer science 903.) (Page: 292-304) Local and global average degree in graphs and multigraphs Authors: Bertram, E; Erdős, P; Horák, P; Sirán, J; Tuza, ZS Date: 1995. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 18, Issue no.: 7, Page: 647-661) The acyclic orientation game on random graphs Authors: Alon, N; Tuza, ZS Date: 1995. Published by: RANDOM STRUCTURES & ALGORITHMS (Volume no.: 6, Issue no.: 2-3, Page: 261-268) Searching for acyclic orientations of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1995. Published by: DISCRETE MATHEMATICS (Volume no.: 144, Issue no.: 1-3, Page: 3-10) Small n-dominating sets Authors: Tuza, ZS Date: 1994. Published by: MATHEMATICA PANNONICA (Volume no.: 5, Issue no.: 2, Page: 271-273) Perfect triangle families Authors: Tuza, ZS Date: 1994. Published by: BULLETIN OF THE LONDON MATHEMATICAL SOCIETY (Volume no.: 26, Page: 321-324) Characterization of (m,1)-transitive and (3,2)-transitive semi-complete directed graphs Authors: Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 135, Issue no.: 1-3, Page: 335-347) The expected relative error of the polyhedral approximation of the max-cut problem Authors: Poljak, S; Tuza, ZS Date: 1994. Published by: OPERATIONS RESEARCH LETTERS (Volume no.: 16, Issue no.: 4, Page: 191-198) Paths through fixed vertices in edge-colored graphs Authors: Chou, WS; Manoussakis, Y; Megalalaki, O; Spyratos, M; Tuza, ZS Date: 1994. Published by: MATHEMATIQUES INFORMATIQUE ET SCIENCES HUMAINES (Volume no.: 32, Issue no.: 127, Page: 49-58) Monochromatic coverings and tree Ramsey numbers Authors: Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 125, Issue no.: 1-3, Page: 377-384) Largest size and union of Helly families Authors: Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 127, Issue no.: 1-3, Page: 319-327) Inequalities for minimal covering sets in set systems of given rank Authors: Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 51, Issue no.: 1-2, Page: 187-195) Applications of the set-pair method in extremal hypergraph theory Authors: Tuza, ZS Date: 1994. Published by: Extremal problems for finite sets. Conference. Visegrád, 1991. (Bolyai Society mathematical studies 3.) (Page: 479-514) Bipartite subgraphs of triangle-free graphs Authors: Poljak, S; Tuza, ZS Date: 1994. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 7, Issue no.: 2, Page: 307-313) The spectrum of [lambda]-times repeated blocks for TS([upsilon], [lambda]) Authors: Milici, S; Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 129, Issue no.: 1-3, Page: 159-166) Intersection dimensions of graph classes Authors: Kratochvil, J; Tuza, ZS Date: 1994. Published by: GRAPHS AND COMBINATORICS (Volume no.: 10, Issue no.: 2, Page: 159-168) Algorithmic complexity of list colorings Authors: Kratochvil, J; Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 50, Issue no.: 3, Page: 297-302) Packing problems in edge-colored graphs Authors: Hell, P; Mannoussakis, Y; Tuza, ZS Date: 1994. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 52, Page: 295-306) Solution to a problem of Speranza on Ms-colourings of directed graphs Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA (Volume no.: 8, Issue no.: 7, Page: 283-286) On conjectures of Berge and Chvátal Authors: Gionfriddo, M; Tuza, ZS Date: 1994. Published by: DISCRETE MATHEMATICS (Volume no.: 124, Issue no.: 1-3, Page: 79-86) Blocking sets in SQS (2v) Authors: Gionfriddo, M; Milici, S; Tuza, ZS Date: 1994. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 3, Page: 77-86) The Max-Cut problem - a survey Authors: Poljak, S; Tuza, ZS Date: 1993. Published by: The Max-Cut problem - a survey (Page: 91) Eulerian polynomial identities on matrix rings Authors: Szigeti, J; Tuza, ZS; Révész, G Date: 1993. Published by: JOURNAL OF ALGEBRA (Volume no.: 161, Issue no.: 1, Page: 90-101) Linear-time approximation algorithms for the max cut problem Authors: Nguyen, VN; Tuza, ZS Date: 1993. Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 2, Page: 201-210) Large s-representable set systems with low maximum degree Authors: Horák, P; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 122, Issue no.: 1-3, Page: 205-217) On k-local and k-mean colorings of graphs and hypergraphs Authors: Caro, Y; Tuza, ZS Date: 1993. Published by: QUARTERLY JOURNAL OF MATHEMATICS (Volume no.: 44, Issue no.: 2, Page: 385-398) Theorem proving through depth-first test Authors: Tuza, ZS Date: 1993. Published by: ACTA UNIVERSITATIS CAROLINAE - MATHEMATICA ET PHYSICA (Volume no.: 33, Issue no.: 2, Page: 135-141) Multipartite Turán problem for connected graphs and hypergraphs Authors: Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 112, Issue no.: 1-3, Page: 199-206) Helly property in finite set systems Authors: Tuza, ZS Date: 1993. Published by: JOURNAL OF COMBINATORIAL THEORY SERIES A (Volume no.: 62, Issue no.: 1, Page: 1-14) Complementary pairs of graphs orientable to line digraphs Authors: Radosavljevic, Z; Simic, S; Tuza, ZS Date: 1993. Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 13, Page: 65-75) Menger-type theorems with restrictions on path lengths Authors: Pyber, L; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 120, Issue no.: 1-3, Page: 161-174) One more occurrence of variables makes satisfiability jump from trivial to NP-complete Authors: Kratochvíl, J; Savicky, P; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON COMPUTING (Volume no.: 22, Issue no.: 1, Page: 203-210) Precoloring extension. II. Graph classes related to perfect graphs Authors: Hujter, M; Tuza, ZS Date: 1993. Published by: ACTA MATHEMATICAE UNIVERSITATIS COMENIANAE (Volume no.: 62, Issue no.: 1, Page: 1-11) The number of maximal independent sets in triangle-free graphs Authors: Hujter, M; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 6, Issue no.: 2, Page: 284-288) Two graph-colouring games Authors: Harary, F; Tuza, ZS Date: 1993. Published by: BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY (Volume no.: 48, Issue no.: 1, Page: 141-149) An upper bound on the number of cliques in a graph Authors: Farber, M; Hujter, M; Tuza, ZS Date: 1993. Published by: NETWORKS (Volume no.: 23, Issue no.: 3, Page: 207-210) Rainbow subgraphs in edge-colorings of complete graphs Authors: Erdős, P; Tuza, ZS Date: 1993. Published by: Quo vadis, graph theory? International conference on the future of graph theory. Fairbanks, 1990. (Annals of discrete mathematics 55.) (Page: 81-88) Algorithmic aspects of neighborhood numbers Authors: Chang, GJ; Farber, M; Tuza, ZS Date: 1993. Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 6, Issue no.: 1, Page: 24-29) Bounded degrees and prescribed distances in graphs Authors: Caro, Y; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 111, Issue no.: 1-3, Page: 87-93) Graphs with no induced C4 and 2K2 Authors: Blázsik, Z; Hujter, M; Pluhár, A; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 115, Issue no.: 1-3, Page: 51-55) Domination properties and induced subgraphs Authors: Bacsó, G; Tuza, ZS Date: 1993. Published by: DISCRETE MATHEMATICS (Volume no.: 111, Issue no.: 1-3, Page: 37-40) Nearly uniform distribution of edges among k-subgraphs of a graph Authors: Sirán, J; Tuza, ZS Date: 1992. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 16, Issue no.: 6, Page: 591-604) Cross fertilisation of graph theory and aircraft maintenance Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: AGIFORS thirty-second annual symposium. Airline Group of the International Federation of Operational Research Societies. Budapest, 1992 (Page: 307-318) Locally generated colourings of hexagonal cell division patterns: application to retinal cell differentiation Authors: Tuza, ZS; Lindenmayer, A Date: 1992. Published by: Lindenmayer systems. Impacts on theoretical computer science, computer graphics and developmental biology (Page: 333-350) Large partial parallel classes in Steiner systems Authors: Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 545-548) Graph coloring in linear time Authors: Tuza, ZS Date: 1992. Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 55, Issue no.: 6, Page: 236-243) Asymptotic growth of sparse saturated structures is locally determined Authors: Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 108, Issue no.: 1-3, Page: 397-402) Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets Authors: Truszczynski, M; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 103, Issue no.: 3, Page: 301-312) Rainbow subgraphs in properly edge-colored graphs Authors: Rödl, V; Tuza, ZS Date: 1992. Published by: RANDOM STRUCTURES & ALGORITHMS (Volume no.: 3, Issue no.: 2, Page: 175-182) Perfect couples of graphs Authors: Körner, J; Simonyi, G; Tuza, ZS Date: 1992. Published by: COMBINATORICA (Volume no.: 12, Issue no.: 2, Page: 179-192) Narrowness, pathwidth and their application in natural language processing Authors: Kornai, A; Tuza, ZS Date: 1992. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 36, Issue no.: 1, Page: 87-92) Small transversals in uniform hypergraphs Authors: Erdős, P; Fon der Flass, D; Kostochka, AV; Tuza, ZS Date: 1992. Published by: SIBERIAN ADVANCES IN MATHEMATICS (Volume no.: 2, Issue no.: 1, Page: 82-88) Covering the cliques of a graph with vertices Authors: Erdős, P; Gallai, T; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 108, Issue no.: 1-3, Page: 279-289) Construction of non-isomorphic regular tournaments Authors: Aistie-Vidal, A; Dugat, V; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 11-23) Irregular assignments and vertex distinguishing edge-colorings of graphs Authors: Aigner, M; Triesch, E; Tuza, ZS Date: 1992. Published by: Combinatorics '90. Recent trends and applications. Conference on combinatorics.Gaeta, 20-27 May, 1990 (Annals of Discrete Mathematics 52) (Page: 1-9) Precoloring extension I. Interval graphs Authors: Bíró, M; Hujter, M; Tuza, ZS Date: 1992. Published by: DISCRETE MATHEMATICS (Volume no.: 100, Issue no.: 1-3, Page: 267-279) Tuza, Zsolt Better bounds for the bin packing problem with the "Largest Item in the Bottom" constraint. Authors: Dósa, Gy.; Tuza, Zsolt; Ye, Deshi Editor: Brodnik, A.; Galambos, G. Date: 2011. Published by: MATCOS-10. Proceedings of the 2010 mini-conference on applied theoretical computer science. Koper, 2010. (Page: 65-68.) Color-bounded hypergraphs, V: Host graphs and subdivisions. Authors: Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2011. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 31, Issue no.: 2, Page: 223-238.) Combinatorial batch codes: extremal problems under Hall-type conditions. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Electronic Notes in Discrete Mathematics (Volume no.: 38, Page: 201-206.) Maximum number of colors: C-coloring and related problems. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Journal of Geometry (Volume no.: 101, Page: 83-97.) Optimal combinatorial batch codes derived from dual systems. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Miskolc Mathematical Notes (Volume no.: 12, Issue no.: 1, Page: 11-23.) Optimal batch codes: many items or low retrieval requirement. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2011. Published by: Advances in Mathematics of Communications (Volume no.: 5, Issue no.: 3, Page: 529-541.) Improper C-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Pushpalatha, L.; Vasundhara, R.C. Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 174-186.) The graph-bin packing problem. Authors: Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zsolt Date: 2011. Published by: International Journal of Foundations of Computer Science (Volume no.: 22, Issue no.: 8, Page: 1971-1993.) The most vital nodes with respect to independent set and vertex cover. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 1933-1946.) Complexity of most vital nodes for independent set in graphs related to tree structures. Authors: Bazgan, C.; Toubaline, S.; Tuza, Zsolt Editor: Iliopoulos, C.S.; Smyth, W.F. Date: 2011. Published by: IWOCA 2010. 21st international workshop on combinatorial algorithms. London, 2010. (Lecture notes in computer science 6460.) (Page: 154-166.) Complexity and approximation of the constrained forest problem. Authors: Bazgan, C.; Couetoux, B.; Tuza, Zsolt Date: 2011. Published by: Theoretical Computer Science (Volume no.: 412, Page: 4081-4091.) Optimal guard sets and the Helly property. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2011. Published by: European Journal of Combinatorics (Volume no.: 32, Page: 28-32.) Graph based solution for segmentation tasks in case of out-of-focus, noisy and corrupted images. Authors: Keszler, Anita; Szirányi, Tamás; Tuza, Zsolt Department: Distributed Events Analysis Research Group Date: 2011. Published by: IMAGAPP & IVAPP 2011. - Proceedings of the international conference on imaging theory and applications and international conference on information visualization theory and applications. Vilamoura, Algarve, 2011. (Page: 100-105.) Voloshin's conjecture for C-perfect hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Australasian Journal of Combinatorics (Volume no.: 48, Page: 253-267.) Hall number for list colorings of graphs: extremal results. Authors: Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 3, Page: 461-470.) Approximation algorithms for the minimum rainbow subgraph problem. Authors: Matos Camacho, S.; Schiermeyer, I.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 20, Page: 2666-2670.) A note on graphs with prescribed complete coloring numbers. Authors: Chartrand, G.; Okamoto, F.; Tuza, Zsolt; Zhang, P. Date: 2010. Published by: Journal of Combinatorial Mathematics and Combinatorial Computing (Volume no.: 73, Page: 77-84.) Satisfactory graph partition, variants, and generalizations. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2010. Published by: European Journal of Operational Research (Volume no.: 206, Issue no.: 2, Page: 271-280.) Geometric representation for semi on-line scheduling on uniform processors. Authors: Angelelli, E.; Speranza, M. G.; Szoldatics, J.; Tuza, Zsolt Date: 2010. Published by: Optimization Methods & Software (Volume no.: 25, Issue no.: 3, Page: 421-428.) 3-consecutive c-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Subramanya, M. S.; Dominic, Ch. Date: 2010. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 30, Issue no.: 3, Page: 393-405.) C-perfect hypergraphs. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 2, Page: 132-149.) Color-bounded hypergraphs, IV: stable colorings of hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 9, Page: 1463-1474.) Smallest set-transversals of k-partitions. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Graphs and Combinatorics (Volume no.: 25, Issue no.: 6, Page: 807-816.) Infinite versus finite graph domination. Authors: Bacsó, Gábor; Jung, H. A.; Tuza, Zsolt Date: 2010. Published by: Discrete Mathematics (Volume no.: 310, Issue no.: 9, Page: 1495-1500.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2010. Published by: Advances in discrete mathematics and applications. Mysore, 2008. (Ramanujan Mathematical Society lecture notes series 13.) (Page: 45-57.) On list critical graphs. Authors: Stiebitz, M.; Tuza, Zsolt; Voigt, M. Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 4931-4941.) Extending the spatial relational model PLA to represent trees. Authors: Novák, Á. B.; Tuza, Zsolt Editor: Machado, J.A.T.; Pátkai, B.; Rudas, I.J. Date: 2009. Published by: Intelligent engineering systems and computational cybernetics. (Page: 355-364.) Logarithmic upper bound for the upper chromatic number of S(t,t+1,v) systems Authors: Milazzo, L.; Tuza, Zsolt Date: 2009. Published by: Ars Combinatoria (Volume no.: 92, Page: 213-223.) Hypergraph domination and strong independence. Authors: Jose, B. K.; Tuza, Zsolt Date: 2009. Published by: Applicable Analysis and Discrete Mathematics (Volume no.: 3, Page: 347-358.) Some complexity problems on single input double output controllers. Authors: Hangos, Katalin; Tuza, Zsolt; Yeo, A. Date: 2009. Published by: Discrete Applied Mathematics (Volume no.: 157, Issue no.: 5, Page: 1146-1158.) Groupies in random graphs. Authors: Fernandez de la Vega, W.; Tuza, Zsolt Date: 2009. Published by: Information Processing Letters (Volume no.: 109, Page: 339-340.) Coloring intervals with four types of constraints. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: 6th Japanese-Hungarian symposium on discrete mathematics and its applications. Budapest, 2009. (Page: 393-401.) Download article: [pdf] Color-bounded hypergraphs, II: interval hypergraphs and hypertrees. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 6391-6401.) Color-bounded hypergraphs, I: general results. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 4890-4902.) Learning of winning strategies for terminal games with linear-size memory. Authors: Böhme, Th.; Göring, F.; Tuza, Zsolt; Unger, H. Date: 2009. Published by: International Journal of Game Theory (Volume no.: 38, Page: 155-168.) Covering a graph with a constrained forest (extended abstract). Authors: Bazgan, C.; Couëtoux, B.; Tuza, Zsolt Date: 2009. 12. 16. Published by: ISAAC 2009. Algorithms and computation. 20th international symposium. Honolulu, 2009. (Lecture notes in computer science 5878.) (Page: 892-901.) Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2009. Published by: Discrete Mathematics and Theoretical Computer Science (Volume no.: 11, Issue no.: 2, Page: 15-24.) Problems and results on colorings of mixed hypergraphs. Authors: Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: Horizons of Combinatorics. Balatonalmádi, 2006. (Bolyai Society mathematical studies 17.) (Page: 235-255.) Hereditary domination in graphs: characterization with forbidden induced subgraphs. Authors: Tuza, Zsolt Date: 2008. Published by: SIAM Journal on Discrete Mathematics (Volume no.: 22, Issue no.: 3, Page: 849-853.) On rainbow connection. Authors: Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael Date: 2008. Published by: Electronic Journal of Combinatorics (Volume no.: 15, Issue no.: 1, Page: #R57) Uniform mixed hypergraphs: the possible numbers of colors. Authors: Bujtás, Csilla; Tuza, Zsolt Date: 2008. Published by: Graphs and Combinatorics (Volume no.: 24, Issue no.: 1, Page: 1-12.) Approximation of satisfactory bisection problems. Authors: Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel Date: 2008. Published by: Journal of Computer and System Sciences (Volume no.: 74, Issue no.: 5, Page: 875-883.) Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. Authors: Bazgan, Cristina; Tuza, Zsolt Date: 2008. Published by: Journal of Discrete Algorithms (Volume no.: 6, Issue no.: 3, Page: 510-519.) Semi-online scheduling on two uniform processors. Authors: Angelelli, Enrico; Speranza, Maria Grazia; Tuza, Zsolt Date: 2008. Published by: Theoretical Computer Science (Volume no.: 393, Issue no.: 1-3, Page: 211-219.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: ICDM 2008. International conference on discrete mathematics. Mysore, 2008. (Page: 67-78.) Upper chromatic number of finite projective planes. Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2008. Published by: Journal of Combinatorial Designs (Volume no.: 16, Issue no.: 3, Page: 221-230.) Extremal jumps of the Hall number. Authors: Tuza, Zsolt Date: 2007. Published by: Electronic Notes in Discrete Mathematics (Volume no.: 28, Page: 83-89.) Lower bound on the profile of degree pairs in cross-intersecting set systems. Authors: Szaniszló, Zs.; Tuza, Zsolt Date: 2007. Published by: Combinatorica (Volume no.: 27, Issue no.: 3, Page: 399-405.) A class of Steiner systems S(2,4,v) with arcs of extremal size. Authors: Milazzo, L.; Tuza, Zsolt Date: 2007. Published by: Tatra Mountains Mathematical Publications (Volume no.: 36, Page: 153-162.) On-line arbitrarily vertex decomposable trees. Authors: Hornák, M.; Tuza, Zsolt; Wozniak, M. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 11, Page: 1420-1429.) Orderings of uniquely colorable hypergraphs. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 11, Page: 1395-1407.) Color-bounded hyper-graphs, III: Model comparison. Authors: Bujtás, Cs.; Tuza, Zsolt Date: 2007. Published by: Applicable Analysis and Discrete Mathematics (Volume no.: 1, Issue no.: 1, Page: 36-55.) Game list colouring of graphs. Authors: Boroviecki, M.; Sidorowicz, E.; Tuza, Zsolt Date: 2007. Published by: Electronic Journal of Combinatorics (Volume no.: 14, Issue no.: 1, Page: R26) Efficient algorithms for decomposing graphs under degree constraints. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 8, Page: 979-988.) Semi on-line scheduling on three processors with known sum of the tasks. Authors: Angelelli, E.; Speranza, M. G.; Tuza, Zsolt Date: 2007. Published by: Journal of Scheduling (Volume no.: 10, Issue no.: 4-5, Page: 263-269.) Characterization of graphs dominated by induced paths. Authors: Bacsó, Gábor; Tuza, Zsolt; Voigt, M. Date: 2007. Published by: Discrete Mathematics (Volume no.: 307, Issue no.: 7--8, Page: 822-826.) New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks Authors: Angelelli, E; Speranza, MG; Tuza, Zsolt Date: 2006. Published by: Discrete Mathematics and Theoretical Computer Science (Volume no.: 8, Page: 1-16) Largest non-unique subgraphs Authors: Andersen, LD; Vestergaard, PD; Tuza, Zsolt Date: 2006. Published by: Graphs and Combinatorics (Volume no.: 22, Page: 453-470) Degree-constrained decompositions of graphs: boundered treewidth and planarity Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Theoretical Computer Science (Volume no.: 355, Page: 389-395) The satisfactory partition problem Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Discrete Applied Mathematics (Volume no.: 154, Page: 1236-1245) A temporal extension of the spatial relational model PLA and some interoperability problems Authors: Novák, ÁB; Bérces, M; Ludányi, Z; Tuza, Zsolt Editor: Elmenreich, W Date: 2005. Published by: Intelligent systems at the service of mankind. Vol. 2. (Page: 41-52) A method to represent restricted classes of planar graphs in the enhanced spatial relational model PLA, based on Hahn graphs Authors: Novák, ÁB; Tuza, Zsolt Date: 2006. Published by: INES 2006. 10th international conference on intelligent engineering systems. London, 2006. (Page: 118-122) Formal theory of connectionist web retrieval Authors: Dominich, S; Skrop, A; Tuza, Zsolt Editor: Herrera-Viedma, E Date: 2006. Published by: Soft computing in web information retrieval (Page: 163-194) Mixed colorings of hypergraphs Authors: Bujtás, Cs; Tuza, Zsolt Date: 2006. Published by: Electronic Notes in Discrete Mathematics (Volume no.: 24, Page: 273-275) Steiner systems and large non-Hamiltonian hypergraphs Authors: Tuza, Zsolt Date: 2006. Published by: Le Matematiche (Volume no.: 61, Issue no.: 1, Page: 179-183) The cost chromatic number and hypergraph parameters Authors: Bacsó, Gábor; Tuza, Zsolt Date: 2006. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 26, Issue no.: 3, Page: 369-376) Egy minimax probléma halmazrendszerekre Authors: Kéri, Gerzson; Tuza, Zsolt Date: 2006. Published by: Matematikai Lapok (Volume no.: 12 (2004-2005), Issue no.: 1, Page: 20-30) Download article: [pdf] Tálos, A Graph domination in distance two Authors: Bacsó, G; Tálos, A; Tuza, Zs Date: 2005. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 25, Page: 121-128) Unger, H. Learning of winning strategies for terminal games with linear-size memory. Authors: Böhme, Th.; Göring, F.; Tuza, Zsolt; Unger, H. Date: 2009. Published by: International Journal of Game Theory (Volume no.: 38, Page: 155-168.) Valtr, P Ramsey-remainder. Authors: Erdős, P; Tuza, ZS; Valtr, P Date: 1996. Published by: EUROPEAN JOURNAL OF COMBINATORICS (Volume no.: 17, Issue no.: 6, Page: 519-532) Vanderpooten, D Degree-constrained decompositions of graphs: boundered treewidth and planarity Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Theoretical Computer Science (Volume no.: 355, Page: 389-395) The satisfactory partition problem Authors: Bazgan, C; Tuza, Zsolt; Vanderpooten, D Date: 2006. Published by: Discrete Applied Mathematics (Volume no.: 154, Page: 1236-1245) Complexity and approximation of satisfactory partition problems Authors: Bazgan, C; Tuza, Zs; Vanderpooten, D Date: 2005. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 3595, Page: 829-838) On the existence and determination of satisfactory partitions in a graph Authors: Bazgan, C; Vanderpooten, D; Tuza, ZS Date: 2003. Published by: LECTURE NOTES IN COMPUTER SCIENCE (Volume no.: 2906, Page: 444-453) Vanderpooten, D. Satisfactory graph partition, variants, and generalizations. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2010. Published by: European Journal of Operational Research (Volume no.: 206, Issue no.: 2, Page: 271-280.) Efficient algorithms for decomposing graphs under degree constraints. Authors: Bazgan, C.; Tuza, Zsolt; Vanderpooten, D. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 8, Page: 979-988.) Vanderpooten, Daniel Approximation of satisfactory bisection problems. Authors: Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel Date: 2008. Published by: Journal of Computer and System Sciences (Volume no.: 74, Issue no.: 5, Page: 875-883.) Vasundhara, R.C. Improper C-colorings of graphs. Authors: Bujtás, Cs.; Sampathkumar, E.; Tuza, Zsolt; Pushpalatha, L.; Vasundhara, R.C. Date: 2011. Published by: Discrete Applied Mathematics (Volume no.: 159, Page: 174-186.) Vestergaard, PD Largest non-unique subgraphs Authors: Andersen, LD; Vestergaard, PD; Tuza, Zsolt Date: 2006. Published by: Graphs and Combinatorics (Volume no.: 22, Page: 453-470) Domination in partitioned graphs. Authors: Tuza, ZS; Vestergaard, PD Date: 2002. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 22, Issue no.: 1, Page: 199-210) Voight, M On a conjecture of Erdős, Rubin and Taylor. Authors: Tuza, ZS; Voight, M Date: 1996. Published by: TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS (Volume no.: 9, Page: 69-82) Voigt, M List version of L(d,s)-labelings Authors: Kohl, A; Schreyer, J; Tuza, Zs; Voigt, M Date: 2005. Published by: THEORETICAL COMPUTER SCIENCE (Volume no.: 349, Page: 92-98) Distance graphs with finite chromatic number. Authors: Ruzsa, IZ; Tuza, ZS; Voigt, M Date: 2002. Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 85, Issue no.: 1, Page: 181-187) A note on planar 5-list colouring: non-extendability at distance 4. Authors: Tuza, ZS; Voigt, M Date: 2002. Published by: DISCRETE MATHEMATICS (Volume no.: 251, Issue no.: 1-3, Page: 169-172) Oriented list colorings of graphs. Authors: Tuza, ZS; Voigt, M Date: 2001. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 36, Page: 217-229) On-line rankings of graphs. Authors: Schiermeyer, I; Tuza, ZS; Voigt, M Date: 2000. Published by: DISCRETE MATHEMATICS (Volume no.: 212, Issue no.: 1-2, Page: 141-147) Fractional P-colourings and P-choice-ratio. Authors: Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: TATRA MOUNTAINS MATHEMATICAL PUBLICATIONS (Volume no.: 18, Page: 69-77) New trends in the theory of graph colorings: Choosability and list colorings. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1999. Published by: Contemporary trends in discrete mathematics: from DIMACS and DIMATIA to the future. (DIMACS series in discrete mathematics and theoretical computer science, 49.) (Page: 183-197) Remarks on the existence of uniquely partitionable planar graphs. Authors: Borowiecki, M; Mihók, P; Tuza, ZS; Voigt, M Date: 1999. Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Volume no.: 19, Issue no.: 2, Page: 159-166) Complexity of choosing subsets from color sets. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: DISCRETE MATHEMATICS (Volume no.: 191, Issue no.: 1-3, Page: 139-148) Brooks-type theorems for choosability with separation. Authors: Kratochvíl, J; Tuza, ZS; Voigt, M Date: 1998. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 27, Issue no.: 1, Page: 43-49) List colorings and reducibility. Authors: Tuza, ZS; Voigt, M Date: 1997. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 79, Issue no.: 1-3, Page: 247-256) Minimal colorings for properly colored subgraphs. Authors: Manoussakis, Y; Spyratos, M; Tuza, ZS; Voigt, M Date: 1996. Published by: GRAPHS AND COMBINATORICS (Volume no.: 12, Issue no.: 4, Page: 345-360) Every 2-choosable graph in (2m,m)-choosable. Authors: Tuza, ZS; Voigt, M Date: 1996. Published by: JOURNAL OF GRAPH THEORY (Volume no.: 22, Issue no.: 3, Page: 245-252) Voigt, M. On list critical graphs. Authors: Stiebitz, M.; Tuza, Zsolt; Voigt, M. Date: 2009. Published by: Discrete Mathematics (Volume no.: 309, Page: 4931-4941.) Characterization of graphs dominated by induced paths. Authors: Bacsó, Gábor; Tuza, Zsolt; Voigt, M. Date: 2007. Published by: Discrete Mathematics (Volume no.: 307, Issue no.: 7--8, Page: 822-826.) Voloshin, V Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types Authors: Tuza, ZS; Voloshin, V Date: 2003. Published by: COMPUTER SCIENCE JOURNAL OF MOLDOVA (Volume no.: 11, Issue no.: 1, Page: 35-42) Strict colorings of Steiner triple and quadruple systems Authors: Milazzo, M; Tuza, ZS; Voloshin, V Date: 2003. Published by: DISCRETE MATHEMATICS (Volume no.: 261, Issue no.: 1-3, Page: 399-411) The chromatic spectrum of mixed hypergraphs. Authors: Jiang, T; Mubayi, D; Tuza, ZS; Voloshin, V; West, DB Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 18, Issue no.: 2, Page: 309-318) Uncolorable mixed hypergraphs. Authors: Tuza, ZS; Voloshin, V Date: 2000. Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 99, Issue no.: 1-3, Page: 209-227) Voloshin, V. Color-bounded hypergraphs, V: Host graphs and subdivisions. Authors: Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2011. Published by: Discussiones Mathematicae Graph Theory (Volume no.: 31, Issue no.: 2, Page: 223-238.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Cs.; Tuza, Zsolt; Voloshin, V. Date: 2010. Published by: Advances in discrete mathematics and applications. Mysore, 2008. (Ramanujan Mathematical Society lecture notes series 13.) (Page: 45-57.) Voloshin, VI Uniquely colorable mixed hypergraphs. Authors: Tuza, ZS; Voloshin, VI; Zhou, H Date: 2002. Published by: DISCRETE MATHEMATICS (Volume no.: 248, Issue no.: 1-3, Page: 221-236) Chromatic spectrum is broken. Authors: Jang, T; Mubayi, D; Tuza, ZS; Voloshin, VI; West, D Date: 1999. Published by: 6th Twente workshop on graphs and combinatorial optimization. Preprint. Enschede, 1999. (Page: 94-97) Voloshin, Vitaly Problems and results on colorings of mixed hypergraphs. Authors: Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: Horizons of Combinatorics. Balatonalmádi, 2006. (Bolyai Society mathematical studies 17.) (Page: 235-255.) New challenges in the theory of hypergraph coloring. Authors: Bacsó, Gábor; Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly Date: 2008. Published by: ICDM 2008. International conference on discrete mathematics. Mysore, 2008. (Page: 67-78.) Voroshin, V Unique colorings of bi-hypergraphs Authors: Bacsó, G; Tuza, ZS; Voroshin, V Date: 2003. Published by: AUSTRALASIAN JOURNAL OF COMBINATORICS (Volume no.: 27, Page: 33-45) Wagler, A Minimally non-preperfect graphs of small maximum degree. Authors: Tuza, ZS; Wagler, A Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 17, Issue no.: 4, Page: 235-256) West, D Chromatic spectrum is broken. Authors: Jang, T; Mubayi, D; Tuza, ZS; Voloshin, VI; West, D Date: 1999. Published by: 6th Twente workshop on graphs and combinatorial optimization. Preprint. Enschede, 1999. (Page: 94-97) West, DB The chromatic spectrum of mixed hypergraphs. Authors: Jiang, T; Mubayi, D; Tuza, ZS; Voloshin, V; West, DB Date: 2002. Published by: GRAPHS AND COMBINATORICS (Volume no.: 18, Issue no.: 2, Page: 309-318) Woegiger, G Complexity of coloring graphs without forbidden induced subgraphs. Authors: Král, D; Kratochvíl, J; Tuza, ZS; Woegiger, G Date: 2001. Published by: Graph-theoretic concepts in computer science. 27th international workshop. WG 2001 Boltenhagen, 2001. Proceedings. ( Lecture notes in computer science 2204.) (Page: 254-262) Woodrow, RE On magnitude networks. Authors: Fouquet, J-L; Hahn, G; Tuza, ZS; Woodrow, RE Date: 1998. Published by: CONGRESSUS NUMERANTIUM (Volume no.: 133, Page: 75-84) Wozniak, M. On-line arbitrarily vertex decomposable trees. Authors: Hornák, M.; Tuza, Zsolt; Wozniak, M. Date: 2007. Published by: Discrete Applied Mathematics (Volume no.: 155, Issue no.: 11, Page: 1420-1429.) Ye, Deshi Better bounds for the bin packing problem with the "Largest Item in the Bottom" constraint. Authors: Dósa, Gy.; Tuza, Zsolt; Ye, Deshi Editor: Brodnik, A.; Galambos, G. Date: 2011. Published by: MATCOS-10. Proceedings of the 2010 mini-conference on applied theoretical computer science. Koper, 2010. (Page: 65-68.) Yeo, A Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) Authors: Hangos, KM; Tuza, ZS; Yeo, A Date: 2001. Published by: Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.) (Page: 27) Yeo, A. Some complexity problems on single input double output controllers. Authors: Hangos, Katalin; Tuza, Zsolt; Yeo, A. Date: 2009. Published by: Discrete Applied Mathematics (Volume no.: 157, Issue no.: 5, Page: 1146-1158.) Yuster, Raphael On rainbow connection. Authors: Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael Date: 2008. Published by: Electronic Journal of Combinatorics (Volume no.: 15, Issue no.: 1, Page: #R57) Zhang, P. A note on graphs with prescribed complete coloring numbers. Authors: Chartrand, G.; Okamoto, F.; Tuza, Zsolt; Zhang, P. Date: 2010. Published by: Journal of Combinatorial Mathematics and Combinatorial Computing (Volume no.: 73, Page: 77-84.) Zhou, H Uniquely colorable mixed hypergraphs. Authors: Tuza, ZS; Voloshin, VI; Zhou, H Date: 2002. Published by: DISCRETE MATHEMATICS (Volume no.: 248, Issue no.: 1-3, Page: 221-236) New search