| Date | Author/Title | | Document Type |
|---|
| 2013 | Keszler, Anita and Szirányi, Tamás and Tuza, Zsolt
Dense subgraph mining with a mixed graph model |  | ISI Article |
| 2012 | Bacsó, Gábor and Tuza, Zsolt
Distance domination versus iterated domination | | ISI Article |
| 2012 | Szederkényi, Gábor and Hangos, Katalin and Tuza, Zsolt
Finding Weakly Reversible Realizations of Chemical Reaction Networks Using Optimization | | ISI Article |
| 2011 | Bazgan, Cristina and Couëtoux, Basile and Tuza, Zsolt
Complexity and approximation of the Constrained Forest problem | | ISI Article |
| 2011 | Bazgan, C. and Couetoux, B. and Tuza, Zsolt
Complexity and approximation of the constrained forest problem | | ISI Article |
| 2011 | Bujtás, Csilla and Sampathkumar, E and Tuza, Zsolt and Pushpalatha, L and Vasundhara, R
Improper C-colorings of graphs | | ISI Article |
| 2011 | Bujtás, Csilla and Tuza, Zsolt
Maximum number of colors: C-coloring and related problems | | ISI Article |
| 2011 | Bujtás, Csilla and Tuza, Zsolt
Optimal batch codes: many items or low retrieval requirement | | ISI Article |
| 2011 | Bujtás, Csilla and Tuza, Zsolt
Optimal combinatorial batch codes derived from dual systems | | ISI Article |
| 2011 | Bacsó, Gábor and Tuza, Zsolt
Optimal guard sets and the Helly property | | ISI Article |
| 2011 | Bujtás, Csilla and Dósa, György and Imreh, Csanád and Nagy-GYörgy, Judit and Tuza, Zsolt
The graph-bin packing problem | | ISI Article |
| 2011 | Bazgan, Cristina and Toubaline, Sonia and Tuza, Zsolt
The most vital nodes with respect to independent set and vertex cover | | ISI Article |
| 2010 | Matos Camacho, S. and Schiermeyer, I. and Tuza, Zsolt
Approximation algorithms for the minimum rainbow subgraph problem | | ISI Article |
| 2010 | Bujtás, Cs. and Tuza, Zsolt
C-perfect hypergraphs | | ISI Article |
| 2010 | Bujtás, Cs. and Tuza, Zsolt
Color-bounded hypergraphs, IV: stable colorings of hypertrees | | ISI Article |
| 2010 | Angelelli, E. and Speranza, M. G. and Szoldatics, J. and Tuza, Zsolt
Geometric representation for semi on-line scheduling on uniform processors | | ISI Article |
| 2010 | Tuza, Zsolt
Hall number for list colorings of graphs: extremal results | | ISI Article |
| 2010 | Bacsó, Gábor and Jung, H. A. and Tuza, Zsolt
Infinite versus finite graph domination | | ISI Article |
| 2010 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Satisfactory graph partition, variants, and generalizations | | ISI Article |
| 2009 | Bacsó, Gábor and Tuza, Zsolt
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree | | ISI Article |
| 2009 | Bujtás, Cs. and Tuza, Zsolt
Color-bounded hypergraphs, I: general results | | ISI Article |
| 2009 | Bujtás, Cs. and Tuza, Zsolt
Color-bounded hypergraphs, II: interval hypergraphs and hypertrees | | ISI Article |
| 2009 | Fernandez de la Vega, W. and Tuza, Zsolt
Groupies in random graphs | | ISI Article |
| 2009 | Böhme, Th. and Göring, F. and Tuza, Zsolt and Unger, H.
Learning of winning strategies for terminal games with linear-size memory | | ISI Article |
| 2009 | Milazzo, L. and Tuza, Zsolt
Logarithmic upper bound for the upper chromatic number of S(t,t+1,v) systems | | ISI Article |
| 2009 | Stiebitz, M. and Tuza, Zsolt and Voigt, M.
On list critical graphs | | ISI Article |
| 2009 | Bujtás, Cs. and Tuza, Zsolt
Smallest set-transversals of k-partitions | | ISI Article |
| 2009 | Hangos, Katalin and Tuza, Zsolt and Yeo, A.
Some complexity problems on single input double output controllers | | ISI Article |
| 2008 | Bazgan, Cristina and Tuza, Zsolt and Vanderpooten, Daniel
Approximation of satisfactory bisection problems | | ISI Article |
| 2008 | Tuza, Zsolt
Hereditary domination in graphs: characterization with forbidden induced subgraphs | | ISI Article |
| 2008 | Caro, Yair and Lev, Arie and Roditty, Yehuda and Tuza, Zsolt and Yuster, Raphael
On rainbow connection | | ISI Article |
| 2008 | Angelelli, Enrico and Speranza, Maria Grazia and Tuza, Zsolt
Semi-online scheduling on two uniform processors | | ISI Article |
| 2008 | Bujtás, Csilla and Tuza, Zsolt
Uniform mixed hypergraphs: the possible numbers of colors | | ISI Article |
| 2008 | Bacsó, Gábor and Tuza, Zsolt
Upper chromatic number of finite projective planes | | ISI Article |
| 2007 | Bacsó, Gábor and Tuza, Zsolt and Voigt, M.
Characterization of graphs dominated by induced paths | | ISI Article |
| 2007 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Efficient algorithms for decomposing graphs under degree constraints | | ISI Article |
| 2007 | Boroviecki, M. and Sidorowicz, E. and Tuza, Zsolt
Game list colouring of graphs | | ISI Article |
| 2007 | Szaniszló, Zs. and Tuza, Zsolt
Lower bound on the profile of degree pairs in cross-intersecting set systems | | ISI Article |
| 2007 | Hornák, M. and Tuza, Zsolt and Wozniak, M.
On-line arbitrarily vertex decomposable trees | | ISI Article |
| 2007 | Bujtás, Cs. and Tuza, Zsolt
Orderings of uniquely colorable hypergraphs | | ISI Article |
| 2007 | Angelelli, E. and Speranza, M. G. and Tuza, Zsolt
Semi on-line scheduling on three processors with known sum of the tasks | | ISI Article |
| 2006 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Degree-constrained decompositions of graphs: boundered treewidth and planarity | | ISI Article |
| 2006 | Andersen, LD and Vestergaard, PD and Tuza, Zsolt
Largest non-unique subgraphs | | ISI Article |
| 2006 | Angelelli, E. and Speranza, MG and Tuza, Zsolt
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks | | ISI Article |
| 2006 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
The satisfactory partition problem | | ISI Article |
| 1992 | Kornai, András and Tuza, Zsolt
Narrowness, pathwidth and their application in natural language processing | | ISI Article |
| Date | Author/Title | | Document Type |
|---|
| 2024 | Keszler, Anita and Tuza, Zsolt
Spectrum of 3-uniform 6- and 9-cycle systems over K (3) v − I | | Article |
| 2021 | Keszler, Anita and Tuza, Zsolt
Hypercycle Systems of 5-Cycles in Complete 3-Uniform Hypergraphs | | Article |
| 2019 | Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs | | Article |
| 2017 | Bacsó, Gábor and Ryjáček, Z and Tuza, Zsolt
Coloring the cliques of line graphs | | Article |
| 2016 | Ács, Bernadett and Szederkényi, Gábor and Tuza, Zsolt and Tuza, Z A
Computing all possible graph structures describing linearly conjugate realizations of kinetic systems | | Article |
| 2015 | Ács, Bernadett and Szederkényi, Gábor and Tuza, Zoltán András and Tuza, Zsolt
Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory | | Article |
| 2015 | Bacsó, Gábor and Borowiecki, Piotr and Hujter, Mihály and Tuza, Zsolt
Minimum order of graphs with given coloring parameters | | Article |
| 2011 | Bujtás, Csilla and Tuza, Zsolt and Voloshin, V
Color-bounded hypergraphs, V: Host graphs and subdivisions | | Article |
| 2011 | Bujtás, Csilla and Tuza, Zsolt
Combinatorial batch codes: extremal problems under Hall-type conditions | | Article |
| 2010 | Bujtás, Cs. and Sampathkumar, E. and Tuza, Zsolt and Subramanya, M. S. and Dominic, Ch.
3-consecutive c-colorings of graphs | | Article |
| 2010 | Bujtás, Cs. and Tuza, Zsolt
Voloshin's conjecture for C-perfect hypertrees | | Article |
| 2010 | Chartrand, G. and Okamoto, F. and Tuza, Zsolt and Zhang, P.
A note on graphs with prescribed complete coloring numbers | | Article |
| 2009 | Jose, B. K. and Tuza, Zsolt
Hypergraph domination and strong independence | | Article |
| 2008 | Bazgan, Cristina and Tuza, Zsolt
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 | | Article |
| 2007 | Bujtás, Cs. and Tuza, Zsolt
Color-bounded hyper-graphs, III: Model comparison | | Article |
| 2007 | Tuza, Zsolt
Extremal jumps of the Hall number | | Article |
| 2007 | Milazzo, L. and Tuza, Zsolt
A class of Steiner systems S(2,4,v) with arcs of extremal size | | Article |
| 2006 | Kéri, Gerzson and Tuza, Zsolt
Egy minimax probléma halmazrendszerekre | | Article |
| 2006 | Bujtás, Cs and Tuza, Zsolt
Mixed colorings of hypergraphs | | Article |
| 2006 | Tuza, Zsolt
Steiner systems and large non-Hamiltonian hypergraphs | | Article |
| 2006 | Bacsó, Gábor and Tuza, Zsolt
The cost chromatic number and hypergraph parameters | | Article |
| 2005 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Complexity and approximation of satisfactory partition problems | | Article |
| 2005 | Bacsó, Gábor and Michalak, D. and Tuza, Zsolt
Dominating bipartite subgraphs in graphs | | Article |
| 2005 | Bacsó, Gábor and Tálos, A. and Tuza, Zsolt
Graph domination in distance two | | Article |
| 2005 | Tuza, Zsolt
Highly connected counterexamples to a conjecture on a-domination | | Article |
| 2005 | Kohl, A. and Schreyer, J. and Tuza, Zsolt and Voigt, M.
List version of L(d,s)-labelings | | Article |
| 2005 | Tuza, Zsolt
Strong branchwidth and local transversals | | Article |
| 2005 | Deogun, JS and Tuza, Zsolt and Scott, SD and Li, L.
Weighted edge-decompositions of graphs | | Article |
| 2005 | Crull, B. and Cundiff, T. and Feltman, P. and Hurlbert, GH and Pudwell, L. and Szaniszló, Zs and Tuza, Zsolt
The cover pebbling number of graphs | | Article |
| 2004 | Bacsó, Gábor and Tuza, Zsolt
Graphs without induced P5 and C5 | | Article |
| 2004 | Göring, F. and Harant, J. and Hexel, E. and Tuza, Zsolt
On short cycles through prescribed vertices of a graph | | Article |
| 2004 | Quattrocchi, G. and Tuza, Zsolt
Partition of C4-designs into minimum and maximum number of P3-designs | | Article |
| 2004 | Mansini, R. and Spernaza, MG and Tuza, Zsolt
Scheduling groups of tasks with precedence constraints on three dedicated processors | | Article |
| 2004 | Hangos, Katalin and Szederkényi, Gábor and Tuza, Zsolt
The effect of model simplification assumptions on the differential index of lumped process models | | Article |
| 2004 | Angelelli, E. and Nagy, and Spernaza, MG and Tuza, Zsolt
The on-line multiprocessor scheduling problem with known sum of the tasks | | Article |
| 2003 | Tuza, Zsolt and Voloshin, V.
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types | | Article |
| 2003 | Kierstead, H. and Tuza, Zsolt
Marking games and the oriented game chromatic number of partial k-trees | | Article |
| 2003 | Bazgan, C. and Vanderpooten, D. and Tuza, Zsolt
On the existence and determination of satisfactory partitions in a graph | | Article |
| 2003 | Borowiecki, M. and Grytczuk, J. and Haluszczak, M. and Tuza, Zsolt
Schütte's tournament problem and intersecting families of sets | | Article |
| 2003 | Angelelli, E. and Speranza, MG and Tuza, Zsolt
Semi-on-line scheduling on two parallel processors with an upper bound on the items | | Article |
| 2003 | Milazzo, M. and Tuza, Zsolt and Voloshin, V.
Strict colorings of Steiner triple and quadruple systems | | Article |
| 2003 | Bacsó, Gábor and Tuza, Zsolt and Voroshin, V.
Unique colorings of bi-hypergraphs | | Article |
| 2002 | Ruzsa, IZ and Tuza, Zsolt and Voigt, M.
Distance graphs with finite chromatic number | | Article |
| 2002 | Tuza, Zsolt and Vestergaard, PD
Domination in partitioned graphs | | Article |
| 2002 | Al-Yakoob, SM and Tuza, Zsolt
Domination number of graphs with bounded diameter | | Article |
| 2002 | Bazgan, C. and Santha, M. and Tuza, Zsolt
Efficient approximation algorithms for the subset-sums equality problem | | Article |
| 2002 | Tuza, Zsolt and Wagler, A.
Minimally non-preperfect graphs of small maximum degree | | Article |
| 2002 | Kratochvíl, J. and Tuza, Zsolt
On the complexity of bicoloring clique hypergraphs of graphs | | Article |
| 2002 | Novák, ÁB and Tuza, Zsolt
Reconstruction graphs and testing their properties in a relational spatial database | | Article |
| 2002 | Bacsó, Gábor and Tuza, Zsolt
Structural domination of graphs | | Article |
| 2002 | Leitold, A. and Hangos, Katalin and Tuza, Zsolt
Structure simplification of dynamic process models | | Article |
| 2002 | Tuza, Zsolt and Voloshin, VI and Zhou, H.
Uniquely colorable mixed hypergraphs | | Article |
| 2002 | Jiang, T. and Mubayi, D. and Tuza, Zsolt and Voloshin, V. and West, DB
The chromatic spectrum of mixed hypergraphs | | Article |
| 2002 | Tuza, Zsolt
A colourful theory on graphs | | Article |
| 2002 | Tuza, Zsolt and Voigt, M.
A note on planar 5-list colouring: non-extendability at distance 4 | | Article |
| 2001 | Lee, A. and Révész, G. and Szigeti, J. and Tuza, Zsolt
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs | | Article |
| 2001 | Idzik, A. and Tuza, Zsolt
Heredity properties of connectedness in edge-coloured complete graphs | | Article |
| 2001 | Hangos, Katalin and Tuza, Zsolt
Optimal control structure selection for process systems | | Article |
| 2001 | Tuza, Zsolt and Voigt, M.
Oriented list colorings of graphs | | Article |
| 2001 | Manoussakis, Y. and Tuza, Zsolt
Ramsey numbers for tournaments | | Article |
| 2000 | Tuza, Zsolt
Extremal bi-Helly families | | Article |
| 2000 | Schiermeyer, I. and Tuza, Zsolt and Voigt, M.
On-line rankings of graphs | | Article |
| 2000 | Hujter, M. and Spissich, L. and Tuza, Zsolt
Sharpness of some intersection theorems | | Article |
| 2000 | Tuza, Zsolt and Voloshin, V.
Uncolorable mixed hypergraphs | | Article |
| 1999 | Milici, S. and Tuza, Zsolt
Disjoint blocking sets in cycle systems | | Article |
| 1999 | Bacsó, Gábor and Tuza, Zsolt
Dominating subgraphs of small diameter | | Article |
| 1999 | Mihók, P. and Tuza, Zsolt and Voigt, M.
Fractional P-colourings and P-choice-ratio | | Article |
| 1999 | Bylka, S. and Idzik, A. and Tuza, Zsolt
Maximum cuts: improvementsand local algorithmic analogues of the Edwards-Erdős inequality | | Article |
| 1999 | Jendrol', S. and Madaras, T. and Soták, R. and Tuza, Zsolt
On light cycles in plane triangulations | | Article |
| 1999 | Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | | Article |
| 1999 | Speranza, MG and Tuza, Zsolt
On-line approximation algorithms for scheduling tasks on identical machines with extendable working time | | Article |
| 1999 | Hangos, Katalin and Tuza, Zsolt
Process model structure simplification | | Article |
| 1999 | Kratovchíl, J. and Tuza, Zsolt
Rankings of directed graphs | | Article |
| 1999 | Borowiecki, M. and Mihók, P. and Tuza, Zsolt and Voigt, M.
Remarks on the existence of uniquely partitionable planar graphs | | Article |
| 1999 | Amoura, AK and Bampis, E. and Manoussakis, Y. and Tuza, Zsolt
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors | | Article |
| 1998 | Dell'olmo, P. and Kellerer, H. and Speranza, MG and Tuza, Zsolt
A 13/12 approximation algorithm for bin packing with extendable bins | | Article |
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
Brooks-type theorems for choosability with separation | | Article |
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
Complexity of choosing subsets from color sets | | Article |
| 1998 | Fouquet, J-L and Hahn, G. and Tuza, Zsolt and Woodrow, RE
On magnitude networks | | Article |
| 1998 | Bodlaender, HL and Deogun, JS and Jansen, K. and Kloks, T. and Kratsch, D. and Müller, H. and Tuza, Zsolt
Rankings of graphs | | Article |
| 1998 | Milazzo, L. and Tuza, Zsolt
Strict colourings for classes of steiner triple systems | | Article |
| 1997 | Alon, N. and Tuza, Zsolt
Choosability and fractional chromatic numbers | | Article |
| 1997 | Dell'olmo, P. and Speranza, MG and Tuza, Zsolt
Comparability graph augmentation for some multiprocessor scheduling problems | | Article |
| 1997 | Dell'olmo, P. and Speranza, MG and Tuza, Zsolt
Efficiency and effectiveness of normal schedules on three dedicated processors | | Article |
| 1997 | Szigeti, J. and Tuza, Zsolt
Generalized colorings and avoidable orientations | | Article |
| 1997 | Tuza, Zsolt
Graph colorings with local constraints - A survey | | Article |
| 1997 | Tuza, Zsolt and Voigt, M.
List colorings and reducibility | | Article |
| 1997 | Kellerer, H. and Kotov, V. and Speranza, MG and Tuza, Zsolt
Semi on-line algorithms for the partition problem | | Article |
| 1997 | Szigeti, J. and Tuza, Zsolt
Solving systems of linear equations over Lie nilpotent rings | | Article |
| 1997 | Gimbel, J. and Henning, MA and Tuza, Zsolt
Switching distance in graphs | | Article |
| 1997 | Milazzo, L. and Tuza, Zsolt
Upper chromatic number of Steiner triple and quadruple systems | | Article |
| 1997 | Gionfriddo, M. and Harary, F. and Tuza, Zsolt
The color cost of a caterpillar | | Article |
| 1997 | Bondy, JA and Tuza, Zsolt
A weighted generalization of Turán's theorem | | Article |
| 1996 | Erdős, P. and Gallai, T. and Tuza, Zsolt
Covering and independence in triangle structures | | Article |
| 1996 | Milici, S. and Tuza, Zsolt
Cycle systems without 2-colorings | | Article |
| 1996 | Barefoot, CA and Clark, LH and Entringer, RC and Porter, TD and Székely, LA and Tuza, Zsolt
Cycle-saturated graphs of minimum size | | Article |
| 1996 | Manoussakis, Y. and Spyratos, M. and Tuza, Zsolt
Cycles of given color patterns | | Article |
| 1996 | Tuza, Zsolt and Voigt, M.
Every 2-choosable graph in (2m,m)-choosable | | Article |
| 1996 | Manoussakis, Y. and Spyratos, M. and Tuza, Zsolt and Voigt, M.
Minimal colorings for properly colored subgraphs | | Article |
| 1996 | Tuza, Zsolt and Voight, M.
On a conjecture of Erdős, Rubin and Taylor | | Article |
| 1996 | Manoussakis, Y. and Tuza, Zsolt
Optimal routings in communication networks with linearly bounded forwarding index | | Article |
| 1996 | Hujter, M. and Tuza, Zsolt
Precoloring extension III. Classes of perfect graphs | | Article |
| 1996 | Erdős, P. and Tuza, Zsolt and Valtr, P.
Ramsey-remainder | | Article |
| 1996 | Rousseau, C. and Tuza, Zsolt
Some hypergraph questions suggested by a Nordic Olympiad problem | | Article |
| 1996 | Manoussakis, Y. and Tuza, Zsolt
The forwarding index of directed networks | | Article |
| 1996 | Jendrol, S. and Tkác, M. and Tuza, Zsolt
The irregularity strength and cost of the union of cliques | | Article |
| 1995 | Gnuyen, VN and Tuza, Zsolt
4-chroamatic graphs with large odd girth | | Article |
| 1995 | Milici, S. and Tuza, Zsolt
Coverable graphs | | Article |
| 1995 | Tuza, Zsolt
How to make a random graph irregular | | Article |
| 1995 | Bertram, E. and Erdős, P. and Horák, P. and Sirán, J. and Tuza, Zsolt
Local and global average degree in graphs and multigraphs | | Article |
| 1995 | Aigner, M. and Triesch, E. and Tuza, Zsolt
Searching for acyclic orientations of graphs | | Article |
| 1995 | Jipsen, P. and Maddux, RD and Tuza, Zsolt
Small representations of the relation algebra En+1(1,2,3) | | Article |
| 1995 | Tuza, Zsolt
Zero-sum block designs and graph labelings | | Article |
| 1995 | Alon, N. and Tuza, Zsolt
The acyclic orientation game on random graphs | | Article |
| 1994 | Kratochvil, J. and Tuza, Zsolt
Algorithmic complexity of list colorings | | Article |
| 1994 | Poljak, S. and Tuza, Zsolt
Bipartite subgraphs of triangle-free graphs | | Article |
| 1994 | Gionfriddo, M. and Milici, S. and Tuza, Zsolt
Blocking sets in SQS (2v) | | Article |
| 1994 | Tuza, Zsolt
Characterization of (m,1)-transitive and (3,2)-transitive semi-complete directed graphs | | Article |
| 1994 | Tuza, Zsolt
Inequalities for minimal covering sets in set systems of given rank | | Article |
| 1994 | Kratochvil, J. and Tuza, Zsolt
Intersection dimensions of graph classes | | Article |
| 1994 | Tuza, Zsolt
Largest size and union of Helly families | | Article |
| 1994 | Tuza, Zsolt
Monochromatic coverings and tree Ramsey numbers | | Article |
| 1994 | Gionfriddo, M. and Tuza, Zsolt
On conjectures of Berge and Chvátal | | Article |
| 1994 | Hell, P. and Mannoussakis, Y. and Tuza, Zsolt
Packing problems in edge-colored graphs | | Article |
| 1994 | Chou, WS and Manoussakis, Y. and Megalalaki, O. and Spyratos, M. and Tuza, Zsolt
Paths through fixed vertices in edge-colored graphs | | Article |
| 1994 | Tuza, Zsolt
Perfect triangle families | | Article |
| 1994 | Tuza, Zsolt
Small n-dominating sets | | Article |
| 1994 | Gionfriddo, M. and Milici, S. and Tuza, Zsolt
Solution to a problem of Speranza on Ms-colourings of directed graphs | | Article |
| 1994 | Poljak, S. and Tuza, Zsolt
The expected relative error of the polyhedral approximation of the max-cut problem | | Article |
| 1994 | Milici, S. and Tuza, Zsolt
The spectrum of [lambda]-times repeated blocks for TS([upsilon], [lambda]) | | Article |
| 1993 | Chang, GJ and Farber, M. and Tuza, Zsolt
Algorithmic aspects of neighborhood numbers | | Article |
| 1993 | Caro, Y. and Tuza, Zsolt
Bounded degrees and prescribed distances in graphs | | Article |
| 1993 | Radosavljevic, Z. and Simic, S. and Tuza, Zsolt
Complementary pairs of graphs orientable to line digraphs | | Article |
| 1993 | Bacsó, Gábor and Tuza, Zsolt
Domination properties and induced subgraphs | | Article |
| 1993 | Szigeti, J. and Tuza, Zsolt and Révész, G.
Eulerian polynomial identities on matrix rings | | Article |
| 1993 | Blázsik, Z. and Hujter, M. and Pluhár, A. and Tuza, Zsolt
Graphs with no induced C4 and 2K2 | | Article |
| 1993 | Tuza, Zsolt
Helly property in finite set systems | | Article |
| 1993 | Horák, P. and Tuza, Zsolt
Large s-representable set systems with low maximum degree | | Article |
| 1993 | Nguyen, VN and Tuza, Zsolt
Linear-time approximation algorithms for the max cut problem | | Article |
| 1993 | Pyber, L. and Tuza, Zsolt
Menger-type theorems with restrictions on path lengths | | Article |
| 1993 | Tuza, Zsolt
Multipartite Turán problem for connected graphs and hypergraphs | | Article |
| 1993 | Caro, Y. and Tuza, Zsolt
On k-local and k-mean colorings of graphs and hypergraphs | | Article |
| 1993 | Kratochvíl, J. and Savicky, P. and Tuza, Zsolt
One more occurrence of variables makes satisfiability jump from trivial to NP-complete | | Article |
| 1993 | Hujter, M. and Tuza, Zsolt
Precoloring extension. II. Graph classes related to perfect graphs | | Article |
| 1993 | Tuza, Zsolt
Theorem proving through depth-first test | | Article |
| 1993 | Harary, F. and Tuza, Zsolt
Two graph-colouring games | | Article |
| 1993 | Hujter, M. and Tuza, Zsolt
The number of maximal independent sets in triangle-free graphs | | Article |
| 1993 | Farber, M. and Hujter, M. and Tuza, Zsolt
An upper bound on the number of cliques in a graph | | Article |
| 1992 | Tuza, Zsolt
Asymptotic growth of sparse saturated structures is locally determined | | Article |
| 1992 | Erdős, P. and Gallai, T. and Tuza, Zsolt
Covering the cliques of a graph with vertices | | Article |
| 1992 | Tuza, Zsolt
Graph coloring in linear time | | Article |
| 1992 | Sirán, J. and Tuza, Zsolt
Nearly uniform distribution of edges among k-subgraphs of a graph | | Article |
| 1992 | Körner, J. and Simonyi, G. and Tuza, Zsolt
Perfect couples of graphs | | Article |
| 1992 | Bíró, M. and Hujter, M. and Tuza, Zsolt
Precoloring extension I. Interval graphs | | Article |
| 1992 | Truszczynski, M. and Tuza, Zsolt
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets | | Article |
| 1992 | Rödl, V. and Tuza, Zsolt
Rainbow subgraphs in properly edge-colored graphs | | Article |
| 1992 | Erdős, P. and Fon der Flass, D. and Kostochka, AV and Tuza, Zsolt
Small transversals in uniform hypergraphs | | Article |
| Date | Author/Title | | Document Type |
|---|
| 2013 | Bacsó, Gábor and Keszler, Anita and Tuza, Zsolt
Matching matchings | | Conference or Workshop Item |
| 2011 | Dósa, György and Tuza, Zsolt and Ye, D
Better bounds for the bin packing problem with the "Largest Item in the Bottom" constraint | | Conference or Workshop Item |
| 2011 | Bazgan, C and Toubaline, S and Tuza, Zsolt
Complexity of most vital nodes for independent set in graphs related to tree structures | | Conference or Workshop Item |
| 2011 | Keszler, Anita and Szirányi, Tamás and Tuza, Zsolt
Graph based solution for segmentation tasks in case of out-of-focus, noisy and corrupted images | | Conference or Workshop Item |
| 2010 | Bacsó, Gábor and Bujtás, Cs. and Tuza, Zsolt and Voloshin, V.
New challenges in the theory of hypergraph coloring | | Conference or Workshop Item |
| 2009-12-16 | Bazgan, C. and Couëtoux, B. and Tuza, Zsolt
Covering a graph with a constrained forest (extended abstract) | | Conference or Workshop Item |
| 2009 | Bujtás, Cs. and Tuza, Zsolt
Coloring intervals with four types of constraints | | Conference or Workshop Item |
| 2008 | Bacsó, Gábor and Bujtás, Csilla and Tuza, Zsolt and Voloshin, Vitaly
New challenges in the theory of hypergraph coloring | | Conference or Workshop Item |
| 2008 | Tuza, Zsolt and Voloshin, Vitaly
Problems and results on colorings of mixed hypergraphs | | Conference or Workshop Item |
| 2006 | Novák, ÁB and Tuza, Zsolt
A method to represent restricted classes of planar graphs in the enhanced spatial relational model PLA, based on Hahn graphs | | Conference or Workshop Item |
| 2005 | Novák, ÁB and Tuza, Zsolt
Combining spatial and topological data in a spatiotemporal relational model | | Conference or Workshop Item |
| 2005 | Novák, ÁB and Tuza, Zsolt
Reconstruction of planar graphs from their centered triangulations in some spatio-relational models | | Conference or Workshop Item |
| 2004 | Novák, ÁB and Bérces, M. and Ludányi, Z. and Tuza, Zsolt
On the Interoperability problems of the spatiotemporal relational model, PLAT | | Conference or Workshop Item |
| 2004 | Novák, ÁB and Bérces, M. and Ludányi, Z. and Tuza, Zsolt
A temporal extension of a spatial relational model | | Conference or Workshop Item |
| 2003 | Dominich, S. and Tuza, Zsolt
Computational aspects of connectionist interaction information retrieval | | Conference or Workshop Item |
| 2003 | Novák, AB and Tuza, Zsolt
Constructing Hamiltonian paths of some special graphs, using a relational spatial database model | | Conference or Workshop Item |
| 2003 | Novák, AB and Ronkay, ZS and Tuza, Zsolt
Discovering spanning trees in a spatial relational model | | Conference or Workshop Item |
| 2003 | Novák, AB and Revesz, P. and Tuza, Zsolt
Spatiotemporal database models for attracting students to research | | Conference or Workshop Item |
| 2002 | Novák, AB and Tuza, Zsolt
Representing directed and weighted graphs and their properties in a relational spatial database model | | Conference or Workshop Item |
| 2002 | Tuza, Zsolt and Szederkényi, Gábor and Hangos, Katalin
The effect of modelling assumptions on the differential index of lumped process models | | Conference or Workshop Item |
| 2001 | Král, D. and Kratochvíl, J. and Tuza, Zsolt and Woegiger, G.
Complexity of coloring graphs without forbidden induced subgraphs | | Conference or Workshop Item |
| 2000 | Kratochvíl, J. and Tuza, Zsolt
On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract) | | Conference or Workshop Item |
| 1999 | Jang, T. and Mubayi, D. and Tuza, Zsolt and Voloshin, VI and West, D.
Chromatic spectrum is broken | | Conference or Workshop Item |
| 1999 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
New trends in the theory of graph colorings: Choosability and list colorings | | Conference or Workshop Item |
| 1999 | Novák, ÁB and Tuza, Zsolt
Objects reconstruction and its complexity problems in the PLA spatial database model | | Conference or Workshop Item |
| 1999 | Kratochvíl, J. and Tuza, Zsolt
Rankings of directed graphs | | Conference or Workshop Item |
| 1999 | Novák, ÁB and Tuza, Zsolt
Representation, constraints and complexity of graphs in the PLA spatial database model | | Conference or Workshop Item |
| 1998 | Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | | Conference or Workshop Item |
| 1996 | Tuza, Zsolt
Applications of the se-pair method in extremal problems, II | | Conference or Workshop Item |
| 1996 | Hangos, Katalin and Tuza, Zsolt
Computational aspects of graph theoretic methods in control | | Conference or Workshop Item |
| 1996 | Hangos, Katalin and Tuza, Zsolt
Process structure driven control structure selection | | Conference or Workshop Item |
| 1995 | Erdős, P. and Tuza, Zsolt
Vertex coverings of the edge set in a connected graph | | Conference or Workshop Item |
| 1994 | Tuza, Zsolt
Applications of the set-pair method in extremal hypergraph theory | | Conference or Workshop Item |
| 1993 | Erdős, P. and Tuza, Zsolt
Rainbow subgraphs in edge-colorings of complete graphs | | Conference or Workshop Item |
| 1992 | Aistie-Vidal, A. and Dugat, V. and Tuza, Zsolt
Construction of non-isomorphic regular tournaments | | Conference or Workshop Item |
| 1992 | Bíró, M. and Hujter, M. and Tuza, Zsolt
Cross fertilisation of graph theory and aircraft maintenance | | Conference or Workshop Item |
| 1992 | Aigner, M. and Triesch, E. and Tuza, Zsolt
Irregular assignments and vertex distinguishing edge-colorings of graphs | | Conference or Workshop Item |
| 1992 | Tuza, Zsolt
Large partial parallel classes in Steiner systems | | Conference or Workshop Item |
