Zsolt Tuza

发表

Decompositions of regular bipartite graphs

Zsolt Tuza, Miroslaw Truszczynski, Michael S. Jacobson, 1991, Discret. Math..

Zsolt Tuza, Curtis A. Barefoot, Lane H. Clark, 1996, Discret. Math..

Zsolt Tuza, Gábor Bacsó, Anita Keszler, 2013, 2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems.

The color cost of a caterpillar

Zsolt Tuza, Frank Harary, Mario Gionfriddo, 1997, Discret. Math..

Uniformly resolvable decompositions of Kv into P3 and K3 graphs

Zsolt Tuza, Salvatore Milici, Z. Tuza, 2013, Discret. Math..

Approximation of satisfactory bisection problems

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2008, J. Comput. Syst. Sci..

Coloring the cliques of line graphs

Zsolt Tuza, Zdenek Ryjácek, Gábor Bacsó, 2017, Discret. Math..

Constructing Hamiltonian paths of some special graphs, using a relational spatial database model

Zsolt Tuza, Ágnes Bércesné Novák, 2003 .

A conjecture on triangles of graphs

Zsolt Tuza, 1990, Graphs Comb..

Colorability of mixed hypergraphs and their chromatic inversions

Zsolt Tuza, Máté Hegyháti, 2013, J. Comb. Optim..

The structure of rectangle families dividing the plane into maximum number of atoms

Zsolt Tuza, András Gyárfás, Jenö Lehel, 1984, Discret. Math..

Inequalities for Minimal Covering Sets in Set Systems of Given Rank

Zsolt Tuza, 1994, Discret. Appl. Math..

Semi on-line algorithms for the partition problem

Zsolt Tuza, Hans Kellerer, Maria Grazia Speranza, 1997, Oper. Res. Lett..

Marking Games and the Oriented Game Chromatic Number of Partial k-Trees

Zsolt Tuza, Hal A. Kierstead, 2003, Graphs Comb..

The expected relative error of the polyhedral approximation of the max-cut problem

Zsolt Tuza, Svatopluk Poljak, S. Poljak, 1994, Oper. Res. Lett..

Perfect couples of graphs

Zsolt Tuza, Gábor Simonyi, János Körner, 1992, Comb..

On-line arbitrarily vertex decomposable trees

Zsolt Tuza, Mirko Hornák, Mariusz Wozniak, 2007, Discret. Appl. Math..

Stronger bounds for generalized degress and Menger path systems

Zsolt Tuza, Ralph J. Faudree, 1995, Discuss. Math. Graph Theory.

Using weight decision for decreasing the price of anarchy in selfish bin packing games

Zsolt Tuza, Hans Kellerer, György Dósa, 2019, Eur. J. Oper. Res..

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Zsolt Tuza, Gerhard J. Woeginger, Daniel Král, 2001, WG.

$$[1,1,t]$$-Colorings of Complete Graphs

Zsolt Tuza, Arnfried Kemnitz, Massimiliano Marangio, 2013, Graphs Comb..

Lower bound on the profile of degree pairs in cross-intersecting set systems

Zsolt Tuza, Zsuzsanna Szaniszlo, 2007, Comb..

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2003, Algorithmica.

Tropical matchings in vertex-colored graphs

Zsolt Tuza, Yannis Manoussakis, Johanne Cohen, 2017, Electron. Notes Discret. Math..

The Forwarding Index of Directed Networks

Zsolt Tuza, Yannis Manoussakis, Z. Tuza, 1996, Discret. Appl. Math..

The domination number of the graph defined by two levels of the n-cube, II

Zsolt Tuza, Gyula O. H. Katona, József Balogh, 2021, Eur. J. Comb..

On the Complexity of Finding a Potential Community

Zsolt Tuza, Cristina Bazgan, Thomas Pontoizeau, 2017, CIAC.

Induced Decompositions of Highly Dense Graphs

Zsolt Tuza, Nathann Cohen, Z. Tuza, 2015, J. Graph Theory.

How to Make A Random Graph Irregular

Zsolt Tuza, 1995, Random Struct. Algorithms.

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types

Zsolt Tuza, Vitaly I. Voloshin, 2003, Comput. Sci. J. Moldova.

On short cycles through prescribed vertices of a graph

Zsolt Tuza, Jochen Harant, Erhard Hexel, 2004, Discret. Math..

Optimal routings in communication networks with linearly bounded forwarding index

Zsolt Tuza, Yannis Manoussakis, 1996, Networks.

Online Results for Black and White Bin Packing

Zsolt Tuza, Hans Kellerer, Leah Epstein, 2014, Theory of Computing Systems.

Infinite versus finite graph domination

Zsolt Tuza, Gábor Bacsó, Heinz A. Jung, 2010, Discret. Math..

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Zsolt Tuza, Cristina Bazgan, Z. Tuza, 2008, J. Discrete Algorithms.

Upper chromatic number of Steiner triple and quadruple systems

Zsolt Tuza, Lorenzo Milazzo, Z. Tuza, 1997, Discret. Math..

The irregularity strength and cost of the union of cliques

Stanislav Jendrol', Zsolt Tuza, Michal Tkác, 1996, Discret. Math..

Rankings of Graphs

Klaus Jansen, Jitender S. Deogun, Zsolt Tuza, 1998, SIAM J. Discret. Math..

Covering the cliques of a graph with vertices

Zsolt Tuza, Paul Erdös, Tibor Gallai, 1992, Discret. Math..

Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms pdf

Zsolt Tuza, György Dósa, 2012, ArXiv.

Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles

Zsolt Tuza, Salvatore Milici, Selda Küçükçifçi, 2013, Discret. Math..

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs

Zsolt Tuza, Miklos Santha, Cristina Bazgan, 1999, J. Algorithms.

Saturated graphs with minimal number of edges

Zsolt Tuza, L. Kászonyi, Z. Tuza, 1986, J. Graph Theory.

Linear-Time Algorithms for the Max Cut Problem

Zsolt Tuza, Nguyen Van Ngoc, 1993, Comb. Probab. Comput..

