Zsolt Tuza

351 papers A* 2A 1B 10C 3Misc 3Journal 324Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
No tiling of the 70 × 70 square with consecutive squares.
Theor. Comput. Sci.
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2025 J jnl
Covering a square with consecutive squares.
Ann. Oper. Res.
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, István Szalkai, Zsolt Tuza
2025 J jnl
Covering the edges of a graph with triangles.
Discret. Math.
Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang
2025 J jnl
Edge mappings of graphs: Turán type parameters.
Eur. J. Comb.
Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2025 J jnl
Monochromatic graph decompositions inspired by anti-Ramsey colorings.
Discret. Appl. Math.
Yair Caro, Zsolt Tuza
2025 J jnl
On strong odd colorings of graphs.
Discret. Math.
Yair Caro, Mirko Petrusevski, Riste Skrekovski, Zsolt Tuza
2025 J jnl
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard.
Algorithms
György Dósa, András Éles, Angshuman Robin Goswami, István Szalkai, Zsolt Tuza
2025 J jnl
The robust chromatic number of certain graph classes.
Discuss. Math. Graph Theory
Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Connected Turán number of trees.
Ars Math. Contemp.
Yair Caro, Balázs Patkós, Zsolt Tuza
2024 J jnl
Counting connected partitions of graphs.
J. Graph Theory
Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Extremal Graph Theoretic Questions for q-Ary Vectors.
Graphs Comb.
Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Extremal behavior of the Greedy algorithm for a triangle scheduling problem.
Comput. Oper. Res.
János Balogh, József Békési, Nóra Büki, György Dósa, Zsolt Tuza
2024 J jnl
Indicated domination game.
Discret. Math.
Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza
2024 Misc conf
No Tiling of the 70 × 70 Square with Consecutive Squares.
FUN
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2024 J jnl
Optimal strategies in fractional games: vertex cover and domination.
Ars Math. Contemp.
Csilla Bujtás, Günter Rote, Zsolt Tuza
2024 J jnl
Some exact results for regular Turán problems for all large orders.
Eur. J. Comb.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I.
Discret. Math.
Anita Keszler, Zsolt Tuza
2024 J jnl
The Robust Chromatic Number of Graphs.
Graphs Comb.
Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer
2023 J jnl
Gregarious Decompositions of Complete Equipartite Graphs and Related Structures.
Symmetry
Zsolt Tuza
2023 J jnl
Minimal Non-C-Perfect Hypergraphs with Circular Symmetry.
Symmetry
Péter Bence Czaun, Pál Pusztai, Levente Sebok, Zsolt Tuza
2023 J jnl
The bin covering with delivery problem, extended investigations for the online case.
Central Eur. J. Oper. Res.
Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark
2023 J jnl
The board packing problem.
Eur. J. Oper. Res.
Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
2023 J jnl
Vector sum-intersection theorems.
Discret. Math.
Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Guillotine cutting is asymptotically optimal for packing consecutive squares.
Optim. Lett.
János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza
2022 J jnl
On saturation of Berge hypergraphs.
Eur. J. Comb.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Realization of digraphs in Abelian groups and its consequences.
J. Graph Theory
Sylwia Cichacz, Zsolt Tuza
2022 J jnl
Saturation problems with regularity constraints.
Discret. Math.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Singular Turán numbers and WORM-colorings.
Discuss. Math. Graph Theory
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Strong Edge Coloring of Cayley Graphs and Some Product Graphs.
Graphs Comb.
Suresh Dara, Suchismita Mishra, Narayanan Narayanan, Zsolt Tuza
2022 J jnl
The k-path vertex cover: General bounds and chordal graphs.
Networks
Csilla Bujtás, Marko Jakovac, Zsolt Tuza
2021 J jnl
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.
Theor. Comput. Sci.
György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza
2021 J jnl
Coloring Properties of Mixed Cycloids.
Symmetry
György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin
2021 J jnl
Comparison of sum choice number with chromatic sum.
Discret. Math.
Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza, Margit Voigt
2021 J jnl
Complex uniformly resolvable decompositions of K_v.
Ars Math. Contemp.
Csilla Bujtás, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Salvatore Milici, Zsolt Tuza
2021 J jnl
On Grundy total domination number in product graphs.
Discuss. Math. Graph Theory
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer
2021 J jnl
The domination number of the graph defined by two levels of the n-cube, II.
Eur. J. Comb.
József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza
2020 J jnl
Clique coverings and claw-free graphs.
Eur. J. Comb.
Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza
2020 J jnl
Hypercycle systems.
Australas. J Comb.
Mario Gionfriddo, Lorenzo Milazzo, Zsolt Tuza
2020 J jnl
Independent (k+1)-domination in k-trees.
Discret. Appl. Math.
Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza
2020 J jnl
On Specific Factors in Graphs.
Graphs Comb.
Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza
2020 J jnl
On caterpillar factors in graphs.
Theor. Comput. Sci.
Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza
2020 J jnl
Regular Turán numbers.
Australas. J Comb.
Yair Caro, Zsolt Tuza
2019 J jnl
Aspects of upper defensive alliances.
Discret. Appl. Math.
Cristina Bazgan, Henning Fernau, Zsolt Tuza
2019 J jnl
Disjoint Paired-Dominating sets in Cubic Graphs.
Graphs Comb.
Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza
2019 J jnl
Domination game on uniform hypergraphs.
Discret. Appl. Math.
Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2019 J jnl
Finding a potential community in networks.
Theor. Comput. Sci.
Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
2019 J jnl
Fractional Domination Game.
Electron. J. Comb.
Csilla Bujtás, Zsolt Tuza
2019 J jnl
Restricted assignment scheduling with resource constraints.
Theor. Comput. Sci.
György Dósa, Hans Kellerer, Zsolt Tuza
2019 J jnl
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.
Algorithmica
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2019 J jnl
The domination number of the graph defined by two levels of the n-cube.
Discret. Appl. Math.
Leila Badakhshian, Gyula O. H. Katona, Zsolt Tuza
2019 J jnl
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res.
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
2019 J jnl
Using weight decision for decreasing the price of anarchy in selfish bin packing games.
Eur. J. Oper. Res.
György Dósa, Hans Kellerer, Zsolt Tuza
2018 J jnl
A General Bin Packing Game: Interest Taken into Account.
Algorithmica
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
2018 J jnl
A note on the polytope of bipartite TSP.
Discret. Appl. Math.
Gergely Kovács, Zsolt Tuza, Béla Vizvári, Hajieh K. Jabbari
2018 B conf
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
WAOA
György Dósa, Hans Kellerer, Zsolt Tuza
2018 J jnl
Mixed hypergraphs and beyond.
Art Discret. Appl. Math.
Zsolt Tuza
2018 J jnl
Multiprofessor scheduling.
Discret. Appl. Math.
György Dósa, Zsolt Tuza
2018 J jnl
Partition-Crossing Hypergraphs.
Acta Cybern.
Csilla Bujtás, Zsolt Tuza
2018 J jnl
Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim.
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
2018 J jnl
Safe sets, network majority on weighted trees.
Networks
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2018 J jnl
Subexponential-time Algorithms for Maximum Independent Set in P
CoRR
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2018 J jnl
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res.
György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek
2018 J jnl
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms
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
2017 J jnl
A combinatorial problem related to sparse systems of equations.
Des. Codes Cryptogr.
Peter Horák, Igor A. Semaev, Zsolt Tuza
2017 J jnl
Bounds on the game transversal number in hypergraphs.
Eur. J. Comb.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza
2017 J jnl
Coloring the cliques of line graphs.
Discret. Math.
Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza
2017 J jnl
F-WORM colorings: Results for 2-connected graphs.
Discret. Appl. Math.
Csilla Bujtás, Zsolt Tuza
2017 J jnl
Graph labeling games.
Electron. Notes Discret. Math.
Zsolt Tuza
2017 J jnl
Grundy dominating sequences and zero forcing sets.
Discret. Optim.
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
2017 C conf
On the Complexity of Finding a Potential Community.
CIAC
Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
2017 J jnl
The minimum number of vertices in uniform hypergraphs with given domination number.
Discret. Math.
Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2017 J jnl
Tropical matchings in vertex-colored graphs.
Electron. Notes Discret. Math.
Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza
2016 J jnl
Computing all possible graph structures describing linearly conjugate realizations of kinetic systems.
Comput. Phys. Commun.
Bernadett Ács, Gábor Szederkényi, Zsolt Tuza, Zoltán A. Tuza
2016 J jnl
Dominating Sequences in Grid-Like and Toroidal Graphs.
Electron. J. Comb.
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
2016 B conf
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
IPEC
Gábor Bacsó, Dániel Marx, Zsolt Tuza
2016 J jnl
Induced cycles in triangle graphs.
Discret. Appl. Math.
S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza
2016 J jnl
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math.
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2016 J jnl
New models of graph-bin packing.
Theor. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2016 C conf
Safe Sets in Graphs: Graph Classes and Structural Parameters.
COCOA
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2016 J jnl
Some properties of vertex-oblique graphs.
Discret. Math.
Ewa Drgas-Burchardt, Kamila Kowalska, Jerzy Michael, Zsolt Tuza
2016 J jnl
The Disjoint Domination Game.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2016 J jnl
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.
SIAM J. Discret. Math.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza
2016 B conf
Tropical Dominating Sets in Vertex-Coloured Graphs.
WALCOM
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
2016 J jnl
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.
Ars Comb.
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
2015 J jnl
An application of Combinatorics in Cryptography.
Electron. Notes Discret. Math.
Peter Horák, Igor A. Semaev, Zsolt Tuza
2015 J jnl
Approximability of the upper chromatic number of hypergraphs.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2015 Misc conf
Bin Packing Game with an Interest Matrix.
COCOON
Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
2015 J jnl
Circular coloring of graphs via linear programming and tabu search.
Central Eur. J. Oper. Res.
Mate Barany, Zsolt Tuza
2015 J jnl
Distance-constrained labeling of complete trees.
Discret. Math.
Veronika Halász, Zsolt Tuza
2015 J jnl
Generalized Line Graphs: Cartesian Products and Complexity of Recognition.
Electron. J. Comb.
S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza
2015 J jnl
Induced Decompositions of Highly Dense Graphs.
J. Graph Theory
Nathann Cohen, Zsolt Tuza
2015 J jnl
Maximum number of colors in hypertrees of bounded degree.
Central Eur. J. Oper. Res.
Csilla Bujtás, Zsolt Tuza
2015 J jnl
Maximum uniformly resolvable decompositions of
Discret. Math.
Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza
2015 J jnl
Minimum number of affine simplices of given dimension.
Discret. Appl. Math.
István Szalkai, Zsolt Tuza
2015 J jnl
Minimum order of graphs with given coloring parameters.
Discret. Math.
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2015 J jnl
Offline black and white bin packing.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
2015 J jnl
Online Results for Black and White Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza
2015 J jnl
Orientations of Graphs with Prescribed Weighted Out-Degrees.
Graphs Comb.
Michael Stiebitz, Zsolt Tuza, Margit Voigt
2015 J jnl
Speeding up deciphering by hypergraph ordering.
Des. Codes Cryptogr.
Peter Horák, Zsolt Tuza
2015 J jnl
Tropical Dominating Sets in Vertex-Coloured Graphs.
CoRR
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
2015 J jnl
Turán numbers and batch codes.
Discret. Appl. Math.
Csilla Bujtás, Zsolt Tuza
2014 J jnl
Complexity and approximation for Traveling Salesman Problems with profits.
Theor. Comput. Sci.
Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza
2014 J jnl
G-designs without blocking sets, Note.
Ars Comb.
Salvatore Milici, Gaetano Quattrocchi, Zsolt Tuza
2014 J jnl
Total Transversals and Total Domination in Uniform Hypergraphs.
Electron. J. Comb.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo
2014 J jnl
Uniformly resolvable decompositions of K
Discret. Math.
Salvatore Milici, Zsolt Tuza
2013 J jnl
$$[1, 1, t]$$ -Colorings of Complete Graphs.
Graphs Comb.
Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza
2013 J jnl
Bin covering with a general profit function: approximability results.
Central Eur. J. Oper. Res.
Attila Benko, György Dósa, Zsolt Tuza
2013 J jnl
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.
J. Comb. Optim.
György Dósa, Zsolt Tuza, Deshi Ye
2013 J jnl
Choice-perfect graphs.
Discuss. Math. Graph Theory
Zsolt Tuza
2013 J jnl
Color the cycles.
Discret. Math.
Gyula O. H. Katona, Zsolt Tuza
2013 J jnl
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2013 J jnl
Colorability of mixed hypergraphs and their chromatic inversions.
J. Comb. Optim.
Máté Hegyháti, Zsolt Tuza
2013 J jnl
Cordial labeling of hypertrees.
Discret. Math.
Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza
2013 J jnl
Decompositions of plane graphs under parity constrains given by faces.
Discuss. Math. Graph Theory
Július Czap, Zsolt Tuza
2013 J jnl
Dense subgraph mining with a mixed graph model.
Pattern Recognit. Lett.
Anita Keszler, Tamás Szirányi, Zsolt Tuza
2013 J jnl
Equality of domination and transversal numbers in hypergraphs.
Discret. Appl. Math.
S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza
2013 — conf
Matching Matchings.
ECBS-EERC
Gábor Bacsó, Anita Keszler, Zsolt Tuza
2013 J jnl
Minimum order of graphs with given coloring parameters.
CoRR
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2013 J jnl
Problems on cycles and colorings.
Discret. Math.
Zsolt Tuza
2013 J jnl
Speeding up Deciphering by Hypergraph Ordering.
CoRR
Peter Horák, Zsolt Tuza
2013 J jnl
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
Theor. Comput. Sci.
György Dósa, Rongheng Li, Xin Han, Zsolt Tuza
2012 J jnl
3-consecutive edge coloring of a graph.
Discret. Math.
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
2012 J jnl
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms
CoRR
György Dósa, Zsolt Tuza
2012 B conf
Black and White Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
2012 J jnl
Distance domination versus iterated domination.
Discret. Math.
Gábor Bacsó, Zsolt Tuza
2012 J jnl
List Colorings of
J. Graph Theory
Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt
2012 J jnl
Proper connection of graphs.
Discret. Math.
Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza
2012 J jnl
Small Edge Sets Meeting all Triangles of a Graph.
Graphs Comb.
S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza
2012 J jnl
Transversals and domination in uniform hypergraphs.
Eur. J. Comb.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza
2012 J jnl
Vertex coloring without large polychromatic stars.
Discret. Math.
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
2011 J jnl
Color-bounded hypergraphs, V: host graphs and subdivisions.
Discuss. Math. Graph Theory
Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin
2011 J jnl
Combinatorial batch codes: Extremal problems under Hall-type conditions.
Electron. Notes Discret. Math.
Csilla Bujtás, Zsolt Tuza
2011 J jnl
Complexity and approximation of the Constrained Forest problem.
Theor. Comput. Sci.
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
2011 — conf
Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images.
IMAGAPP/IVAPP
Anita Keszler, Tamás Szirányi, Zsolt Tuza
2011 J jnl
Improper C-colorings of graphs.
Discret. Appl. Math.
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara
2011 J jnl
Optimal batch codes: Many items or low retrieval requirement.
Adv. Math. Commun.
Csilla Bujtás, Zsolt Tuza
2011 J jnl
Optimal guard sets and the Helly property.
Eur. J. Comb.
Gábor Bacsó, Zsolt Tuza
2011 J jnl
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci.
Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza
2011 J jnl
The most vital nodes with respect to independent set and vertex cover.
Discret. Appl. Math.
Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
2011 J jnl
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim.
György Dósa, Maria Grazia Speranza, Zsolt Tuza
2010 J jnl
3-consecutive C-colorings of graphs.
Discuss. Math. Graph Theory
Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza
2010 J jnl
Approximation algorithms for the minimum rainbow subgraph problem.
Discret. Math.
Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza
2010 — conf
Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
BIC-TA
Attila Benko, György Dósa, Zsolt Tuza
2010 J jnl
C-perfect hypergraphs.
J. Graph Theory
Csilla Bujtás, Zsolt Tuza
2010 J jnl
Color-bounded hypergraphs, IV: Stable colorings of hypertrees.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2010 C conf
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures.
IWOCA
Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
2010 J jnl
Geometric representation for semi on-line scheduling on uniform processors.
Optim. Methods Softw.
Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza
2010 J jnl
Hall number for list colorings of graphs: Extremal results.
Discret. Math.
Zsolt Tuza
2010 J jnl
Infinite versus finite graph domination.
Discret. Math.
Gábor Bacsó, Heinz A. Jung, Zsolt Tuza
2010 J jnl
Satisfactory graph partition, variants, and generalizations.
Eur. J. Oper. Res.
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2010 J jnl
Voloshin's conjecture for C-perfect hypertrees.
Australas. J Comb.
Csilla Bujtás, Zsolt Tuza
2009 J jnl
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discret. Math. Theor. Comput. Sci.
Gábor Bacsó, Zsolt Tuza
2009 J jnl
Color-bounded hypergraphs, I: General results.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2009 J jnl
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees.
Discret. Math.
Csilla Bujtás, Zsolt Tuza
2009 B conf
Covering a Graph with a Constrained Forest (Extended Abstract).
ISAAC
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
2009 J jnl
Groupies in random graphs.
Inf. Process. Lett.
Wenceslas Fernandez de la Vega, Zsolt Tuza
2009 J jnl
Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory
Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger
2009 J jnl
Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.
Ars Comb.
Lorenzo Milazzo, Zsolt Tuza
2009 J jnl
On list critical graphs.
Discret. Math.
Michael Stiebitz, Zsolt Tuza, Margit Voigt
2009 J jnl
Smallest Set-Transversals of
Graphs Comb.
Csilla Bujtás, Zsolt Tuza
2009 J jnl
Some complexity problems on single input double output controllers.
Discret. Appl. Math.
Katalin M. Hangos, Zsolt Tuza, Anders Yeo
2008 J jnl
Approximation of satisfactory bisection problems.
J. Comput. Syst. Sci.
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2008 J jnl
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3.
J. Discrete Algorithms
Cristina Bazgan, Zsolt Tuza
2008 J jnl
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs.
SIAM J. Discret. Math.
Zsolt Tuza
2008 J jnl
On Rainbow Connection.
Electron. J. Comb.
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
2008 J jnl
Semi-online scheduling on two uniform processors.
Theor. Comput. Sci.
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
2008 J jnl
Uniform Mixed Hypergraphs: The Possible Numbers of Colors.
Graphs Comb.
Csilla Bujtás, Zsolt Tuza
2007 J jnl
Characterization of graphs dominated by induced paths.
Discret. Math.
Gábor Bacsó, Zsolt Tuza, Margit Voigt
2007 J jnl
Efficient algorithms for decomposing graphs under degree constraints.
Discret. Appl. Math.
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2007 J jnl
Extremal jumps of the Hall number.
Electron. Notes Discret. Math.
Zsolt Tuza
2007 J jnl
Game List Colouring of Graphs.
Electron. J. Comb.
Mieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt Tuza
2007 J jnl
Lower bound on the profile of degree pairs in cross-intersecting set systems.
Comb.
Zsuzsanna Szaniszló, Zsolt Tuza
2007 J jnl
On-line arbitrarily vertex decomposable trees.
Discret. Appl. Math.
Mirko Hornák, Zsolt Tuza, Mariusz Wozniak
2007 J jnl
Orderings of uniquely colorable hypergraphs.
Discret. Appl. Math.
Csilla Bujtás, Zsolt Tuza
2007 J jnl
Semi on-line scheduling on three processors with known sum of the tasks.
J. Sched.
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
2006 J jnl
Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci.
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2006 — ch.
Formal Theory of Connectionist Web Retrieval.
Soft Computing in Web Information Retrieva
Sándor Dominich, Adrienn Skrop, Zsolt Tuza
2006 J jnl
Largest Non-Unique Subgraphs.
Graphs Comb.
Lars Døvling Andersen, Preben D. Vestergaard, Zsolt Tuza
2006 J jnl
Mixed colorings of hypergraphs.
Electron. Notes Discret. Math.
Csilla Bujtás, Zsolt Tuza
2006 J jnl
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discret. Math. Theor. Comput. Sci.
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
2006 J jnl
The cost chromatic number and hypergraph parameters.
Discuss. Math. Graph Theory
Gábor Bacsó, Zsolt Tuza
2006 J jnl
The satisfactory partition problem.
Discret. Appl. Math.
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2005 Misc conf
Complexity and Approximation of Satisfactory Partition Problems.
COCOON
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2005 J jnl
Dominating Bipartite Subgraphs in Graphs.
Discuss. Math. Graph Theory
Gábor Bacsó, Danuta Michalak, Zsolt Tuza
2005 J jnl
Graph Domination in Distance Two.
Discuss. Math. Graph Theory
Gábor Bacsó, Attila Tálos, Zsolt Tuza
2005 J jnl
Highly connected counterexamples to a conjecture on
Discuss. Math. Graph Theory
Zsolt Tuza
2005 J jnl
List version of
Theor. Comput. Sci.
Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
2005 J jnl
Strong branchwidth and local transversals.
Discret. Appl. Math.
Zsolt Tuza
2005 J jnl
The cover pebbling number of graphs.
Discret. Math.
Betsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza
2004 J jnl
Graphs without induced
Discuss. Math. Graph Theory
Gábor Bacsó, Zsolt Tuza
2004 J jnl
On short cycles through prescribed vertices of a graph.
Discret. Math.
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
2004 J jnl
Partition of
Graphs Comb.
Gaetano Quattrocchi, Zsolt Tuza
2004 J jnl
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discret. Appl. Math.
Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
2004 J jnl
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Sched.
Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza
2004 J jnl
The effect of model simplification assumptions on the differential index of lumped process models.
Comput. Chem. Eng.
Katalin M. Hangos, Gábor Szederkényi, Zsolt Tuza
2003 — ch.
Colorings and Related Topics.
Handbook of Graph Theory
Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston
2003 J jnl
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.
Comput. Sci. J. Moldova
Zsolt Tuza, Vitaly I. Voloshin
2003 J jnl
Local Anti-Ramsey Numbers of Graphs.
Comb. Probab. Comput.
Maria Axenovich, Tao Jiang, Zsolt Tuza
2003 J jnl
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs Comb.
Hal A. Kierstead, Zsolt Tuza
2003 B conf
On the Existence and Determination of Satisfactory Partitions in a Graph.
ISAAC
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
2003 J jnl
Schütte's Tournament Problem and Intersecting Families of Sets.
Comb. Probab. Comput.
Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Mariusz Haluszczak, Zsolt Tuza
2003 J jnl
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
2003 J jnl
Strict colorings of Steiner triple and quadruple systems: a survey.
Discret. Math.
Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin
2003 J jnl
Unique colorings of bi-hypergraphs.
Australas. J Comb.
Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin
2002 J jnl
A note on planar 5-list colouring: non-extendability at distance 4.
Discret. Math.
Zsolt Tuza, Margit Voigt
2002 J jnl
Distance Graphs with Finite Chromatic Number.
J. Comb. Theory B
Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt
2002 J jnl
Domination in partitioned graphs.
Discuss. Math. Graph Theory
Zsolt Tuza, Preben D. Vestergaard
2002 J jnl
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem.
J. Comput. Syst. Sci.
Cristina Bazgan, Miklos Santha, Zsolt Tuza
2002 B conf
On the b-Chromatic Number of Graphs.
WG
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
2002 J jnl
On the complexity of bicoloring clique hypergraphs of graphs.
J. Algorithms
Jan Kratochvíl, Zsolt Tuza
2002 J jnl
Structural domination of graphs.
Ars Comb.
Gábor Bacsó, Zsolt Tuza
2002 J jnl
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb.
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
2002 J jnl
Uniquely colorable mixed hypergraphs.
Discret. Math.
Zsolt Tuza, Vitaly I. Voloshin, Huishan Zhou
2001 J jnl
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
Discret. Math.
Anna Lee, Gábor Révész, Jenö Szigeti, Zsolt Tuza
2001 B conf
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
WG
Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
2001 J jnl
Heredity properties of connectedness in edge-coloured complete graphs.
Discret. Math.
Adam Idzik, Zsolt Tuza
2001 J jnl
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs Comb.
Zsolt Tuza, Annegret K. Wagler
2001 J jnl
Oriented list colorings of graphs.
J. Graph Theory
Zsolt Tuza, Margit Voigt
2001 J jnl
Ramsey numbers for tournaments.
Theor. Comput. Sci.
Yannis Manoussakis, Zsolt Tuza
2000 J jnl
Extremal bi-Helly families.
Discret. Math.
Zsolt Tuza
2000 A* conf
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).
SODA
Jan Kratochvíl, Zsolt Tuza
2000 J jnl
On-line rankings of graphs.
Discret. Math.
Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
2000 J jnl
Sharpness of Some Intersection Theorems.
Eur. J. Comb.
Mihály Hujter, László Spissich, Zsolt Tuza
2000 J jnl
Uncolorable Mixed Hypergraphs.
Discret. Appl. Math.
Zsolt Tuza, Vitaly I. Voloshin
1999 J jnl
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Comput.
Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza
1999 J jnl
Chromatic spectrum is broken.
Electron. Notes Discret. Math.
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
1999 J jnl
Disjoint blocking sets in cycle systems.
Discret. Math.
Salvatore Milici, Zsolt Tuza
1999 J jnl
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.
Discret. Math.
Stanislaw Bylka, Adam Idzik, Zsolt Tuza
1999 J jnl
On light cycles in plane triangulations.
Discret. Math.
Stanislav Jendrol', Tomás Madaras, Roman Soták, Zsolt Tuza
1999 J jnl
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs.
J. Algorithms
Cristina Bazgan, Miklos Santha, Zsolt Tuza
1999 J jnl
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.
Ann. Oper. Res.
Maria Grazia Speranza, Zsolt Tuza
1999 J jnl
Rankings of Directed Graphs.
SIAM J. Discret. Math.
Jan Kratochvíl, Zsolt Tuza
1999 J jnl
Remarks on the existence of uniquely partitionable planar graphs.
Discuss. Math. Graph Theory
Mieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt
1998 J jnl
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett.
Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza
1998 J jnl
Brooks-type theorems for choosability with separation.
J. Graph Theory
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998 J jnl
Complexity of choosing subsets from color sets.
Discret. Math.
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998 A* conf
Efficient Approximation Algorithms for the Subset-Sums Equality Problem.
ICALP
Cristina Bazgan, Miklos Santha, Zsolt Tuza
1998 A conf
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).
STACS
Cristina Bazgan, Miklos Santha, Zsolt Tuza
1998 B conf
Rankings of Directed Graphs.
WG
Jan Kratochvíl, Zsolt Tuza
1998 J jnl
Rankings of Graphs.
SIAM J. Discret. Math.
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998 J jnl
Strict colourings for classes of steiner triple systems.
Discret. Math.
Lorenzo Milazzo, Zsolt Tuza
1997 J jnl
Choosability and fractional chromatic numbers.
Discret. Math.
Noga Alon, Zsolt Tuza, Margit Voigt
1997 J jnl
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discret. Appl. Math.
Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
1997 J jnl
Efficiency and effectiveness of normal schedules on three dedicated processors.
Discret. Math.
Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
1997 J jnl
Generalized colorings and avoidable orientations.
Discuss. Math. Graph Theory
Jenö Szigeti, Zsolt Tuza
1997 J jnl
Graph colorings with local constraints - a survey.
Discuss. Math. Graph Theory
Zsolt Tuza
1997 J jnl
List Colorings and Reducibility.
Discret. Appl. Math.
Zsolt Tuza, Margit Voigt
1997 — conf
New trends in the theory of graph colorings: Choosability and list coloring.
Contemporary Trends in Discrete Mathematics
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1997 J jnl
Semi on-line algorithms for the partition problem.
Oper. Res. Lett.
Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
1997 J jnl
Switching Distance Graphs.
Ars Comb.
John G. Gimbel, Michael A. Henning, Zsolt Tuza
1997 J jnl
The color cost of a caterpillar.
Discret. Math.
Mario Gionfriddo, Frank Harary, Zsolt Tuza
1997 J jnl
Upper chromatic number of Steiner triple and quadruple systems.
Discret. Math.
Lorenzo Milazzo, Zsolt Tuza
1996 J jnl
Covering and independence in triangle structures.
Discret. Math.
Paul Erdös, Tibor Gallai, Zsolt Tuza
1996 J jnl
Cycle-saturated graphs of minimum size.
Discret. Math.
Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
1996 J jnl
Cycles of given color patterns.
J. Graph Theory
Yannis Manoussakis, Michael Spyratos, Zsolt Tuza
1996 J jnl
Every 2-choosable graph is (2
J. Graph Theory
Zsolt Tuza, Margit Voigt
1996 J jnl
Hamiltonian properties of Toeplitz graphs.
Discret. Math.
René van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu
1996 J jnl
Minimal colorings for properly colored subgraphs.
Graphs Comb.
Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt
1996 J jnl
Optimal routings in communication networks with linearly bounded forwarding index.
Networks
Yannis Manoussakis, Zsolt Tuza
1996 J jnl
Precoloring Extension 3: Classes of Perfect Graphs.
Comb. Probab. Comput.
Mihály Hujter, Zsolt Tuza
1996 J jnl
Ramsey-remainder.
Eur. J. Comb.
Paul Erdös, Zsolt Tuza, Pavel Valtr
1996 J jnl
The Forwarding Index of Directed Networks.
Discret. Appl. Math.
Yannis Manoussakis, Zsolt Tuza
1996 J jnl
The irregularity strength and cost of the union of cliques.
Discret. Math.
Stanislav Jendrol', Michal Tkác, Zsolt Tuza
1995 J jnl
4-chromatic graphs with large odd girth.
Discret. Math.
Nguyen Van Ngoc, Zsolt Tuza
1995 J jnl
Degree Sums and Covering Cycles.
J. Graph Theory
Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza
1995 J jnl
How to Make A Random Graph Irregular.
Random Struct. Algorithms
Zsolt Tuza
1995 J jnl
Searching for acyclic orientations of graphs.
Discret. Math.
Martin Aigner, Eberhard Triesch, Zsolt Tuza
1995 J jnl
Stronger bounds for generalized degress and Menger path systems.
Discuss. Math. Graph Theory
Ralph J. Faudree, Zsolt Tuza
1995 J jnl
The Acyclic Orientation Game on Random Graphs.
Random Struct. Algorithms
Noga Alon, Zsolt Tuza
1994 J jnl
Algorithmic complexity of list colorings.
Discret. Appl. Math.
Jan Kratochvíl, Zsolt Tuza
1994 J jnl
Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discret. Math.
Svatopluk Poljak, Zsolt Tuza
1994 J jnl
Blocking Sets in SQS(2u).
Comb. Probab. Comput.
Mario Gionfriddo, Salvatore Milici, Zsolt Tuza
1994 J jnl
Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs.
Discret. Math.
Zsolt Tuza
1994 J jnl
Inequalities for Minimal Covering Sets in Set Systems of Given Rank.
Discret. Appl. Math.
Zsolt Tuza
1994 J jnl
Intersection Dimensions of Graph Classes.
Graphs Comb.
Jan Kratochvíl, Zsolt Tuza
1994 J jnl
Largest size and union of Helly families.
Discret. Math.
Zsolt Tuza
1994 J jnl
Local and global average degree in graphs and multigraphs.
J. Graph Theory
Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza
1994 J jnl
Monochromatic coverings and tree Ramsey numbers.
Discret. Math.
Zsolt Tuza
1994 J jnl
On conjectures of Berge and Chvátal.
Discret. Math.
Mario Gionfriddo, Zsolt Tuza
1994 J jnl
Packing Problems in Edge-colored Graphs.
Discret. Appl. Math.
Pavol Hell, Yannis Manoussakis, Zsolt Tuza
1994 B conf
Ranking of Graphs.
WG
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1994 J jnl
The expected relative error of the polyhedral approximation of the max-cut problem.
Oper. Res. Lett.
Svatopluk Poljak, Zsolt Tuza
1994 J jnl
The spectrum of lambda-times repeated blocks for TS(upsilon, lambda).
Discret. Math.
Salvatore Milici, Zsolt Tuza
1993 J jnl
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math.
Gerard J. Chang, Martin Farber, Zsolt Tuza
1993 J jnl
An upper bound on the number of cliques in a graph.
Networks
Martin Farber, Mihály Hujter, Zsolt Tuza
1993 J jnl
Bounded degrees and prescribed distances in graphs.
Discret. Math.
Yair Caro, Zsolt Tuza
1993 J jnl
Domination properties and induced subgraphs.
Discret. Math.
Gábor Bacsó, Zsolt Tuza
1993 J jnl
Graphs with no induced C
Discret. Math.
Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza
1993 J jnl
Helly Property in Finite Set Systems.
J. Comb. Theory A
Zsolt Tuza
1993 J jnl
Large s-representable set systems with low maximum degree.
Discret. Math.
Peter Horák, Zsolt Tuza
1993 J jnl
Linear-Time Algorithms for the Max Cut Problem.
Comb. Probab. Comput.
Nguyen Van Ngoc, Zsolt Tuza
1993 — conf
Maximum cuts and largest bipartite subgraphs.
Combinatorial Optimization
Svatopluk Poljak, Zsolt Tuza
1993 J jnl
Menger-type theorems with restrictions on path lengths.
Discret. Math.
László Pyber, Zsolt Tuza
1993 J jnl
Multipartite Turán problem for connected graphs and hypergraphs.
Discret. Math.
Zsolt Tuza
1993 J jnl
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
SIAM J. Comput.
Jan Kratochvíl, Petr Savický, Zsolt Tuza
1993 J jnl
The Number of Maximal Independent Sets in Triangle-Free Graphs.
SIAM J. Discret. Math.
Mihály Hujter, Zsolt Tuza
1992 J jnl
Asymptotic growth of sparse saturated structures is locally determined.
Discret. Math.
Zsolt Tuza
1992 J jnl
Covering the cliques of a graph with vertices.
Discret. Math.
Paul Erdös, Tibor Gallai, Zsolt Tuza
1992 J jnl
Graph coloring in linear time.
J. Comb. Theory B
Zsolt Tuza
1992 J jnl
Narrowness, pathwidth, and their application in natural language processing.
Discret. Appl. Math.
András Kornai, Zsolt Tuza
1992 J jnl
Nearly uniform distribution of edges among
J. Graph Theory
Jozef Sirán, Zsolt Tuza
1992 J jnl
Perfect couples of graphs.
Comb.
János Körner, Gábor Simonyi, Zsolt Tuza
1992 J jnl
Precoloring extension. I. Interval graphs.
Discret. Math.
Miklós Biró, Mihály Hujter, Zsolt Tuza
1992 J jnl
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discret. Math.
Miroslaw Truszczynski, Zsolt Tuza
1992 J jnl
Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms
Vojtech Rödl, Zsolt Tuza
1991 J jnl
A Periodic Division Pattern that Cannot be Generated by D0L Systems.
Theor. Comput. Sci.
Martin J. M. de Boer, Aristid Lindenmayer, Zsolt Tuza
1991 J jnl
Asymptotic results on saturated graphs.
Discret. Math.
Miroslaw Truszczynski, Zsolt Tuza
1991 J jnl
Clique-transversal sets of line graphs and complements of line graphs.
Discret. Math.
Thomas Andreae, Martin Schughart, Zsolt Tuza
1991 J jnl
Decompositions of regular bipartite graphs.
Discret. Math.
Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza
1991 J jnl
Extensions of Gallai's graph covering theorems for uniform hypergraphs.
J. Comb. Theory B
Zsolt Tuza
1991 J jnl
Hypergraph coverings and local colorings.
J. Comb. Theory B
Yair Caro, Zsolt Tuza
1991 J jnl
Improved lower bounds on
J. Graph Theory
Yair Caro, Zsolt Tuza
1991 J jnl
Local constraints ensuring small representing sets.
J. Comb. Theory A
Paul Erdös, András Hajnal, Zsolt Tuza
1991 J jnl
Perfect graph decompositions.
Graphs Comb.
Zsolt Tuza
1991 J jnl
Saturated r-uniform hypergraphs.
Discret. Math.
Paul Erdös, Zoltán Füredi, Zsolt Tuza
1990 J jnl
A characterization of graphs without long induced paths.
J. Graph Theory
Gábor Bacsó, Zsolt Tuza
1990 J jnl
A conjecture on triangles of graphs.
Graphs Comb.
Zsolt Tuza
1990 J jnl
Contractions and minimal
Graphs Comb.
Zsolt Tuza
1990 J jnl
Covering all cliques of a graph.
Discret. Math.
Zsolt Tuza
1990 J jnl
Periodic String Division Generated by Deterministic L Systems.
Inf. Process. Lett.
Zsolt Tuza
1990 J jnl
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discret. Math.
Yannis Manoussakis, Zsolt Tuza
1990 J jnl
The maximum number of edges in 2K
Discret. Math.
Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter
1989 J jnl
Induced matchings in bipartite graphs.
Discret. Math.
Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
1989 J jnl
Minimum number of elements representing a set system of given rank.
J. Comb. Theory A
Zsolt Tuza
1989 J jnl
On the maximum number of qualitatively independent partitions.
J. Comb. Theory A
Svatopluk Poljak, Zsolt Tuza
1989 J jnl
Radius, diameter, and minimum degree.
J. Comb. Theory B
Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
1989 J jnl
Sub-Ramsey numbers for arithmetic progressions.
Graphs Comb.
Noga Alon, Yair Caro, Zsolt Tuza
1988 J jnl
Clumsy packing of dominoes.
Discret. Math.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1988 J jnl
Isomorphism of two infinite-chromatic triangle-free graphs.
Discret. Math.
Zsolt Tuza
1987 J jnl
An upper bound on the Ramsey number of trees.
Discret. Math.
András Gyárfás, Zsolt Tuza
1987 J jnl
Another Extremal Property of Some Turan Graphs.
Eur. J. Comb.
Christopher S. Edwards, Peter D. Johnson Jr., Zsolt Tuza
1987 J jnl
Inequalities for two set systems with prescribed intersections.
Graphs Comb.
Zsolt Tuza
1987 J jnl
Linear upper bounds for local Ramsey numbers.
Graphs Comb.
Miroslaw Truszczynski, Zsolt Tuza
1987 J jnl
Local
J. Comb. Theory B
András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
1987 J jnl
Maximum bipartite subgraphs of Kneser graphs.
Graphs Comb.
Svatopluk Poljak, Zsolt Tuza
1987 J jnl
On the context-free production complexity of finite languages.
Discret. Appl. Math.
Zsolt Tuza
1987 J jnl
On two intersecting set systems and k-continuous boolean functions.
Discret. Appl. Math.
Zsolt Tuza
1987 J jnl
Ramsey numbers for local colorings.
Graphs Comb.
András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza
1986 J jnl
Neighborhood perfect graphs.
Discret. Math.
Jenö Lehel, Zsolt Tuza
1986 J jnl
Saturated graphs with minimal number of edges.
J. Graph Theory
L. Kászonyi, Zsolt Tuza
1986 — conf
Some combinatorial problems concerning finite languages.
IMYCS
Zsolt Tuza
1985 J jnl
Critical hypergraphs and intersecting set-pair systems.
J. Comb. Theory B
Zsolt Tuza
1985 J jnl
How many atoms can be defined by boxes.
Comb.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1985 J jnl
Hypergraphs without a large star.
Discret. Math.
Zoltán Füredi, Zsolt Tuza
1985 J jnl
On color critical graphs.
J. Comb. Theory B
Vojtech Rödl, Zsolt Tuza
1984 J jnl
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.
Comb.
Zsolt Tuza
1984 J jnl
Helly-type Hypergraphs and Sperner Families.
Eur. J. Comb.
Zsolt Tuza
1984 J jnl
The structure of rectangle families dividing the plane into maximum number of atoms.
Discret. Math.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1982 J jnl
Triangle-free partial graphs and edge covering theorems.
Discret. Math.
Jenö Lehel, Zsolt Tuza
1980 J jnl
Ensembles d'articulation d'un graphe γ-critique.
Discret. Math.
Jenö Lehel, Zsolt Tuza
1980 J jnl
Induced subtrees in graphs of large chromatic number.
Discret. Math.
András Gyárfás, Endre Szemerédi, Zsolt Tuza