dblp.uni-trier.dewww.uni-trier.de

Zsolt Tuza Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
142EEKatalin M. Hangos, Zsolt Tuza, A. Yeo: Some complexity problems on single input double output controllers. Discrete Applied Mathematics 157(5): 1146-1158 (2009)
141EEWenceslas Fernandez de la Vega, Zsolt Tuza: Groupies in random graphs. Inf. Process. Lett. 109(7): 339-340 (2009)
2008
140EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008)
139EECristina Bazgan, Zsolt Tuza: Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6(3): 510-519 (2008)
138EEZsolt Tuza: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs. SIAM J. Discrete Math. 22(3): 849-853 (2008)
137EEEnrico Angelelli, Maria Grazia Speranza, Zsolt Tuza: Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008)
2007
136EECsilla Bujtás, Zsolt Tuza: Orderings of uniquely colorable hypergraphs. Discrete Applied Mathematics 155(11): 1395-1407 (2007)
135EEMirko Hornák, Zsolt Tuza, Mariusz Wozniak: On-line arbitrarily vertex decomposable trees. Discrete Applied Mathematics 155(11): 1420-1429 (2007)
134EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Efficient algorithms for decomposing graphs under degree constraints. Discrete Applied Mathematics 155(8): 979-988 (2007)
133EEGábor Bacsó, Zsolt Tuza, Margit Voigt: Characterization of graphs dominated by induced paths. Discrete Mathematics 307(7-8): 822-826 (2007)
132EEMieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt Tuza: Game List Colouring of Graphs. Electr. J. Comb. 14(1): (2007)
131EEZsolt Tuza: Extremal jumps of the Hall number. Electronic Notes in Discrete Mathematics 28: 83-89 (2007)
2006
130EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: The satisfactory partition problem. Discrete Applied Mathematics 154(8): 1236-1245 (2006)
129EEEnrico Angelelli, Maria Grazia Speranza, Zsolt Tuza: New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Mathematics & Theoretical Computer Science 8(1): 1-16 (2006)
128EECsilla Bujtás, Zsolt Tuza: Mixed colorings of hypergraphs. Electronic Notes in Discrete Mathematics 24: 273-275 (2006)
127EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006)
2005
126EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838
125EEZsolt Tuza: Strong branchwidth and local transversals. Discrete Applied Mathematics 145(2): 291-296 (2005)
124EEBetsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza: The cover pebbling number of graphs. Discrete Mathematics 296(1): 15-23 (2005)
123EEAnja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt: List version of L(d, s)-labelings. Theor. Comput. Sci. 349(1): 92-98 (2005)
2004
122EEKatalin M. Hangos, Gábor Szederkényi, Zsolt Tuza: The effect of model simplification assumptions on the differential index of lumped process models. Computers & Chemical Engineering 28(1-2): 129-137 (2004)
121EERenata Mansini, Maria Grazia Speranza, Zsolt Tuza: Scheduling groups of tasks with precedence constraints on three dedicated processors. Discrete Applied Mathematics 134(1-3): 141-168 (2004)
120EEFrank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza: On short cycles through prescribed vertices of a graph. Discrete Mathematics 286(1-2): 67-74 (2004)
119EEGaetano Quattrocchi, Zsolt Tuza: Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs. Graphs and Combinatorics 20(4): 531-540 (2004)
118EEEnrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza: The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Scheduling 7(6): 421-428 (2004)
2003
117EECristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453
116EEEnrico Angelelli, Maria Grazia Speranza, Zsolt Tuza: Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Algorithmica 37(4): 243-262 (2003)
115 Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Mariusz Haluszczak, Zsolt Tuza: Schütte's Tournament Problem and Intersecting Families of Sets. Combinatorics, Probability & Computing 12(4): 359-364 (2003)
114 Maria Axenovich, Tao Jiang, Zsolt Tuza: Local Anti-Ramsey Numbers of Graphs. Combinatorics, Probability & Computing 12(5-6): 495-511 (2003)
113EELorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin: Strict colorings of Steiner triple and quadruple systems: a survey. Discrete Mathematics 261(1-3): 399-411 (2003)
112EEHal A. Kierstead, Zsolt Tuza: Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs and Combinatorics 19(1): 121-129 (2003)
2002
111EEJan Kratochvíl, Zsolt Tuza, Margit Voigt: On the b-Chromatic Number of Graphs. WG 2002: 310-320
110 Gabor Bascó, Zsolt Tuza: Structural domination of graphs. Ars Comb. 63: (2002)
109EEZsolt Tuza, Vitaly I. Voloshin, Huishan Zhou: Uniquely colorable mixed hypergraphs. Discrete Mathematics 248(1-3): 221-236 (2002)
108EEZsolt Tuza, Margit Voigt: A note on planar 5-list colouring: non-extendability at distance 4. Discrete Mathematics 251(1-3): 169-172 (2002)
107EETao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West: The Chromatic Spectrum of Mixed Hypergraphs. Graphs and Combinatorics 18(2): 309-318 (2002)
106EEJan Kratochvíl, Zsolt Tuza: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1): 40-54 (2002)
105EEImre Z. Ruzsa, Zsolt Tuza, Margit Voigt: Distance Graphs with Finite Chromatic Number. J. Comb. Theory, Ser. B 85(1): 181-187 (2002)
104EECristina Bazgan, Miklos Santha, Zsolt Tuza: Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. 64(2): 160-170 (2002)
2001
103EEDaniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262
102EEAnna Lee, Gábor Révész, Jenö Szigeti, Zsolt Tuza: Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Discrete Mathematics 230(1-3): 49-61 (2001)
101EEAdam Idzik, Zsolt Tuza: Heredity properties of connectedness in edge-coloured complete graphs. Discrete Mathematics 235(1-3): 301-306 (2001)
100EEZsolt Tuza, Annegret Wagler: Minimally Non-Preperfect Graphs of Small Maximum Degree. Graphs and Combinatorics 17(4): 759-773 (2001)
99EEYannis Manoussakis, Zsolt Tuza: Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001)
2000
98EEJan Kratochvíl, Zsolt Tuza: On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). SODA 2000: 40-41
97EEZsolt Tuza, Vitaly I. Voloshin: Uncolorable Mixed Hypergraphs. Discrete Applied Mathematics 99(1-3): 209-227 (2000)
96EEIngo Schiermeyer, Zsolt Tuza, Margit Voigt: On-line rankings of graphs. Discrete Mathematics 212(1-2): 141-147 (2000)
95EEZsolt Tuza: Extremal bi-Helly families. Discrete Mathematics 213(1-3): 321-331 (2000)
94EEMihály Hujter, László Spissich, Zsolt Tuza: Sharpness of Some Intersection Theorems. Eur. J. Comb. 21(7): 913-916 (2000)
1999
93EEStanislaw Bylka, Adam Idzik, Zsolt Tuza: Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. Discrete Mathematics 194(1-3): 39-58 (1999)
92EEStanislav Jendrol, Tomás Madaras, Roman Sotak, Zsolt Tuza: On light cycles in plane triangulations. Discrete Mathematics 197-198: 453-467 (1999)
91EESalvatore Milici, Zsolt Tuza: Disjoint blocking sets in cycle systems. Discrete Mathematics 208-209: 451-462 (1999)
90EETao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West: Chromatic spectrum is broken. Electronic Notes in Discrete Mathematics 3: 86-89 (1999)
89 Cristina Bazgan, Miklos Santha, Zsolt Tuza: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. J. Algorithms 31(1): 249-268 (1999)
88 Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza: A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Parallel Computing 25(1): 49-61 (1999)
87EEJan Kratochvíl, Zsolt Tuza: Rankings of Directed Graphs. SIAM J. Discrete Math. 12(3): 374-384 (1999)
1998
86EECristina Bazgan, Miklos Santha, Zsolt Tuza: Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP 1998: 387-396
85EECristina Bazgan, Miklos Santha, Zsolt Tuza: On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS 1998: 276-286
84EEJan Kratochvíl, Zsolt Tuza: Rankings of Directed Graphs. WG 1998: 114-123
83EELorenzo Milazzo, Zsolt Tuza: Strict colourings for classes of steiner triple systems. Discrete Mathematics 182(1-3): 233-243 (1998)
82EEJan Kratochvíl, Zsolt Tuza, Margit Voigt: Complexity of choosing subsets from color sets. Discrete Mathematics 191(1-3): 139-148 (1998)
81EEPaolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza: A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65(5): 229-233 (1998)
80EEHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Rankings of Graphs. SIAM J. Discrete Math. 11(1): 168-181 (1998)
1997
79 John G. Gimbel, Michael A. Henning, Zsolt Tuza: Switching Distance Graphs. Ars Comb. 47: (1997)
78EEPaolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza: Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discrete Applied Mathematics 72(1-2): 71-84 (1997)
77EEZsolt Tuza, Margit Voigt: List Colorings and Reducibility. Discrete Applied Mathematics 79(1-3): 247-256 (1997)
76EEPaolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza: Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Mathematics 164(1-3): 67-79 (1997)
75EENoga Alon, Zsolt Tuza, Margit Voigt: Choosability and fractional chromatic numbers. Discrete Mathematics 165-166: 31-38 (1997)
74EEMario Gionfriddo, Frank Harary, Zsolt Tuza: The color cost of a caterpillar. Discrete Mathematics 174(1-3): 125-130 (1997)
73EELorenzo Milazzo, Zsolt Tuza: Upper chromatic number of Steiner triple and quadruple systems. Discrete Mathematics 174(1-3): 247-259 (1997)
72EEHans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5): 235-242 (1997)
1996
71 Mihály Hujter, Zsolt Tuza: Precoloring Extension 3: Classes of Perfect Graphs. Combinatorics, Probability & Computing 5: 35-56 (1996)
70EEYannis Manoussakis, Zsolt Tuza: The Forwarding Index of Directed Networks. Discrete Applied Mathematics 68(3): 279-291 (1996)
69EEStanislav Jendrol, Michal Tkác, Zsolt Tuza: The irregularity strength and cost of the union of cliques. Discrete Mathematics 150(1-3): 179-186 (1996)
68EECurtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza: Cycle-saturated graphs of minimum size. Discrete Mathematics 150(1-3): 31-48 (1996)
67EEPaul Erdös, Tibor Gallai, Zsolt Tuza: Covering and independence in triangle structures. Discrete Mathematics 150(1-3): 89-101 (1996)
66EERené van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu: Hamiltonian properties of Toeplitz graphs. Discrete Mathematics 159(1-3): 69-81 (1996)
65EEPaul Erdös, Zsolt Tuza, Pavel Valtr: Ramsey-remainder. Eur. J. Comb. 17(6): 519-532 (1996)
64EEYannis Manoussakis, Zsolt Tuza: Optimal routings in communication networks with linearly bounded forwarding index. Networks 28(4): 177-180 (1996)
1995
63EENguyen Van Ngoc, Zsolt Tuza: 4-chromatic graphs with large odd girth. Discrete Mathematics 138(1-3): 387-392 (1995)
62EEMartin Aigner, Eberhard Triesch, Zsolt Tuza: Searching for acyclic orientations of graphs. Discrete Mathematics 144(1-3): 3-10 (1995)
61 Noga Alon, Zsolt Tuza: The Acyclic Orientation Game on Random Graphs. Random Struct. Algorithms 6(2/3): 261-268 (1995)
60 Zsolt Tuza: How to Make A Random Graph Irregular. Random Struct. Algorithms 6(2/3): 323-330 (1995)
1994
59EEHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
58 Mario Gionfriddo, Salvatore Milici, Zsolt Tuza: Blocking Sets in SQS(2u). Combinatorics, Probability & Computing 3: 77-86 (1994)
57 Jan Kratochvíl, Zsolt Tuza: Algorithmic complexity of list colorings. Discrete Applied Mathematics 50(3): 297-302 (1994)
56EEZsolt Tuza: Inequalities for Minimal Covering Sets in Set Systems of Given Rank. Discrete Applied Mathematics 51(1-2): 187-195 (1994)
55EEPavol Hell, Yannis Manoussakis, Zsolt Tuza: Packing Problems in Edge-colored Graphs. Discrete Applied Mathematics 52(3): 295-306 (1994)
54EEMario Gionfriddo, Zsolt Tuza: On conjectures of Berge and Chvátal. Discrete Mathematics 124(1-3): 79-86 (1994)
53EEZsolt Tuza: Monochromatic coverings and tree Ramsey numbers. Discrete Mathematics 125(1-3): 377-384 (1994)
52EEZsolt Tuza: Largest size and union of Helly families. Discrete Mathematics 127(1-3): 319-327 (1994)
51EESalvatore Milici, Zsolt Tuza: The spectrum of lambda-times repeated blocks for TS(upsilon, lambda). Discrete Mathematics 129(1-3): 159-166 (1994)
50EEZsolt Tuza: Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs. Discrete Mathematics 135(1-3): 335-347 (1994)
49EESvatopluk Poljak, Zsolt Tuza: Bipartite Subgraphs of Triangle-Free Graphs. SIAM J. Discrete Math. 7(2): 307-313 (1994)
1993
48 Nguyen Van Ngoc, Zsolt Tuza: Linear-Time Algorithms for the Max Cut Problem. Combinatorics, Probability & Computing 2: 201-210 (1993)
47EEGabor Bascó, Zsolt Tuza: Domination properties and induced subgraphs. Discrete Mathematics 111(1-3): 37-40 (1993)
46EEYair Caro, Zsolt Tuza: Bounded degrees and prescribed distances in graphs. Discrete Mathematics 111(1-3): 87-93 (1993)
45EEZsolt Tuza: Multipartite Turán problem for connected graphs and hypergraphs. Discrete Mathematics 112(1-3): 199-206 (1993)
44EEZoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza: Graphs with no induced C4 and 2K2. Discrete Mathematics 115(1-3): 51-55 (1993)
43EELászló Pyber, Zsolt Tuza: Menger-type theorems with restrictions on path lengths. Discrete Mathematics 120(1-3): 161-174 (1993)
42EEPeter Horák, Zsolt Tuza: Large s-representable set systems with low maximum degree. Discrete Mathematics 122(1-3): 205-217 (1993)
41 Zsolt Tuza: Helly Property in Finite Set Systems. J. Comb. Theory, Ser. A 62(1): 1-14 (1993)
40 Jan Kratochvíl, Petr Savický, Zsolt Tuza: One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. 22(1): 203-210 (1993)
39 Gerhard J. Chang, Martin Farber, Zsolt Tuza: Algorithmic Aspects of Neighborhood Numbers. SIAM J. Discrete Math. 6(1): 24-29 (1993)
38 Mihály Hujter, Zsolt Tuza: The Number of Maximal Independent Sets in Triangle-Free Graphs. SIAM J. Discrete Math. 6(2): 284-288 (1993)
1992
37 János Körner, Gábor Simonyi, Zsolt Tuza: Perfect couples of graphs. Combinatorica 12(2): 179-192 (1992)
36EEAndrás Kornai, Zsolt Tuza: Narrowness, pathwidth, and their application in natural language processing. Discrete Applied Mathematics 36(1): 87-92 (1992)
35EEM. Biró, Mihály Hujter, Zsolt Tuza: Precoloring extension. I. Interval graphs. Discrete Mathematics 100(1-3): 267-279 (1992)
34EEMiroslaw Truszczynski, Zsolt Tuza: Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. Discrete Mathematics 103(3): 301-312 (1992)
33EEPaul Erdös, Tibor Gallai, Zsolt Tuza: Covering the cliques of a graph with vertices. Discrete Mathematics 108(1-3): 279-289 (1992)
32EEZsolt Tuza: Asymptotic growth of sparse saturated structures is locally determined. Discrete Mathematics 108(1-3): 397-402 (1992)
31EEZsolt Tuza: Graph coloring in linear time. J. Comb. Theory, Ser. B 55(2): 236-243 (1992)
30 Vojtech Rödl, Zsolt Tuza: Rainbow Subgraphs in Properly Edge-colored Graphs. Random Struct. Algorithms 3(2): 175-182 (1992)
1991
29EEMiroslaw Truszczynski, Zsolt Tuza: Asymptotic results on saturated graphs. Discrete Mathematics 87(3): 309-314 (1991)
28EEThomas Andreae, Martin Schughart, Zsolt Tuza: Clique-transversal sets of line graphs and complements of line graphs. Discrete Mathematics 88(1): 11-20 (1991)
27EEMichael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza: Decompositions of regular bipartite graphs. Discrete Mathematics 89(1): 17-27 (1991)
26EEPaul Erdös, Zoltán Füredi, Zsolt Tuza: Saturated r-uniform hypergraphs. Discrete Mathematics 98(2): 95-104 (1991)
25EEPaul Erdös, András Hajnal, Zsolt Tuza: Local constraints ensuring small representing sets. J. Comb. Theory, Ser. A 58(1): 78-84 (1991)
24EEYair Caro, Zsolt Tuza: Hypergraph coverings and local colorings. J. Comb. Theory, Ser. B 52(1): 79-85 (1991)
23EEZsolt Tuza: Extensions of Gallai's graph covering theorems for uniform hypergraphs. J. Comb. Theory, Ser. B 52(1): 92-96 (1991)
22 Martin J. M. de Boer, Aristid Lindenmayer, Zsolt Tuza: A Periodic Division Pattern that Cannot be Generated by D0L Systems. Theor. Comput. Sci. 83(2): 205-218 (1991)
1990
21EEFan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics 81(2): 129-135 (1990)
20EEZsolt Tuza: Covering all cliques of a graph. Discrete Mathematics 86(1-3): 117-126 (1990)
19 Zsolt Tuza: Periodic String Division Generated by Deterministic L Systems. Inf. Process. Lett. 34(5): 229-234 (1990)
18 Yannis Manoussakis, Zsolt Tuza: Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. SIAM J. Discrete Math. 3(4): 537-543 (1990)
1989
17EERalph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza: Induced matchings in bipartite graphs. Discrete Mathematics 78(1-2): 83-87 (1989)
16EESvatopluk Poljak, Zsolt Tuza: On the maximum number of qualitatively independent partitions. J. Comb. Theory, Ser. A 51(1): 111-116 (1989)
15EEZsolt Tuza: Minimum number of elements representing a set system of given rank. J. Comb. Theory, Ser. A 52(1): 84-89 (1989)
14EEPaul Erdös, János Pach, Richard Pollack, Zsolt Tuza: Radius, diameter, and minimum degree. J. Comb. Theory, Ser. B 47(1): 73-79 (1989)
1988
13EEZsolt Tuza: Isomorphism of two infinite-chromatic triangle-free graphs. Discrete Mathematics 69(1): 95 (1988)
12EEAndrás Gyárfás, Jenö Lehel, Zsolt Tuza: Clumsy packing of dominoes. Discrete Mathematics 71(1): 33-46 (1988)
1987
11EEAndrás Gyárfás, Zsolt Tuza: An upper bound on the Ramsey number of trees. Discrete Mathematics 66(3): 309-310 (1987)
10EEAndrás Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987)
1986
9EEZsolt Tuza: Some combinatorial problems concerning finite languages. IMYCS 1986: 51-58
8EEJenö Lehel, Zsolt Tuza: Neighborhood perfect graphs. Discrete Mathematics 61(1): 93-101 (1986)
1985
7 András Gyárfás, Jenö Lehel, Zsolt Tuza: How many atoms can be defined by boxes. Combinatorica 5(3): 193-204 (1985)
6EEZoltán Füredi, Zsolt Tuza: Hypergraphs without a large star. Discrete Mathematics 55(3): 317-321 (1985)
5EEVojtech Rödl, Zsolt Tuza: On color critical graphs. J. Comb. Theory, Ser. B 38(3): 204-213 (1985)
4EEZsolt Tuza: Critical hypergraphs and intersecting set-pair systems. J. Comb. Theory, Ser. B 39(2): 134-145 (1985)
1984
3 Zsolt Tuza: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices. Combinatorica 4(1): 111-116 (1984)
2EEAndrás Gyárfás, Jenö Lehel, Zsolt Tuza: The structure of rectangle families dividing the plane into maximum number of atoms. Discrete Mathematics 52(2-3): 177-198 (1984)
1982
1EEJenö Lehel, Zsolt Tuza: Triangle-free partial graphs and edge covering theorems. Discrete Mathematics 39(1): 59-65 (1982)