Disjoint Paired-Dominating sets in Cubic Graphs

Csilla Bujtás, Zsolt Tuza, Gábor Bacsó, 2019, Graphs Comb..

Strict colorings of Steiner triple and quadruple systems: a survey

Zsolt Tuza, Vitaly I. Voloshin, Lorenzo Milazzo, 2003, Discret. Math..

Dominating Bipartite Subgraphs in Graphs

Zsolt Tuza, Gábor Bacsó, Danuta Michalak, 2005, Discuss. Math. Graph Theory.

New models of graph-bin packing

Csilla Bujtás, Zsolt Tuza, György Dósa, 2016, Theor. Comput. Sci..

Scheduling groups of tasks with precedence constraints on three dedicated processors

Zsolt Tuza, Maria Grazia Speranza, Renata Mansini, 2004, Discret. Appl. Math..

Saturated r-uniform hypergraphs

Zsolt Tuza, Zoltán Füredi, Paul Erdös, 1991, Discret. Math..

Contractions and minimalk-colorability

Zsolt Tuza, Z. Tuza, 1990, Graphs Comb..

Groupies in random graphs

Zsolt Tuza, Wenceslas Fernandez de la Vega, 2009, Inf. Process. Lett..

Remarks on the existence of uniquely partitionable planar graphs

Zsolt Tuza, Margit Voigt, Peter Mihók, 1999, Discuss. Math. Graph Theory.

4-chromatic Graphs with Large Odd Girth

Zsolt Tuza, Nguyen Van Ngoc, Z. Tuza, 1995, Discret. Math..

How many atoms can be defined by boxes?

Zsolt Tuza, András Gyárfás, Jenö Lehel, 1985, Comb..

Heredity properties of connectedness in edge-coloured complete graphs

Zsolt Tuza, Adam Idzik, 2001, Discret. Math..

Helly Property in Finite Set Systems

Zsolt Tuza, 1993, J. Comb. Theory, Ser. A.

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum

Armin Fügenschuh, Zsolt Tuza, Zhiyi Tan, 2017, Central Eur. J. Oper. Res..

Semi on-line scheduling on three processors with known sum of the tasks

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2007 .

Uniquely colorable mixed hypergraphs

Zsolt Tuza, Vitaly I. Voloshin, Huishan Zhou, 2002, Discret. Math..

Structural domination of graphs

Zsolt Tuza, Gábor Bacsó, 2002, Ars Comb..

C-perfect hypergraphs

Csilla Bujtás, Zsolt Tuza, 2010, J. Graph Theory.

Covering and independence in triangle structures

Zsolt Tuza, Paul Erdös, Tibor Gallai, 1996, Discret. Math..

Decompositions of Plane Graphs Under Parity Constrains Given by Faces

Zsolt Tuza, Július Czap, 2013, Discuss. Math. Graph Theory.

Extremal jumps of the Hall number

Zsolt Tuza, 2007, Electron. Notes Discret. Math..

Bin Packing/Covering with Delivery, solved with the evolution of algorithms

Zsolt Tuza, György Dósa, Attila Benko, 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality

Zsolt Tuza, Adam Idzik, Stanislaw Bylka, 1999, Discret. Math..

Another Extremal Property of Some Turan Graphs

Zsolt Tuza, Peter D. Johnson, Christopher S. Edwards, 1987, Eur. J. Comb..

Choosability and fractional chromatic numbers

Noga Alon, Zsolt Tuza, Margit Voigt, 1997, Discret. Math..

Algorithms and Structure: Set Partitions Under Local Constraints

Csilla Bujtás, Zsolt Tuza, lokális feltételekkel, 2008 .

Local constraints ensuring small representing sets

Zsolt Tuza, Paul Erdös, András Hajnal, 1991, J. Comb. Theory, Ser. A.

Ramsey numbers for local colorings

Zsolt Tuza, Richard H. Schelp, András Gyárfás, 1987, Graphs Comb..

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets

Zsolt Tuza, Miroslaw Truszczynski, Z. Tuza, 1992, Discret. Math..

Local Anti-Ramsey Numbers of Graphs

Zsolt Tuza, Maria Axenovich, Tao Jiang, 2003, Combinatorics, Probability and Computing.

New trends in the theory of graph colorings: Choosability and list coloring

Zsolt Tuza, Jan Kratochvíl, Margit Voigt, 1997, Contemporary Trends in Discrete Mathematics.

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$Pt-Free and Broom-Free Graphs

Zsolt Tuza, Erik Jan van Leeuwen, Dániel Marx, 2018, Algorithmica.

On Rainbow Connection

Raphael Yuster, Zsolt Tuza, Yair Caro, 2008, Electron. J. Comb..

G-designs without blocking sets, Note

Zsolt Tuza, Salvatore Milici, Gaetano Quattrocchi, 2014, Ars Comb..

Schütte's Tournament Problem and Intersecting Families of Sets

Zsolt Tuza, Mariusz Haluszczak, Jaroslaw Grytczuk, 2003, Comb. Probab. Comput..

Aspects of upper defensive alliances

Zsolt Tuza, Henning Fernau, Cristina Bazgan, 2019, Discret. Appl. Math..

On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time

Zsolt Tuza, Maria Grazia Speranza, 1999, Ann. Oper. Res..

Packing Problems in Edge-colored Graphs

Zsolt Tuza, Yannis Manoussakis, Pavol Hell, 1994, Discret. Appl. Math..

Algorithmic Aspects of Neighborhood Numbers

Zsolt Tuza, Gerard J. Chang, Martin Farber, 1993, SIAM J. Discret. Math..

On Specific Factors in Graphs

Zsolt Tuza, Stanislav Jendrol, Csilla Bujt'as, 2020, Graphs Comb..

On light cycles in plane triangulations

Stanislav Jendrol', Zsolt Tuza, Tomás Madaras, 1999, Discret. Math..

Induced cycles in triangle graphs

Csilla Bujtás, Zsolt Tuza, S. Aparna Lakshmanan, 2016, Discret. Appl. Math..

