Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andrzej Grzesik
@article{DBLP:journals/cpc/GrzesikKP24,
author = {Andrzej Grzesik and
Daniel Kr{\'{a}}l' and
Oleg Pikhurko},
title = {Forcing generalised quasirandom graphs efficiently},
journal = {Comb. Probab. Comput.},
volume = {33},
number = {1},
pages = {16--31},
year = {2024},
url = {https://doi.org/10.1017/s0963548323000263},
doi = {10.1017/S0963548323000263},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GrzesikKP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BabinskiG24,
author = {Sebastian Babinski and
Andrzej Grzesik},
title = {Maximal edge colorings of graphs},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103824},
year = {2024},
url = {https://doi.org/10.1016/j.ejc.2023.103824},
doi = {10.1016/J.EJC.2023.103824},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BabinskiG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BabinskiG24,
author = {Sebastian Babinski and
Andrzej Grzesik},
title = {Graphs without a Rainbow Path of Length 3},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {629--644},
year = {2024},
url = {https://doi.org/10.1137/22m1535048},
doi = {10.1137/22M1535048},
timestamp = {Thu, 22 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BabinskiG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GrzesikGST23,
author = {Andrzej Grzesik and
Ervin Gy{\"{o}}ri and
Nika Salia and
Casey Tompkins},
title = {Subgraph Densities in {\textdollar}K{\_}r{\textdollar}-Free Graphs},
journal = {Electron. J. Comb.},
volume = {30},
number = {1},
year = {2023},
url = {https://doi.org/10.37236/11329},
doi = {10.37236/11329},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GrzesikGST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GrzesikKLV23,
author = {Andrzej Grzesik and
Daniel Kr{\'{a}}l' and
L{\'{a}}szl{\'{o}} Mikl{\'{o}}s Lov{\'{a}}sz and
Jan Volec},
title = {Cycles of a given length in tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {158},
number = {Part},
pages = {117--145},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2022.07.007},
doi = {10.1016/J.JCTB.2022.07.007},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/GrzesikKLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GrzesikIKK23,
author = {Andrzej Grzesik and
Daniel Il'kovic and
Bartlomiej Kielak and
Daniel Kr{\'{a}}l'},
title = {Quasirandom-Forcing Orientations of Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {4},
pages = {2689--2716},
year = {2023},
url = {https://doi.org/10.1137/23m1548700},
doi = {10.1137/23M1548700},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/GrzesikIKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GrzesikLLV22,
author = {Andrzej Grzesik and
Joonkyung Lee and
Bernard Lidick{\'{y}} and
Jan Volec},
title = {On tripartite common graphs},
journal = {Comb. Probab. Comput.},
volume = {31},
number = {5},
pages = {907--923},
year = {2022},
url = {https://doi.org/10.1017/S0963548322000074},
doi = {10.1017/S0963548322000074},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GrzesikLLV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BozykGK22,
author = {Lukasz Bozyk and
Andrzej Grzesik and
Bartlomiej Kielak},
title = {On the inducibility of oriented graphs on four vertices},
journal = {Discret. Math.},
volume = {345},
number = {7},
pages = {112874},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112874},
doi = {10.1016/J.DISC.2022.112874},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BozykGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BonamyBGHM0O22,
author = {Marthe Bonamy and
Lukasz Bozyk and
Andrzej Grzesik and
Meike Hatzel and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Karolina Okrasa},
title = {Tuza's Conjecture for Threshold Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {24},
number = {1},
year = {2022},
url = {https://doi.org/10.46298/dmtcs.7660},
doi = {10.46298/DMTCS.7660},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/BonamyBGHM0O22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CooperGKK22,
author = {Jacob W. Cooper and
Andrzej Grzesik and
Adam Kabela and
Daniel Kr{\'{a}}l'},
title = {Packing and covering directed triangles asymptotically},
journal = {Eur. J. Comb.},
volume = {101},
pages = {103462},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2021.103462},
doi = {10.1016/J.EJC.2021.103462},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CooperGKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GrzesikJN22,
author = {Andrzej Grzesik and
Oliver Janzer and
Zolt{\'{a}}n L{\'{o}}r{\'{a}}nt Nagy},
title = {The Tur{\'{a}}n number of blow-ups of trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {156},
pages = {299--309},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.05.004},
doi = {10.1016/J.JCTB.2022.05.004},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/GrzesikJN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GrzesikK22,
author = {Andrzej Grzesik and
Bartlomiej Kielak},
title = {On the maximum number of odd cycles in graphs without smaller odd
cycles},
journal = {J. Graph Theory},
volume = {99},
number = {2},
pages = {240--246},
year = {2022},
url = {https://doi.org/10.1002/jgt.22738},
doi = {10.1002/JGT.22738},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GrzesikK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GrzesikGPSTZ22,
author = {Andrzej Grzesik and
Ervin Gy{\"{o}}ri and
Addisu Paulos and
Nika Salia and
Casey Tompkins and
Oscar Zamora},
title = {The maximum number of paths of length three in a planar graph},
journal = {J. Graph Theory},
volume = {101},
number = {3},
pages = {493--510},
year = {2022},
url = {https://doi.org/10.1002/jgt.22836},
doi = {10.1002/JGT.22836},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GrzesikGPSTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrzesikKPP22,
author = {Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Polynomial-time Algorithm for Maximum Weight Independent Set on \emph{P}\({}_{\mbox{6}}\)-free
Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {1},
pages = {4:1--4:57},
year = {2022},
url = {https://doi.org/10.1145/3414473},
doi = {10.1145/3414473},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GrzesikKPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GrzesikKPP21,
author = {Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Covering Minimal Separators and Potential Maximal Cliques in {\textdollar}P{\_}t{\textdollar}-Free
Graphs},
journal = {Electron. J. Comb.},
volume = {28},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.37236/9473},
doi = {10.37236/9473},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GrzesikKPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AaronsonGGJK21,
author = {James Aaronson and
Carla Groenland and
Andrzej Grzesik and
Tom Johnston and
Bartlomiej Kielak},
title = {Exact hyperplane covers for subsets of the hypercube},
journal = {Discret. Math.},
volume = {344},
number = {9},
pages = {112490},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112490},
doi = {10.1016/J.DISC.2021.112490},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/AaronsonGGJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-09871,
author = {Marthe Bonamy and
Lukasz Bozyk and
Andrzej Grzesik and
Meike Hatzel and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Karolina Okrasa},
title = {Tuza's Conjecture for Threshold Graphs},
journal = {CoRR},
volume = {abs/2105.09871},
year = {2021},
url = {https://arxiv.org/abs/2105.09871},
eprinttype = {arXiv},
eprint = {2105.09871},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-09871.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/ChanGKN20,
author = {Timothy F. N. Chan and
Andrzej Grzesik and
Daniel Kr{\'{a}}l' and
Jonathan A. Noel},
title = {Cycles of length three and four in tournaments},
journal = {J. Comb. Theory, Ser. {A}},
volume = {175},
pages = {105276},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2020.105276},
doi = {10.1016/J.JCTA.2020.105276},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/ChanGKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-12345,
author = {Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Covering minimal separators and potential maximal cliques in P\({}_{\mbox{t}}\)-free
graphs},
journal = {CoRR},
volume = {abs/2003.12345},
year = {2020},
url = {https://arxiv.org/abs/2003.12345},
eprinttype = {arXiv},
eprint = {2003.12345},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-12345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GrzesikHV19,
author = {Andrzej Grzesik and
Ping Hu and
Jan Volec},
title = {Minimum number of edges that occur in odd cycles},
journal = {J. Comb. Theory, Ser. {B}},
volume = {137},
pages = {65--103},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.12.003},
doi = {10.1016/J.JCTB.2018.12.003},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GrzesikHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcc/GrzesikK19,
author = {Andrzej Grzesik and
Daniel Kr{\'{a}}l},
editor = {Allan Lo and
Richard Mycroft and
Guillem Perarnau and
Andrew Treglown},
title = {Analytic representations of large graphs},
booktitle = {Surveys in Combinatorics, 2019: Invited lectures from the 27th British
Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019},
pages = {57--88},
publisher = {Cambridge University Press},
year = {2019},
url = {https://doi.org/10.1017/9781108649094.003},
doi = {10.1017/9781108649094.003},
timestamp = {Mon, 10 Jan 2022 15:48:34 +0100},
biburl = {https://dblp.org/rec/conf/bcc/GrzesikK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrzesikKPP19,
author = {Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Timothy M. Chan},
title = {Polynomial-time algorithm for Maximum Weight Independent Set on P6-free
graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1257--1271},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.77},
doi = {10.1137/1.9781611975482.77},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/GrzesikKPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CooperGK18,
author = {Jacob W. Cooper and
Andrzej Grzesik and
Daniel Kr{\'{a}}l'},
title = {Optimal-size clique transversals in chordal graphs},
journal = {J. Graph Theory},
volume = {89},
number = {4},
pages = {479--493},
year = {2018},
url = {https://doi.org/10.1002/jgt.22362},
doi = {10.1002/JGT.22362},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CooperGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01141,
author = {Andrzej Grzesik and
Daniel Kr{\'{a}}l' and
L{\'{a}}szl{\'{o}} Mikl{\'{o}}s Lov{\'{a}}sz},
title = {Elusive extremal graphs},
journal = {CoRR},
volume = {abs/1807.01141},
year = {2018},
url = {http://arxiv.org/abs/1807.01141},
eprinttype = {arXiv},
eprint = {1807.01141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Grzesik17,
author = {Andrzej Grzesik},
title = {On the Caccetta-H{\"{a}}ggkvist Conjecture with a Forbidden Transitive
Tournament},
journal = {Electron. J. Comb.},
volume = {24},
number = {2},
pages = {2},
year = {2017},
url = {https://doi.org/10.37236/5954},
doi = {10.37236/5954},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Grzesik17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GrzesikKL17,
author = {Andrzej Grzesik and
Daniel Kr{\'{a}}l' and
L{\'{a}}szl{\'{o}} Mikl{\'{o}}s Lov{\'{a}}sz},
title = {Extremal graph theory and finite forcibility},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {541--547},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.07.005},
doi = {10.1016/J.ENDM.2017.07.005},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GrzesikKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrzesikKPP17,
author = {Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Polynomial-time algorithm for Maximum Weight Independent Set on {\textdollar}P{\_}6{\textdollar}-free
graphs},
journal = {CoRR},
volume = {abs/1707.05491},
year = {2017},
url = {http://arxiv.org/abs/1707.05491},
eprinttype = {arXiv},
eprint = {1707.05491},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GrzesikKPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrzesikHV16,
author = {Andrzej Grzesik and
Ping Hu and
Jan Volec},
title = {Minimum number of edges that occur in odd cycles},
journal = {CoRR},
volume = {abs/1605.09055},
year = {2016},
url = {http://arxiv.org/abs/1605.09055},
eprinttype = {arXiv},
eprint = {1605.09055},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GrzesikHV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/GrzesikMNNPS15,
author = {Andrzej Grzesik and
Mirjana Mikalacki and
Zolt{\'{a}}n L{\'{o}}r{\'{a}}nt Nagy and
Alon Naor and
Bal{\'{a}}zs Patk{\'{o}}s and
Fiona Skerman},
title = {Avoider-Enforcer star games},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {1},
pages = {145--160},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2124},
doi = {10.46298/DMTCS.2124},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/GrzesikMNNPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GlebovGKK15,
author = {Roman Glebov and
Andrzej Grzesik and
Tereza Klimosov{\'{a}} and
Daniel Kr{\'{a}}l},
title = {Finitely forcible graphons and permutons},
journal = {J. Comb. Theory, Ser. {B}},
volume = {110},
pages = {112--135},
year = {2015},
url = {https://doi.org/10.1016/j.jctb.2014.07.007},
doi = {10.1016/J.JCTB.2014.07.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GlebovGKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GrzesikMS15,
author = {Andrzej Grzesik and
Michal Morayne and
Malgorzata Sulkowska},
title = {From Directed Path to Linear Order - The Best Choice Problem for Powers
of Directed Path},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {500--513},
year = {2015},
url = {https://doi.org/10.1137/130950689},
doi = {10.1137/130950689},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GrzesikMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GrzesikK14,
author = {Andrzej Grzesik and
Hrant Khachatrian},
title = {Interval edge-colorings of K\({}_{\mbox{1, m, n}}\)},
journal = {Discret. Appl. Math.},
volume = {174},
pages = {140--145},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.04.003},
doi = {10.1016/J.DAM.2014.04.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GrzesikK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GrzesikK13,
author = {Andrzej Grzesik and
Hrant Khachatrian},
title = {Interval edge-colorings of K{\_}\{1, m, n\}},
journal = {CoRR},
volume = {abs/1308.4431},
year = {2013},
url = {http://arxiv.org/abs/1308.4431},
eprinttype = {arXiv},
eprint = {1308.4431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GrzesikK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Grzesik12,
author = {Andrzej Grzesik},
title = {Indicated coloring of graphs},
journal = {Discret. Math.},
volume = {312},
number = {23},
pages = {3467--3472},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.07.001},
doi = {10.1016/J.DISC.2012.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Grzesik12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Grzesik12,
author = {Andrzej Grzesik},
title = {On the maximum number of five-cycles in a triangle-free graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {102},
number = {5},
pages = {1061--1066},
year = {2012},
url = {https://doi.org/10.1016/j.jctb.2012.04.001},
doi = {10.1016/J.JCTB.2012.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Grzesik12.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-04-02 20:09 CEST 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:
