# Items where Author is "Tuza, Zsolt"

Up a level |

Number of items:

**254**.## 1992

## 1993

## 1994

## 1995

Date | Author/Title | Document Type | |
---|---|---|---|

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 | Poljak, S. and Tuza, Zsolt Maximum cuts and large bipartite subgraphs | Book Section | |

1995 | Bodlaender, HL and Deogun, JS and Jansen, K. and Kloks, T. and Kratsch, D. and Muller, H. and Tuza, Zsolt Rankings of graphs | Book Section | |

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 | Erdős, P. and Tuza, Zsolt Vertex coverings of the edge set in a connected graph | Conference or Workshop Item | |

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 |

## 1996

Date | Author/Title | Document Type | |
---|---|---|---|

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 | 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 | Tuza, Zsolt Lower bounds for a class of depth-two switching circuits | Book Section | |

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 | Hangos, Katalin and Tuza, Zsolt Process structure driven control structure selection | Conference or Workshop Item | |

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 |

## 1997

## 1998

Date | Author/Title | Document Type | |
---|---|---|---|

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 | Bazgan, C. and Santha, M. and Tuza, Zsolt Efficient approximation algorithms for the subset-sums equality problem | Book Section | |

1998 | Fouquet, J-L and Hahn, G. and Tuza, Zsolt and Woodrow, RE On magnitude networks | Article | |

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 | |

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 |

## 1999

## 2000

Date | Author/Title | Document Type | |
---|---|---|---|

2000 | Tuza, Zsolt Extremal bi-Helly families | Article | |

2000 | Kratochvíl, J. and Tuza, Zsolt On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract) | Conference or Workshop Item | |

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 |

## 2001

Date | Author/Title | Document Type | |
---|---|---|---|

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 | 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 | |

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 | |

2001 | Hangos, Katalin and Tuza, Zsolt and 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.) | Book | |

2001 | Tuza, Zsolt Unsolved combinatorial problems. Part I. (BRICS Lecture Series, LS-01-1) | Book |

## 2002

## 2003

## 2004

Date | Author/Title | Document Type | |
---|---|---|---|

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 | 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 | 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 | |

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 |

## 2005

Date | Author/Title | Document Type | |
---|---|---|---|

2005 | Novák, ÁB and Tuza, Zsolt Combining spatial and topological data in a spatiotemporal relational model | Conference or Workshop Item | |

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 | Deogun, JS and Tuza, Zsolt Graph-theoretic methods and recent applications in computer science | Book Section | |

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 | Novák, ÁB and Tuza, Zsolt Reconstruction of planar graphs from their centered triangulations in some spatio-relational models | Conference or Workshop Item | |

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 | |

2005 | Novák, ÁB and Bérces, M. and Ludányi, Z. and Tuza, Zsolt A temporal extension of the spatial relational model PLA and some interoperability problems | Book Section |

## 2006

## 2007

## 2008

Date | Author/Title | Document Type | |
---|---|---|---|

2008 | Bazgan, Cristina and Tuza, Zsolt and Vanderpooten, Daniel Approximation of satisfactory bisection problems | ISI Article | |

2008 | Bazgan, Cristina and Tuza, Zsolt Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 | Article | |

2008 | Tuza, Zsolt Hereditary domination in graphs: characterization with forbidden induced subgraphs | ISI Article | |

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 | Caro, Yair and Lev, Arie and Roditty, Yehuda and Tuza, Zsolt and Yuster, Raphael On rainbow connection | ISI Article | |

2008 | Tuza, Zsolt and Voloshin, Vitaly Problems and results on colorings of mixed hypergraphs | Conference or Workshop Item | |

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 |

## 2009

## 2010

Date | Author/Title | Document Type | |
---|---|---|---|

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 | 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 | 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 | |

2010 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D. Satisfactory graph partition, variants, and generalizations | ISI 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 |

## 2011

Date | Author/Title | Document Type | |
---|---|---|---|

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 | 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 | |

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 | 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 | |

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 |

## 2012

Date | Author/Title | Document Type | |
---|---|---|---|

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 |

## 2013

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 | |

2013 | Bacsó, Gábor and Keszler, Anita and Tuza, Zsolt Matching matchings | Conference or Workshop Item |

## 2015

Date | Author/Title | Document Type | |
---|---|---|---|

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 |

## 2016

Date | Author/Title | Document Type | |
---|---|---|---|

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 |

## 2017

Date | Author/Title | Document Type | |
---|---|---|---|

2017 | Bacsó, Gábor and Ryjáček, Z and Tuza, Zsolt Coloring the cliques of line graphs | Article | |

2017 | Bacsó, Gábor and Marx, Dániel and Tuza, Zsolt H-free graphs, Independent Sets, and subexponential-time algorithms | Book Section |

## 2019

Date | Author/Title | Document Type | |
---|---|---|---|

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 |