The Graph-Bin Packing Problem

Csilla Bujtás, Zsolt Tuza, György Dósa, 2011, Int. J. Found. Comput. Sci..

Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures

Zsolt Tuza, Cristina Bazgan, Sonia Toubaline, 2010, IWOCA.

An application of Combinatorics in Cryptography

Zsolt Tuza, Igor Semaev, Peter Horak, 2015, Electron. Notes Discret. Math..

The domination number of the graph defined by two levels of the n-cube

Zsolt Tuza, Gyula O. H. Katona, Leila Badakhshian, 2019, Discret. Appl. Math..

Vertex coloring without large polychromatic stars

Csilla Bujtás, Zsolt Tuza, E. Sampathkumar, 2012, Discret. Math..

Offline black and white bin packing

Zsolt Tuza, Hans Kellerer, Leah Epstein, 2015, Theor. Comput. Sci..

Distance domination versus iterated domination

Zsolt Tuza, Gábor Bacsó, 2012, Discret. Math..

Distance Graphs with Finite Chromatic Number

Zsolt Tuza, Margit Voigt, Imre Z. Ruzsa, 2002, J. Comb. Theory, Ser. B.

Rankings of Directed Graphs

Zsolt Tuza, Jan Kratochvíl, 1999, SIAM J. Discret. Math..

On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract)

Zsolt Tuza, Miklos Santha, Cristina Bazgan, 1998, STACS.

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game

Csilla Bujtás, Zsolt Tuza, Michael A. Henning, 2016, SIAM J. Discret. Math..

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete

Zsolt Tuza, Jan Kratochvíl, Petr Savický, 1993, SIAM J. Comput..

The cost chromatic number and hypergraph parameters

Zsolt Tuza, Gábor Bacsó, 2006, Discuss. Math. Graph Theory.

Uniform Mixed Hypergraphs: The Possible Numbers of Colors

Csilla Bujtás, Zsolt Tuza, 2008, Graphs Comb..

On the maximum number of qualitatively independent partitions

Zsolt Tuza, Svatopluk Poljak, S. Poljak, 1989, J. Comb. Theory, Ser. A.

Cordial labeling of hypertrees

Zsolt Tuza, Sylwia Cichacz-Przenioslo, Agnieszka Görlich, 2013, Discret. Math..

Transversals and domination in uniform hypergraphs

Csilla Bujtás, Zsolt Tuza, Michael A. Henning, 2012, Eur. J. Comb..

Geometric representation for semi on-line scheduling on uniform processors

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2010, Optim. Methods Softw..

Chromatic spectrum is broken

Zsolt Tuza, Vitaly I. Voloshin, Dhruv Mubayi, 1999, Electron. Notes Discret. Math..

Safe Sets in Graphs: Graph Classes and Structural Parameters

Zsolt Tuza, Yota Otachi, Tadashi Sakuma, 2016, COCOA.

Some combinatorial problems concerning finite languages

Zsolt Tuza, 1986, IMYCS.

On-line rankings of graphs

Zsolt Tuza, Margit Voigt, Ingo Schiermeyer, 2000, Discret. Math..

Mixed colorings of hypergraphs

Csilla Bujtás, Zsolt Tuza, 2006, Electron. Notes Discret. Math..

Graph Domination in Distance Two

Zsolt Tuza, Gábor Bacsó, Attila Tálos, 2005, Discuss. Math. Graph Theory.

Searching for acyclic orientations of graphs

Zsolt Tuza, Eberhard Triesch, Martin Aigner, 1995, Discret. Math..

Isomorphism of two infinite-chromatic triangle-free graphs

Zsolt Tuza, Z. Tuza, 1988, Discret. Math..

Bin covering with a general profit function: approximability results

Zsolt Tuza, György Dósa, Attila Benko, 2013, Central Eur. J. Oper. Res..

Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices

Zsolt Tuza, Z. Tuza, 1984, Comb..

Hamiltonian properties of Toeplitz graphs

Zsolt Tuza, Christina Zamfirescu, Jack A. A. van der Veen, 1996, Discret. Math..

A note on the polytope of bipartite TSP

Zsolt Tuza, Béla Vizvári, Gergely Kovács, 2018, Discret. Appl. Math..

Extremal bi-Helly families

Zsolt Tuza, Z. Tuza, 2000, Discret. Math..

Covering all cliques of a graph

Zsolt Tuza, Z. Tuza, 1991, Discret. Math..

3-consecutive Edge Coloring of a Graph

Csilla Bujtás, Zsolt Tuza, E. Sampathkumar, 2012, Discret. Math..

Perfect graph decompositions

Zsolt Tuza, 1991, Graphs Comb..

A General Bin Packing Game: Interest Taken into Account

Zsolt Tuza, Xin Han, György Dósa, 2017, Algorithmica.

Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs

Zsolt Tuza, Z. Tuza, 1994, Discret. Math..

Improper C-colorings of graphs

Csilla Bujtás, Zsolt Tuza, E. Sampathkumar, 2011, Discret. Appl. Math..

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence

Csilla Bujtás, Zsolt Tuza, E. Sampathkumar, 2016, Ars Comb..

F-WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2015, Discret. Appl. Math..

Degree Sums and Covering Cycles

Zsolt Tuza, Hikoe Enomoto, Atsushi Kaneko, 1995, J. Graph Theory.

Voloshin's conjecture for C-perfect hypertrees

Csilla Bujtás, Zsolt Tuza, 2010, Australas. J Comb..

Maximum bipartite subgraphs of Kneser graphs

Zsolt Tuza, Svatopluk Poljak, S. Poljak, 1987, Graphs Comb..

Linear upper bounds for local Ramsey numbers

Zsolt Tuza, Miroslaw Truszczynski, 1987, Graphs Comb..

Largest size and union of Helly families

Zsolt Tuza, 1994, Discret. Math..

On the context-free production complexity of finite languages

Zsolt Tuza, 1987, Discret. Appl. Math..

