Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Zsolt Tuza
@article{DBLP:journals/dm/KeszlerT24,
author = {Anita Keszler and
Zsolt Tuza},
title = {Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I},
journal = {Discret. Math.},
volume = {347},
number = {3},
pages = {113782},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113782},
doi = {10.1016/J.DISC.2023.113782},
timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KeszlerT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GerbnerPTV24,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Some exact results for regular Tur{\'{a}}n problems for all large
orders},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103828},
year = {2024},
url = {https://doi.org/10.1016/j.ejc.2023.103828},
doi = {10.1016/J.EJC.2023.103828},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GerbnerPTV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/AbrahamADDTW23,
author = {Gyula Abraham and
Peter Auer and
Gy{\"{o}}rgy D{\'{o}}sa and
Tibor Dulai and
Zsolt Tuza and
Agnes Werner{-}Stark},
title = {The bin covering with delivery problem, extended investigations for
the online case},
journal = {Central Eur. J. Oper. Res.},
volume = {31},
number = {1},
pages = {21--47},
year = {2023},
url = {https://doi.org/10.1007/s10100-022-00798-1},
doi = {10.1007/S10100-022-00798-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/AbrahamADDTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PatkosTV23,
author = {Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Vector sum-intersection theorems},
journal = {Discret. Math.},
volume = {346},
number = {10},
pages = {113506},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113506},
doi = {10.1016/J.DISC.2023.113506},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/PatkosTV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AbrahamDHOT23,
author = {Gyula Abraham and
Gy{\"{o}}rgy D{\'{o}}sa and
Lars Magnus Hvattum and
Tomas Olaj and
Zsolt Tuza},
title = {The board packing problem},
journal = {Eur. J. Oper. Res.},
volume = {308},
number = {3},
pages = {1056--1073},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.01.030},
doi = {10.1016/J.EJOR.2023.01.030},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/AbrahamDHOT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/CzaunPST23,
author = {P{\'{e}}ter Bence Czaun and
P{\'{a}}l Pusztai and
Levente Sebok and
Zsolt Tuza},
title = {Minimal Non-C-Perfect Hypergraphs with Circular Symmetry},
journal = {Symmetry},
volume = {15},
number = {5},
pages = {1114},
year = {2023},
url = {https://doi.org/10.3390/sym15051114},
doi = {10.3390/SYM15051114},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/symmetry/CzaunPST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/Tuza23,
author = {Zsolt Tuza},
title = {Gregarious Decompositions of Complete Equipartite Graphs and Related
Structures},
journal = {Symmetry},
volume = {15},
number = {12},
pages = {2097},
year = {2023},
url = {https://doi.org/10.3390/sym15122097},
doi = {10.3390/SYM15122097},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/symmetry/Tuza23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GerbnerPTV22,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Saturation problems with regularity constraints},
journal = {Discret. Math.},
volume = {345},
number = {8},
pages = {112921},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112921},
doi = {10.1016/J.DISC.2022.112921},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GerbnerPTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/GerbnerPTV22,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Singular Tur{\'{a}}n numbers and WORM-colorings},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {4},
pages = {1061--1074},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2335},
doi = {10.7151/DMGT.2335},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/GerbnerPTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GerbnerPTV22,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {On saturation of Berge hypergraphs},
journal = {Eur. J. Comb.},
volume = {102},
pages = {103477},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2021.103477},
doi = {10.1016/J.EJC.2021.103477},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/GerbnerPTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DaraMNT22,
author = {Suresh Dara and
Suchismita Mishra and
Narayanan Narayanan and
Zsolt Tuza},
title = {Strong Edge Coloring of Cayley Graphs and Some Product Graphs},
journal = {Graphs Comb.},
volume = {38},
number = {2},
pages = {51},
year = {2022},
url = {https://doi.org/10.1007/s00373-021-02408-4},
doi = {10.1007/S00373-021-02408-4},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/DaraMNT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CichaczT22,
author = {Sylwia Cichacz and
Zsolt Tuza},
title = {Realization of digraphs in Abelian groups and its consequences},
journal = {J. Graph Theory},
volume = {100},
number = {2},
pages = {331--345},
year = {2022},
url = {https://doi.org/10.1002/jgt.22782},
doi = {10.1002/JGT.22782},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CichaczT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BujtasJT22,
author = {Csilla Bujt{\'{a}}s and
Marko Jakovac and
Zsolt Tuza},
title = {The k-path vertex cover: General bounds and chordal graphs},
journal = {Networks},
volume = {80},
number = {1},
pages = {63--76},
year = {2022},
url = {https://doi.org/10.1002/net.22079},
doi = {10.1002/NET.22079},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BujtasJT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/BaloghDHOT22,
author = {J{\'{a}}nos Balogh and
Gy{\"{o}}rgy D{\'{o}}sa and
Lars Magnus Hvattum and
Tomas Olaj and
Zsolt Tuza},
title = {Guillotine cutting is asymptotically optimal for packing consecutive
squares},
journal = {Optim. Lett.},
volume = {16},
number = {9},
pages = {2775--2785},
year = {2022},
url = {https://doi.org/10.1007/s11590-022-01858-w},
doi = {10.1007/S11590-022-01858-W},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/BaloghDHOT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/BujtasGGMMT21,
author = {Csilla Bujt{\'{a}}s and
Mario Gionfriddo and
Elena Guardo and
Lorenzo Milazzo and
Salvatore Milici and
Zsolt Tuza},
title = {Complex uniformly resolvable decompositions of K{\_}v},
journal = {Ars Math. Contemp.},
volume = {21},
number = {1},
year = {2021},
url = {https://doi.org/10.26493/1855-3974.2288.a20},
doi = {10.26493/1855-3974.2288.A20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arsmc/BujtasGGMMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KemnitzMTV21,
author = {Arnfried Kemnitz and
Massimiliano Marangio and
Zsolt Tuza and
Margit Voigt},
title = {Comparison of sum choice number with chromatic sum},
journal = {Discret. Math.},
volume = {344},
number = {7},
pages = {112391},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112391},
doi = {10.1016/J.DISC.2021.112391},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KemnitzMTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BresarBGKKMPTV21,
author = {Bostjan Bresar and
Csilla Bujt{\'{a}}s and
Tanja Gologranc and
Sandi Klavzar and
Gasper Kosmrlj and
Tilen Marc and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {On Grundy total domination number in product graphs},
journal = {Discuss. Math. Graph Theory},
volume = {41},
number = {1},
pages = {225--247},
year = {2021},
url = {https://doi.org/10.7151/dmgt.2184},
doi = {10.7151/DMGT.2184},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/BresarBGKKMPTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/CichaczGT21,
author = {Sylwia Cichacz and
Agnieszka G{\"{o}}rlich and
Zsolt Tuza},
title = {\emph{Z\({}_{\mbox{2}}\){\texttimes} Z\({}_{\mbox{2}}\)}-cordial cycle-free
hypergraphs},
journal = {Discuss. Math. Graph Theory},
volume = {41},
number = {4},
pages = {1021--1040},
year = {2021},
url = {https://doi.org/10.7151/dmgt.2226},
doi = {10.7151/DMGT.2226},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/CichaczGT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BaloghKLT21,
author = {J{\'{o}}zsef Balogh and
Gyula O. H. Katona and
William Linz and
Zsolt Tuza},
title = {The domination number of the graph defined by two levels of the n-cube,
{II}},
journal = {Eur. J. Comb.},
volume = {91},
pages = {103201},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2020.103201},
doi = {10.1016/J.EJC.2020.103201},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BaloghKLT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/DosaNTV21,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Nicholas Newman and
Zsolt Tuza and
Vitaly I. Voloshin},
title = {Coloring Properties of Mixed Cycloids},
journal = {Symmetry},
volume = {13},
number = {8},
pages = {1539},
year = {2021},
url = {https://doi.org/10.3390/sym13081539},
doi = {10.3390/SYM13081539},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/DosaNTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DosaKOT21,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Tomas Olaj and
Zsolt Tuza},
title = {An improved parametric algorithm on two-machine scheduling with given
lower and upper bounds for the total processing time},
journal = {Theor. Comput. Sci.},
volume = {880},
pages = {69--81},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.06.002},
doi = {10.1016/J.TCS.2021.06.002},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DosaKOT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Gionfriddo0T20,
author = {Mario Gionfriddo and
Lorenzo Milazzo and
Zsolt Tuza},
title = {Hypercycle systems},
journal = {Australas. {J} Comb.},
volume = {77},
pages = {336--354},
year = {2020},
url = {http://ajc.maths.uq.edu.au/pdf/77/ajc\_v77\_p336.pdf},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Gionfriddo0T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/CaroT20,
author = {Yair Caro and
Zsolt Tuza},
title = {Regular Tur{\'{a}}n numbers},
journal = {Australas. {J} Comb.},
volume = {78},
pages = {133--144},
year = {2020},
url = {http://ajc.maths.uq.edu.au/pdf/78/ajc\_v78\_p133.pdf},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/CaroT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BorowieckiFST20,
author = {Mieczyslaw Borowiecki and
Anna Fiedorowicz and
Elzbieta Sidorowicz and
Zsolt Tuza},
title = {Independent (k+1)-domination in k-trees},
journal = {Discret. Appl. Math.},
volume = {284},
pages = {99--110},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.03.019},
doi = {10.1016/J.DAM.2020.03.019},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BorowieckiFST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BujtasDGT20,
author = {Csilla Bujt{\'{a}}s and
Akbar Davoodi and
Ervin Gy{\"{o}}ri and
Zsolt Tuza},
title = {Clique coverings and claw-free graphs},
journal = {Eur. J. Comb.},
volume = {88},
pages = {103114},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103114},
doi = {10.1016/J.EJC.2020.103114},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BujtasDGT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BujtasJT20,
author = {Csilla Bujt{\'{a}}s and
Stanislav Jendrol' and
Zsolt Tuza},
title = {On Specific Factors in Graphs},
journal = {Graphs Comb.},
volume = {36},
number = {5},
pages = {1391--1399},
year = {2020},
url = {https://doi.org/10.1007/s00373-020-02225-1},
doi = {10.1007/S00373-020-02225-1},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BujtasJT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BujtasJT20,
author = {Csilla Bujt{\'{a}}s and
Stanislav Jendrol' and
Zsolt Tuza},
title = {On caterpillar factors in graphs},
journal = {Theor. Comput. Sci.},
volume = {846},
pages = {82--90},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.022},
doi = {10.1016/J.TCS.2020.09.022},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BujtasJT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BacsoLMPTL19,
author = {G{\'{a}}bor Bacs{\'{o}} and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen},
title = {Subexponential-Time Algorithms for Maximum Independent Set in {\textdollar}{\textdollar}P{\_}t{\textdollar}{\textdollar}
{P} t -Free and Broom-Free Graphs},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {421--438},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0479-5},
doi = {10.1007/S00453-018-0479-5},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BacsoLMPTL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/DosaFTTW19,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Armin F{\"{u}}genschuh and
Zhiyi Tan and
Zsolt Tuza and
Krzysztof Wesek},
title = {Tight lower bounds for semi-online scheduling on two uniform machines
with known optimum},
journal = {Central Eur. J. Oper. Res.},
volume = {27},
number = {4},
pages = {1107--1130},
year = {2019},
url = {https://doi.org/10.1007/s10100-018-0536-9},
doi = {10.1007/S10100-018-0536-9},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cejor/DosaFTTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BujtasT19,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Fractional Domination Game},
journal = {Electron. J. Comb.},
volume = {26},
number = {4},
pages = {4},
year = {2019},
url = {https://doi.org/10.37236/8730},
doi = {10.37236/8730},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BujtasT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BujtasPTV19,
author = {Csilla Bujt{\'{a}}s and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Domination game on uniform hypergraphs},
journal = {Discret. Appl. Math.},
volume = {258},
pages = {65--75},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.11.013},
doi = {10.1016/J.DAM.2018.11.013},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BujtasPTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BadakhshianKT19,
author = {Leila Badakhshian and
Gyula O. H. Katona and
Zsolt Tuza},
title = {The domination number of the graph defined by two levels of the n-cube},
journal = {Discret. Appl. Math.},
volume = {266},
pages = {30--37},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.02.006},
doi = {10.1016/J.DAM.2019.02.006},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BadakhshianKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganFT19,
author = {Cristina Bazgan and
Henning Fernau and
Zsolt Tuza},
title = {Aspects of upper defensive alliances},
journal = {Discret. Appl. Math.},
volume = {266},
pages = {111--120},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.05.061},
doi = {10.1016/J.DAM.2018.05.061},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganFT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DosaKT19,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Zsolt Tuza},
title = {Using weight decision for decreasing the price of anarchy in selfish
bin packing games},
journal = {Eur. J. Oper. Res.},
volume = {278},
number = {1},
pages = {160--169},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.04.026},
doi = {10.1016/J.EJOR.2019.04.026},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DosaKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BacsoBTT19,
author = {G{\'{a}}bor Bacs{\'{o}} and
Csilla Bujt{\'{a}}s and
Casey Tompkins and
Zsolt Tuza},
title = {Disjoint Paired-Dominating sets in Cubic Graphs},
journal = {Graphs Comb.},
volume = {35},
number = {5},
pages = {1129--1138},
year = {2019},
url = {https://doi.org/10.1007/s00373-019-02063-w},
doi = {10.1007/S00373-019-02063-W},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BacsoBTT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DosaKT19,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Zsolt Tuza},
title = {Restricted assignment scheduling with resource constraints},
journal = {Theor. Comput. Sci.},
volume = {760},
pages = {72--87},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.08.016},
doi = {10.1016/J.TCS.2018.08.016},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DosaKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganPT19,
author = {Cristina Bazgan and
Thomas Pontoizeau and
Zsolt Tuza},
title = {Finding a potential community in networks},
journal = {Theor. Comput. Sci.},
volume = {769},
pages = {32--42},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.011},
doi = {10.1016/J.TCS.2018.10.011},
timestamp = {Wed, 08 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BazganPT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/BujtasT18,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Partition-Crossing Hypergraphs},
journal = {Acta Cybern.},
volume = {23},
number = {3},
pages = {815--828},
year = {2018},
url = {https://doi.org/10.14232/actacyb.23.3.2018.6},
doi = {10.14232/ACTACYB.23.3.2018.6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/BujtasT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adam/Tuza18,
author = {Zsolt Tuza},
title = {Mixed hypergraphs and beyond},
journal = {Art Discret. Appl. Math.},
volume = {1},
number = {2},
pages = {{\#}P2.05},
year = {2018},
url = {https://doi.org/10.26493/2590-9770.1234.37b},
doi = {10.26493/2590-9770.1234.37B},
timestamp = {Fri, 16 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adam/Tuza18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangHDT18,
author = {Zhenbo Wang and
Xin Han and
Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {A General Bin Packing Game: Interest Taken into Account},
journal = {Algorithmica},
volume = {80},
number = {5},
pages = {1534--1555},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0361-x},
doi = {10.1007/S00453-017-0361-X},
timestamp = {Thu, 29 Mar 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangHDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/DosaFTTW18,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Armin F{\"{u}}genschuh and
Zhiyi Tan and
Zsolt Tuza and
Krzysztof Wesek},
title = {Tight upper bounds for semi-online scheduling on two uniform machines
with known optimum},
journal = {Central Eur. J. Oper. Res.},
volume = {26},
number = {1},
pages = {161--180},
year = {2018},
url = {https://doi.org/10.1007/s10100-017-0481-z},
doi = {10.1007/S10100-017-0481-Z},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cejor/DosaFTTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DosaT18,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {Multiprofessor scheduling},
journal = {Discret. Appl. Math.},
volume = {234},
pages = {195--209},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2016.01.035},
doi = {10.1016/J.DAM.2016.01.035},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DosaT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KovacsTVJ18,
author = {Gergely Kov{\'{a}}cs and
Zsolt Tuza and
B{\'{e}}la Vizv{\'{a}}ri and
Hajieh K. Jabbari},
title = {A note on the polytope of bipartite {TSP}},
journal = {Discret. Appl. Math.},
volume = {235},
pages = {92--100},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.09.009},
doi = {10.1016/J.DAM.2017.09.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KovacsTVJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AguedaCFLMMMNOO18,
author = {Raquel {\'{A}}gueda and
Nathann Cohen and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Leandro Montero and
Reza Naserasr and
Hirotaka Ono and
Yota Otachi and
Tadashi Sakuma and
Zsolt Tuza and
Renyu Xu},
title = {Safe sets in graphs: Graph classes and structural parameters},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1221--1242},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0205-2},
doi = {10.1007/S10878-017-0205-2},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AguedaCFLMMMNOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/dAuriacBMKMMNRT18,
author = {Jean{-}Alexandre Angl{\`{e}}s d'Auriac and
Csilla Bujt{\'{a}}s and
Abdelhakim El Maftouhi and
Marek Karpinski and
Yannis Manoussakis and
Leandro Montero and
N. Narayanan and
Laurent Rosaz and
Johan Thapper and
Zsolt Tuza},
title = {Tropical dominating sets in vertex-coloured graphs},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {27--41},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.03.001},
doi = {10.1016/J.JDA.2018.03.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/dAuriacBMKMMNRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BapatFLMMST18,
author = {Ravindra B. Bapat and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Tadashi Sakuma and
Zsolt Tuza},
title = {Safe sets, network majority on weighted trees},
journal = {Networks},
volume = {71},
number = {1},
pages = {81--92},
year = {2018},
url = {https://doi.org/10.1002/net.21794},
doi = {10.1002/NET.21794},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BapatFLMMST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DosaKT18,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Zsolt Tuza},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Bin Packing Games with Weight Decision: How to Get a Small Value for
the Price of Anarchy},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {204--217},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_13},
doi = {10.1007/978-3-030-04693-4\_13},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DosaKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-04077,
author = {G{\'{a}}bor Bacs{\'{o}} and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen},
title = {Subexponential-time Algorithms for Maximum Independent Set in P\({}_{\mbox{t}}\)-free
and Broom-free Graphs},
journal = {CoRR},
volume = {abs/1804.04077},
year = {2018},
url = {http://arxiv.org/abs/1804.04077},
eprinttype = {arXiv},
eprint = {1804.04077},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-04077.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BujtasT17,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {{F-WORM} colorings: Results for 2-connected graphs},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {131--138},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.05.008},
doi = {10.1016/J.DAM.2017.05.008},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BujtasT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/HorakST17,
author = {Peter Hor{\'{a}}k and
Igor A. Semaev and
Zsolt Tuza},
title = {A combinatorial problem related to sparse systems of equations},
journal = {Des. Codes Cryptogr.},
volume = {85},
number = {1},
pages = {129--144},
year = {2017},
url = {https://doi.org/10.1007/s10623-016-0294-4},
doi = {10.1007/S10623-016-0294-4},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/HorakST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BresarBGKKPTV17,
author = {Bostjan Bresar and
Csilla Bujt{\'{a}}s and
Tanja Gologranc and
Sandi Klavzar and
Gasper Kosmrlj and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Grundy dominating sequences and zero forcing sets},
journal = {Discret. Optim.},
volume = {26},
pages = {66--77},
year = {2017},
url = {https://doi.org/10.1016/j.disopt.2017.07.001},
doi = {10.1016/J.DISOPT.2017.07.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BresarBGKKPTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BacsoRT17,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zdenek Ryj{\'{a}}cek and
Zsolt Tuza},
title = {Coloring the cliques of line graphs},
journal = {Discret. Math.},
volume = {340},
number = {11},
pages = {2641--2649},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.11.011},
doi = {10.1016/J.DISC.2016.11.011},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BacsoRT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasPTV17,
author = {Csilla Bujt{\'{a}}s and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {The minimum number of vertices in uniform hypergraphs with given domination
number},
journal = {Discret. Math.},
volume = {340},
number = {11},
pages = {2704--2713},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.07.007},
doi = {10.1016/J.DISC.2016.07.007},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasPTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BujtasHT17,
author = {Csilla Bujt{\'{a}}s and
Michael A. Henning and
Zsolt Tuza},
title = {Bounds on the game transversal number in hypergraphs},
journal = {Eur. J. Comb.},
volume = {59},
pages = {34--50},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2016.07.003},
doi = {10.1016/J.EJC.2016.07.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BujtasHT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Tuza17,
author = {Zsolt Tuza},
title = {Graph labeling games},
journal = {Electron. Notes Discret. Math.},
volume = {60},
pages = {61--68},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.009},
doi = {10.1016/J.ENDM.2017.06.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Tuza17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CohenMPT17,
author = {Johanne Cohen and
Yannis Manoussakis and
Hong Phong Pham and
Zsolt Tuza},
title = {Tropical matchings in vertex-colored graphs},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {219--224},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.038},
doi = {10.1016/J.ENDM.2017.10.038},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CohenMPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganPT17,
author = {Cristina Bazgan and
Thomas Pontoizeau and
Zsolt Tuza},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {On the Complexity of Finding a Potential Community},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {80--91},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_8},
doi = {10.1007/978-3-319-57586-5\_8},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BazganPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BujtasSTDP16,
author = {Csilla Bujt{\'{a}}s and
E. Sampathkumar and
Zsolt Tuza and
Charles Dominic and
L. Pushpalatha},
title = {When the vertex coloring of a graph is an edge coloring of its line
graph - a rare coincidence},
journal = {Ars Comb.},
volume = {128},
pages = {165--173},
year = {2016},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/BujtasSTDP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BresarBGKKPTV16,
author = {Bostjan Bresar and
Csilla Bujt{\'{a}}s and
Tanja Gologranc and
Sandi Klavzar and
Gasper Kosmrlj and
Bal{\'{a}}zs Patk{\'{o}}s and
Zsolt Tuza and
M{\'{a}}t{\'{e}} Vizer},
title = {Dominating Sequences in Grid-Like and Toroidal Graphs},
journal = {Electron. J. Comb.},
volume = {23},
number = {4},
pages = {4},
year = {2016},
url = {https://doi.org/10.37236/6269},
doi = {10.37236/6269},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BresarBGKKPTV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cphysics/AcsSTT16,
author = {Bernadett {\'{A}}cs and
G{\'{a}}bor Szederk{\'{e}}nyi and
Zsolt Tuza and
Zolt{\'{a}}n A. Tuza},
title = {Computing all possible graph structures describing linearly conjugate
realizations of kinetic systems},
journal = {Comput. Phys. Commun.},
volume = {204},
pages = {11--20},
year = {2016},
url = {https://doi.org/10.1016/j.cpc.2016.02.020},
doi = {10.1016/J.CPC.2016.02.020},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cphysics/AcsSTT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LakshmananBT16,
author = {S. Aparna Lakshmanan and
Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Induced cycles in triangle graphs},
journal = {Discret. Appl. Math.},
volume = {209},
pages = {264--275},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.12.012},
doi = {10.1016/J.DAM.2015.12.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LakshmananBT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Drgas-Burchardt16,
author = {Ewa Drgas{-}Burchardt and
Kamila Kowalska and
Jerzy Michael and
Zsolt Tuza},
title = {Some properties of vertex-oblique graphs},
journal = {Discret. Math.},
volume = {339},
number = {1},
pages = {95--102},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.07.012},
doi = {10.1016/J.DISC.2015.07.012},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Drgas-Burchardt16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT16,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {The Disjoint Domination Game},
journal = {Discret. Math.},
volume = {339},
number = {7},
pages = {1985--1992},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.04.028},
doi = {10.1016/J.DISC.2015.04.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BujtasT16,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {\emph{K\({}_{\mbox{3}}\)}-WORM colorings of graphs: Lower chromatic
number and gaps in the chromatic spectrum},
journal = {Discuss. Math. Graph Theory},
volume = {36},
number = {3},
pages = {759--772},
year = {2016},
url = {https://doi.org/10.7151/dmgt.1891},
doi = {10.7151/DMGT.1891},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BujtasT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BapatFLMMST16,
author = {Ravindra B. Bapat and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Tadashi Sakuma and
Zsolt Tuza},
title = {Network Majority on Tree Topological Network},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {79--84},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.015},
doi = {10.1016/J.ENDM.2016.09.015},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BapatFLMMST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BujtasHT16,
author = {Csilla Bujt{\'{a}}s and
Michael A. Henning and
Zsolt Tuza},
title = {Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total
Domination Game},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {3},
pages = {1830--1847},
year = {2016},
url = {https://doi.org/10.1137/15M1049361},
doi = {10.1137/15M1049361},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BujtasHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BujtasDINT16,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {New models of graph-bin packing},
journal = {Theor. Comput. Sci.},
volume = {640},
pages = {94--103},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.06.008},
doi = {10.1016/J.TCS.2016.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BujtasDINT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AguedaCFLMMMNOS16,
author = {Raquel {\'{A}}gueda and
Nathann Cohen and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Leandro Montero and
Reza Naserasr and
Yota Otachi and
Tadashi Sakuma and
Zsolt Tuza and
Renyu Xu},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {Safe Sets in Graphs: Graph Classes and Structural Parameters},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {241--253},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_18},
doi = {10.1007/978-3-319-48749-6\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/AguedaCFLMMMNOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BacsoMT16,
author = {G{\'{a}}bor Bacs{\'{o}} and
D{\'{a}}niel Marx and
Zsolt Tuza},
editor = {Jiong Guo and
Danny Hermelin},
title = {H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.3},
doi = {10.4230/LIPICS.IPEC.2016.3},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BacsoMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/dAuriacBMKMMNRT16,
author = {Jean{-}Alexandre Angl{\`{e}}s d'Auriac and
Csilla Bujt{\'{a}}s and
Hakim El Maftouhi and
Marek Karpinski and
Yannis Manoussakis and
Leandro Montero and
Narayanan Narayanan and
Laurent Rosaz and
Johan Thapper and
Zsolt Tuza},
editor = {Mohammad Kaykobad and
Rossella Petreschi},
title = {Tropical Dominating Sets in Vertex-Coloured Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
{WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9627},
pages = {17--27},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30139-6\_2},
doi = {10.1007/978-3-319-30139-6\_2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/dAuriacBMKMMNRT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BaranyT15,
author = {Mate Barany and
Zsolt Tuza},
title = {Circular coloring of graphs via linear programming and tabu search},
journal = {Central Eur. J. Oper. Res.},
volume = {23},
number = {4},
pages = {833--848},
year = {2015},
url = {https://doi.org/10.1007/s10100-014-0345-8},
doi = {10.1007/S10100-014-0345-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/BaranyT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BujtasT15,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Maximum number of colors in hypertrees of bounded degree},
journal = {Central Eur. J. Oper. Res.},
volume = {23},
number = {4},
pages = {867--876},
year = {2015},
url = {https://doi.org/10.1007/s10100-014-0357-4},
doi = {10.1007/S10100-014-0357-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/BujtasT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LakshmananBT15,
author = {S. Aparna Lakshmanan and
Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Generalized Line Graphs: Cartesian Products and Complexity of Recognition},
journal = {Electron. J. Comb.},
volume = {22},
number = {3},
pages = {3},
year = {2015},
url = {https://doi.org/10.37236/3983},
doi = {10.37236/3983},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LakshmananBT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SzalkaiT15,
author = {Istv{\'{a}}n Szalkai and
Zsolt Tuza},
title = {Minimum number of affine simplices of given dimension},
journal = {Discret. Appl. Math.},
volume = {180},
pages = {141--149},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.07.025},
doi = {10.1016/J.DAM.2014.07.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SzalkaiT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BujtasT15,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Tur{\'{a}}n numbers and batch codes},
journal = {Discret. Appl. Math.},
volume = {186},
pages = {45--55},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.01.006},
doi = {10.1016/J.DAM.2015.01.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BujtasT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/HorakT15,
author = {Peter Hor{\'{a}}k and
Zsolt Tuza},
title = {Speeding up deciphering by hypergraph ordering},
journal = {Des. Codes Cryptogr.},
volume = {75},
number = {1},
pages = {175--185},
year = {2015},
url = {https://doi.org/10.1007/s10623-013-9899-z},
doi = {10.1007/S10623-013-9899-Z},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/HorakT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BacsoBHT15,
author = {G{\'{a}}bor Bacs{\'{o}} and
Piotr Borowiecki and
Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {Minimum order of graphs with given coloring parameters},
journal = {Discret. Math.},
volume = {338},
number = {4},
pages = {621--632},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.12.002},
doi = {10.1016/J.DISC.2014.12.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BacsoBHT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HalaszT15,
author = {Veronika Hal{\'{a}}sz and
Zsolt Tuza},
title = {Distance-constrained labeling of complete trees},
journal = {Discret. Math.},
volume = {338},
number = {8},
pages = {1398--1406},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.02.016},
doi = {10.1016/J.DISC.2015.02.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HalaszT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KucukcifciMT15,
author = {Selda K{\"{u}}{\c{c}}{\"{u}}k{\c{c}}if{\c{c}}i and
Salvatore Milici and
Zsolt Tuza},
title = {Maximum uniformly resolvable decompositions of \({}_{\mbox{K}}\)\({}_{\mbox{v}}\)
and \({}_{\mbox{K}}\)\({}_{\mbox{v}}\)-I into 3-stars and 3-cycles},
journal = {Discret. Math.},
volume = {338},
number = {10},
pages = {1667--1673},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.05.016},
doi = {10.1016/J.DISC.2014.05.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KucukcifciMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT15,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Approximability of the upper chromatic number of hypergraphs},
journal = {Discret. Math.},
volume = {338},
number = {10},
pages = {1714--1721},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.08.007},
doi = {10.1016/J.DISC.2014.08.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HorakST15,
author = {Peter Hor{\'{a}}k and
Igor A. Semaev and
Zsolt Tuza},
title = {An application of Combinatorics in Cryptography},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {31--35},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.006},
doi = {10.1016/J.ENDM.2015.06.006},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HorakST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/StiebitzTV15,
author = {Michael Stiebitz and
Zsolt Tuza and
Margit Voigt},
title = {Orientations of Graphs with Prescribed Weighted Out-Degrees},
journal = {Graphs Comb.},
volume = {31},
number = {1},
pages = {265--280},
year = {2015},
url = {https://doi.org/10.1007/s00373-013-1382-0},
doi = {10.1007/S00373-013-1382-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/StiebitzTV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CohenT15,
author = {Nathann Cohen and
Zsolt Tuza},
title = {Induced Decompositions of Highly Dense Graphs},
journal = {J. Graph Theory},
volume = {78},
number = {2},
pages = {97--107},
year = {2015},
url = {https://doi.org/10.1002/jgt.21792},
doi = {10.1002/JGT.21792},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CohenT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BaloghBDEKT15,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Hans Kellerer and
Zsolt Tuza},
title = {Online Results for Black and White Bin Packing},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {137--155},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9538-8},
doi = {10.1007/S00224-014-9538-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BaloghBDEKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaloghBDEKLT15,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Hans Kellerer and
Asaf Levin and
Zsolt Tuza},
title = {Offline black and white bin packing},
journal = {Theor. Comput. Sci.},
volume = {596},
pages = {92--101},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.045},
doi = {10.1016/J.TCS.2015.06.045},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BaloghBDEKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/WangHDT15,
author = {Zhenbo Wang and
Xin Han and
Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {Bin Packing Game with an Interest Matrix},
booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON}
2015, Beijing, China, August 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9198},
pages = {57--69},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_5},
doi = {10.1007/978-3-319-21398-9\_5},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/WangHDT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/dAuriacBMKMMNRT15,
author = {Jean{-}Alexandre Angl{\`{e}}s d'Auriac and
Csilla Bujt{\'{a}}s and
Hakim El Maftouhi and
Marek Karpinski and
Yannis Manoussakis and
Leandro Montero and
N. Narayanan and
Laurent Rosaz and
Johan Thapper and
Zsolt Tuza},
title = {Tropical Dominating Sets in Vertex-Coloured Graphs},
journal = {CoRR},
volume = {abs/1503.01008},
year = {2015},
url = {http://arxiv.org/abs/1503.01008},
eprinttype = {arXiv},
eprint = {1503.01008},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/dAuriacBMKMMNRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/MiliciQT14,
author = {Salvatore Milici and
Gaetano Quattrocchi and
Zsolt Tuza},
title = {G-designs without blocking sets, Note},
journal = {Ars Comb.},
volume = {114},
pages = {229--233},
year = {2014},
timestamp = {Fri, 05 Sep 2014 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/MiliciQT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BujtasHTY14,
author = {Csilla Bujt{\'{a}}s and
Michael A. Henning and
Zsolt Tuza and
Anders Yeo},
title = {Total Transversals and Total Domination in Uniform Hypergraphs},
journal = {Electron. J. Comb.},
volume = {21},
number = {2},
pages = {2},
year = {2014},
url = {https://doi.org/10.37236/3866},
doi = {10.37236/3866},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BujtasHTY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MiliciT14,
author = {Salvatore Milici and
Zsolt Tuza},
title = {Uniformly resolvable decompositions of K\({}_{\mbox{v}}\) into P\({}_{\mbox{3}}\)
and K\({}_{\mbox{3}}\) graphs},
journal = {Discret. Math.},
volume = {331},
pages = {137--141},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2014.05.010},
doi = {10.1016/J.DISC.2014.05.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MiliciT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngelelliBST14,
author = {Enrico Angelelli and
Cristina Bazgan and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Complexity and approximation for Traveling Salesman Problems with
profits},
journal = {Theor. Comput. Sci.},
volume = {531},
pages = {54--65},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.02.046},
doi = {10.1016/J.TCS.2014.02.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngelelliBST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BenkoDT13,
author = {Attila Benko and
Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {Bin covering with a general profit function: approximability results},
journal = {Central Eur. J. Oper. Res.},
volume = {21},
number = {4},
pages = {805--816},
year = {2013},
url = {https://doi.org/10.1007/s10100-012-0269-0},
doi = {10.1007/S10100-012-0269-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/BenkoDT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArumugamJBT13,
author = {S. Arumugam and
Bibin K. Jose and
Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Equality of domination and transversal numbers in hypergraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1859--1867},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.009},
doi = {10.1016/J.DAM.2013.02.009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ArumugamJBT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT13,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Color-bounded hypergraphs, {VI:} Structural and functional jumps in
complexity},
journal = {Discret. Math.},
volume = {313},
number = {19},
pages = {1965--1977},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.09.020},
doi = {10.1016/J.DISC.2012.09.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza13,
author = {Zsolt Tuza},
title = {Problems on cycles and colorings},
journal = {Discret. Math.},
volume = {313},
number = {19},
pages = {2007--2013},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.04.016},
doi = {10.1016/J.DISC.2013.04.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KatonaT13,
author = {Gyula O. H. Katona and
Zsolt Tuza},
title = {Color the cycles},
journal = {Discret. Math.},
volume = {313},
number = {19},
pages = {2026--2033},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.04.034},
doi = {10.1016/J.DISC.2013.04.034},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KatonaT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CichaczGT13,
author = {Sylwia Cichacz and
Agnieszka G{\"{o}}rlich and
Zsolt Tuza},
title = {Cordial labeling of hypertrees},
journal = {Discret. Math.},
volume = {313},
number = {22},
pages = {2518--2524},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.07.025},
doi = {10.1016/J.DISC.2013.07.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CichaczGT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Tuza13,
author = {Zsolt Tuza},
title = {Choice-perfect graphs},
journal = {Discuss. Math. Graph Theory},
volume = {33},
number = {1},
pages = {231--242},
year = {2013},
url = {https://doi.org/10.7151/dmgt.1660},
doi = {10.7151/DMGT.1660},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Tuza13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/CzapT13,
author = {J{\'{u}}lius Czap and
Zsolt Tuza},
title = {Decompositions of plane graphs under parity constrains given by faces},
journal = {Discuss. Math. Graph Theory},
volume = {33},
number = {3},
pages = {521--530},
year = {2013},
url = {https://doi.org/10.7151/dmgt.1690},
doi = {10.7151/DMGT.1690},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/CzapT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KemnitzMT13,
author = {Arnfried Kemnitz and
Massimiliano Marangio and
Zsolt Tuza},
title = {{\textdollar}{\textdollar}[1, 1, t]{\textdollar}{\textdollar} -Colorings
of Complete Graphs},
journal = {Graphs Comb.},
volume = {29},
number = {4},
pages = {1041--1050},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1153-3},
doi = {10.1007/S00373-012-1153-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KemnitzMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HegyhatiT13,
author = {M{\'{a}}t{\'{e}} Hegyh{\'{a}}ti and
Zsolt Tuza},
title = {Colorability of mixed hypergraphs and their chromatic inversions},
journal = {J. Comb. Optim.},
volume = {25},
number = {4},
pages = {737--751},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9559-7},
doi = {10.1007/S10878-012-9559-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HegyhatiT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DosaTY13,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza and
Deshi Ye},
title = {Bin packing with "Largest In Bottom" constraint: tighter
bounds and generalizations},
journal = {J. Comb. Optim.},
volume = {26},
number = {3},
pages = {416--436},
year = {2013},
url = {https://doi.org/10.1007/s10878-011-9408-0},
doi = {10.1007/S10878-011-9408-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DosaTY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/KeszlerST13,
author = {Anita Keszler and
Tam{\'{a}}s Szir{\'{a}}nyi and
Zsolt Tuza},
title = {Dense subgraph mining with a mixed graph model},
journal = {Pattern Recognit. Lett.},
volume = {34},
number = {11},
pages = {1252--1262},
year = {2013},
url = {https://doi.org/10.1016/j.patrec.2013.03.035},
doi = {10.1016/J.PATREC.2013.03.035},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/prl/KeszlerST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DosaLHT13,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Rongheng Li and
Xin Han and
Zsolt Tuza},
title = {Tight absolute bound for First Fit Decreasing bin-packing: FFD(l)
{\(\leq\)} 11/9 {OPT(L)} + 6/9},
journal = {Theor. Comput. Sci.},
volume = {510},
pages = {13--61},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.09.007},
doi = {10.1016/J.TCS.2013.09.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DosaLHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecbs/BacsoKT13,
author = {G{\'{a}}bor Bacs{\'{o}} and
Anita Keszler and
Zsolt Tuza},
title = {Matching Matchings},
booktitle = {3rd Eastern European Regional Conference on the Engineering of Computer
Based Systems, {ECBS-EERC} 2013, Budapest, Hungary, 29-30 August 2013},
pages = {85--94},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/ECBS-EERC.2013.19},
doi = {10.1109/ECBS-EERC.2013.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecbs/BacsoKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HorakT13,
author = {Peter Hor{\'{a}}k and
Zsolt Tuza},
title = {Speeding up Deciphering by Hypergraph Ordering},
journal = {CoRR},
volume = {abs/1309.5292},
year = {2013},
url = {http://arxiv.org/abs/1309.5292},
eprinttype = {arXiv},
eprint = {1309.5292},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HorakT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BacsoBHT13,
author = {G{\'{a}}bor Bacs{\'{o}} and
Piotr Borowiecki and
Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {Minimum order of graphs with given coloring parameters},
journal = {CoRR},
volume = {abs/1312.7522},
year = {2013},
url = {http://arxiv.org/abs/1312.7522},
eprinttype = {arXiv},
eprint = {1312.7522},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BacsoBHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasSTDL12,
author = {Csilla Bujt{\'{a}}s and
E. Sampathkumar and
Zsolt Tuza and
Charles Dominic and
L. Pushpalatha},
title = {3-consecutive edge coloring of a graph},
journal = {Discret. Math.},
volume = {312},
number = {3},
pages = {561--573},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.04.006},
doi = {10.1016/J.DISC.2011.04.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasSTDL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasSTDP12,
author = {Csilla Bujt{\'{a}}s and
E. Sampathkumar and
Zsolt Tuza and
Charles Dominic and
L. Pushpalatha},
title = {Vertex coloring without large polychromatic stars},
journal = {Discret. Math.},
volume = {312},
number = {14},
pages = {2102--2108},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.04.013},
doi = {10.1016/J.DISC.2011.04.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasSTDP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BorozanFGMMMT12,
author = {Valentin Borozan and
Shinya Fujita and
Aydin Gerek and
Colton Magnant and
Yannis Manoussakis and
Leandro Montero and
Zsolt Tuza},
title = {Proper connection of graphs},
journal = {Discret. Math.},
volume = {312},
number = {17},
pages = {2550--2560},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.09.003},
doi = {10.1016/J.DISC.2011.09.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BorozanFGMMMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BacsoT12,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Distance domination versus iterated domination},
journal = {Discret. Math.},
volume = {312},
number = {17},
pages = {2672--2675},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.12.008},
doi = {10.1016/J.DISC.2011.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BacsoT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BujtasHT12,
author = {Csilla Bujt{\'{a}}s and
Michael A. Henning and
Zsolt Tuza},
title = {Transversals and domination in uniform hypergraphs},
journal = {Eur. J. Comb.},
volume = {33},
number = {1},
pages = {62--72},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.08.002},
doi = {10.1016/J.EJC.2011.08.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BujtasHT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LakshmananBT12,
author = {S. Aparna Lakshmanan and
Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Small Edge Sets Meeting all Triangles of a Graph},
journal = {Graphs Comb.},
volume = {28},
number = {3},
pages = {381--392},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1048-8},
doi = {10.1007/S00373-011-1048-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LakshmananBT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CranstonPTV12,
author = {Daniel W. Cranston and
Anja Pruchnewski and
Zsolt Tuza and
Margit Voigt},
title = {List Colorings of \emph{K}5-Minor-Free Graphs With Special List Assignments},
journal = {J. Graph Theory},
volume = {71},
number = {1},
pages = {18--30},
year = {2012},
url = {https://doi.org/10.1002/jgt.20628},
doi = {10.1002/JGT.20628},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CranstonPTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BaloghBDKT12,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Zsolt Tuza},
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {Black and White Bin Packing},
booktitle = {Approximation and Online Algorithms - 10th International Workshop,
{WAOA} 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {7846},
pages = {131--144},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-38016-7\_12},
doi = {10.1007/978-3-642-38016-7\_12},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BaloghBDKT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5672,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {Bin Packing/Covering with Delivery: Some variations, theoretical results
and efficient offline algorithms},
journal = {CoRR},
volume = {abs/1207.5672},
year = {2012},
url = {http://arxiv.org/abs/1207.5672},
eprinttype = {arXiv},
eprint = {1207.5672},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5672.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amco/BujtasT11,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Optimal batch codes: Many items or low retrieval requirement},
journal = {Adv. Math. Commun.},
volume = {5},
number = {3},
pages = {529--541},
year = {2011},
url = {https://doi.org/10.3934/amc.2011.5.529},
doi = {10.3934/AMC.2011.5.529},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amco/BujtasT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BujtasSTLV11,
author = {Csilla Bujt{\'{a}}s and
E. Sampathkumar and
Zsolt Tuza and
L. Pushpalatha and
R. C. Vasundhara},
title = {Improper C-colorings of graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {4},
pages = {174--186},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.11.004},
doi = {10.1016/J.DAM.2010.11.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BujtasSTLV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganTT11,
author = {Cristina Bazgan and
Sonia Toubaline and
Zsolt Tuza},
title = {The most vital nodes with respect to independent set and vertex cover},
journal = {Discret. Appl. Math.},
volume = {159},
number = {17},
pages = {1933--1946},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.06.023},
doi = {10.1016/J.DAM.2011.06.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BujtasTV11,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza and
Vitaly I. Voloshin},
title = {Color-bounded hypergraphs, {V:} host graphs and subdivisions},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {2},
pages = {223--238},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1541},
doi = {10.7151/DMGT.1541},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BujtasTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BacsoT11,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Optimal guard sets and the Helly property},
journal = {Eur. J. Comb.},
volume = {32},
number = {1},
pages = {28--32},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2010.08.001},
doi = {10.1016/J.EJC.2010.08.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BacsoT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BujtasT11,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Combinatorial batch codes: Extremal problems under Hall-type conditions},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {201--206},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.034},
doi = {10.1016/J.ENDM.2011.09.034},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BujtasT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BujtasDINT11,
author = {Csilla Bujt{\'{a}}s and
Gy{\"{o}}rgy D{\'{o}}sa and
Csan{\'{a}}d Imreh and
Judit Nagy{-}Gy{\"{o}}rgy and
Zsolt Tuza},
title = {The Graph-Bin Packing Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {22},
number = {8},
pages = {1971--1993},
year = {2011},
url = {https://doi.org/10.1142/S012905411100915X},
doi = {10.1142/S012905411100915X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BujtasDINT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DosaST11,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Two uniform machines with nearly equal speeds: unified approach to
known sum and known optimum in semi on-line scheduling},
journal = {J. Comb. Optim.},
volume = {21},
number = {4},
pages = {458--480},
year = {2011},
url = {https://doi.org/10.1007/s10878-009-9265-2},
doi = {10.1007/S10878-009-9265-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DosaST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganCT11,
author = {Cristina Bazgan and
Basile Cou{\"{e}}toux and
Zsolt Tuza},
title = {Complexity and approximation of the Constrained Forest problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4081--4091},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.018},
doi = {10.1016/J.TCS.2010.07.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganCT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imagapp/KeszlerST11,
author = {Anita Keszler and
Tam{\'{a}}s Szir{\'{a}}nyi and
Zsolt Tuza},
editor = {Gabriela Csurka and
Martin Kraus and
Jos{\'{e}} Braz},
title = {Graph based Solution for Segmentation Tasks in Case of Out-of-focus,
Noisy and Corrupted Images},
booktitle = {{IMAGAPP} {\&} {IVAPP} 2011 - Proceedings of the International
Conference on Imaging Theory and Applications and International Conference
on Information Visualization Theory and Applications, Vilamoura, Algarve,
Portugal, March 5-7, 2011},
pages = {100--105},
publisher = {SciTePress},
year = {2011},
timestamp = {Tue, 05 Mar 2024 11:15:19 +0100},
biburl = {https://dblp.org/rec/conf/imagapp/KeszlerST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BujtasT10,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Voloshin's conjecture for C-perfect hypertrees},
journal = {Australas. {J} Comb.},
volume = {48},
pages = {253--268},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/48/ajc\_v48\_p253.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BujtasT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza10,
author = {Zsolt Tuza},
title = {Hall number for list colorings of graphs: Extremal results},
journal = {Discret. Math.},
volume = {310},
number = {3},
pages = {461--470},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.03.025},
doi = {10.1016/J.DISC.2009.03.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT10,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Color-bounded hypergraphs, {IV:} Stable colorings of hypertrees},
journal = {Discret. Math.},
volume = {310},
number = {9},
pages = {1463--1474},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.07.014},
doi = {10.1016/J.DISC.2009.07.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BacsoJT10,
author = {G{\'{a}}bor Bacs{\'{o}} and
Heinz A. Jung and
Zsolt Tuza},
title = {Infinite versus finite graph domination},
journal = {Discret. Math.},
volume = {310},
number = {9},
pages = {1495--1500},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.11.007},
doi = {10.1016/J.DISC.2009.11.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BacsoJT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CamachoST10,
author = {Stephan Matos Camacho and
Ingo Schiermeyer and
Zsolt Tuza},
title = {Approximation algorithms for the minimum rainbow subgraph problem},
journal = {Discret. Math.},
volume = {310},
number = {20},
pages = {2666--2670},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.03.032},
doi = {10.1016/J.DISC.2010.03.032},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CamachoST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BujtasDSST10,
author = {Csilla Bujt{\'{a}}s and
Charles Dominic and
E. Sampathkumar and
M. S. Subramanya and
Zsolt Tuza},
title = {3-consecutive C-colorings of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {30},
number = {3},
pages = {393--405},
year = {2010},
url = {https://doi.org/10.7151/dmgt.1502},
doi = {10.7151/DMGT.1502},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BujtasDSST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BazganTV10,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
title = {Satisfactory graph partition, variants, and generalizations},
journal = {Eur. J. Oper. Res.},
volume = {206},
number = {2},
pages = {271--280},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.10.019},
doi = {10.1016/J.EJOR.2009.10.019},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BazganTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BujtasT10,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {C-perfect hypergraphs},
journal = {J. Graph Theory},
volume = {64},
number = {2},
pages = {132--149},
year = {2010},
url = {https://doi.org/10.1002/jgt.20444},
doi = {10.1002/JGT.20444},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BujtasT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/AngelelliSST10,
author = {Enrico Angelelli and
Maria Grazia Speranza and
J{\'{o}}zsef Szoldatics and
Zsolt Tuza},
title = {Geometric representation for semi on-line scheduling on uniform processors},
journal = {Optim. Methods Softw.},
volume = {25},
number = {3},
pages = {421--428},
year = {2010},
url = {https://doi.org/10.1080/10556780903239311},
doi = {10.1080/10556780903239311},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/AngelelliSST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bic-ta/BenkoDT10,
author = {Attila Benko and
Gy{\"{o}}rgy D{\'{o}}sa and
Zsolt Tuza},
title = {Bin Packing/Covering with Delivery, solved with the evolution of algorithms},
booktitle = {Fifth International Conference on Bio-Inspired Computing: Theories
and Applications, {BIC-TA} 2010, University of Hunan, Liverpool Hope
University, Liverpool, United Kingdom / Changsha, China, September
8-10 and September 23-26, 2010},
pages = {298--302},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/BICTA.2010.5645312},
doi = {10.1109/BICTA.2010.5645312},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/bic-ta/BenkoDT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganTT10,
author = {Cristina Bazgan and
Sonia Toubaline and
Zsolt Tuza},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Complexity of Most Vital Nodes for Independent Set in Graphs Related
to Tree Structures},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {154--166},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_17},
doi = {10.1007/978-3-642-19222-7\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BazganTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/MilazzoT09,
author = {Lorenzo Milazzo and
Zsolt Tuza},
title = {Logartihmic upper bound for the upper chromatic number of S(t, t+1,
v) systems},
journal = {Ars Comb.},
volume = {92},
year = {2009},
timestamp = {Tue, 14 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/MilazzoT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HangosTY09,
author = {Katalin M. Hangos and
Zsolt Tuza and
Anders Yeo},
title = {Some complexity problems on single input double output controllers},
journal = {Discret. Appl. Math.},
volume = {157},
number = {5},
pages = {1146--1158},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.03.028},
doi = {10.1016/J.DAM.2008.03.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HangosTY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT09,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Color-bounded hypergraphs, {I:} General results},
journal = {Discret. Math.},
volume = {309},
number = {15},
pages = {4890--4902},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.019},
doi = {10.1016/J.DISC.2008.04.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/StiebitzTV09,
author = {Michael Stiebitz and
Zsolt Tuza and
Margit Voigt},
title = {On list critical graphs},
journal = {Discret. Math.},
volume = {309},
number = {15},
pages = {4931--4941},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.05.021},
doi = {10.1016/J.DISC.2008.05.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/StiebitzTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BujtasT09a,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Color-bounded hypergraphs, {II:} Interval hypergraphs and hypertrees},
journal = {Discret. Math.},
volume = {309},
number = {22},
pages = {6391--6401},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.10.023},
doi = {10.1016/J.DISC.2008.10.023},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BujtasT09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BacsoT09,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Clique-transversal sets and weak 2-colorings in graphs of small maximum
degree},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {11},
number = {2},
pages = {15--24},
year = {2009},
url = {https://doi.org/10.46298/dmtcs.453},
doi = {10.46298/DMTCS.453},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BacsoT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BujtasT09,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Smallest Set-Transversals of \emph{k}-Partitions},
journal = {Graphs Comb.},
volume = {25},
number = {6},
pages = {807--816},
year = {2009},
url = {https://doi.org/10.1007/s00373-010-0890-4},
doi = {10.1007/S00373-010-0890-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BujtasT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/BohmeGTU09,
author = {Thomas B{\"{o}}hme and
Frank G{\"{o}}ring and
Zsolt Tuza and
Herwig Unger},
title = {Learning of winning strategies for terminal games with linear-size
memory},
journal = {Int. J. Game Theory},
volume = {38},
number = {2},
pages = {155--168},
year = {2009},
url = {https://doi.org/10.1007/s00182-008-0142-5},
doi = {10.1007/S00182-008-0142-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/BohmeGTU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VegaT09,
author = {Wenceslas Fernandez de la Vega and
Zsolt Tuza},
title = {Groupies in random graphs},
journal = {Inf. Process. Lett.},
volume = {109},
number = {7},
pages = {339--340},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2008.09.015},
doi = {10.1016/J.IPL.2008.09.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VegaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BazganCT09,
author = {Cristina Bazgan and
Basile Cou{\"{e}}toux and
Zsolt Tuza},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Covering a Graph with a Constrained Forest (Extended Abstract)},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {892--901},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_90},
doi = {10.1007/978-3-642-10631-6\_90},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BazganCT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CaroLRTY08,
author = {Yair Caro and
Arieh Lev and
Yehuda Roditty and
Zsolt Tuza and
Raphael Yuster},
title = {On Rainbow Connection},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r57.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CaroLRTY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BujtasT08,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Uniform Mixed Hypergraphs: The Possible Numbers of Colors},
journal = {Graphs Comb.},
volume = {24},
number = {1},
pages = {1--12},
year = {2008},
url = {https://doi.org/10.1007/s00373-007-0765-5},
doi = {10.1007/S00373-007-0765-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BujtasT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BazganTV08,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
title = {Approximation of satisfactory bisection problems},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {5},
pages = {875--883},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.12.001},
doi = {10.1016/J.JCSS.2007.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BazganTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BazganT08,
author = {Cristina Bazgan and
Zsolt Tuza},
title = {Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree
3},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {510--519},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.02.002},
doi = {10.1016/J.JDA.2007.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BazganT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Tuza08,
author = {Zsolt Tuza},
title = {Hereditary Domination in Graphs: Characterization with Forbidden Induced
Subgraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {3},
pages = {849--853},
year = {2008},
url = {https://doi.org/10.1137/070699482},
doi = {10.1137/070699482},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Tuza08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngelelliST08,
author = {Enrico Angelelli and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Semi-online scheduling on two uniform processors},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {211--219},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.12.005},
doi = {10.1016/J.TCS.2007.12.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngelelliST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SzaniszloT07,
author = {Zsuzsanna Szaniszl{\'{o}} and
Zsolt Tuza},
title = {Lower bound on the profile of degree pairs in cross-intersecting set
systems},
journal = {Comb.},
volume = {27},
number = {3},
pages = {399--405},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2105-z},
doi = {10.1007/S00493-007-2105-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SzaniszloT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BorowieckiST07,
author = {Mieczyslaw Borowiecki and
Elzbieta Sidorowicz and
Zsolt Tuza},
title = {Game List Colouring of Graphs},
journal = {Electron. J. Comb.},
volume = {14},
number = {1},
year = {2007},
url = {https://doi.org/10.37236/944},
doi = {10.37236/944},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BorowieckiST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganTV07,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
title = {Efficient algorithms for decomposing graphs under degree constraints},
journal = {Discret. Appl. Math.},
volume = {155},
number = {8},
pages = {979--988},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.10.005},
doi = {10.1016/J.DAM.2006.10.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BujtasT07,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Orderings of uniquely colorable hypergraphs},
journal = {Discret. Appl. Math.},
volume = {155},
number = {11},
pages = {1395--1407},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.02.008},
doi = {10.1016/J.DAM.2007.02.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BujtasT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HornakTW07,
author = {Mirko Horn{\'{a}}k and
Zsolt Tuza and
Mariusz Wozniak},
title = {On-line arbitrarily vertex decomposable trees},
journal = {Discret. Appl. Math.},
volume = {155},
number = {11},
pages = {1420--1429},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.02.011},
doi = {10.1016/J.DAM.2007.02.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HornakTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BacsoTV07,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza and
Margit Voigt},
title = {Characterization of graphs dominated by induced paths},
journal = {Discret. Math.},
volume = {307},
number = {7-8},
pages = {822--826},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.035},
doi = {10.1016/J.DISC.2005.11.035},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BacsoTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Tuza07,
author = {Zsolt Tuza},
title = {Extremal jumps of the Hall number},
journal = {Electron. Notes Discret. Math.},
volume = {28},
pages = {83--89},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.01.012},
doi = {10.1016/J.ENDM.2007.01.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Tuza07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganTV06,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
title = {The satisfactory partition problem},
journal = {Discret. Appl. Math.},
volume = {154},
number = {8},
pages = {1236--1245},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.10.014},
doi = {10.1016/J.DAM.2005.10.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganTV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BacsoT06,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {The cost chromatic number and hypergraph parameters},
journal = {Discuss. Math. Graph Theory},
volume = {26},
number = {3},
pages = {369--376},
year = {2006},
url = {https://doi.org/10.7151/dmgt.1329},
doi = {10.7151/DMGT.1329},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BacsoT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/AngelelliST06,
author = {Enrico Angelelli and
Maria Grazia Speranza and
Zsolt Tuza},
title = {New bounds and algorithms for on-line scheduling: two identical processors,
known sum and upper bound on the tasks},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {8},
number = {1},
pages = {1--16},
year = {2006},
url = {https://doi.org/10.46298/dmtcs.367},
doi = {10.46298/DMTCS.367},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/AngelelliST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BujtasT06,
author = {Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Mixed colorings of hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {24},
pages = {273--275},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.06.026},
doi = {10.1016/J.ENDM.2006.06.026},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BujtasT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AndersenVT06,
author = {Lars D{\o}vling Andersen and
Preben D. Vestergaard and
Zsolt Tuza},
title = {Largest Non-Unique Subgraphs},
journal = {Graphs Comb.},
volume = {22},
number = {4},
pages = {453--470},
year = {2006},
url = {https://doi.org/10.1007/s00373-006-0676-x},
doi = {10.1007/S00373-006-0676-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AndersenVT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganTV06,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
title = {Degree-constrained decompositions of graphs: Bounded treewidth and
planarity},
journal = {Theor. Comput. Sci.},
volume = {355},
number = {3},
pages = {389--395},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.01.024},
doi = {10.1016/J.TCS.2006.01.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganTV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/sfsc/DominichST06,
author = {S{\'{a}}ndor Dominich and
Adrienn Skrop and
Zsolt Tuza},
editor = {Enrique Herrera{-}Viedma and
Gabriella Pasi and
Fabio Crestani},
title = {Formal Theory of Connectionist Web Retrieval},
booktitle = {Soft Computing in Web Information Retrieval - Models and Applications},
series = {Studies in Fuzziness and Soft Computing},
volume = {197},
pages = {163--194},
year = {2006},
url = {https://doi.org/10.1007/3-540-31590-X\_9},
doi = {10.1007/3-540-31590-X\_9},
timestamp = {Thu, 21 Feb 2019 12:38:05 +0100},
biburl = {https://dblp.org/rec/series/sfsc/DominichST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tuza05,
author = {Zsolt Tuza},
title = {Strong branchwidth and local transversals},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {291--296},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.017},
doi = {10.1016/J.DAM.2004.01.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tuza05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CrullCFHPST05,
author = {Betsy Crull and
Tammy Cundiff and
Paul Feltman and
Glenn H. Hurlbert and
Lara Pudwell and
Zsuzsanna Szaniszl{\'{o}} and
Zsolt Tuza},
title = {The cover pebbling number of graphs},
journal = {Discret. Math.},
volume = {296},
number = {1},
pages = {15--23},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.03.009},
doi = {10.1016/J.DISC.2005.03.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CrullCFHPST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BacsoMT05,
author = {G{\'{a}}bor Bacs{\'{o}} and
Danuta Michalak and
Zsolt Tuza},
title = {Dominating Bipartite Subgraphs in Graphs},
journal = {Discuss. Math. Graph Theory},
volume = {25},
number = {1-2},
pages = {85--94},
year = {2005},
url = {https://doi.org/10.7151/dmgt.1263},
doi = {10.7151/DMGT.1263},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BacsoMT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BacsoTT05,
author = {G{\'{a}}bor Bacs{\'{o}} and
Attila T{\'{a}}los and
Zsolt Tuza},
title = {Graph Domination in Distance Two},
journal = {Discuss. Math. Graph Theory},
volume = {25},
number = {1-2},
pages = {121--128},
year = {2005},
url = {https://doi.org/10.7151/dmgt.1266},
doi = {10.7151/DMGT.1266},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BacsoTT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Tuza05,
author = {Zsolt Tuza},
title = {Highly connected counterexamples to a conjecture on \emph{{\'{$\alpha$}}}
-domination},
journal = {Discuss. Math. Graph Theory},
volume = {25},
number = {3},
pages = {435--440},
year = {2005},
url = {https://doi.org/10.7151/dmgt.1295},
doi = {10.7151/DMGT.1295},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Tuza05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KohlSTV05,
author = {Anja Kohl and
Jens Schreyer and
Zsolt Tuza and
Margit Voigt},
title = {List version of \emph{L}(\emph{d}, \emph{s})-labelings},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {1},
pages = {92--98},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.032},
doi = {10.1016/J.TCS.2005.09.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KohlSTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BazganTV05,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
editor = {Lusheng Wang},
title = {Complexity and Approximation of Satisfactory Partition Problems},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {829--838},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_84},
doi = {10.1007/11533719\_84},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BazganTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cce/HangosST04,
author = {Katalin M. Hangos and
G{\'{a}}bor Szederk{\'{e}}nyi and
Zsolt Tuza},
title = {The effect of model simplification assumptions on the differential
index of lumped process models},
journal = {Comput. Chem. Eng.},
volume = {28},
number = {1-2},
pages = {129--137},
year = {2004},
url = {https://doi.org/10.1016/S0098-1354(03)00166-2},
doi = {10.1016/S0098-1354(03)00166-2},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cce/HangosST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MansiniST04,
author = {Renata Mansini and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Scheduling groups of tasks with precedence constraints on three dedicated
processors},
journal = {Discret. Appl. Math.},
volume = {134},
number = {1-3},
pages = {141--168},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00302-0},
doi = {10.1016/S0166-218X(03)00302-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MansiniST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GoringHHT04,
author = {Frank G{\"{o}}ring and
Jochen Harant and
Erhard Hexel and
Zsolt Tuza},
title = {On short cycles through prescribed vertices of a graph},
journal = {Discret. Math.},
volume = {286},
number = {1-2},
pages = {67--74},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.11.047},
doi = {10.1016/J.DISC.2003.11.047},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GoringHHT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BacsoT04,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Graphs without induced \emph{P\({}_{\mbox{5}}\)} and \emph{ C\({}_{\mbox{5}}\)}},
journal = {Discuss. Math. Graph Theory},
volume = {24},
number = {3},
pages = {503--507},
year = {2004},
url = {https://doi.org/10.7151/dmgt.1248},
doi = {10.7151/DMGT.1248},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BacsoT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/QuattrocchiT04,
author = {Gaetano Quattrocchi and
Zsolt Tuza},
title = {Partition of \emph{C} \({}_{\mbox{4}}\)-Designs into Minimum and Maximum
Number of \emph{P} \({}_{\mbox{3}}\)-Designs},
journal = {Graphs Comb.},
volume = {20},
number = {4},
pages = {531--540},
year = {2004},
url = {https://doi.org/10.1007/s00373-004-0582-z},
doi = {10.1007/S00373-004-0582-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/QuattrocchiT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AngelelliNST04,
author = {Enrico Angelelli and
{\'{A}}. B. Nagy and
Maria Grazia Speranza and
Zsolt Tuza},
title = {The On-Line Multiprocessor Scheduling Problem with Known Sum of the
Tasks},
journal = {J. Sched.},
volume = {7},
number = {6},
pages = {421--428},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000046074.03560.5d},
doi = {10.1023/B:JOSH.0000046074.03560.5D},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AngelelliNST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BacsoTV03,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza and
Vitaly I. Voloshin},
title = {Unique colorings of bi-hypergraphs},
journal = {Australas. {J} Comb.},
volume = {27},
pages = {33--46},
year = {2003},
url = {http://ajc.maths.uq.edu.au/pdf/27/ajc\_v27\_p033.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BacsoTV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelelliST03,
author = {Enrico Angelelli and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound
on the Items},
journal = {Algorithmica},
volume = {37},
number = {4},
pages = {243--262},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1037-2},
doi = {10.1007/S00453-003-1037-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelelliST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BorowieckiGHT03,
author = {Mieczyslaw Borowiecki and
Jaroslaw Grytczuk and
Mariusz Haluszczak and
Zsolt Tuza},
title = {Sch{\"{u}}tte's Tournament Problem and Intersecting Families
of Sets},
journal = {Comb. Probab. Comput.},
volume = {12},
number = {4},
pages = {359--364},
year = {2003},
url = {https://doi.org/10.1017/S0963548303005674},
doi = {10.1017/S0963548303005674},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BorowieckiGHT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AxenovichJT03,
author = {Maria Axenovich and
Tao Jiang and
Zsolt Tuza},
title = {Local Anti-Ramsey Numbers of Graphs},
journal = {Comb. Probab. Comput.},
volume = {12},
number = {5-6},
pages = {495--511},
year = {2003},
url = {https://doi.org/10.1017/S0963548303005868},
doi = {10.1017/S0963548303005868},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AxenovichJT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csjm/TuzaV03,
author = {Zsolt Tuza and
Vitaly I. Voloshin},
title = {Linear-time algorithm for the edge-colorability of a graph with prescribed
vertex types},
journal = {Comput. Sci. J. Moldova},
volume = {11},
number = {1},
pages = {35--42},
year = {2003},
url = {http://www.math.md/publications/csjm/issues/v11-n1/8396/},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csjm/TuzaV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MilazzoTV03,
author = {Lorenzo Milazzo and
Zsolt Tuza and
Vitaly I. Voloshin},
title = {Strict colorings of Steiner triple and quadruple systems: a survey},
journal = {Discret. Math.},
volume = {261},
number = {1-3},
pages = {399--411},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00485-5},
doi = {10.1016/S0012-365X(02)00485-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MilazzoTV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KiersteadT03,
author = {Hal A. Kierstead and
Zsolt Tuza},
title = {Marking Games and the Oriented Game Chromatic Number of Partial k-Trees},
journal = {Graphs Comb.},
volume = {19},
number = {1},
pages = {121--129},
year = {2003},
url = {https://doi.org/10.1007/s00373-002-0489-5},
doi = {10.1007/S00373-002-0489-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KiersteadT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BazganTV03,
author = {Cristina Bazgan and
Zsolt Tuza and
Daniel Vanderpooten},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {On the Existence and Determination of Satisfactory Partitions in a
Graph},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {444--453},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_46},
doi = {10.1007/978-3-540-24587-2\_46},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BazganTV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/03/TuzaGPTBWK03,
author = {Zsolt Tuza and
Gregory Z. Gutin and
Michael Plurnmer and
Alan Tucker and
Edmund Kieran Burke and
Dominique de Werra and
Jeffrey H. Kingston},
editor = {Jonathan L. Gross and
Jay Yellen},
title = {Colorings and Related Topics},
booktitle = {Handbook of Graph Theory},
series = {Discrete Mathematics and Its Applications},
pages = {340--483},
publisher = {Chapman {\&} Hall / Taylor {\&} Francis},
year = {2003},
url = {https://doi.org/10.1201/9780203490204.ch5},
doi = {10.1201/9780203490204.CH5},
timestamp = {Fri, 17 Jul 2020 16:12:44 +0200},
biburl = {https://dblp.org/rec/books/tf/03/TuzaGPTBWK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BascoT02,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Structural domination of graphs},
journal = {Ars Comb.},
volume = {63},
year = {2002},
timestamp = {Wed, 05 May 2010 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/BascoT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TuzaVZ02,
author = {Zsolt Tuza and
Vitaly I. Voloshin and
Huishan Zhou},
title = {Uniquely colorable mixed hypergraphs},
journal = {Discret. Math.},
volume = {248},
number = {1-3},
pages = {221--236},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00176-5},
doi = {10.1016/S0012-365X(01)00176-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TuzaVZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TuzaV02,
author = {Zsolt Tuza and
Margit Voigt},
title = {A note on planar 5-list colouring: non-extendability at distance 4},
journal = {Discret. Math.},
volume = {251},
number = {1-3},
pages = {169--172},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00338-7},
doi = {10.1016/S0012-365X(01)00338-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TuzaV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/TuzaV02,
author = {Zsolt Tuza and
Preben D. Vestergaard},
title = {Domination in partitioned graphs},
journal = {Discuss. Math. Graph Theory},
volume = {22},
number = {1},
pages = {199--210},
year = {2002},
url = {https://doi.org/10.7151/dmgt.1169},
doi = {10.7151/DMGT.1169},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/TuzaV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/JiangMTVW02,
author = {Tao Jiang and
Dhruv Mubayi and
Zsolt Tuza and
Vitaly I. Voloshin and
Douglas B. West},
title = {The Chromatic Spectrum of Mixed Hypergraphs},
journal = {Graphs Comb.},
volume = {18},
number = {2},
pages = {309--318},
year = {2002},
url = {https://doi.org/10.1007/s003730200023},
doi = {10.1007/S003730200023},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/JiangMTVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KratochvilT02,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {On the complexity of bicoloring clique hypergraphs of graphs},
journal = {J. Algorithms},
volume = {45},
number = {1},
pages = {40--54},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00221-3},
doi = {10.1016/S0196-6774(02)00221-3},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/KratochvilT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BazganST02,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
title = {Efficient Approximation Algorithms for the {SUBSET-SUMS} {EQUALITY}
Problem},
journal = {J. Comput. Syst. Sci.},
volume = {64},
number = {2},
pages = {160--170},
year = {2002},
url = {https://doi.org/10.1006/jcss.2001.1784},
doi = {10.1006/JCSS.2001.1784},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BazganST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/RuzsaTV02,
author = {Imre Z. Ruzsa and
Zsolt Tuza and
Margit Voigt},
title = {Distance Graphs with Finite Chromatic Number},
journal = {J. Comb. Theory, Ser. {B}},
volume = {85},
number = {1},
pages = {181--187},
year = {2002},
url = {https://doi.org/10.1006/jctb.2001.2093},
doi = {10.1006/JCTB.2001.2093},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/RuzsaTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilTV02,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
editor = {Ludek Kucera},
title = {On the b-Chromatic Number of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {310--320},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_27},
doi = {10.1007/3-540-36379-3\_27},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LeeRST01,
author = {Anna Lee and
G{\'{a}}bor R{\'{e}}v{\'{e}}sz and
Jen{\"{o}} Szigeti and
Zsolt Tuza},
title = {Capelli polynomials, almost-permutation matrices and sparse Eulerian
graphs},
journal = {Discret. Math.},
volume = {230},
number = {1-3},
pages = {49--61},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00069-8},
doi = {10.1016/S0012-365X(00)00069-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LeeRST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/IdzikT01,
author = {Adam Idzik and
Zsolt Tuza},
title = {Heredity properties of connectedness in edge-coloured complete graphs},
journal = {Discret. Math.},
volume = {235},
number = {1-3},
pages = {301--306},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00282-X},
doi = {10.1016/S0012-365X(00)00282-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/IdzikT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/TuzaW01,
author = {Zsolt Tuza and
Annegret Wagler},
title = {Minimally Non-Preperfect Graphs of Small Maximum Degree},
journal = {Graphs Comb.},
volume = {17},
number = {4},
pages = {759--773},
year = {2001},
url = {https://doi.org/10.1007/s003730170015},
doi = {10.1007/S003730170015},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/TuzaW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TuzaV01,
author = {Zsolt Tuza and
Margit Voigt},
title = {Oriented list colorings of graphs},
journal = {J. Graph Theory},
volume = {36},
number = {4},
pages = {217--229},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200104)36:4\&\#60;217::AID-JGT1007\&\#62;3.0.CO;2-1},
doi = {10.1002/1097-0118(200104)36:4\&\#60;217::AID-JGT1007\&\#62;3.0.CO;2-1},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TuzaV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManoussakisT01,
author = {Yannis Manoussakis and
Zsolt Tuza},
title = {Ramsey numbers for tournaments},
journal = {Theor. Comput. Sci.},
volume = {263},
number = {1-2},
pages = {75--85},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00232-2},
doi = {10.1016/S0304-3975(00)00232-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManoussakisT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KralKTW01,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Gerhard J. Woeginger},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Complexity of Coloring Graphs without Forbidden Induced Subgraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {254--262},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_23},
doi = {10.1007/3-540-45477-2\_23},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KralKTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TuzaV00,
author = {Zsolt Tuza and
Vitaly I. Voloshin},
title = {Uncolorable Mixed Hypergraphs},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {209--227},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00134-1},
doi = {10.1016/S0166-218X(99)00134-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TuzaV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SchiermeyerTV00,
author = {Ingo Schiermeyer and
Zsolt Tuza and
Margit Voigt},
title = {On-line rankings of graphs},
journal = {Discret. Math.},
volume = {212},
number = {1-2},
pages = {141--147},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00215-0},
doi = {10.1016/S0012-365X(99)00215-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SchiermeyerTV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza00,
author = {Zsolt Tuza},
title = {Extremal bi-Helly families},
journal = {Discret. Math.},
volume = {213},
number = {1-3},
pages = {321--331},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00192-2},
doi = {10.1016/S0012-365X(99)00192-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HujterST00,
author = {Mih{\'{a}}ly Hujter and
L{\'{a}}szl{\'{o}} Spissich and
Zsolt Tuza},
title = {Sharpness of Some Intersection Theorems},
journal = {Eur. J. Comb.},
volume = {21},
number = {7},
pages = {913--916},
year = {2000},
url = {https://doi.org/10.1006/eujc.2000.0408},
doi = {10.1006/EUJC.2000.0408},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HujterST00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KratochvilT00,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
editor = {David B. Shmoys},
title = {On the complexity of bicoloring clique hypergraphs of graphs (extended
abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {40--41},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338230},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KratochvilT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/SperanzaT99,
author = {Maria Grazia Speranza and
Zsolt Tuza},
title = {On-line approximation algorithms for scheduling tasks on identical
machines withextendable working time},
journal = {Ann. Oper. Res.},
volume = {86},
pages = {491--506},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018935608981},
doi = {10.1023/A\%3A1018935608981},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/SperanzaT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BylkaIT99,
author = {Stanislaw Bylka and
Adam Idzik and
Zsolt Tuza},
title = {Maximum cuts: Improvements and local algorithmic analogues of the
Edwards-Erd{\"{o}}s inequality},
journal = {Discret. Math.},
volume = {194},
number = {1-3},
pages = {39--58},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00115-0},
doi = {10.1016/S0012-365X(98)00115-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BylkaIT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JendrolMST99,
author = {Stanislav Jendrol' and
Tom{\'{a}}s Madaras and
Roman Sot{\'{a}}k and
Zsolt Tuza},
title = {On light cycles in plane triangulations},
journal = {Discret. Math.},
volume = {197-198},
pages = {453--467},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)90099-7},
doi = {10.1016/S0012-365X(99)90099-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JendrolMST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MiliciT99,
author = {Salvatore Milici and
Zsolt Tuza},
title = {Disjoint blocking sets in cycle systems},
journal = {Discret. Math.},
volume = {208-209},
pages = {451--462},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)00099-0},
doi = {10.1016/S0012-365X(99)00099-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MiliciT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BorowieckiMTV99,
author = {Mieczyslaw Borowiecki and
Peter Mih{\'{o}}k and
Zsolt Tuza and
Margit Voigt},
title = {Remarks on the existence of uniquely partitionable planar graphs},
journal = {Discuss. Math. Graph Theory},
volume = {19},
number = {2},
pages = {159--166},
year = {1999},
url = {https://doi.org/10.7151/dmgt.1092},
doi = {10.7151/DMGT.1092},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BorowieckiMTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/JiangMTVW99,
author = {Tao Jiang and
Dhruv Mubayi and
Zsolt Tuza and
Vitaly I. Voloshin and
Douglas B. West},
title = {Chromatic spectrum is broken},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {86--89},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80030-7},
doi = {10.1016/S1571-0653(05)80030-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/JiangMTVW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BazganST99,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
title = {On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic
Hamiltonian Graphs},
journal = {J. Algorithms},
volume = {31},
number = {1},
pages = {249--268},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0998},
doi = {10.1006/JAGM.1998.0998},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BazganST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/AmouraBMT99,
author = {Abdel Krim Amoura and
Evripidis Bampis and
Yannis Manoussakis and
Zsolt Tuza},
title = {A comparison of heuristics for scheduling multiprocessor tasks on
three dedicated processors},
journal = {Parallel Comput.},
volume = {25},
number = {1},
pages = {49--61},
year = {1999},
url = {https://doi.org/10.1016/S0167-8191(98)00102-1},
doi = {10.1016/S0167-8191(98)00102-1},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/AmouraBMT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratochvilT99,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Rankings of Directed Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {3},
pages = {374--384},
year = {1999},
url = {https://doi.org/10.1137/S0895480197330242},
doi = {10.1137/S0895480197330242},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KratochvilT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MilazzoT98,
author = {Lorenzo Milazzo and
Zsolt Tuza},
title = {Strict colourings for classes of steiner triple systems},
journal = {Discret. Math.},
volume = {182},
number = {1-3},
pages = {233--243},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00143-X},
doi = {10.1016/S0012-365X(97)00143-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MilazzoT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratochvilTV98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
title = {Complexity of choosing subsets from color sets},
journal = {Discret. Math.},
volume = {191},
number = {1-3},
pages = {139--148},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(98)00101-0},
doi = {10.1016/S0012-365X(98)00101-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratochvilTV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DellOlmoKST98,
author = {Paolo Dell'Olmo and
Hans Kellerer and
Maria Grazia Speranza and
Zsolt Tuza},
title = {A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {229--233},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00216-0},
doi = {10.1016/S0020-0190(97)00216-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DellOlmoKST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KratochvilTV98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
title = {Brooks-type theorems for choosability with separation},
journal = {J. Graph Theory},
volume = {27},
number = {1},
pages = {43--49},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199801)27:1\&\#60;43::AID-JGT7\&\#62;3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199801)27:1\&\#60;43::AID-JGT7\&\#62;3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KratochvilTV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderDJKKMT98,
author = {Hans L. Bodlaender and
Jitender S. Deogun and
Klaus Jansen and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Zsolt Tuza},
title = {Rankings of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {168--181},
year = {1998},
url = {https://doi.org/10.1137/S0895480195282550},
doi = {10.1137/S0895480195282550},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BazganST98,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Efficient Approximation Algorithms for the Subset-Sums Equality Problem},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {387--396},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055069},
doi = {10.1007/BFB0055069},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BazganST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BazganST98,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Approximation of Finding A(nother) Hamilton Cycle in Cubic
Hamilton Graphs (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {276--286},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028567},
doi = {10.1007/BFB0028567},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BazganST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilT98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Rankings of Directed Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {114--123},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_10},
doi = {10.1007/10692760\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/GimbelHT97,
author = {John G. Gimbel and
Michael A. Henning and
Zsolt Tuza},
title = {Switching Distance Graphs},
journal = {Ars Comb.},
volume = {47},
year = {1997},
timestamp = {Thu, 15 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/GimbelHT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DellOlmoST97,
author = {Paolo Dell'Olmo and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Comparability Graph Augmentation for some Multiprocessor Scheduling
Problems},
journal = {Discret. Appl. Math.},
volume = {72},
number = {1-2},
pages = {71--84},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00037-6},
doi = {10.1016/S0166-218X(96)00037-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DellOlmoST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TuzaV97,
author = {Zsolt Tuza and
Margit Voigt},
title = {List Colorings and Reducibility},
journal = {Discret. Appl. Math.},
volume = {79},
number = {1-3},
pages = {247--256},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00046-2},
doi = {10.1016/S0166-218X(97)00046-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TuzaV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DellOlmoST97,
author = {Paolo Dell'Olmo and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Efficiency and effectiveness of normal schedules on three dedicated
processors},
journal = {Discret. Math.},
volume = {164},
number = {1-3},
pages = {67--79},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(97)84781-4},
doi = {10.1016/S0012-365X(97)84781-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DellOlmoST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlonTV97,
author = {Noga Alon and
Zsolt Tuza and
Margit Voigt},
title = {Choosability and fractional chromatic numbers},
journal = {Discret. Math.},
volume = {165-166},
pages = {31--38},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00159-8},
doi = {10.1016/S0012-365X(96)00159-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlonTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GionfriddoHT97,
author = {Mario Gionfriddo and
Frank Harary and
Zsolt Tuza},
title = {The color cost of a caterpillar},
journal = {Discret. Math.},
volume = {174},
number = {1-3},
pages = {125--130},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00325-1},
doi = {10.1016/S0012-365X(96)00325-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GionfriddoHT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MilazzoT97,
author = {Lorenzo Milazzo and
Zsolt Tuza},
title = {Upper chromatic number of Steiner triple and quadruple systems},
journal = {Discret. Math.},
volume = {174},
number = {1-3},
pages = {247--259},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(97)80332-9},
doi = {10.1016/S0012-365X(97)80332-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MilazzoT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/SzigetiT97,
author = {Jen{\"{o}} Szigeti and
Zsolt Tuza},
title = {Generalized colorings and avoidable orientations},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {1},
pages = {137--145},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1047},
doi = {10.7151/DMGT.1047},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/SzigetiT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Tuza97,
author = {Zsolt Tuza},
title = {Graph colorings with local constraints - a survey},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {2},
pages = {161--228},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1049},
doi = {10.7151/DMGT.1049},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Tuza97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KellererKST97,
author = {Hans Kellerer and
Vladimir Kotov and
Maria Grazia Speranza and
Zsolt Tuza},
title = {Semi on-line algorithms for the partition problem},
journal = {Oper. Res. Lett.},
volume = {21},
number = {5},
pages = {235--242},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(98)00005-4},
doi = {10.1016/S0167-6377(98)00005-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KellererKST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/KratochvilTV97,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
editor = {Ronald L. Graham and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril and
Fred S. Roberts},
title = {New trends in the theory of graph colorings: Choosability and list
coloring},
booktitle = {Contemporary Trends in Discrete Mathematics: From {DIMACS} and {DIMATIA}
to the Future, Proceedings of a {DIMACS} Workshop, Stir{\'{\i}}n
Castle, Czech Republic, May 19-25, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {49},
pages = {183--197},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/049/13},
doi = {10.1090/DIMACS/049/13},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/KratochvilTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HujterT96,
author = {Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {Precoloring Extension 3: Classes of Perfect Graphs},
journal = {Comb. Probab. Comput.},
volume = {5},
pages = {35--56},
year = {1996},
url = {https://doi.org/10.1017/S0963548300001826},
doi = {10.1017/S0963548300001826},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HujterT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ManoussakisT96,
author = {Yannis Manoussakis and
Zsolt Tuza},
title = {The Forwarding Index of Directed Networks},
journal = {Discret. Appl. Math.},
volume = {68},
number = {3},
pages = {279--291},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00072-Y},
doi = {10.1016/0166-218X(95)00072-Y},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ManoussakisT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BarefootCEPST96,
author = {Curtis A. Barefoot and
Lane H. Clark and
Roger C. Entringer and
T. D. Porter and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Zsolt Tuza},
title = {Cycle-saturated graphs of minimum size},
journal = {Discret. Math.},
volume = {150},
number = {1-3},
pages = {31--48},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00173-T},
doi = {10.1016/0012-365X(95)00173-T},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BarefootCEPST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosGT96,
author = {Paul Erd{\"{o}}s and
Tibor Gallai and
Zsolt Tuza},
title = {Covering and independence in triangle structures},
journal = {Discret. Math.},
volume = {150},
number = {1-3},
pages = {89--101},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00178-Y},
doi = {10.1016/0012-365X(95)00178-Y},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosGT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JendrolTT96,
author = {Stanislav Jendrol' and
Michal Tk{\'{a}}c and
Zsolt Tuza},
title = {The irregularity strength and cost of the union of cliques},
journal = {Discret. Math.},
volume = {150},
number = {1-3},
pages = {179--186},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00186-Z},
doi = {10.1016/0012-365X(95)00186-Z},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/JendrolTT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DalTTVZZ96,
author = {Ren{\'{e}} van Dal and
Gert A. Tijssen and
Zsolt Tuza and
Jack A. A. van der Veen and
Christina Zamfirescu and
Tudor Zamfirescu},
title = {Hamiltonian properties of Toeplitz graphs},
journal = {Discret. Math.},
volume = {159},
number = {1-3},
pages = {69--81},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00111-9},
doi = {10.1016/0012-365X(95)00111-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DalTTVZZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ErdosTV96,
author = {Paul Erd{\"{o}}s and
Zsolt Tuza and
Pavel Valtr},
title = {Ramsey-remainder},
journal = {Eur. J. Comb.},
volume = {17},
number = {6},
pages = {519--532},
year = {1996},
url = {https://doi.org/10.1006/eujc.1996.0045},
doi = {10.1006/EUJC.1996.0045},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/ErdosTV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ManoussakisSTV96,
author = {Yannis Manoussakis and
Michael Spyratos and
Zsolt Tuza and
Margit Voigt},
title = {Minimal colorings for properly colored subgraphs},
journal = {Graphs Comb.},
volume = {12},
number = {1},
pages = {345--360},
year = {1996},
url = {https://doi.org/10.1007/BF01858468},
doi = {10.1007/BF01858468},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ManoussakisSTV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ManoussakisST96,
author = {Yannis Manoussakis and
Michael Spyratos and
Zsolt Tuza},
title = {Cycles of given color patterns},
journal = {J. Graph Theory},
volume = {21},
number = {2},
pages = {153--162},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199602)21:2\&\#60;153::AID-JGT4\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1097-0118(199602)21:2\&\#60;153::AID-JGT4\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ManoussakisST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TuzaV96,
author = {Zsolt Tuza and
Margit Voigt},
title = {Every 2-choosable graph is (2\emph{m, m})-choosable},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {245--252},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\&\#60;245::AID-JGT5\&\#62;3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199607)22:3\&\#60;245::AID-JGT5\&\#62;3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TuzaV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ManoussakisT96,
author = {Yannis Manoussakis and
Zsolt Tuza},
title = {Optimal routings in communication networks with linearly bounded forwarding
index},
journal = {Networks},
volume = {28},
number = {4},
pages = {177--180},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0037(199612)28:4\&\#60;177::AID-NET1\&\#62;3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0037(199612)28:4\&\#60;177::AID-NET1\&\#62;3.0.CO;2-I},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ManoussakisT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NgocT95,
author = {Nguyen Van Ngoc and
Zsolt Tuza},
title = {4-chromatic graphs with large odd girth},
journal = {Discret. Math.},
volume = {138},
number = {1-3},
pages = {387--392},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00221-4},
doi = {10.1016/0012-365X(94)00221-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NgocT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AignerTT95,
author = {Martin Aigner and
Eberhard Triesch and
Zsolt Tuza},
title = {Searching for acyclic orientations of graphs},
journal = {Discret. Math.},
volume = {144},
number = {1-3},
pages = {3--10},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00281-M},
doi = {10.1016/0012-365X(94)00281-M},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AignerTT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/FaudreeT95,
author = {Ralph J. Faudree and
Zsolt Tuza},
title = {Stronger bounds for generalized degress and Menger path systems},
journal = {Discuss. Math. Graph Theory},
volume = {15},
number = {2},
pages = {167--177},
year = {1995},
url = {https://doi.org/10.7151/dmgt.1014},
doi = {10.7151/DMGT.1014},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/FaudreeT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EnomotoKKT95,
author = {Hikoe Enomoto and
Atsushi Kaneko and
Mekkia Kouider and
Zsolt Tuza},
title = {Degree Sums and Covering Cycles},
journal = {J. Graph Theory},
volume = {20},
number = {4},
pages = {419--422},
year = {1995},
url = {https://doi.org/10.1002/jgt.3190200405},
doi = {10.1002/JGT.3190200405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EnomotoKKT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonT95,
author = {Noga Alon and
Zsolt Tuza},
title = {The Acyclic Orientation Game on Random Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {261--268},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060213},
doi = {10.1002/RSA.3240060213},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tuza95,
author = {Zsolt Tuza},
title = {How to Make {A} Random Graph Irregular},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {323--330},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060219},
doi = {10.1002/RSA.3240060219},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Tuza95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GionfriddoMT94,
author = {Mario Gionfriddo and
Salvatore Milici and
Zsolt Tuza},
title = {Blocking Sets in SQS(2u)},
journal = {Comb. Probab. Comput.},
volume = {3},
pages = {77--86},
year = {1994},
url = {https://doi.org/10.1017/S0963548300000997},
doi = {10.1017/S0963548300000997},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GionfriddoMT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilT94,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Algorithmic complexity of list colorings},
journal = {Discret. Appl. Math.},
volume = {50},
number = {3},
pages = {297--302},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90150-3},
doi = {10.1016/0166-218X(94)90150-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tuza94,
author = {Zsolt Tuza},
title = {Inequalities for Minimal Covering Sets in Set Systems of Given Rank},
journal = {Discret. Appl. Math.},
volume = {51},
number = {1-2},
pages = {187--195},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90108-2},
doi = {10.1016/0166-218X(94)90108-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tuza94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HellMT94,
author = {Pavol Hell and
Yannis Manoussakis and
Zsolt Tuza},
title = {Packing Problems in Edge-colored Graphs},
journal = {Discret. Appl. Math.},
volume = {52},
number = {3},
pages = {295--306},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90148-1},
doi = {10.1016/0166-218X(94)90148-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HellMT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GionfriddoT94,
author = {Mario Gionfriddo and
Zsolt Tuza},
title = {On conjectures of Berge and Chv{\'{a}}tal},
journal = {Discret. Math.},
volume = {124},
number = {1-3},
pages = {79--86},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90086-8},
doi = {10.1016/0012-365X(94)90086-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GionfriddoT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza94a,
author = {Zsolt Tuza},
title = {Monochromatic coverings and tree Ramsey numbers},
journal = {Discret. Math.},
volume = {125},
number = {1-3},
pages = {377--384},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90179-1},
doi = {10.1016/0012-365X(94)90179-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza94b,
author = {Zsolt Tuza},
title = {Largest size and union of Helly families},
journal = {Discret. Math.},
volume = {127},
number = {1-3},
pages = {319--327},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(92)00488-D},
doi = {10.1016/0012-365X(92)00488-D},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza94b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MiliciT94,
author = {Salvatore Milici and
Zsolt Tuza},
title = {The spectrum of lambda-times repeated blocks for TS(upsilon, lambda)},
journal = {Discret. Math.},
volume = {129},
number = {1-3},
pages = {159--166},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(92)00510-X},
doi = {10.1016/0012-365X(92)00510-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MiliciT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza94,
author = {Zsolt Tuza},
title = {Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete
directed graphs},
journal = {Discret. Math.},
volume = {135},
number = {1-3},
pages = {335--347},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)00060-V},
doi = {10.1016/0012-365X(94)00060-V},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KratochvilT94,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Intersection Dimensions of Graph Classes},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {159--168},
year = {1994},
url = {https://doi.org/10.1007/BF02986660},
doi = {10.1007/BF02986660},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KratochvilT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BertramEHST94,
author = {Edward A. Bertram and
Paul Erd{\"{o}}s and
Peter Hor{\'{a}}k and
Jozef Sir{\'{a}}n and
Zsolt Tuza},
title = {Local and global average degree in graphs and multigraphs},
journal = {J. Graph Theory},
volume = {18},
number = {7},
pages = {647--661},
year = {1994},
url = {https://doi.org/10.1002/jgt.3190180702},
doi = {10.1002/JGT.3190180702},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BertramEHST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PoljakT94,
author = {Svatopluk Poljak and
Zsolt Tuza},
title = {The expected relative error of the polyhedral approximation of the
max-cut problem},
journal = {Oper. Res. Lett.},
volume = {16},
number = {4},
pages = {191--198},
year = {1994},
url = {https://doi.org/10.1016/0167-6377(94)90068-X},
doi = {10.1016/0167-6377(94)90068-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PoljakT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PoljakT94,
author = {Svatopluk Poljak and
Zsolt Tuza},
title = {Bipartite Subgraphs of Triangle-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {7},
number = {2},
pages = {307--313},
year = {1994},
url = {https://doi.org/10.1137/S0895480191196824},
doi = {10.1137/S0895480191196824},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PoljakT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderDJKKMT94,
author = {Hans L. Bodlaender and
Jitender S. Deogun and
Klaus Jansen and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Zsolt Tuza},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Ranking of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {292--304},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_56},
doi = {10.1007/3-540-59071-4\_56},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderDJKKMT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/NgocT93,
author = {Nguyen Van Ngoc and
Zsolt Tuza},
title = {Linear-Time Algorithms for the Max Cut Problem},
journal = {Comb. Probab. Comput.},
volume = {2},
pages = {201--210},
year = {1993},
url = {https://doi.org/10.1017/S0963548300000596},
doi = {10.1017/S0963548300000596},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/NgocT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BascoT93,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {Domination properties and induced subgraphs},
journal = {Discret. Math.},
volume = {111},
number = {1-3},
pages = {37--40},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90138-J},
doi = {10.1016/0012-365X(93)90138-J},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BascoT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaroT93,
author = {Yair Caro and
Zsolt Tuza},
title = {Bounded degrees and prescribed distances in graphs},
journal = {Discret. Math.},
volume = {111},
number = {1-3},
pages = {87--93},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90144-I},
doi = {10.1016/0012-365X(93)90144-I},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CaroT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza93,
author = {Zsolt Tuza},
title = {Multipartite Tur{\'{a}}n problem for connected graphs and hypergraphs},
journal = {Discret. Math.},
volume = {112},
number = {1-3},
pages = {199--206},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90234-K},
doi = {10.1016/0012-365X(93)90234-K},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BlazsikHPT93,
author = {Zolt{\'{a}}n Bl{\'{a}}zsik and
Mih{\'{a}}ly Hujter and
Andr{\'{a}}s Pluh{\'{a}}r and
Zsolt Tuza},
title = {Graphs with no induced C\({}_{\mbox{4}}\) and 2K\({}_{\mbox{2}}\)},
journal = {Discret. Math.},
volume = {115},
number = {1-3},
pages = {51--55},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90477-B},
doi = {10.1016/0012-365X(93)90477-B},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BlazsikHPT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PyberT93,
author = {L{\'{a}}szl{\'{o}} Pyber and
Zsolt Tuza},
title = {Menger-type theorems with restrictions on path lengths},
journal = {Discret. Math.},
volume = {120},
number = {1-3},
pages = {161--174},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90573-C},
doi = {10.1016/0012-365X(93)90573-C},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PyberT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HorakT93,
author = {Peter Hor{\'{a}}k and
Zsolt Tuza},
title = {Large s-representable set systems with low maximum degree},
journal = {Discret. Math.},
volume = {122},
number = {1-3},
pages = {205--217},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90296-6},
doi = {10.1016/0012-365X(93)90296-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HorakT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tuza93,
author = {Zsolt Tuza},
title = {Helly Property in Finite Set Systems},
journal = {J. Comb. Theory, Ser. {A}},
volume = {62},
number = {1},
pages = {1--14},
year = {1993},
timestamp = {Mon, 19 Jul 2004 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Tuza93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FarberHT93,
author = {Martin Farber and
Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {An upper bound on the number of cliques in a graph},
journal = {Networks},
volume = {23},
number = {3},
pages = {207--210},
year = {1993},
url = {https://doi.org/10.1002/net.3230230308},
doi = {10.1002/NET.3230230308},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FarberHT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KratochvilST93,
author = {Jan Kratochv{\'{\i}}l and
Petr Savick{\'{y}} and
Zsolt Tuza},
title = {One More Occurrence of Variables Makes Satisfiability Jump From Trivial
to NP-Complete},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {1},
pages = {203--210},
year = {1993},
url = {https://doi.org/10.1137/0222015},
doi = {10.1137/0222015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KratochvilST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChangFT93,
author = {Gerard J. Chang and
Martin Farber and
Zsolt Tuza},
title = {Algorithmic Aspects of Neighborhood Numbers},
journal = {{SIAM} J. Discret. Math.},
volume = {6},
number = {1},
pages = {24--29},
year = {1993},
url = {https://doi.org/10.1137/0406002},
doi = {10.1137/0406002},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChangFT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HujterT93,
author = {Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {The Number of Maximal Independent Sets in Triangle-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {6},
number = {2},
pages = {284--288},
year = {1993},
url = {https://doi.org/10.1137/0406022},
doi = {10.1137/0406022},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HujterT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/PoljakT93,
author = {Svatopluk Poljak and
Zsolt Tuza},
editor = {William J. Cook and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Paul D. Seymour},
title = {Maximum cuts and largest bipartite subgraphs},
booktitle = {Combinatorial Optimization, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, 1992/93},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {20},
pages = {181--244},
publisher = {{DIMACS/AMS}},
year = {1993},
url = {https://doi.org/10.1090/dimacs/020/04},
doi = {10.1090/DIMACS/020/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/PoljakT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KornerST92,
author = {J{\'{a}}nos K{\"{o}}rner and
G{\'{a}}bor Simonyi and
Zsolt Tuza},
title = {Perfect couples of graphs},
journal = {Comb.},
volume = {12},
number = {2},
pages = {179--192},
year = {1992},
url = {https://doi.org/10.1007/BF01204721},
doi = {10.1007/BF01204721},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KornerST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KornaiT92,
author = {Andr{\'{a}}s Kornai and
Zsolt Tuza},
title = {Narrowness, pathwidth, and their application in natural language processing},
journal = {Discret. Appl. Math.},
volume = {36},
number = {1},
pages = {87--92},
year = {1992},
url = {https://doi.org/10.1016/0166-218X(92)90208-R},
doi = {10.1016/0166-218X(92)90208-R},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KornaiT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BiroHT92,
author = {Mikl{\'{o}}s Bir{\'{o}} and
Mih{\'{a}}ly Hujter and
Zsolt Tuza},
title = {Precoloring extension. I. Interval graphs},
journal = {Discret. Math.},
volume = {100},
number = {1-3},
pages = {267--279},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90646-W},
doi = {10.1016/0012-365X(92)90646-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BiroHT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TruszczynskiT92,
author = {Miroslaw Truszczynski and
Zsolt Tuza},
title = {Rado's selection principle: applications to binary relations, graph
and hypergraph colorings and partially ordered sets},
journal = {Discret. Math.},
volume = {103},
number = {3},
pages = {301--312},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90322-7},
doi = {10.1016/0012-365X(92)90322-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TruszczynskiT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosGT92,
author = {Paul Erd{\"{o}}s and
Tibor Gallai and
Zsolt Tuza},
title = {Covering the cliques of a graph with vertices},
journal = {Discret. Math.},
volume = {108},
number = {1-3},
pages = {279--289},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90681-5},
doi = {10.1016/0012-365X(92)90681-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosGT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza92,
author = {Zsolt Tuza},
title = {Asymptotic growth of sparse saturated structures is locally determined},
journal = {Discret. Math.},
volume = {108},
number = {1-3},
pages = {397--402},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90692-9},
doi = {10.1016/0012-365X(92)90692-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tuza92,
author = {Zsolt Tuza},
title = {Graph coloring in linear time},
journal = {J. Comb. Theory, Ser. {B}},
volume = {55},
number = {2},
pages = {236--243},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90042-V},
doi = {10.1016/0095-8956(92)90042-V},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Tuza92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SiranT92,
author = {Jozef Sir{\'{a}}n and
Zsolt Tuza},
title = {Nearly uniform distribution of edges among \emph{k}-subgraphs of a
graph},
journal = {J. Graph Theory},
volume = {16},
number = {6},
pages = {591--604},
year = {1992},
url = {https://doi.org/10.1002/jgt.3190160606},
doi = {10.1002/JGT.3190160606},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SiranT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RodlT92,
author = {Vojtech R{\"{o}}dl and
Zsolt Tuza},
title = {Rainbow Subgraphs in Properly Edge-colored Graphs},
journal = {Random Struct. Algorithms},
volume = {3},
number = {2},
pages = {175--182},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030207},
doi = {10.1002/RSA.3240030207},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RodlT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TruszczynskiT91,
author = {Miroslaw Truszczynski and
Zsolt Tuza},
title = {Asymptotic results on saturated graphs},
journal = {Discret. Math.},
volume = {87},
number = {3},
pages = {309--314},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90140-W},
doi = {10.1016/0012-365X(91)90140-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TruszczynskiT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndreaeST91,
author = {Thomas Andreae and
Martin Schughart and
Zsolt Tuza},
title = {Clique-transversal sets of line graphs and complements of line graphs},
journal = {Discret. Math.},
volume = {88},
number = {1},
pages = {11--20},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90055-7},
doi = {10.1016/0012-365X(91)90055-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndreaeST91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JacobsonTT91,
author = {Michael S. Jacobson and
Miroslaw Truszczynski and
Zsolt Tuza},
title = {Decompositions of regular bipartite graphs},
journal = {Discret. Math.},
volume = {89},
number = {1},
pages = {17--27},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90396-J},
doi = {10.1016/0012-365X(91)90396-J},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JacobsonTT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFT91,
author = {Paul Erd{\"{o}}s and
Zolt{\'{a}}n F{\"{u}}redi and
Zsolt Tuza},
title = {Saturated r-uniform hypergraphs},
journal = {Discret. Math.},
volume = {98},
number = {2},
pages = {95--104},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90035-Z},
doi = {10.1016/0012-365X(91)90035-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ErdosFT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Tuza91,
author = {Zsolt Tuza},
title = {Perfect graph decompositions},
journal = {Graphs Comb.},
volume = {7},
number = {1},
pages = {89--93},
year = {1991},
url = {https://doi.org/10.1007/BF01789465},
doi = {10.1007/BF01789465},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Tuza91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CaroT91,
author = {Yair Caro and
Zsolt Tuza},
title = {Hypergraph coverings and local colorings},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {79--85},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90092-X},
doi = {10.1016/0095-8956(91)90092-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CaroT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tuza91,
author = {Zsolt Tuza},
title = {Extensions of Gallai's graph covering theorems for uniform hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {92--96},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90094-Z},
doi = {10.1016/0095-8956(91)90094-Z},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Tuza91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ErdosHT91,
author = {Paul Erd{\"{o}}s and
Andr{\'{a}}s Hajnal and
Zsolt Tuza},
title = {Local constraints ensuring small representing sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {58},
number = {1},
pages = {78--84},
year = {1991},
url = {https://doi.org/10.1016/0097-3165(91)90074-Q},
doi = {10.1016/0097-3165(91)90074-Q},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ErdosHT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaroT91,
author = {Yair Caro and
Zsolt Tuza},
title = {Improved lower bounds on \emph{k}-independence},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {99--107},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150110},
doi = {10.1002/JGT.3190150110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaroT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoerLT91,
author = {Martin J. M. de Boer and
Aristid Lindenmayer and
Zsolt Tuza},
title = {A Periodic Division Pattern that Cannot be Generated by {D0L} Systems},
journal = {Theor. Comput. Sci.},
volume = {83},
number = {2},
pages = {205--218},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90274-6},
doi = {10.1016/0304-3975(91)90274-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoerLT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChungGTT90,
author = {Fan R. K. Chung and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Zsolt Tuza and
William T. Trotter},
title = {The maximum number of edges in 2K\({}_{\mbox{2}}\)-free graphs of
bounded degree},
journal = {Discret. Math.},
volume = {81},
number = {2},
pages = {129--135},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90144-7},
doi = {10.1016/0012-365X(90)90144-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChungGTT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza90,
author = {Zsolt Tuza},
title = {Covering all cliques of a graph},
journal = {Discret. Math.},
volume = {86},
number = {1-3},
pages = {117--126},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90354-K},
doi = {10.1016/0012-365X(90)90354-K},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Tuza90,
author = {Zsolt Tuza},
title = {Contractions and minimal\emph{k}-colorability},
journal = {Graphs Comb.},
volume = {6},
number = {1},
pages = {51--59},
year = {1990},
url = {https://doi.org/10.1007/BF01787480},
doi = {10.1007/BF01787480},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Tuza90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Tuza90a,
author = {Zsolt Tuza},
title = {A conjecture on triangles of graphs},
journal = {Graphs Comb.},
volume = {6},
number = {4},
pages = {373--380},
year = {1990},
url = {https://doi.org/10.1007/BF01787705},
doi = {10.1007/BF01787705},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Tuza90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tuza90,
author = {Zsolt Tuza},
title = {Periodic String Division Generated by Deterministic {L} Systems},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {229--234},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90127-J},
doi = {10.1016/0020-0190(90)90127-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tuza90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BacsoT90,
author = {G{\'{a}}bor Bacs{\'{o}} and
Zsolt Tuza},
title = {A characterization of graphs without long induced paths},
journal = {J. Graph Theory},
volume = {14},
number = {4},
pages = {455--464},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140409},
doi = {10.1002/JGT.3190140409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BacsoT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ManoussakisT90,
author = {Yannis Manoussakis and
Zsolt Tuza},
title = {Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {4},
pages = {537--543},
year = {1990},
url = {https://doi.org/10.1137/0403046},
doi = {10.1137/0403046},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ManoussakisT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeGST89,
author = {Ralph J. Faudree and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Richard H. Schelp and
Zsolt Tuza},
title = {Induced matchings in bipartite graphs},
journal = {Discret. Math.},
volume = {78},
number = {1-2},
pages = {83--87},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90163-5},
doi = {10.1016/0012-365X(89)90163-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeGST89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AlonCT89,
author = {Noga Alon and
Yair Caro and
Zsolt Tuza},
title = {Sub-Ramsey numbers for arithmetic progressions},
journal = {Graphs Comb.},
volume = {5},
number = {1},
pages = {307--314},
year = {1989},
url = {https://doi.org/10.1007/BF01788685},
doi = {10.1007/BF01788685},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AlonCT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ErdosPPT89,
author = {Paul Erd{\"{o}}s and
J{\'{a}}nos Pach and
Richard Pollack and
Zsolt Tuza},
title = {Radius, diameter, and minimum degree},
journal = {J. Comb. Theory, Ser. {B}},
volume = {47},
number = {1},
pages = {73--79},
year = {1989},
url = {https://doi.org/10.1016/0095-8956(89)90066-X},
doi = {10.1016/0095-8956(89)90066-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ErdosPPT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PoljakT89,
author = {Svatopluk Poljak and
Zsolt Tuza},
title = {On the maximum number of qualitatively independent partitions},
journal = {J. Comb. Theory, Ser. {A}},
volume = {51},
number = {1},
pages = {111--116},
year = {1989},
url = {https://doi.org/10.1016/0097-3165(89)90081-2},
doi = {10.1016/0097-3165(89)90081-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PoljakT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tuza89,
author = {Zsolt Tuza},
title = {Minimum number of elements representing a set system of given rank},
journal = {J. Comb. Theory, Ser. {A}},
volume = {52},
number = {1},
pages = {84--89},
year = {1989},
url = {https://doi.org/10.1016/0097-3165(89)90064-2},
doi = {10.1016/0097-3165(89)90064-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Tuza89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuza88,
author = {Zsolt Tuza},
title = {Isomorphism of two infinite-chromatic triangle-free graphs},
journal = {Discret. Math.},
volume = {69},
number = {1},
pages = {95},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90181-1},
doi = {10.1016/0012-365X(88)90181-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuza88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasLT88,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Clumsy packing of dominoes},
journal = {Discret. Math.},
volume = {71},
number = {1},
pages = {33--46},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90028-3},
doi = {10.1016/0012-365X(88)90028-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasLT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tuza87a,
author = {Zsolt Tuza},
title = {On two intersecting set systems and k-continuous boolean functions},
journal = {Discret. Appl. Math.},
volume = {16},
number = {2},
pages = {183--185},
year = {1987},
url = {https://doi.org/10.1016/0166-218X(87)90074-6},
doi = {10.1016/0166-218X(87)90074-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tuza87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tuza87,
author = {Zsolt Tuza},
title = {On the context-free production complexity of finite languages},
journal = {Discret. Appl. Math.},
volume = {18},
number = {3},
pages = {293--304},
year = {1987},
url = {https://doi.org/10.1016/S0166-218X(87)80004-5},
doi = {10.1016/S0166-218X(87)80004-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tuza87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasT87,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Zsolt Tuza},
title = {An upper bound on the Ramsey number of trees},
journal = {Discret. Math.},
volume = {66},
number = {3},
pages = {309--310},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90107-5},
doi = {10.1016/0012-365X(87)90107-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/EdwardsJT87,
author = {Christopher S. Edwards and
Peter D. Johnson Jr. and
Zsolt Tuza},
title = {Another Extremal Property of Some Turan Graphs},
journal = {Eur. J. Comb.},
volume = {8},
number = {1},
pages = {27--28},
year = {1987},
url = {https://doi.org/10.1016/S0195-6698(87)80016-1},
doi = {10.1016/S0195-6698(87)80016-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/EdwardsJT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/TruszczynskiT87,
author = {Miroslaw Truszczynski and
Zsolt Tuza},
title = {Linear upper bounds for local Ramsey numbers},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {67--73},
year = {1987},
url = {https://doi.org/10.1007/BF01788530},
doi = {10.1007/BF01788530},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/TruszczynskiT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Tuza87,
author = {Zsolt Tuza},
title = {Inequalities for two set systems with prescribed intersections},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {75--80},
year = {1987},
url = {https://doi.org/10.1007/BF01788531},
doi = {10.1007/BF01788531},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Tuza87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/PoljakT87,
author = {Svatopluk Poljak and
Zsolt Tuza},
title = {Maximum bipartite subgraphs of Kneser graphs},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {191--199},
year = {1987},
url = {https://doi.org/10.1007/BF01788540},
doi = {10.1007/BF01788540},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/PoljakT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GyarfasLST87,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jeno Lehel and
Richard H. Schelp and
Zsolt Tuza},
title = {Ramsey numbers for local colorings},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {267--277},
year = {1987},
url = {https://doi.org/10.1007/BF01788549},
doi = {10.1007/BF01788549},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GyarfasLST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GyarfasLNRST87,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Jaroslav Nesetril and
Vojtech R{\"{o}}dl and
Richard H. Schelp and
Zsolt Tuza},
title = {Local \emph{k}-colorings of graphs and hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {43},
number = {2},
pages = {127--139},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90017-7},
doi = {10.1016/0095-8956(87)90017-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GyarfasLNRST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT86,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Neighborhood perfect graphs},
journal = {Discret. Math.},
volume = {61},
number = {1},
pages = {93--101},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90031-2},
doi = {10.1016/0012-365X(86)90031-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KaszonyiT86,
author = {L. K{\'{a}}szonyi and
Zsolt Tuza},
title = {Saturated graphs with minimal number of edges},
journal = {J. Graph Theory},
volume = {10},
number = {2},
pages = {203--210},
year = {1986},
url = {https://doi.org/10.1002/jgt.3190100209},
doi = {10.1002/JGT.3190100209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KaszonyiT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imycs/Tuza86,
author = {Zsolt Tuza},
editor = {Alica Kelemenov{\'{a}} and
Jozef Kelemen},
title = {Some combinatorial problems concerning finite languages},
booktitle = {Trends, Techniques, and Problems in Theoretical Computer Science,
4th International Meeting of Young Computer Scientists, Smolenice,
Czechoslovakia, October 13-17, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {281},
pages = {51--58},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3540185356\_30},
doi = {10.1007/3540185356\_30},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/imycs/Tuza86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasLT85,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {How many atoms can be defined by boxes},
journal = {Comb.},
volume = {5},
number = {3},
pages = {193--204},
year = {1985},
url = {https://doi.org/10.1007/BF02579362},
doi = {10.1007/BF02579362},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasLT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FurediT85,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Zsolt Tuza},
title = {Hypergraphs without a large star},
journal = {Discret. Math.},
volume = {55},
number = {3},
pages = {317--321},
year = {1985},
url = {https://doi.org/10.1016/S0012-365X(85)80009-1},
doi = {10.1016/S0012-365X(85)80009-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FurediT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/RodlT85,
author = {Vojtech R{\"{o}}dl and
Zsolt Tuza},
title = {On color critical graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {38},
number = {3},
pages = {204--213},
year = {1985},
url = {https://doi.org/10.1016/0095-8956(85)90066-8},
doi = {10.1016/0095-8956(85)90066-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/RodlT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tuza85,
author = {Zsolt Tuza},
title = {Critical hypergraphs and intersecting set-pair systems},
journal = {J. Comb. Theory, Ser. {B}},
volume = {39},
number = {2},
pages = {134--145},
year = {1985},
url = {https://doi.org/10.1016/0095-8956(85)90043-7},
doi = {10.1016/0095-8956(85)90043-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Tuza85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Tuza84,
author = {Zsolt Tuza},
title = {Covering of graphs by complete bipartite subgraphs; complexity of
0-1 matrices},
journal = {Comb.},
volume = {4},
number = {1},
pages = {111--116},
year = {1984},
url = {https://doi.org/10.1007/BF02579163},
doi = {10.1007/BF02579163},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Tuza84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasLT84,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {The structure of rectangle families dividing the plane into maximum
number of atoms},
journal = {Discret. Math.},
volume = {52},
number = {2-3},
pages = {177--198},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90080-3},
doi = {10.1016/0012-365X(84)90080-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasLT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Tuza84,
author = {Zsolt Tuza},
title = {Helly-type Hypergraphs and Sperner Families},
journal = {Eur. J. Comb.},
volume = {5},
number = {2},
pages = {185--187},
year = {1984},
url = {https://doi.org/10.1016/S0195-6698(84)80032-3},
doi = {10.1016/S0195-6698(84)80032-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Tuza84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT82,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Triangle-free partial graphs and edge covering theorems},
journal = {Discret. Math.},
volume = {39},
number = {1},
pages = {59--65},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90040-1},
doi = {10.1016/0012-365X(82)90040-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasST80,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Endre Szemer{\'{e}}di and
Zsolt Tuza},
title = {Induced subtrees in graphs of large chromatic number},
journal = {Discret. Math.},
volume = {30},
number = {3},
pages = {235--244},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90230-7},
doi = {10.1016/0012-365X(80)90230-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasST80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT80,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Ensembles d'articulation d'un graphe {\(\gamma\)}-critique},
journal = {Discret. Math.},
volume = {30},
number = {3},
pages = {245--248},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90231-9},
doi = {10.1016/0012-365X(80)90231-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-20 01:10 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:
