default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsolt Tuza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j312]Csilla Bujtás
, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang:
Covering the edges of a graph with triangles. Discret. Math. 348(1): 114226 (2025)- 2024
- [j311]Yair Caro, Balázs Patkós, Zsolt Tuza:
Connected Turán number of trees. Ars Math. Contemp. 24(4): 4 (2024) - [j310]János Balogh, József Békési, Nóra Büki, György Dósa, Zsolt Tuza:
Extremal behavior of the Greedy algorithm for a triangle scheduling problem. Comput. Oper. Res. 169: 106718 (2024) - [j309]Anita Keszler, Zsolt Tuza:
Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I. Discret. Math. 347(3): 113782 (2024) - [j308]Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024) - [j307]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Some exact results for regular Turán problems for all large orders. Eur. J. Comb. 117: 103828 (2024) - [j306]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40(3): 57 (2024) - [j305]Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The Robust Chromatic Number of Graphs. Graphs Comb. 40(4): 89 (2024) - [c25]Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN 2024: 28:1-28:16 - 2023
- [j304]Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark:
The bin covering with delivery problem, extended investigations for the online case. Central Eur. J. Oper. Res. 31(1): 21-47 (2023) - [j303]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Vector sum-intersection theorems. Discret. Math. 346(10): 113506 (2023) - [j302]Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
The board packing problem. Eur. J. Oper. Res. 308(3): 1056-1073 (2023) - [j301]Péter Bence Czaun, Pál Pusztai, Levente Sebok, Zsolt Tuza:
Minimal Non-C-Perfect Hypergraphs with Circular Symmetry. Symmetry 15(5): 1114 (2023) - [j300]Zsolt Tuza:
Gregarious Decompositions of Complete Equipartite Graphs and Related Structures. Symmetry 15(12): 2097 (2023) - 2022
- [j299]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022) - [j298]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory 42(4): 1061-1074 (2022) - [j297]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022) - [j296]Suresh Dara, Suchismita Mishra, Narayanan Narayanan, Zsolt Tuza:
Strong Edge Coloring of Cayley Graphs and Some Product Graphs. Graphs Comb. 38(2): 51 (2022) - [j295]Sylwia Cichacz, Zsolt Tuza:
Realization of digraphs in Abelian groups and its consequences. J. Graph Theory 100(2): 331-345 (2022) - [j294]Csilla Bujtás, Marko Jakovac, Zsolt Tuza:
The k-path vertex cover: General bounds and chordal graphs. Networks 80(1): 63-76 (2022) - [j293]János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16(9): 2775-2785 (2022) - 2021
- [j292]Csilla Bujtás, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Salvatore Milici, Zsolt Tuza:
Complex uniformly resolvable decompositions of K_v. Ars Math. Contemp. 21(1) (2021) - [j291]Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza, Margit Voigt:
Comparison of sum choice number with chromatic sum. Discret. Math. 344(7): 112391 (2021) - [j290]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j289]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Z2× Z2-cordial cycle-free hypergraphs. Discuss. Math. Graph Theory 41(4): 1021-1040 (2021) - [j288]József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube, II. Eur. J. Comb. 91: 103201 (2021) - [j287]György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin:
Coloring Properties of Mixed Cycloids. Symmetry 13(8): 1539 (2021) - [j286]György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza:
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. Theor. Comput. Sci. 880: 69-81 (2021) - 2020
- [j285]Mario Gionfriddo, Lorenzo Milazzo, Zsolt Tuza:
Hypercycle systems. Australas. J Comb. 77: 336-354 (2020) - [j284]Yair Caro, Zsolt Tuza:
Regular Turán numbers. Australas. J Comb. 78: 133-144 (2020) - [j283]Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza:
Independent (k+1)-domination in k-trees. Discret. Appl. Math. 284: 99-110 (2020) - [j282]Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza:
Clique coverings and claw-free graphs. Eur. J. Comb. 88: 103114 (2020) - [j281]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On Specific Factors in Graphs. Graphs Comb. 36(5): 1391-1399 (2020) - [j280]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On caterpillar factors in graphs. Theor. Comput. Sci. 846: 82-90 (2020)
2010 – 2019
- 2019
- [j279]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j278]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 27(4): 1107-1130 (2019) - [j277]Csilla Bujtás, Zsolt Tuza:
Fractional Domination Game. Electron. J. Comb. 26(4): 4 (2019) - [j276]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Domination game on uniform hypergraphs. Discret. Appl. Math. 258: 65-75 (2019) - [j275]Leila Badakhshian, Gyula O. H. Katona, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube. Discret. Appl. Math. 266: 30-37 (2019) - [j274]Cristina Bazgan, Henning Fernau, Zsolt Tuza:
Aspects of upper defensive alliances. Discret. Appl. Math. 266: 111-120 (2019) - [j273]György Dósa, Hans Kellerer, Zsolt Tuza:
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1): 160-169 (2019) - [j272]Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza:
Disjoint Paired-Dominating sets in Cubic Graphs. Graphs Comb. 35(5): 1129-1138 (2019) - [j271]György Dósa, Hans Kellerer, Zsolt Tuza:
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760: 72-87 (2019) - [j270]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
Finding a potential community in networks. Theor. Comput. Sci. 769: 32-42 (2019) - 2018
- [j269]Csilla Bujtás, Zsolt Tuza:
Partition-Crossing Hypergraphs. Acta Cybern. 23(3): 815-828 (2018) - [j268]Zsolt Tuza:
Mixed hypergraphs and beyond. Art Discret. Appl. Math. 1(2): #P2.05 (2018) - [j267]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
A General Bin Packing Game: Interest Taken into Account. Algorithmica 80(5): 1534-1555 (2018) - [j266]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 26(1): 161-180 (2018) - [j265]György Dósa, Zsolt Tuza:
Multiprofessor scheduling. Discret. Appl. Math. 234: 195-209 (2018) - [j264]Gergely Kovács, Zsolt Tuza, Béla Vizvári, Hajieh K. Jabbari:
A note on the polytope of bipartite TSP. Discret. Appl. Math. 235: 92-100 (2018) - [j263]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j262]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018) - [j261]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Safe sets, network majority on weighted trees. Networks 71(1): 81-92 (2018) - [c24]György Dósa, Hans Kellerer, Zsolt Tuza:
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. WAOA 2018: 204-217 - [i5]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - 2017
- [j260]Csilla Bujtás, Zsolt Tuza:
F-WORM colorings: Results for 2-connected graphs. Discret. Appl. Math. 231: 131-138 (2017) - [j259]Peter Horák, Igor A. Semaev, Zsolt Tuza:
A combinatorial problem related to sparse systems of equations. Des. Codes Cryptogr. 85(1): 129-144 (2017) - [j258]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26: 66-77 (2017) - [j257]Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza:
Coloring the cliques of line graphs. Discret. Math. 340(11): 2641-2649 (2017) - [j256]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. 340(11): 2704-2713 (2017) - [j255]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Bounds on the game transversal number in hypergraphs. Eur. J. Comb. 59: 34-50 (2017) - [j254]Zsolt Tuza:
Graph labeling games. Electron. Notes Discret. Math. 60: 61-68 (2017) - [j253]Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza:
Tropical matchings in vertex-colored graphs. Electron. Notes Discret. Math. 62: 219-224 (2017) - [c23]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
On the Complexity of Finding a Potential Community. CIAC 2017: 80-91 - 2016
- [j252]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128: 165-173 (2016) - [j251]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j250]Bernadett Ács, Gábor Szederkényi, Zsolt Tuza, Zoltán A. Tuza:
Computing all possible graph structures describing linearly conjugate realizations of kinetic systems. Comput. Phys. Commun. 204: 11-20 (2016) - [j249]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Induced cycles in triangle graphs. Discret. Appl. Math. 209: 264-275 (2016) - [j248]Ewa Drgas-Burchardt, Kamila Kowalska, Jerzy Michael, Zsolt Tuza:
Some properties of vertex-oblique graphs. Discret. Math. 339(1): 95-102 (2016) - [j247]Csilla Bujtás, Zsolt Tuza:
The Disjoint Domination Game. Discret. Math. 339(7): 1985-1992 (2016) - [j246]Csilla Bujtás, Zsolt Tuza:
K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. Discuss. Math. Graph Theory 36(3): 759-772 (2016) - [j245]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Network Majority on Tree Topological Network. Electron. Notes Discret. Math. 54: 79-84 (2016) - [j244]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. SIAM J. Discret. Math. 30(3): 1830-1847 (2016) - [j243]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
New models of graph-bin packing. Theor. Comput. Sci. 640: 94-103 (2016) - [c22]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c21]Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC 2016: 3:1-3:12 - [c20]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27 - 2015
- [j242]Mate Barany, Zsolt Tuza:
Circular coloring of graphs via linear programming and tabu search. Central Eur. J. Oper. Res. 23(4): 833-848 (2015) - [j241]Csilla Bujtás, Zsolt Tuza:
Maximum number of colors in hypertrees of bounded degree. Central Eur. J. Oper. Res. 23(4): 867-876 (2015) - [j240]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Generalized Line Graphs: Cartesian Products and Complexity of Recognition. Electron. J. Comb. 22(3): 3 (2015) - [j239]István Szalkai, Zsolt Tuza:
Minimum number of affine simplices of given dimension. Discret. Appl. Math. 180: 141-149 (2015) - [j238]Csilla Bujtás, Zsolt Tuza:
Turán numbers and batch codes. Discret. Appl. Math. 186: 45-55 (2015) - [j237]Peter Horák, Zsolt Tuza:
Speeding up deciphering by hypergraph ordering. Des. Codes Cryptogr. 75(1): 175-185 (2015) - [j236]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. Discret. Math. 338(4): 621-632 (2015) - [j235]Veronika Halász, Zsolt Tuza:
Distance-constrained labeling of complete trees. Discret. Math. 338(8): 1398-1406 (2015) - [j234]Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza:
Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles. Discret. Math. 338(10): 1667-1673 (2015) - [j233]Csilla Bujtás, Zsolt Tuza:
Approximability of the upper chromatic number of hypergraphs. Discret. Math. 338(10): 1714-1721 (2015) - [j232]Peter Horák, Igor A. Semaev, Zsolt Tuza:
An application of Combinatorics in Cryptography. Electron. Notes Discret. Math. 49: 31-35 (2015) - [j231]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs Comb. 31(1): 265-280 (2015) - [j230]Nathann Cohen, Zsolt Tuza:
Induced Decompositions of Highly Dense Graphs. J. Graph Theory 78(2): 97-107 (2015) - [j229]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j228]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - [c19]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
Bin Packing Game with an Interest Matrix. COCOON 2015: 57-69 - [i4]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. CoRR abs/1503.01008 (2015) - 2014
- [j227]Salvatore Milici, Gaetano Quattrocchi, Zsolt Tuza:
G-designs without blocking sets, Note. Ars Comb. 114: 229-233 (2014) - [j226]Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo:
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21(2): 2 (2014) - [j225]Salvatore Milici, Zsolt Tuza:
Uniformly resolvable decompositions of Kv into P3 and K3 graphs. Discret. Math. 331: 137-141 (2014) - [j224]Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza:
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - 2013
- [j223]Attila Benko, György Dósa, Zsolt Tuza:
Bin covering with a general profit function: approximability results. Central Eur. J. Oper. Res. 21(4): 805-816 (2013) - [j222]S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161(13-14): 1859-1867 (2013) - [j221]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discret. Math. 313(19): 1965-1977 (2013) - [j220]Zsolt Tuza:
Problems on cycles and colorings. Discret. Math. 313(19): 2007-2013 (2013) - [j219]Gyula O. H. Katona, Zsolt Tuza:
Color the cycles. Discret. Math. 313(19): 2026-2033 (2013) - [j218]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Cordial labeling of hypertrees. Discret. Math. 313(22): 2518-2524 (2013) - [j217]Zsolt Tuza:
Choice-perfect graphs. Discuss. Math. Graph Theory 33(1): 231-242 (2013) - [j216]Július Czap, Zsolt Tuza:
Decompositions of plane graphs under parity constrains given by faces. Discuss. Math. Graph Theory 33(3): 521-530 (2013) - [j215]Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza:
$$[1, 1, t]$$ -Colorings of Complete Graphs. Graphs Comb. 29(4): 1041-1050 (2013) - [j214]Máté Hegyháti, Zsolt Tuza:
Colorability of mixed hypergraphs and their chromatic inversions. J. Comb. Optim. 25(4): 737-751 (2013) - [j213]György Dósa, Zsolt Tuza, Deshi Ye:
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. J. Comb. Optim. 26(3): 416-436 (2013) - [j212]Anita Keszler, Tamás Szirányi, Zsolt Tuza:
Dense subgraph mining with a mixed graph model. Pattern Recognit. Lett. 34(11): 1252-1262 (2013) - [j211]György Dósa, Rongheng Li, Xin Han, Zsolt Tuza:
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9. Theor. Comput. Sci. 510: 13-61 (2013) - [c18]Gábor Bacsó, Anita Keszler, Zsolt Tuza:
Matching Matchings. ECBS-EERC 2013: 85-94 - [i3]Peter Horák, Zsolt Tuza:
Speeding up Deciphering by Hypergraph Ordering. CoRR abs/1309.5292 (2013) - [i2]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. CoRR abs/1312.7522 (2013) - 2012
- [j210]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
3-consecutive edge coloring of a graph. Discret. Math. 312(3): 561-573 (2012) - [j209]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
Vertex coloring without large polychromatic stars. Discret. Math. 312(14): 2102-2108 (2012) - [j208]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. Discret. Math. 312(17): 2550-2560 (2012) - [j207]Gábor Bacsó, Zsolt Tuza:
Distance domination versus iterated domination. Discret. Math. 312(17): 2672-2675 (2012) - [j206]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33(1): 62-72 (2012) - [j205]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Small Edge Sets Meeting all Triangles of a Graph. Graphs Comb. 28(3): 381-392 (2012) - [j204]Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt:
List Colorings of K5-Minor-Free Graphs With Special List Assignments. J. Graph Theory 71(1): 18-30 (2012) - [c17]János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. WAOA 2012: 131-144 - [i1]György Dósa, Zsolt Tuza:
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms. CoRR abs/1207.5672 (2012) - 2011
- [j203]Csilla Bujtás, Zsolt Tuza:
Optimal batch codes: Many items or low retrieval requirement. Adv. Math. Commun. 5(3): 529-541 (2011) - [j202]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara:
Improper C-colorings of graphs. Discret. Appl. Math. 159(4): 174-186 (2011) - [j201]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159(17): 1933-1946 (2011) - [j200]Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin:
Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31(2): 223-238 (2011) - [j199]Gábor Bacsó, Zsolt Tuza:
Optimal guard sets and the Helly property. Eur. J. Comb. 32(1): 28-32 (2011) - [j198]Csilla Bujtás, Zsolt Tuza:
Combinatorial batch codes: Extremal problems under Hall-type conditions. Electron. Notes Discret. Math. 38: 201-206 (2011) - [j197]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
The Graph-Bin Packing Problem. Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) - [j196]György Dósa, Maria Grazia Speranza, Zsolt Tuza:
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J. Comb. Optim. 21(4): 458-480 (2011) - [j195]Cristina Bazgan, Basile Couëtoux, Zsolt Tuza:
Complexity and approximation of the Constrained Forest problem. Theor. Comput. Sci. 412(32): 4081-4091 (2011) - [c16]Anita Keszler, Tamás Szirányi, Zsolt Tuza:
Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images. IMAGAPP/IVAPP 2011: 100-105 - 2010
- [j194]Csilla Bujtás, Zsolt Tuza:
Voloshin's conjecture for C-perfect hypertrees. Australas. J Comb. 48: 253-268 (2010) - [j193]Zsolt Tuza:
Hall number for list colorings of graphs: Extremal results. Discret. Math. 310(3): 461-470 (2010) - [j192]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Discret. Math. 310(9): 1463-1474 (2010) - [j191]Gábor Bacsó, Heinz A. Jung, Zsolt Tuza:
Infinite versus finite graph domination. Discret. Math. 310(9): 1495-1500 (2010) - [j190]Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza:
Approximation algorithms for the minimum rainbow subgraph problem. Discret. Math. 310(20): 2666-2670 (2010) - [j189]Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza:
3-consecutive C-colorings of graphs. Discuss. Math. Graph Theory 30(3): 393-405 (2010) - [j188]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2): 271-280 (2010) - [j187]Csilla Bujtás, Zsolt Tuza:
C-perfect hypergraphs. J. Graph Theory 64(2): 132-149 (2010) - [j186]Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza:
Geometric representation for semi on-line scheduling on uniform processors. Optim. Methods Softw. 25(3): 421-428 (2010) - [c15]Attila Benko, György Dósa, Zsolt Tuza:
Bin Packing/Covering with Delivery, solved with the evolution of algorithms. BIC-TA 2010: 298-302 - [c14]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA 2010: 154-166
2000 – 2009
- 2009
- [j185]Lorenzo Milazzo, Zsolt Tuza:
Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems. Ars Comb. 92 (2009) - [j184]Katalin M. Hangos, Zsolt Tuza, Anders Yeo:
Some complexity problems on single input double output controllers. Discret. Appl. Math. 157(5): 1146-1158 (2009) - [j183]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, I: General results. Discret. Math. 309(15): 4890-4902 (2009) - [j182]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
On list critical graphs. Discret. Math. 309(15): 4931-4941 (2009) - [j181]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Discret. Math. 309(22): 6391-6401 (2009) - [j180]Gábor Bacsó, Zsolt Tuza:
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discret. Math. Theor. Comput. Sci. 11(2): 15-24 (2009) - [j179]Csilla Bujtás, Zsolt Tuza:
Smallest Set-Transversals of k-Partitions. Graphs Comb. 25(6): 807-816 (2009) - [j178]Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger:
Learning of winning strategies for terminal games with linear-size memory. Int. J. Game Theory 38(2): 155-168 (2009) - [j177]Wenceslas Fernandez de la Vega, Zsolt Tuza:
Groupies in random graphs. Inf. Process. Lett. 109(7): 339-340 (2009) - [c13]Cristina Bazgan, Basile Couëtoux, Zsolt Tuza:
Covering a Graph with a Constrained Forest (Extended Abstract). ISAAC 2009: 892-901 - 2008
- [j176]Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008) - [j175]Csilla Bujtás, Zsolt Tuza:
Uniform Mixed Hypergraphs: The Possible Numbers of Colors. Graphs Comb. 24(1): 1-12 (2008) - [j174]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008) - [j173]Cristina Bazgan, Zsolt Tuza:
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6(3): 510-519 (2008) - [j172]Zsolt Tuza:
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs. SIAM J. Discret. Math. 22(3): 849-853 (2008) - [j171]Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008) - 2007
- [j170]Zsuzsanna Szaniszló, Zsolt Tuza:
Lower bound on the profile of degree pairs in cross-intersecting set systems. Comb. 27(3): 399-405 (2007) - [j169]Mieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt Tuza:
Game List Colouring of Graphs. Electron. J. Comb. 14(1) (2007) - [j168]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155(8): 979-988 (2007) - [j167]Csilla Bujtás, Zsolt Tuza:
Orderings of uniquely colorable hypergraphs. Discret. Appl. Math. 155(11): 1395-1407 (2007) - [j166]Mirko Hornák, Zsolt Tuza, Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees. Discret. Appl. Math. 155(11): 1420-1429 (2007) - [j165]Gábor Bacsó, Zsolt Tuza, Margit Voigt:
Characterization of graphs dominated by induced paths. Discret. Math. 307(7-8): 822-826 (2007) - [j164]Zsolt Tuza:
Extremal jumps of the Hall number. Electron. Notes Discret. Math. 28: 83-89 (2007) - [j163]Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
Semi on-line scheduling on three processors with known sum of the tasks. J. Sched. 10(4-5): 263-269 (2007) - 2006
- [j162]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
The satisfactory partition problem. Discret. Appl. Math. 154(8): 1236-1245 (2006) - [j161]Gábor Bacsó, Zsolt Tuza:
The cost chromatic number and hypergraph parameters. Discuss. Math. Graph Theory 26(3): 369-376 (2006) - [j160]Enrico 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. Discret. Math. Theor. Comput. Sci. 8(1): 1-16 (2006) - [j159]Csilla Bujtás, Zsolt Tuza:
Mixed colorings of hypergraphs. Electron. Notes Discret. Math. 24: 273-275 (2006) - [j158]Lars Døvling Andersen, Preben D. Vestergaard, Zsolt Tuza:
Largest Non-Unique Subgraphs. Graphs Comb. 22(4): 453-470 (2006) - [j157]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006) - [p2]Sándor Dominich, Adrienn Skrop, Zsolt Tuza:
Formal Theory of Connectionist Web Retrieval. Soft Computing in Web Information Retrieva 2006: 163-194 - 2005
- [j156]Zsolt Tuza:
Strong branchwidth and local transversals. Discret. Appl. Math. 145(2): 291-296 (2005) - [j155]Betsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza:
The cover pebbling number of graphs. Discret. Math. 296(1): 15-23 (2005) - [j154]Gábor Bacsó, Danuta Michalak, Zsolt Tuza:
Dominating Bipartite Subgraphs in Graphs. Discuss. Math. Graph Theory 25(1-2): 85-94 (2005) - [j153]Gábor Bacsó, Attila Tálos, Zsolt Tuza:
Graph Domination in Distance Two. Discuss. Math. Graph Theory 25(1-2): 121-128 (2005) - [j152]Zsolt Tuza:
Highly connected counterexamples to a conjecture on ά -domination. Discuss. Math. Graph Theory 25(3): 435-440 (2005) - [j151]Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt:
List version of L(d, s)-labelings. Theor. Comput. Sci. 349(1): 92-98 (2005) - [c12]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838 - 2004
- [j150]Katalin M. Hangos, Gábor Szederkényi, Zsolt Tuza:
The effect of model simplification assumptions on the differential index of lumped process models. Comput. Chem. Eng. 28(1-2): 129-137 (2004) - [j149]Renata Mansini, Maria Grazia Speranza, Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134(1-3): 141-168 (2004) - [j148]Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza:
On short cycles through prescribed vertices of a graph. Discret. Math. 286(1-2): 67-74 (2004) - [j147]Gábor Bacsó, Zsolt Tuza:
Graphs without induced P5 and C5. Discuss. Math. Graph Theory 24(3): 503-507 (2004) - [j146]Gaetano Quattrocchi, Zsolt Tuza:
Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs. Graphs Comb. 20(4): 531-540 (2004) - [j145]Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza:
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7(6): 421-428 (2004) - 2003
- [j144]Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin:
Unique colorings of bi-hypergraphs. Australas. J Comb. 27: 33-46 (2003) - [j143]Enrico 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) - [j142]Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Mariusz Haluszczak, Zsolt Tuza:
Schütte's Tournament Problem and Intersecting Families of Sets. Comb. Probab. Comput. 12(4): 359-364 (2003) - [j141]Maria Axenovich, Tao Jiang, Zsolt Tuza:
Local Anti-Ramsey Numbers of Graphs. Comb. Probab. Comput. 12(5-6): 495-511 (2003) - [j140]Zsolt Tuza, Vitaly I. Voloshin:
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types. Comput. Sci. J. Moldova 11(1): 35-42 (2003) - [j139]Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin:
Strict colorings of Steiner triple and quadruple systems: a survey. Discret. Math. 261(1-3): 399-411 (2003) - [j138]Hal A. Kierstead, Zsolt Tuza:
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs Comb. 19(1): 121-129 (2003) - [c11]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453 - [p1]Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston:
Colorings and Related Topics. Handbook of Graph Theory 2003: 340-483 - 2002
- [j137]Gábor Bacsó, Zsolt Tuza:
Structural domination of graphs. Ars Comb. 63 (2002) - [j136]Zsolt Tuza, Vitaly I. Voloshin, Huishan Zhou:
Uniquely colorable mixed hypergraphs. Discret. Math. 248(1-3): 221-236 (2002) - [j135]Zsolt Tuza, Margit Voigt:
A note on planar 5-list colouring: non-extendability at distance 4. Discret. Math. 251(1-3): 169-172 (2002) - [j134]Zsolt Tuza, Preben D. Vestergaard:
Domination in partitioned graphs. Discuss. Math. Graph Theory 22(1): 199-210 (2002) - [j133]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
The Chromatic Spectrum of Mixed Hypergraphs. Graphs Comb. 18(2): 309-318 (2002) - [j132]Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1): 40-54 (2002) - [j131]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. 64(2): 160-170 (2002) - [j130]Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt:
Distance Graphs with Finite Chromatic Number. J. Comb. Theory B 85(1): 181-187 (2002) - [c10]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
On the b-Chromatic Number of Graphs. WG 2002: 310-320 - 2001
- [j129]Anna Lee, Gábor Révész, Jenö Szigeti, Zsolt Tuza:
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. Discret. Math. 230(1-3): 49-61 (2001) - [j128]Adam Idzik, Zsolt Tuza:
Heredity properties of connectedness in edge-coloured complete graphs. Discret. Math. 235(1-3): 301-306 (2001) - [j127]Zsolt Tuza, Annegret Wagler:
Minimally Non-Preperfect Graphs of Small Maximum Degree. Graphs Comb. 17(4): 759-773 (2001) - [j126]Zsolt Tuza, Margit Voigt:
Oriented list colorings of graphs. J. Graph Theory 36(4): 217-229 (2001) - [j125]Yannis Manoussakis, Zsolt Tuza:
Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001) - [c9]Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262 - 2000
- [j124]Zsolt Tuza, Vitaly I. Voloshin:
Uncolorable Mixed Hypergraphs. Discret. Appl. Math. 99(1-3): 209-227 (2000) - [j123]Ingo Schiermeyer, Zsolt Tuza, Margit Voigt:
On-line rankings of graphs. Discret. Math. 212(1-2): 141-147 (2000) - [j122]Zsolt Tuza:
Extremal bi-Helly families. Discret. Math. 213(1-3): 321-331 (2000) - [j121]Mihály Hujter, László Spissich, Zsolt Tuza:
Sharpness of Some Intersection Theorems. Eur. J. Comb. 21(7): 913-916 (2000) - [c8]Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). SODA 2000: 40-41
1990 – 1999
- 1999
- [j120]Maria Grazia Speranza, Zsolt Tuza:
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time. Ann. Oper. Res. 86: 491-506 (1999) - [j119]Stanislaw Bylka, Adam Idzik, Zsolt Tuza:
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. Discret. Math. 194(1-3): 39-58 (1999) - [j118]Stanislav Jendrol', Tomás Madaras, Roman Soták, Zsolt Tuza:
On light cycles in plane triangulations. Discret. Math. 197-198: 453-467 (1999) - [j117]Salvatore Milici, Zsolt Tuza:
Disjoint blocking sets in cycle systems. Discret. Math. 208-209: 451-462 (1999) - [j116]Mieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt:
Remarks on the existence of uniquely partitionable planar graphs. Discuss. Math. Graph Theory 19(2): 159-166 (1999) - [j115]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3: 86-89 (1999) - [j114]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) - [j113]Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza:
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Parallel Comput. 25(1): 49-61 (1999) - [j112]Jan Kratochvíl, Zsolt Tuza:
Rankings of Directed Graphs. SIAM J. Discret. Math. 12(3): 374-384 (1999) - 1998
- [j111]Lorenzo Milazzo, Zsolt Tuza:
Strict colourings for classes of steiner triple systems. Discret. Math. 182(1-3): 233-243 (1998) - [j110]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Complexity of choosing subsets from color sets. Discret. Math. 191(1-3): 139-148 (1998) - [j109]Paolo 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) - [j108]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Brooks-type theorems for choosability with separation. J. Graph Theory 27(1): 43-49 (1998) - [j107]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998) - [c7]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP 1998: 387-396 - [c6]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS 1998: 276-286 - [c5]Jan Kratochvíl, Zsolt Tuza:
Rankings of Directed Graphs. WG 1998: 114-123 - 1997
- [j106]John G. Gimbel, Michael A. Henning, Zsolt Tuza:
Switching Distance Graphs. Ars Comb. 47 (1997) - [j105]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discret. Appl. Math. 72(1-2): 71-84 (1997) - [j104]Zsolt Tuza, Margit Voigt:
List Colorings and Reducibility. Discret. Appl. Math. 79(1-3): 247-256 (1997) - [j103]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors. Discret. Math. 164(1-3): 67-79 (1997) - [j102]Noga Alon, Zsolt Tuza, Margit Voigt:
Choosability and fractional chromatic numbers. Discret. Math. 165-166: 31-38 (1997) - [j101]Mario Gionfriddo, Frank Harary, Zsolt Tuza:
The color cost of a caterpillar. Discret. Math. 174(1-3): 125-130 (1997) - [j100]Lorenzo Milazzo, Zsolt Tuza:
Upper chromatic number of Steiner triple and quadruple systems. Discret. Math. 174(1-3): 247-259 (1997) - [j99]Jenö Szigeti, Zsolt Tuza:
Generalized colorings and avoidable orientations. Discuss. Math. Graph Theory 17(1): 137-145 (1997) - [j98]Zsolt Tuza:
Graph colorings with local constraints - a survey. Discuss. Math. Graph Theory 17(2): 161-228 (1997) - [j97]Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza:
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5): 235-242 (1997) - [c4]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
New trends in the theory of graph colorings: Choosability and list coloring. Contemporary Trends in Discrete Mathematics 1997: 183-197 - 1996
- [j96]Mihály Hujter, Zsolt Tuza:
Precoloring Extension 3: Classes of Perfect Graphs. Comb. Probab. Comput. 5: 35-56 (1996) - [j95]Yannis Manoussakis, Zsolt Tuza:
The Forwarding Index of Directed Networks. Discret. Appl. Math. 68(3): 279-291 (1996) - [j94]Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza:
Cycle-saturated graphs of minimum size. Discret. Math. 150(1-3): 31-48 (1996) - [j93]Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering and independence in triangle structures. Discret. Math. 150(1-3): 89-101 (1996) - [j92]Stanislav Jendrol', Michal Tkác, Zsolt Tuza:
The irregularity strength and cost of the union of cliques. Discret. Math. 150(1-3): 179-186 (1996) - [j91]René van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian properties of Toeplitz graphs. Discret. Math. 159(1-3): 69-81 (1996) - [j90]Paul Erdös, Zsolt Tuza, Pavel Valtr:
Ramsey-remainder. Eur. J. Comb. 17(6): 519-532 (1996) - [j89]Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt:
Minimal colorings for properly colored subgraphs. Graphs Comb. 12(1): 345-360 (1996) - [j88]Yannis Manoussakis, Michael Spyratos, Zsolt Tuza:
Cycles of given color patterns. J. Graph Theory 21(2): 153-162 (1996) - [j87]Zsolt Tuza, Margit Voigt:
Every 2-choosable graph is (2m, m)-choosable. J. Graph Theory 22(3): 245-252 (1996) - [j86]Yannis Manoussakis, Zsolt Tuza:
Optimal routings in communication networks with linearly bounded forwarding index. Networks 28(4): 177-180 (1996) - 1995
- [j85]Nguyen Van Ngoc, Zsolt Tuza:
4-chromatic graphs with large odd girth. Discret. Math. 138(1-3): 387-392 (1995) - [j84]Martin Aigner, Eberhard Triesch, Zsolt Tuza:
Searching for acyclic orientations of graphs. Discret. Math. 144(1-3): 3-10 (1995) - [j83]Ralph J. Faudree, Zsolt Tuza:
Stronger bounds for generalized degress and Menger path systems. Discuss. Math. Graph Theory 15(2): 167-177 (1995) - [j82]Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza:
Degree Sums and Covering Cycles. J. Graph Theory 20(4): 419-422 (1995) - [j81]Noga Alon, Zsolt Tuza:
The Acyclic Orientation Game on Random Graphs. Random Struct. Algorithms 6(2/3): 261-268 (1995) - [j80]Zsolt Tuza:
How to Make A Random Graph Irregular. Random Struct. Algorithms 6(2/3): 323-330 (1995) - 1994
- [j79]Mario Gionfriddo, Salvatore Milici, Zsolt Tuza:
Blocking Sets in SQS(2u). Comb. Probab. Comput. 3: 77-86 (1994) - [j78]Jan Kratochvíl, Zsolt Tuza:
Algorithmic complexity of list colorings. Discret. Appl. Math. 50(3): 297-302 (1994) - [j77]Zsolt Tuza:
Inequalities for Minimal Covering Sets in Set Systems of Given Rank. Discret. Appl. Math. 51(1-2): 187-195 (1994) - [j76]Pavol Hell, Yannis Manoussakis, Zsolt Tuza:
Packing Problems in Edge-colored Graphs. Discret. Appl. Math. 52(3): 295-306 (1994) - [j75]Mario Gionfriddo, Zsolt Tuza:
On conjectures of Berge and Chvátal. Discret. Math. 124(1-3): 79-86 (1994) - [j74]Zsolt Tuza:
Monochromatic coverings and tree Ramsey numbers. Discret. Math. 125(1-3): 377-384 (1994) - [j73]Zsolt Tuza:
Largest size and union of Helly families. Discret. Math. 127(1-3): 319-327 (1994) - [j72]Salvatore Milici, Zsolt Tuza:
The spectrum of lambda-times repeated blocks for TS(upsilon, lambda). Discret. Math. 129(1-3): 159-166 (1994) - [j71]Zsolt Tuza:
Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs. Discret. Math. 135(1-3): 335-347 (1994) - [j70]Jan Kratochvíl, Zsolt Tuza:
Intersection Dimensions of Graph Classes. Graphs Comb. 10(2-4): 159-168 (1994) - [j69]Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza:
Local and global average degree in graphs and multigraphs. J. Graph Theory 18(7): 647-661 (1994) - [j68]Svatopluk Poljak, Zsolt Tuza:
The expected relative error of the polyhedral approximation of the max-cut problem. Oper. Res. Lett. 16(4): 191-198 (1994) - [j67]Svatopluk Poljak, Zsolt Tuza:
Bipartite Subgraphs of Triangle-Free Graphs. SIAM J. Discret. Math. 7(2): 307-313 (1994) - [c3]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. WG 1994: 292-304 - 1993
- [j66]Nguyen Van Ngoc, Zsolt Tuza:
Linear-Time Algorithms for the Max Cut Problem. Comb. Probab. Comput. 2: 201-210 (1993) - [j65]Gábor Bacsó, Zsolt Tuza:
Domination properties and induced subgraphs. Discret. Math. 111(1-3): 37-40 (1993) - [j64]Yair Caro, Zsolt Tuza:
Bounded degrees and prescribed distances in graphs. Discret. Math. 111(1-3): 87-93 (1993) - [j63]Zsolt Tuza:
Multipartite Turán problem for connected graphs and hypergraphs. Discret. Math. 112(1-3): 199-206 (1993) - [j62]Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza:
Graphs with no induced C4 and 2K2. Discret. Math. 115(1-3): 51-55 (1993) - [j61]László Pyber, Zsolt Tuza:
Menger-type theorems with restrictions on path lengths. Discret. Math. 120(1-3): 161-174 (1993) - [j60]Peter Horák, Zsolt Tuza:
Large s-representable set systems with low maximum degree. Discret. Math. 122(1-3): 205-217 (1993) - [j59]Zsolt Tuza:
Helly Property in Finite Set Systems. J. Comb. Theory A 62(1): 1-14 (1993) - [j58]Martin Farber, Mihály Hujter, Zsolt Tuza:
An upper bound on the number of cliques in a graph. Networks 23(3): 207-210 (1993) - [j57]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) - [j56]Gerard J. Chang, Martin Farber, Zsolt Tuza:
Algorithmic Aspects of Neighborhood Numbers. SIAM J. Discret. Math. 6(1): 24-29 (1993) - [j55]Mihály Hujter, Zsolt Tuza:
The Number of Maximal Independent Sets in Triangle-Free Graphs. SIAM J. Discret. Math. 6(2): 284-288 (1993) - [c2]Svatopluk Poljak, Zsolt Tuza:
Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization 1993: 181-244 - 1992
- [j54]János Körner, Gábor Simonyi, Zsolt Tuza:
Perfect couples of graphs. Comb. 12(2): 179-192 (1992) - [j53]András Kornai, Zsolt Tuza:
Narrowness, pathwidth, and their application in natural language processing. Discret. Appl. Math. 36(1): 87-92 (1992) - [j52]Miklós Biró, Mihály Hujter, Zsolt Tuza:
Precoloring extension. I. Interval graphs. Discret. Math. 100(1-3): 267-279 (1992) - [j51]Miroslaw Truszczynski, Zsolt Tuza:
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. Discret. Math. 103(3): 301-312 (1992) - [j50]Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering the cliques of a graph with vertices. Discret. Math. 108(1-3): 279-289 (1992) - [j49]Zsolt Tuza:
Asymptotic growth of sparse saturated structures is locally determined. Discret. Math. 108(1-3): 397-402 (1992) - [j48]Zsolt Tuza:
Graph coloring in linear time. J. Comb. Theory B 55(2): 236-243 (1992) - [j47]Jozef Sirán, Zsolt Tuza:
Nearly uniform distribution of edges among k-subgraphs of a graph. J. Graph Theory 16(6): 591-604 (1992) - [j46]Vojtech Rödl, Zsolt Tuza:
Rainbow Subgraphs in Properly Edge-colored Graphs. Random Struct. Algorithms 3(2): 175-182 (1992) - 1991
- [j45]Miroslaw Truszczynski, Zsolt Tuza:
Asymptotic results on saturated graphs. Discret. Math. 87(3): 309-314 (1991) - [j44]Thomas Andreae, Martin Schughart, Zsolt Tuza:
Clique-transversal sets of line graphs and complements of line graphs. Discret. Math. 88(1): 11-20 (1991) - [j43]Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza:
Decompositions of regular bipartite graphs. Discret. Math. 89(1): 17-27 (1991) - [j42]Paul Erdös, Zoltán Füredi, Zsolt Tuza:
Saturated r-uniform hypergraphs. Discret. Math. 98(2): 95-104 (1991) - [j41]Zsolt Tuza:
Perfect graph decompositions. Graphs Comb. 7(1): 89-93 (1991) - [j40]Yair Caro, Zsolt Tuza:
Hypergraph coverings and local colorings. J. Comb. Theory B 52(1): 79-85 (1991) - [j39]Zsolt Tuza:
Extensions of Gallai's graph covering theorems for uniform hypergraphs. J. Comb. Theory B 52(1): 92-96 (1991) - [j38]Paul Erdös, András Hajnal, Zsolt Tuza:
Local constraints ensuring small representing sets. J. Comb. Theory A 58(1): 78-84 (1991) - [j37]Yair Caro, Zsolt Tuza:
Improved lower bounds on k-independence. J. Graph Theory 15(1): 99-107 (1991) - [j36]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
- [j35]Fan 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. Discret. Math. 81(2): 129-135 (1990) - [j34]Zsolt Tuza:
Covering all cliques of a graph. Discret. Math. 86(1-3): 117-126 (1990) - [j33]Zsolt Tuza:
Contractions and minimalk-colorability. Graphs Comb. 6(1): 51-59 (1990) - [j32]Zsolt Tuza:
A conjecture on triangles of graphs. Graphs Comb. 6(4): 373-380 (1990) - [j31]Zsolt Tuza:
Periodic String Division Generated by Deterministic L Systems. Inf. Process. Lett. 34(5): 229-234 (1990) - [j30]Gábor Bacsó, Zsolt Tuza:
A characterization of graphs without long induced paths. J. Graph Theory 14(4): 455-464 (1990) - [j29]Yannis Manoussakis, Zsolt Tuza:
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. SIAM J. Discret. Math. 3(4): 537-543 (1990)
1980 – 1989
- 1989
- [j28]Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza:
Induced matchings in bipartite graphs. Discret. Math. 78(1-2): 83-87 (1989) - [j27]Noga Alon, Yair Caro, Zsolt Tuza:
Sub-Ramsey numbers for arithmetic progressions. Graphs Comb. 5(1): 307-314 (1989) - [j26]Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree. J. Comb. Theory B 47(1): 73-79 (1989) - [j25]Svatopluk Poljak, Zsolt Tuza:
On the maximum number of qualitatively independent partitions. J. Comb. Theory A 51(1): 111-116 (1989) - [j24]Zsolt Tuza:
Minimum number of elements representing a set system of given rank. J. Comb. Theory A 52(1): 84-89 (1989) - 1988
- [j23]Zsolt Tuza:
Isomorphism of two infinite-chromatic triangle-free graphs. Discret. Math. 69(1): 95 (1988) - [j22]András Gyárfás, Jenö Lehel, Zsolt Tuza:
Clumsy packing of dominoes. Discret. Math. 71(1): 33-46 (1988) - 1987
- [j21]Zsolt Tuza:
On two intersecting set systems and k-continuous boolean functions. Discret. Appl. Math. 16(2): 183-185 (1987) - [j20]Zsolt Tuza:
On the context-free production complexity of finite languages. Discret. Appl. Math. 18(3): 293-304 (1987) - [j19]András Gyárfás, Zsolt Tuza:
An upper bound on the Ramsey number of trees. Discret. Math. 66(3): 309-310 (1987) - [j18]Christopher S. Edwards, Peter D. Johnson Jr., Zsolt Tuza:
Another Extremal Property of Some Turan Graphs. Eur. J. Comb. 8(1): 27-28 (1987) - [j17]Miroslaw Truszczynski, Zsolt Tuza:
Linear upper bounds for local Ramsey numbers. Graphs Comb. 3(1): 67-73 (1987) - [j16]Zsolt Tuza:
Inequalities for two set systems with prescribed intersections. Graphs Comb. 3(1): 75-80 (1987) - [j15]Svatopluk Poljak, Zsolt Tuza:
Maximum bipartite subgraphs of Kneser graphs. Graphs Comb. 3(1): 191-199 (1987) - [j14]András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza:
Ramsey numbers for local colorings. Graphs Comb. 3(1): 267-277 (1987) - [j13]Andrá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 B 43(2): 127-139 (1987) - 1986
- [j12]Jenö Lehel, Zsolt Tuza:
Neighborhood perfect graphs. Discret. Math. 61(1): 93-101 (1986) - [j11]L. Kászonyi, Zsolt Tuza:
Saturated graphs with minimal number of edges. J. Graph Theory 10(2): 203-210 (1986) - [c1]Zsolt Tuza:
Some combinatorial problems concerning finite languages. IMYCS 1986: 51-58 - 1985
- [j10]András Gyárfás, Jenö Lehel, Zsolt Tuza:
How many atoms can be defined by boxes. Comb. 5(3): 193-204 (1985) - [j9]Zoltán Füredi, Zsolt Tuza:
Hypergraphs without a large star. Discret. Math. 55(3): 317-321 (1985) - [j8]Vojtech Rödl, Zsolt Tuza:
On color critical graphs. J. Comb. Theory B 38(3): 204-213 (1985) - [j7]Zsolt Tuza:
Critical hypergraphs and intersecting set-pair systems. J. Comb. Theory B 39(2): 134-145 (1985) - 1984
- [j6]Zsolt Tuza:
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices. Comb. 4(1): 111-116 (1984) - [j5]András Gyárfás, Jenö Lehel, Zsolt Tuza:
The structure of rectangle families dividing the plane into maximum number of atoms. Discret. Math. 52(2-3): 177-198 (1984) - [j4]Zsolt Tuza:
Helly-type Hypergraphs and Sperner Families. Eur. J. Comb. 5(2): 185-187 (1984) - 1982
- [j3]Jenö Lehel, Zsolt Tuza:
Triangle-free partial graphs and edge covering theorems. Discret. Math. 39(1): 59-65 (1982) - 1980
- [j2]András Gyárfás, Endre Szemerédi, Zsolt Tuza:
Induced subtrees in graphs of large chromatic number. Discret. Math. 30(3): 235-244 (1980) - [j1]Jenö Lehel, Zsolt Tuza:
Ensembles d'articulation d'un graphe γ-critique. Discret. Math. 30(3): 245-248 (1980)
Coauthor Index
[j312] [j308] [j294] [j292] [j290] [j282] [j281] [j280] [j277] [j276] [j272] [j269] [j262] [j260] [j258] [j256] [j255] [j252] [j251] [j249] [j247] [j246] [j244] [j243] [c20] [j241] [j240] [j238] [j233] [i4] [j226] [j222] [j221] [j210] [j209] [j206] [j205] [j203] [j202] [j200] [j198] [j197] [j194] [j192] [j189] [j187] [j183] [j181] [j179] [j175] [j167] [j159]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