Computational aspects of connectionist interaction information retrieval

Zsolt Tuza, Sándor Dominich, Z. Tuza, 2003 .

Minimum number of affine simplices of given dimension

Zsolt Tuza, István Szalkai, 2015, Discret. Appl. Math..

Turán numbers and batch codes

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2013, Discret. Appl. Math..

On caterpillar factors in graphs

Stanislav Jendrol', Csilla Bujtás, Zsolt Tuza, 2020, Theor. Comput. Sci..

Maximum cuts and largest bipartite subgraphs

Zsolt Tuza, Svatopluk Poljak, S. Poljak, 1993, Combinatorial Optimization.

Monochromatic coverings and tree Ramsey numbers

Zsolt Tuza, 1994, Discret. Math..

The Chromatic Spectrum of Mixed Hypergraphs

Zsolt Tuza, Vitaly I. Voloshin, Dhruv Mubayi, 2002, Graphs Comb..

Colorings and Related Topics

Zsolt Tuza, Edmund K. Burke, D. de Werra, 2003, Handbook of Graph Theory.

Color-bounded hypergraphs, IV: Stable colorings of hypertrees

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2010, Discret. Math..

Network Majority on Tree Topological Network

Zsolt Tuza, Tadashi Sakuma, Yannis Manoussakis, 2016, Electron. Notes Discret. Math..

Spatiotemporal databases: Models for attracting students to research

Zsolt Tuza, Ágnes Bércesné Novák, Peter Z. Revesz, 2003 .

Minimum number of elements representing a set system of given rank

Zsolt Tuza, 1989, J. Comb. Theory, Ser. A.

Domination in partitioned graphs

Zsolt Tuza, Preben D. Vestergaard, 2002, Discuss. Math. Graph Theory.

Uncolorable Mixed Hypergraphs

Zsolt Tuza, Vitaly I. Voloshin, Z. Tuza, 2000, Discret. Appl. Math..

Characterization of graphs dominated by induced paths

Zsolt Tuza, Margit Voigt, Gábor Bacsó, 2007, Discret. Math..

Problems on cycles and colorings

Zsolt Tuza, Z. Tuza, 2013, Discrete Mathematics.

Multiprofessor scheduling

Zsolt Tuza, György Dósa, 2018, Discret. Appl. Math..

On Grundy Total Domination Number in Product Graphs

Csilla Bujtás, Zsolt Tuza, Gasper Kosmrlj, 2021, Discuss. Math. Graph Theory.

Every 2-choosable graph is (2m, m)-choosable

Zsolt Tuza, Margit Voigt, Z. Tuza, 1996, Journal of Graph Theory.

The most vital nodes with respect to independent set and vertex cover

Zsolt Tuza, Cristina Bazgan, Sonia Toubaline, 2011, Discret. Appl. Math..

Optimal Multi-TDMA Scheduling in Ring Topology Networks

Zsolt Tuza, Gergely Vakulya, Gyula Simon, 2015 .

Strict colourings for classes of steiner triple systems

Zsolt Tuza, Lorenzo Milazzo, Z. Tuza, 1998, Discrete Mathematics.

Hypergraphs without a large star

Zsolt Tuza, Zoltán Füredi, 1985, Discret. Math..

Unique colorings of bi-hypergraphs

Zsolt Tuza, Vitaly I. Voloshin, Gábor Bacsó, 2003, Australas. J Comb..

Critical hypergraphs and intersecting set-pair systems

Zsolt Tuza, Z. Tuza, 1985, J. Comb. Theory, Ser. B.

Tropical Dominating Sets in Vertex-Coloured Graphs pdf

Csilla Bujtás, Zsolt Tuza, Marek Karpinski, 2015, WALCOM.

Black and White Bin Packing

Zsolt Tuza, Hans Kellerer, József Békési, 2012, WAOA.

Graph coloring in linear time

Zsolt Tuza, Z. Tuza, 1992, J. Comb. Theory, Ser. B.

Largest Non-Unique Subgraphs

Zsolt Tuza, Lars Døvling Andersen, Preben Dahl Vestergaard, 2006, Graphs Comb..

Dense subgraph mining with a mixed graph model

Zsolt Tuza, Tamás Szirányi, Anita Keszler, 2013, Pattern Recognit. Lett..

Intersection Dimensions of Graph Classes

Zsolt Tuza, Jan Kratochvíl, 1994, Graphs Comb..

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2004, J. Sched..

Complexity and approximation of the Constrained Forest problem

Zsolt Tuza, Cristina Bazgan, Basile Couëtoux, 2011, Theor. Comput. Sci..

Ensembles d'articulation d'un graphe γ-critique

Zsolt Tuza, Jenö Lehel, 1980, Discret. Math..

Efficient algorithms for decomposing graphs under degree constraints

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2007, Discret. Appl. Math..

Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.)

Zsolt Tuza, Anders Yeo, Katalin M. Hangos, 2001 .

A Periodic Division Pattern that Cannot be Generated by D0L Systems

Zsolt Tuza, Aristid Lindenmayer, Martin J. M. de Boer, 1991, Theor. Comput. Sci..

Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2009, Discret. Math..

Total Transversals and Total Domination in Uniform Hypergraphs

Csilla Bujtás, Zsolt Tuza, Michael A. Henning, 2014, Electron. J. Comb..

Menger-type theorems with restrictions on path lengths

Zsolt Tuza, László Pyber, 1993, Discret. Math..

Mixed hypergraphs and beyond

Zsolt Tuza, 2018, Art Discret. Appl. Math..

Fractional Domination Game

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2019, Electron. J. Comb..

Rainbow Subgraphs in Properly Edge-colored Graphs

Vojtech Rödl, Zsolt Tuza, V. Rödl, 1992, Random Struct. Algorithms.

A characterization of graphs without long induced paths

Zsolt Tuza, Gábor Bacsó, Z. Tuza, 1990, J. Graph Theory.

Dominating Sequences in Grid-Like and Toroidal Graphs

Csilla Bujtás, Zsolt Tuza, Gasper Kosmrlj, 2016, Electron. J. Comb..

