The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Zsolt Tuza: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  131. Covering a Graph with a Constrained Forest (Extended Abstract). [Citation Graph (, )][DBLP]


  132. Lower bound on the profile of degree pairs in cross-intersecting set systems. [Citation Graph (, )][DBLP]


  133. Game List Colouring of Graphs. [Citation Graph (, )][DBLP]


  134. Narrowness, pathwidth, and their application in natural language processing. [Citation Graph (, )][DBLP]


  135. Some complexity problems on single input double output controllers. [Citation Graph (, )][DBLP]


  136. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. [Citation Graph (, )][DBLP]


  137. Color-bounded hypergraphs, I: General results. [Citation Graph (, )][DBLP]


  138. On list critical graphs. [Citation Graph (, )][DBLP]


  139. Hall number for list colorings of graphs: Extremal results. [Citation Graph (, )][DBLP]


  140. Color-bounded hypergraphs, IV: Stable colorings of hypertrees. [Citation Graph (, )][DBLP]


  141. Infinite versus finite graph domination. [Citation Graph (, )][DBLP]


  142. Approximation algorithms for the minimum rainbow subgraph problem. [Citation Graph (, )][DBLP]


Search in 0.071secs, Finished in 0.078secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002