Coauthor Index

1Martin Aigner [62]
2Noga Alon [61] [75]
3Abdel Krim Amoura [88]
4Thomas Andreae [28]
5Enrico Angelelli [116] [118] [129] [137]
6Maria Axenovich [114]
7Gábor Bacsó [133]
8Evripidis Bampis [88]
9Curtis A. Barefoot [68]
10Gabor Bascó [47] [110]
11Cristina Bazgan [85] [86] [89] [104] [117] [126] [127] [130] [134] [139] [140]
12M. Biró [35]
13Zoltán Blázsik [44]
14Hans L. Bodlaender [59] [80]
15Martin J. M. de Boer [22]
16Mieczyslaw Borowiecki [115] [132]
17Csilla Bujtás [128] [136]
18Stanislaw Bylka [93]
19Yair Caro [24] [46]
20Gerhard J. Chang [39]
21Fan R. K. Chung (Fan Chung Graham) [21]
22L. H. Clark [68]
23Betsy Crull [124]
24Tammy Cundiff [124]
25René van Dal [66]
26Paolo Dell'Olmo [76] [78] [81]
27Jitender S. Deogun [59] [80]
28Roger C. Entringer [68]
29Paul Erdös [14] [25] [26] [33] [65] [67]
30Martin Farber [39]
31Ralph J. Faudree [17]
32Paul Feltman [124]
33Zoltán Füredi [6] [26]
34Tibor Gallai [33] [67]
35John G. Gimbel [79]
36Mario Gionfriddo [54] [58] [74]
37Frank Göring [120]
38Jaroslaw Grytczuk [115]
39András Gyárfás [2] [7] [10] [11] [12] [17] [21]
40András Hajnal [25]
41Mariusz Haluszczak [115]
42Katalin M. Hangos [122] [142]
43Jochen Harant [120]
44Frank Harary [74]
45Pavol Hell [55]
46Michael A. Henning [79]
47Erhard Hexel [120]
48Peter Horák [42]
49Mirko Hornák [135]
50Mihály Hujter [35] [38] [44] [71] [94]
51Glenn H. Hurlbert (Glenn Hurlbert) [124]
52Adam Idzik [93] [101]
53Michael S. Jacobson [27]
54Klaus Jansen [59] [80]
55Stanislav Jendrol [69] [92]
56Tao Jiang [90] [107] [114]
57Hans Kellerer [72] [81]
58Hal A. Kierstead (Henry A. Kierstead) [112]
59Ton Kloks (Antonius J. J. Kloks) [59] [80]
60Anja Kohl [123]
61András Kornai [36]
62János Körner [37]
63Vladimir Kotov [72]
64Daniel Král [103]
65Jan Kratochvíl [40] [57] [82] [84] [87] [98] [103] [106] [111]
66Dieter Kratsch [59] [80]
67Anna Lee [102]
68Jenö Lehel (Jeno Lehel) [1] [2] [7] [8] [10] [12]
69Aristid Lindenmayer [22]
70Tomás Madaras [92]
71Yannis Manoussakis [18] [55] [64] [70] [88] [99]
72Renata Mansini [121]
73Lorenzo Milazzo [73] [83] [113]
74Salvatore Milici [51] [58] [91]
75Dhruv Mubayi [90] [107]
76Haiko Müller [59] [80]
77Á. B. Nagy [118]
78Jaroslav Nesetril (Jarik Nesetril) [10]
79Nguyen Van Ngoc [48] [63]
80János Pach [14]
81András Pluhár [44]
82Svatopluk Poljak [16] [49]
83Richard Pollack [14]
84T. D. Porter [68]
85Lara Pudwell [124]
86László Pyber [43]
87Gaetano Quattrocchi [119]
88Gábor Révész [102]
89Vojtech Rödl [5] [10] [30]
90Imre Z. Ruzsa [105]
91Miklos Santha [85] [86] [89] [104]
92Petr Savický [40]
93Richard H. Schelp [10] [17]
94Ingo Schiermeyer [96]
95Jens Schreyer [123]
96Martin Schughart [28]
97Elzbieta Sidorowicz [132]
98Gábor Simonyi [37]
99Roman Sotak [92]
100Maria Grazia Speranza [72] [76] [78] [81] [116] [118] [121] [129] [137]
101László Spissich [94]
102Zsuzsanna Szaniszló [124]
103Gábor Szederkényi [122]
104László A. Székely [68]
105Jenö Szigeti [102]
106Gert A. Tijssen [66]
107Michal Tkác [69]
108Eberhard Triesch [62]
109William T. Trotter [21]
110Miroslaw Truszczynski [27] [29] [34]
111Pavel Valtr [65]
112Daniel Vanderpooten [117] [126] [127] [130] [134] [140]
113Jack A. A. van der Veen [66]
114Wenceslas Fernandez de la Vega [141]
115Margit Voigt [75] [77] [82] [96] [105] [108] [111] [123] [133]
116Vitaly I. Voloshin [90] [97] [107] [109] [113]
117Annegret Wagler (Annegret Katrin Wagler) [100]
118Douglas B. West [90] [107]
119Gerhard J. Woeginger [103]
120Mariusz Wozniak [135]
121A. Yeo [142]
122Christina Zamfirescu [66]
123Tudor Zamfirescu [66]
124Huishan Zhou [109]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)