Optimal guard sets and the Helly property

Zsolt Tuza, Gábor Bacsó, Z. Tuza, 2011, Eur. J. Comb..

Narrowness, pathwidth, and their application in natural language processing

Zsolt Tuza, András Kornai, Z. Tuza, 1992, Discret. Appl. Math..

On two intersecting set systems and k-continuous boolean functions

Zsolt Tuza, Z. Tuza, 1987, Discret. Appl. Math..

Oriented list colorings of graphs

Zsolt Tuza, Margit Voigt, 2001, J. Graph Theory.

Cycles of given color patterns

Zsolt Tuza, Yannis Manoussakis, M. Spyratos, 1996, J. Graph Theory.

Inequalities for two set systems with prescribed intersections

Zsolt Tuza, 1987, Graphs Comb..

Approximability of the upper chromatic number of hypergraphs

Csilla Bujtás, Zsolt Tuza, 2015, Discret. Math..

Approximation algorithms for the minimum rainbow subgraph problem

Zsolt Tuza, Stephan Matos Camacho, Ingo Schiermeyer, 2010, Discret. Math..

Circular coloring of graphs via linear programming and tabu search

Zsolt Tuza, Mate Barany, Z. Tuza, 2015, Central Eur. J. Oper. Res..

Partition of C4-Designs into Minimum and Maximum Number of P3-Designs

Zsolt Tuza, Gaetano Quattrocchi, Z. Tuza, 2004, Graphs Comb..

Improved bounds for batch scheduling with nonidentical job sizes

Zsolt Tuza, Yujie Yan, Zhiyi Tan, 2014 .

Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

Zsolt Tuza, 2008, SIAM J. Discret. Math..

Satisfactory graph partition, variants, and generalizations

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2010, Eur. J. Oper. Res..

Sharpness of Some Intersection Theorems

Zsolt Tuza, Mihály Hujter, László Spissich, 2000, Eur. J. Comb..

Clique-transversal sets of line graphs and complements of line graphs

Zsolt Tuza, Thomas Andreae, Martin Schughart, 1991, Discret. Math..

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

Zsolt Tuza, György Dósa, M. Grazia Speranza, 2011, J. Comb. Optim..

Formal Theory of Connectionist Web Retrieval

Zsolt Tuza, Sándor Dominich, Adrienn Skrop, 2006, Soft Computing in Web Information Retrieva.

Helly-type Hypergraphs and Sperner Families

Zsolt Tuza, 1984, Eur. J. Comb..

Graph labeling games

Zsolt Tuza, Z. Tuza, 2016, Electron. Notes Discret. Math..

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9

Zsolt Tuza, Xin Han, György Dósa, 2013, Theor. Comput. Sci..

An upper bound on the number of cliques in a graph

Zsolt Tuza, Martin Farber, Mihály Hujter, 1993, Networks.

Algorithmic complexity of list colorings

Zsolt Tuza, Jan Kratochvíl, 1994, Discret. Appl. Math..

Choice-Perfect Graphs

Zsolt Tuza, 2013, Discuss. Math. Graph Theory.

Bipartite Subgraphs of Triangle-Free Graphs

Zsolt Tuza, Svatopluk Poljak, 1994, SIAM J. Discret. Math..

The satisfactory partition problem

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2006, Discret. Appl. Math..

Highly connected counterexamples to a conjecture on ά -domination

Zsolt Tuza, Z. Tuza, 2005, Discuss. Math. Graph Theory.

Learning of winning strategies for terminal games with linear-size memory

Zsolt Tuza, Thomas Böhme, Herwig Unger, 2009, Int. J. Game Theory.

Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations

Zsolt Tuza, Deshi Ye, György Dósa, 2013, J. Comb. Optim..

Computing all possible graph structures describing linearly conjugate realizations of kinetic systems

Zsolt Tuza, Gábor Szederkényi, Bernadett Ács, 2016, Comput. Phys. Commun..

Blocking Sets in SQS(2u)

Zsolt Tuza, Mario Gionfriddo, Salvatore Milici, 1994, Comb. Probab. Comput..

Minimally Non-Preperfect Graphs of Small Maximum Degree

Zsolt Tuza, Annegret Wagler, 2001, Graphs Comb..

Color-bounded hypergraphs, V: host graphs and subdivisions

Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin, 2011, Discuss. Math. Graph Theory.

Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images

Zsolt Tuza, Tamás Szirányi, Anita Keszler, 2011, IMAGAPP/IVAPP.

Equality of domination and transversal numbers in hypergraphs

Csilla Bujtás, Zsolt Tuza, S. Arumugam, 2013, Discret. Appl. Math..

Maximum number of colors in hypertrees of bounded degree

Csilla Bujtás, Zsolt Tuza, 2015, Central Eur. J. Oper. Res..

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems

Zsolt Tuza, Paolo Dell'Olmo, Maria Grazia Speranza, 1997, Discret. Appl. Math..

Minimal colorings for properly colored subgraphs

Zsolt Tuza, Yannis Manoussakis, Margit Voigt, 1996, Graphs Comb..

Safe sets, network majority on weighted trees

Zsolt Tuza, Tadashi Sakuma, Yannis Manoussakis, 2018, Networks.

Ranking of Graphs

Klaus Jansen, Jitender S. Deogun, Zsolt Tuza, 1994, WG.

Safe sets in graphs: Graph classes and structural parameters

Zsolt Tuza, Yota Otachi, Tadashi Sakuma, 2018, J. Comb. Optim..

Hypergraph coverings and local colorings

Zsolt Tuza, Yair Caro, 1991, J. Comb. Theory, Ser. B.

Switching Distance Graphs

Zsolt Tuza, Michael A. Henning, John G. Gimbel, 1997, Ars Comb..

3-consecutive C-colorings of graphs

Csilla Bujtás, Zsolt Tuza, E. Sampathkumar, 2010, Discuss. Math. Graph Theory.

On conjectures of Berge and Chvátal

Zsolt Tuza, Mario Gionfriddo, 1994, Discret. Math..

Local and global average degree in graphs and multigraphs

Zsolt Tuza, Paul Erdös, Jozef Sirán, 1994, J. Graph Theory.

Disjoint blocking sets in cycle systems

Zsolt Tuza, Salvatore Milici, 1999, Discret. Math..

Local k-colorings of graphs and hypergraphs

Vojtech Rödl, Zsolt Tuza, Richard H. Schelp, 1987, J. Comb. Theory, Ser. B.

Periodic String Division Generated by Deterministic L Systems

Zsolt Tuza, 1990, Inf. Process. Lett..

Some properties of vertex-oblique graphs

Zsolt Tuza, Ewa Drgas-Burchardt, Jerzy Michael, 2016, Discret. Math..

Ramsey-remainder

Zsolt Tuza, Pavel Valtr, Paul Erdös, 1996, Eur. J. Comb..

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy

Zsolt Tuza, Hans Kellerer, György Dósa, 2018, WAOA.

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms

Zsolt Tuza, Dániel Marx, Gábor Bacsó, 2017, IPEC.

K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum

Csilla Bujtás, Zsolt Tuza, 2016, Discuss. Math. Graph Theory.

Efficient Approximation Algorithms for the Subset-Sums Equality Problem

Zsolt Tuza, Miklos Santha, Cristina Bazgan, 1998, ICALP.

Proper connection of graphs

Zsolt Tuza, Yannis Manoussakis, Shinya Fujita, 2012, Discret. Math..

Clumsy packing of dominoes

Zsolt Tuza, András Gyárfás, Jenö Lehel, 1988, Discret. Math..

List Colorings of K5-Minor-Free Graphs With Special List Assignments

Zsolt Tuza, Daniel W. Cranston, Margit Voigt, 2012, J. Graph Theory.

Combinatorial batch codes: Extremal problems under Hall-type conditions

Csilla Bujtás, Zsolt Tuza, 2011, Electron. Notes Discret. Math..

The effect of modelling assumptions on the differential index of lumped process models

Zsolt Tuza, Gábor Szederkényi, Katalin M. Hangos, 2002 .

Precoloring extension. I. Interval graphs

Zsolt Tuza, Miklós Biró, Mihály Hujter, 1992, Discret. Math..

Sub-Ramsey numbers for arithmetic progressions

Noga Alon, Zsolt Tuza, Yair Caro, 1989, Graphs Comb..

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins

Zsolt Tuza, Hans Kellerer, Paolo Dell'Olmo, 1998, Inf. Process. Lett..

Degree-constrained decompositions of graphs: Bounded treewidth and planarity

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2006, Theor. Comput. Sci..

Orientations of Graphs with Prescribed Weighted Out-Degrees

Zsolt Tuza, Michael Stiebitz, Margit Voigt, 2015, Graphs Comb..

The cover pebbling number of graphs

Zsolt Tuza, Glenn H. Hurlbert, Lara Pudwell, 2005, Discret. Math..

Neighborhood perfect graphs

Zsolt Tuza, Jenö Lehel, Z. Tuza, 1986, Discret. Math..

Computational aspects of graph theoretic methods in control

Zsolt Tuza, Katalin M. Hangos, Z. Tuza, 1997 .

Unsolved combinatorial problems. Part I. (BRICS Lecture Series, LS-01-1)

Zsolt Tuza, Z. Tuza, 2001 .

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

Armin Fügenschuh, Zsolt Tuza, Zhiyi Tan, 2019, Central Eur. J. Oper. Res..

Semi-online scheduling on two uniform processors

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2008, Theor. Comput. Sci..

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

Zsolt Tuza, Gábor Bacsó, 2009, Discret. Math. Theor. Comput. Sci..

On the Existence and Determination of Satisfactory Partitions in a Graph

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2003, ISAAC.

Multipartite Turán problem for connected graphs and hypergraphs

Zsolt Tuza, 1993, Discret. Math..

Grundy dominating sequences and zero forcing sets

Csilla Bujtás, Zsolt Tuza, Gasper Kosmrlj, 2017, Discret. Optim..

A combinatorial problem related to sparse systems of equations

Zsolt Tuza, Igor A. Semaev, Peter Horák, 2017, Des. Codes Cryptogr..

Complexity and Approximation of Satisfactory Partition Problems

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2005, COCOON.

Restricted assignment scheduling with resource constraints

Zsolt Tuza, Hans Kellerer, György Dósa, 2019, Theor. Comput. Sci..

Precoloring Extension III: Classes of Perfect Graphs

Zsolt Tuza, Mihály Hujter, Z. Tuza, 1996, Combinatorics, Probability and Computing.

On list critical graphs

Zsolt Tuza, Michael Stiebitz, Margit Voigt, 2009, Discret. Math..

List Colorings and Reducibility

Zsolt Tuza, Margit Voigt, Z. Tuza, 1997, Discret. Appl. Math..

The effect of model simplification assumptions on the differential index of lumped process models

Zsolt Tuza, Gábor Szederkényi, Katalin M. Hangos, 2004, Comput. Chem. Eng..

Color-bounded hypergraphs, I: General results

Csilla Bujtás, Zsolt Tuza, 2009, Discret. Math..

Strong branchwidth and local transversals

Zsolt Tuza, Z. Tuza, 2005, Discret. Appl. Math..

Asymptotic results on saturated graphs

Zsolt Tuza, Miroslaw Truszczynski, 1991, Discret. Math..

Ramsey numbers for tournaments

Zsolt Tuza, Yannis Manoussakis, Z. Tuza, 2001, Theor. Comput. Sci..

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2006, Discret. Math. Theor. Comput. Sci..

Bin Packing Game with an Interest Matrix

Zsolt Tuza, Xin Han, György Dósa, 2015, COCOON.

Generalized Line Graphs: Cartesian Products and Complexity of Recognition

Csilla Bujtás, Zsolt Tuza, S. Aparna Lakshmanan, 2015, Electron. J. Comb..

Domination game on uniform hypergraphs

Csilla Bujtás, Zsolt Tuza, Máté Vizer, 2017, Discret. Appl. Math..

The minimum number of vertices in uniform hypergraphs with given domination number

Csilla Bujtás, Zsolt Tuza, Máté Vizer, 2017, Discret. Math..

Asymptotic growth of sparse saturated structures is locally determined

Zsolt Tuza, Z. Tuza, 1992, Discret. Math..

Covering a Graph with a Constrained Forest (Extended Abstract)

Zsolt Tuza, Cristina Bazgan, Basile Couëtoux, 2009, ISAAC.

On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)

Zsolt Tuza, Jan Kratochvíl, Z. Tuza, 2000, SODA '00.

The Acyclic Orientation Game on Random Graphs

Noga Alon, Zsolt Tuza, N. Alon, 1995, Random Struct. Algorithms.

New challenges in the theory of hypergraph coloring

Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin, 2008 .

Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems

Zsolt Tuza, Lorenzo Milazzo, 2009, Ars Comb..

On the b-Chromatic Number of Graphs

Zsolt Tuza, Jan Kratochvíl, Margit Voigt, 2002, WG.

Partition-Crossing Hypergraphs

Csilla Bujtás, Zsolt Tuza, 2018, Acta Cybern..

Graphs without induced P5 and C5

Zsolt Tuza, Gábor Bacsó, 2004, Discuss. Math. Graph Theory.

Minimum order of graphs with given coloring parameters pdf

Zsolt Tuza, Gábor Bacsó, Piotr Borowiecki, 2015, Discret. Math..

Optimal batch codes: Many items or low retrieval requirement

Csilla Bujtás, Zsolt Tuza, 2011, Adv. Math. Commun..

Radius, diameter, and minimum degree

Zsolt Tuza, Paul Erdös, János Pach, 1989, J. Comb. Theory, Ser. B.

Color-bounded hypergraphs, VI: Structural and functional jumps in complexity

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2013, Discret. Math..

Extensions of Gallai's graph covering theorems for uniform hypergraphs

Zsolt Tuza, 1991, J. Comb. Theory, Ser. B.

Game List Colouring of Graphs

Zsolt Tuza, Mieczyslaw Borowiecki, Elzbieta Sidorowicz, 2007, Electron. J. Comb..

The maximum number of edges in 2K2-free graphs of bounded degree

Zsolt Tuza, William T. Trotter, Fan Chung Graham, 1990, Discret. Math..

Large s-representable set systems with low maximum degree

Zsolt Tuza, Peter Horák, 1993, Discret. Math..

Small Edge Sets Meeting all Triangles of a Graph

Csilla Bujtás, Zsolt Tuza, S. Aparna Lakshmanan, 2012, Graphs Comb..

Finding a potential community in networks

Zsolt Tuza, Cristina Bazgan, Thomas Pontoizeau, 2019, Theor. Comput. Sci..

An upper bound on the Ramsey number of trees

Zsolt Tuza, András Gyárfás, Z. Tuza, 1987, Discret. Math..

Efficiency and effectiveness of normal schedules on three dedicated processors

Zsolt Tuza, Paolo Dell'Olmo, Maria Grazia Speranza, 1997, Discret. Math..

Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem

Zsolt Tuza, Miklos Santha, Cristina Bazgan, 2002, J. Comput. Syst. Sci..

Domination properties and induced subgraphs

Zsolt Tuza, Gábor Bacsó, 1993, Discret. Math..

Complexity of choosing subsets from color sets

Zsolt Tuza, Jan Kratochvíl, Margit Voigt, 1998, Discret. Math..

The Disjoint Domination Game

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2014, Discret. Math..

The Number of Maximal Independent Sets in Triangle-Free Graphs

Zsolt Tuza, Mihály Hujter, 1993, SIAM J. Discret. Math..

Distance-constrained labeling of complete trees

Zsolt Tuza, Veronika Halász, 2015, Discret. Math..

Improved lower bounds on k-independence

Zsolt Tuza, Yair Caro, 1991, J. Graph Theory.

Clique coverings and claw-free graphs

Csilla Bujtás, Zsolt Tuza, Ervin Györi, 2020, Eur. J. Comb..

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

Zsolt Tuza, Yannis Manoussakis, 1990, SIAM J. Discret. Math..

List version of L(d, s)-labelings

Zsolt Tuza, Margit Voigt, Anja Kohl, 2005, Theor. Comput. Sci..

Color the cycles

Zsolt Tuza, Gyula O. H. Katona, G. Katona, 2013, Discret. Math..

Smallest Set-Transversals of k-Partitions

Csilla Bujtás, Zsolt Tuza, 2009, Graphs Comb..

Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs

Zsolt Tuza, Jenö Szigeti, Anna Lee, 2001, Discret. Math..

The spectrum of lambda-times repeated blocks for TS(upsilon, lambda)

Zsolt Tuza, Salvatore Milici, 1994, Discret. Math..

Induced subtrees in graphs of large chromatic number

Endre Szemerédi, Zsolt Tuza, András Gyárfás, 1980, Discret. Math..

Nearly uniform distribution of edges among k-subgraphs of a graph

Zsolt Tuza, Jozef Sirán, Z. Tuza, 1992, J. Graph Theory.

Hall number for list colorings of graphs: Extremal results

Zsolt Tuza, 2010, Discret. Math..

Graphs with no induced C4 and 2K2

Zsolt Tuza, Zoltán Blázsik, András Pluhár, 1993, Discret. Math..

On color critical graphs

Vojtech Rödl, Zsolt Tuza, V. Rödl, 1985, J. Comb. Theory, Ser. B.

Independent (k+1)-domination in k-trees

Zsolt Tuza, Anna Fiedorowicz, Elżbieta Sidorowicz, 2020, Discret. Appl. Math..

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors

Zsolt Tuza, Evripidis Bampis, Yannis Manoussakis, 1999, Parallel Comput..

Rankings of Directed Graphs

Zsolt Tuza, Jan Kratochvíl, 1998, WG.

Tropical dominating sets in vertex-coloured graphs

Csilla Bujtás, Zsolt Tuza, Marek Karpinski, 2018, J. Discrete Algorithms.

Speeding up deciphering by hypergraph ordering

Zsolt Tuza, Peter Horák, 2015, Des. Codes Cryptogr..

Induced matchings in bipartite graphs

Zsolt Tuza, Richard H. Schelp, András Gyárfás, 1989, Discret. Math..

Complexity and approximation for Traveling Salesman Problems with profits

Zsolt Tuza, Maria Grazia Speranza, Enrico Angelelli, 2014, Theor. Comput. Sci..

Graph colorings with local constraints - a survey

Zsolt Tuza, Z. Tuza, 1997, Discuss. Math. Graph Theory.

Brooks-type theorems for choosability with separation

Zsolt Tuza, Jan Kratochvíl, Margit Voigt, 1998, J. Graph Theory.

Bounds on the game transversal number in hypergraphs

Csilla Bujtás, Zsolt Tuza, Michael A. Henning, 2016, Eur. J. Comb..

Some complexity problems on single input double output controllers

Zsolt Tuza, Anders Yeo, Katalin M. Hangos, 2009, Discret. Appl. Math..

Comparison of sum choice number with chromatic sum

Zsolt Tuza, Margit Voigt, Arnfried Kemnitz, 2021, Discret. Math..

On saturation of Berge hypergraphs

Zsolt Tuza, D'aniel Gerbner, Bal'azs Patk'os, 2022, European Journal of Combinatorics.

Coloring Properties of Mixed Cycloids

Zsolt Tuza, Vitaly I. Voloshin, György Dósa, 2021, Symmetry.

Optimal strategies in fractional games: vertex cover and domination

Zsolt Tuza, Csilla Bujt'as, Gunter Rote, 2021 .

Strong edge coloring of Cayley graphs and some product graphs

Zsolt Tuza, Suresh Dara, Suchismita Mishra, 2021 .

An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time

Zsolt Tuza, Hans Kellerer, György Dósa, 2021, Theor. Comput. Sci..

Realization of digraphs in Abelian groups and its consequences

Zsolt Tuza, Sylwia Cichacz, 2021, Journal of Graph Theory.

Precoloring Extension. IV. General Bounds and List Colorings

Zsolt Tuza, Mih'aly Hujter, 2021 .

Hypercycle Systems of 5-Cycles in Complete 3-Uniform Hypergraphs

Zsolt Tuza, Anita Keszler, Z. Tuza, 2021 .

Efficient Pre-Solve Algorithms for the Schwerin and Falkenauer_U Bin Packing Benchmark Problems for Getting Optimal Solutions with High Probability

Zsolt Tuza, Ágnes Werner-Stark, György Dósa, 2021, Mathematics.

Cycle systems without 2‐colorings

Zsolt Tuza, Salvatore Milici, Z. Tuza, 1996 .

Self-generating hexagonal cell division patterns

Zsolt Tuza, Aristid Lindenmayer, Jerome Malitz, 1990 .

Zero-sum block designs and graph labelings

Zsolt Tuza, 1995 .

Process Structure Driven Control Structure Selection

Zsolt Tuza, Katalin M. Hangos, 1996 .

On light cycles in plane triangulations

Zsolt Tuza, Roman Soták, Stanislav Jendrol, 1999 .

New trends in the theory ofgraph colorings : Choosability and list

Zsolt Tuza, coloringJan, Kratochv, 1998 .

The variety of domination games

Zsolt Tuza, Sandi Klavžar, Máté Vizer, 2018, Aequationes mathematicae.

Steiner systems and large non-Hamiltonian hypergraphs

Zsolt Tuza, 2006 .

A note on graphs with prescribed complete coloring numbers

Zsolt Tuza, Gary Chartrand, Ping Zhang, 2010 .

Coloring intervals with four types of constraints

Zsolt Tuza, Cs. Bujtás, 2009 .

Relaxations of Hall's condition: Optimal batch codes with multiple queries

Csilla Bujtás, Zsolt Tuza, 2012 .

Locally Generated Colourings of Hexagonal Cell Division Patterns: Application to Retinal Cell Differentiation

Zsolt Tuza, Aristid Lindenmayer, 1992 .

Vertex coverings of the edge set in a connected graph

Zsolt Tuza, Paul Erdős, P. Erdos, 1995 .

Irregular assignments and vertex-distinguishing edge-colorings of graphs

Zsolt Tuza, Eberhard Triesch, Martin Aigner, 1990 .

Maximum number of colors: C-coloring and related problems

Csilla Bujtás, Zsolt Tuza, Z. Tuza, 2011 .

Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory

Zsolt Tuza, Gábor Szederkényi, Zoltan A. Tuza, 2015 .

Upper chromatic number of finite projective planes

Zsolt Tuza, Gábor Bacsó, Z. Tuza, 2008 .

C-perfect hypergraphs

Csilla Bujtás, Zsolt Tuza, 2010 .

Transversal designs and induced decompositions of graphs

Zsolt Tuza, Csilla Bujt'as, 2015 .

On k-local and k-mean colorings of graphs and hypergraphs

Zsolt Tuza, Yair Caro, 1993 .

Perfect Triangle Families

Zsolt Tuza, 1994 .

Optimal combinatorial batch codes derived from dual systems

Csilla Bujtás, Zsolt Tuza, 2011 .

Structure simplification of dynamic process models

Zsolt Tuza, Katalin M. Hangos, Adrien Leitold, 2002 .

Complexity of the satisfactory partition problem

Zsolt Tuza, Daniel Vanderpooten, Cristina Bazgan, 2003 .

Further Topics in Graph Coloring

Zsolt Tuza, Z. Tuza, 2003 .

Problems and Results on Colorings of Mixed Hypergraphs

Zsolt Tuza, Vitaly I. Voloshin, Z. Tuza, 2008 .

Decompositions of partially ordered sets into chains and antichains of given size

Zsolt Tuza, Yair Caro, 1988 .