var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fpessoal.dainf.ct.utfpr.edu.br%2Fzatesko%2Flzpubl.bib&jsonp=1&theme=simple&authorFirst=1&owner=Zatesko&css=http%3A%2F%2Fwww.dainf.ct.utfpr.edu.br%2F%7Ezatesko%2Flz.css&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fpessoal.dainf.ct.utfpr.edu.br%2Fzatesko%2Flzpubl.bib&jsonp=1&theme=simple&authorFirst=1&owner=Zatesko&css=http%3A%2F%2Fwww.dainf.ct.utfpr.edu.br%2F%7Ezatesko%2Flz.css\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fpessoal.dainf.ct.utfpr.edu.br%2Fzatesko%2Flzpubl.bib&jsonp=1&theme=simple&authorFirst=1&owner=Zatesko&css=http%3A%2F%2Fwww.dainf.ct.utfpr.edu.br%2F%7Ezatesko%2Flz.css\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; Guedes, A. L. P.; Machado, R. C. S.; and Figueiredo, C. M. H.\n\n\n \n \n \n \n \n The hardness of recognising poorly matchable graphs and the hunting of the \\(d\\)-snark.\n \n \n \n \n\n\n \n\n\n\n 2024.\n to appear in RAIRO Operations Research\n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{dsnarks24,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes and R. C. S. Machado and C. M. H. Figueiredo},\n  title = {The hardness of recognising poorly matchable graphs and the hunting of the \\(d\\)-snark},\n  language = {english},\n  year = 2024,\n  url = {https://doi.org/10.1051/ro/2024068},\n  note = {to appear in RAIRO Operations Research}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; Groshaus, M. E.; and Montanheiro, G. L.\n\n\n \n \n \n \n \n Characterisation and total colouring of bipartite graphs with at most three bicliques.\n \n \n \n \n\n\n \n\n\n\n Matemática Contemporânea, 55: 105–113. 2023.\n X Latin-American Workshop on Cliques in Graphs (LAWCG '22)\n\n\n\n
\n\n\n\n \n \n \"CharacterisationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{matcomp23,\n  author = {L. M. Zatesko and M. E. Groshaus and G. L. Montanheiro},\n  title = {Characterisation and total colouring of bipartite graphs with at most three bicliques},\n  language = {english},\n  journal = {Matemática Contemporânea},\n  year = 2023,\n  volume = 55,\n  pages = {105--113},\n  note = {X Latin-American Workshop on Cliques in Graphs (LAWCG '22)},\n  url = {http://doi.org/10.21711/231766362023/rmc5512}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Costa, A. F. B.; Hepp, H.; Silva, M. V. G.; and Zatesko, L. M.\n\n\n \n \n \n \n \n The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs.\n \n \n \n \n\n\n \n\n\n\n In Proc. 43rd Congress of the Brazilian Computer Society (CSBC '23/VIII ETC), pages 99–103, João Pessoa, Brazil, 2023. \n \n\n\n\n
\n\n\n\n \n \n Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{abneretc23,\n  author = {A. F. B. Costa and H. Hepp and M. V. G. Silva and L. M. Zatesko},\n  language = {portuguese},\n  year = 2023,\n  title = {The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs},\n  booktitle = {Proc. 43rd Congress of the Brazilian Computer Society (CSBC '23/VIII ETC)},\n  address = {Jo\\~ao Pessoa, Brazil},\n  issn = {2595-6116},\n  url = {https://doi.org/10.5753/etc.2023.230017},\n  pages = {99--103}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zorzi, A.; Figueiredo, C. M. H.; Machado, R. C. S.; Zatesko, L. M.; and Souza, U. S.\n\n\n \n \n \n \n \n Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs.\n \n \n \n \n\n\n \n\n\n\n Discrete Appl. Math., 323: 311–323. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Compositions,Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{alesom21dam,\n  author = {A. Zorzi and C. M. H. Figueiredo and R. C. S. Machado and L. M. Zatesko and U. S. Souza},\n  title = {Compositions, Decompositions, and Comformability for Total Coloring of Power of Cycle Graphs},\n  language = {english},\n  journal = {Discrete Appl. Math.},\n  url = {https://doi.org/10.1016/j.dam.2021.06.012},\n  year = 2022,\n  volume = {323},\n  pages = {311--323}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Rocha, A.; Almeida, S. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Rainbow connectivity and rainbow criticality on graph classes.\n \n \n \n \n\n\n \n\n\n\n Discrete Appl. Math., 323: 349–363. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RainbowPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{aleffer21dam,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {Rainbow connectivity and rainbow criticality on graph classes},\n  language = {english},\n  year = 2022,\n  journal = {Discrete Appl. Math.},\n  url = {https://doi.org/10.1016/j.dam.2021.04.017},\n  volume = {323},\n  pages = {349--363}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Cunha, T. H. F. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n A New Bound for the Sum of Squares of Degrees in a Class 2 Graph.\n \n \n \n \n\n\n \n\n\n\n In Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22), pages 104, Curitiba, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg22-thiago,\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\n  title = {A New Bound for the Sum of Squares of Degrees in a Class 2 Graph},\n  language = {english},\n  year = 2022,\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22)},\n  address = {Curitiba},\n  pages = {104},\n  url = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Montanheiro, G. L.; Zatesko, L. M.; and Groshaus, M. E.\n\n\n \n \n \n \n \n On Total Colouring Bipartite Graphs with at Most Three Bicliques.\n \n \n \n \n\n\n \n\n\n\n In Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22), pages 48, Curitiba, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg22-gustavo,\n  author = {G. L. Montanheiro and L. M. Zatesko and M. E. Groshaus},\n  title = {On Total Colouring Bipartite Graphs with at Most Three Bicliques},\n  language = {english},\n  year = 2022,\n  booktitle = {Proc. X Latin American Workshop on Cliques in Graphs (LAWCG '22)},\n  address = {Curitiba},\n  pages = {48},\n  url = {https://www.lawcg.mat.br/lawcg22/LAWCG_2022_book_of_abstracts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n Castilho, J. P. K.; Campos, C. N.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Sobre Rotulações $\\mathcal L(h, k)$ de Caterpillars.\n \n \n \n \n\n\n \n\n\n\n In Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC), pages 62–65, Florianópolis, Brazil, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"SobrePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{castilho21etc,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  language = {portuguese},\n  year = 2021,\n  title = {Sobre Rotulações $\\mathcal L(h, k)$ de Caterpillars},\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},\n  address = {Florian\\'opolis, Brazil},\n  issn = {2595-6116},\n  url = {https://doi.org/10.5753/etc.2021.16381},\n  pages = {62--65}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Hepp, H.; Silva, M. V. G.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Um Algoritmo Quântico para um Problema de Distância Estatística.\n \n \n \n \n\n\n \n\n\n\n In Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC), pages 1–4, Florianópolis, Brazil, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"UmPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{henrique21etc,\n  author = {H. Hepp and M. V. G. Silva and L. M. Zatesko},\n  language = {portuguese},\n  year = 2021,\n  title = {Um Algoritmo Quântico para um Problema de Distância Estatística},\n  booktitle = {Proc. 41st Congress of the Brazilian Computer Society (CSBC '21/VI ETC)},\n  address = {Florian\\'opolis, Brazil},\n  issn = {2595-6116},\n  url = {https://doi.org/10.5753/etc.2021.16366},\n  pages = {1--4}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Cunha, T. H. F. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n An Extended Adjacency Lemma for Graph Edge-Coloring.\n \n \n \n \n\n\n \n\n\n\n In Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21), pages 43–47, Ponta Grossa, Brazil, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{thiago21wpccg,\n  author = {T. H. F. M. Cunha and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {An Extended Adjacency Lemma for Graph Edge-Coloring},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {43--47},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Castilho, J. P. K.; Campos, C. N.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Proper $\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets.\n \n \n \n \n\n\n \n\n\n\n In Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21), pages 48–53, Ponta Grossa, Brazil, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"ProperPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{castilho21wpccg,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {Proper $\\mathcal L(h, k)$-labelling of Caterpillars and Multisunlets},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {48--53},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Dias, M. G.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Grover's Quantum Algorithm and the Maximum Clique Problem.\n \n \n \n \n\n\n \n\n\n\n In Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21), pages 54–59, Ponta Grossa, Brazil, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Grover'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{matheus21wpccg,\n  author = {M. G. Dias and L. M. Zatesko},\n  language = {english},\n  year = 2021,\n  title = {Grover's Quantum Algorithm and the Maximum Clique Problem},\n  booktitle = {Proc. 4th Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '21)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  pages = {54--59},\n  url = {http://www.wpccg.pro.br/volume004.html}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; Zorzi, A.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n Edge-colouring Graphs with Bounded Local Degree Sums.\n \n \n \n \n\n\n \n\n\n\n Discrete Appl. Math., 281: 268–283. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Edge-colouringPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{zatesko20phd,\n  author = {L. M. Zatesko and A. Zorzi and R. Carmo and A. L. P. Guedes},\n  title = {Edge-colouring Graphs with Bounded Local Degree Sums},\n  language = {english},\n  year = 2020,\n  journal = {Discrete Appl. Math.},\n  volume = 281,\n  pages = {268--283},\n  url = {https://doi.org/10.1016/j.dam.2020.03.044}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Rocha, A.; Almeida, S. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n A Near-tight Bound for the Rainbow Connection Number of Snake Graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20), pages 12, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg20-raz,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {A Near-tight Bound for the Rainbow Connection Number of Snake Graphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\n  pages = 12,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Castilho, J. P. K.; Campos, C. N.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Rotulação $\\mathcal L(h, k)$ dos Sunlets.\n \n \n \n \n\n\n \n\n\n\n In Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20), pages 19, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"RotulaçãoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg20-ccz,\n  author = {J. P. K. Castilho and C. N. Campos and L. M. Zatesko},\n  title = {Rotulação $\\mathcal L(h, k)$ dos Sunlets},\n  language = {portuguese},\n  year = 2020,\n  booktitle = {Proc. IX Latin American Workshop on Cliques in Graphs (LAWCG '20)},\n  pages = 19,\n  url = {https://www.lawcg.mat.br/lawcg20/assets/abstracts/LAWCG_MDA20_book_of_abstracts.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Rocha, A.; Almeida, S. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n The Rainbow Connection Number of Triangular Snake Graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC), pages 65–68, Porto Alegre, Brazil, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{etc20aleffer,\n  author = {A. Rocha and S. M. Almeida and L. M. Zatesko},\n  title = {The Rainbow Connection Number of Triangular Snake Graphs},\n  language = {english},\n  year = 2020,\n  booktitle = {Proc. 40th Congress of the Brazilian Computer Society (CSBC '20/V ETC)},\n  address = {Porto Alegre, Brazil},\n  issn = {2595-6116},\n  pages = {65--68},\n  url = {https://sol.sbc.org.br/index.php/etc/article/view/11091}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n Novel Procedures for Graph Edge-colouring.\n \n \n \n \n\n\n \n\n\n\n In Proc. 32th Theses and Dissertations Contest of the Brazilian Computer Society (CTD '19), Belém, Brazil, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"NovelPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{ctd19,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {Novel Procedures for Graph Edge-colouring},\n  language = {english},\n  year = 2019,\n  booktitle = {Proc. 32th Theses and Dissertations Contest of the Brazilian Computer Society (CTD '19)},\n  address = {Belém, Brazil},\n  url = {https://doi.org/10.5753/ctd.2019.6331}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n Novel Procedures for Graph Edge-colouring.\n \n \n \n \n\n\n \n\n\n\n In Proc. Best Doctoral Thesis Prize at 51th Brazilian Symposium on Operations Research (SBPO '19), Limeira, Brazil, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"NovelPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{sbpo19,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {Novel Procedures for Graph Edge-colouring},\n  language = {english},\n  year = 2019,\n  booktitle = {Proc. Best Doctoral Thesis Prize at 51th Brazilian Symposium on Operations Research (SBPO '19)},\n  address = {Limeira, Brazil},\n  url = {https://proceedings.science/sbpo-2019/papers/novel-procedures-for-graph-edge-colouring}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Bernardi, J. P. W.; Silva, M. V. G.; Guedes, A. L. P.; and Zatesko, L. M.\n\n\n \n \n \n \n \n The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal.\n \n \n \n \n\n\n \n\n\n\n In Proc. X Latin and American Algorithms, Graphs, and Optimization Symposium (LAGOS '19), volume 346, of Electron. Notes Theor. Comput. Sci., pages 125–133, Belo Horizonte, Brazil, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lagos19-joao,\n  author = {J. P. W. Bernardi and M. V. G. Silva and A. L. P. Guedes and L. M. Zatesko},\n  language = {english},\n  title = {The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal},\n  booktitle = {Proc. X Latin and American Algorithms, Graphs, and Optimization Symposium (LAGOS '19)},\n  address = {Belo Horizonte, Brazil},\n  volume = {346},\n  series = {Electron. Notes Theor. Comput. Sci.},\n  year = 2019,\n  pages = {125--133},\n  url = {https://doi.org/10.1016/j.entcs.2019.08.012}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; and Vieira, E. A.\n\n\n \n \n \n \n \n P = NP or 5-Snarks Exist.\n \n \n \n \n\n\n \n\n\n\n In Proc. 3rd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '19), pages 135–140, Ponta Grossa, Brazil, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"PPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{wpccg19-za,\n  author = {L. M. Zatesko and E. A. Vieira},\n  title = {P = NP or 5-Snarks Exist},\n  language = {english},\n  year = 2019,\n  booktitle = {Proc. 3rd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '19)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  url = {http://www.wpccg.pro.br/wpccg2019/papers/paper\\_38},\n  pages = {135--140}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Hepp, H.; Silva, M. V. G.; and Zatesko, L. M.\n\n\n \n \n \n \n \n Uma Revisão sobre a Relação de BQP com outras Classes de Complexidade Computacional.\n \n \n \n \n\n\n \n\n\n\n In Proc. 3rd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '19), pages 74–79, Ponta Grossa, Brazil, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"UmaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{wpccg19-hh,\n  author = {H. Hepp and Murilo V. G. Silva and L. M. Zatesko},\n  title = {Uma Revisão sobre a Relação de BQP com outras Classes de Complexidade Computacional},\n  language = {english},\n  year = 2019,\n  booktitle = {Proc. 3rd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '19)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  url = {http://www.wpccg.pro.br/wpccg2019/papers/paper\\_6},\n  pages = {74--79}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Bernardi, J. P. W.; de Almeida, S. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n A Connectivity-based Decomposition for Graph Edge-colouring.\n \n \n \n \n\n\n \n\n\n\n Matemática Contemporânea, 46: 156–164. 2019.\n VIII Latin-American Workshop on Cliques in Graphs (LAWCG '18)\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{matcomp19,\n  author = {L. M. Zatesko and J. P. W. Bernardi and S. M. de Almeida and R. Carmo and A. L. P. Guedes},\n  title = {A Connectivity-based Decomposition for Graph Edge-colouring},\n  journal = {Matemática Contemporânea},\n  year = 2019,\n  volume = 46,\n  pages = {156--164},\n  note = {VIII Latin-American Workshop on Cliques in Graphs (LAWCG '18)},\n  url = {http://mc.sbm.org.br/wp-content/uploads/sites/15/2019/12/P16.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; Guedes, A. L. P.; Zorzi, A.; Machado, R. C. S.; and Figueiredo, C. M. H.\n\n\n \n \n \n \n \n On The Chromatic Index of Complementary Prisms.\n \n \n \n \n\n\n \n\n\n\n In Proc. X European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '19), volume 88, of Acta Math. Univ. Comenianae, pages 1071–1077, Bratislava, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{eurocomb19,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes and A. Zorzi and R. C. S. Machado and C. M. H. Figueiredo},\ntitle = {On The Chromatic Index of Complementary Prisms},\nbooktitle = {Proc. X European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '19)},\naddress = {Bratislava},\nyear = 2019,\nlanguage = {english},\nvolume = {88},\nseries = {Acta Math. Univ. Comenianae},\nnumber = 3,\npages = {1071--1077},\nurl = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1208}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.\n\n\n \n \n \n \n \n Novel Procedures for Graph Edge-colouring.\n \n \n \n \n\n\n \n\n\n\n Ph.D. Thesis, Federal University of Paraná, 2018.\n \n\n\n\n
\n\n\n\n \n \n \"NovelPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@phdthesis{zatesko18,\n  author = {L. M. Zatesko},\n  title = {Novel Procedures for Graph Edge-colouring},\n  school = {Federal University of Paraná},\n  year = 2018,\n  language = {english},\n  url = {https://acervodigital.ufpr.br/handle/1884/58639}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zorzi, A.; and Zatesko, L. M.\n\n\n \n \n \n \n \n On the chromatic index of join graphs and triangle-free graphs with large maximum degree.\n \n \n \n \n\n\n \n\n\n\n Discrete Appl. Math., 245: 183–189. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{zatesko:zorzi16,\n  author = {A. Zorzi and L. M. Zatesko},\n  language = {english},\n  title = {On the chromatic index of join graphs and triangle-free graphs with large maximum degree},\n  journal = {Discrete Appl. Math.},\n  volume = 245,\n  year = 2018,\n  pages = {183--189},\n  url = {http://dx.doi.org/10.1016/j.dam.2016.10.022}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n Upper bounds for the total chromatic number of join graphs and cobipartite graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. 7th International Conference on Operations Research and Enterprise Systems (ICORES '18), pages 247–253, Funchal, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"UpperPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{icores18,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {Upper bounds for the total chromatic number of join graphs and cobipartite graphs},\n  language = {english},\n  year = 2018,\n  booktitle = {Proc. 7th International Conference on Operations Research and Enterprise Systems (ICORES '18)},\n  address = {Funchal},\n  pages = {247--253},\n  url = {http://dx.doi.org/10.5220/0006627102470253}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Bernardi, J. P. W.; Almeida, S. M.; and Zatesko, L. M.\n\n\n \n \n \n \n \n On Total and Edge-colouring of Proper Circular-arc Graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. 38th Congress of the Brazilian Computer Society (CSBC '18/III ETC), pages 73–76, Natal, Brazil, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{etc18,\n  author = {J. P. W. Bernardi and S. M. Almeida and L. M. Zatesko},\n  title = {On Total and Edge-colouring of Proper Circular-arc Graphs},\n  language = {english},\n  year = 2018,\n  booktitle = {Proc. 38th Congress of the Brazilian Computer Society (CSBC '18/III ETC)},\n  address = {Natal, Brazil},\n  issn = {2175-2761},\n  pages = {73--76},\n  url = {http://natal.uern.br/eventos/csbc2018/wp-content/uploads/2018/08/Anais-ETC-2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Bernardi, J. P. W.; Almeida, S. M.; Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n A Decomposition for Edge-colouring.\n \n \n \n \n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs (LAWCG '18), pages 35, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg18-baz,\n  author = {J. P. W. Bernardi and S. M. Almeida and L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {A Decomposition for Edge-colouring},\n  language = {english},\n  year = 2018,\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs (LAWCG '18)},\n  address = {Rio de Janeiro},\n  pages = {35},\n  url = {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n A Recolouring Procedure for Total Colouring.\n \n \n \n \n\n\n \n\n\n\n In Proc. VIII Latin American Workshop on Cliques in Graphs (LAWCG '18), pages 31, Rio de Janeiro, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{lawcg18-zcg,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {A Recolouring Procedure for Total Colouring},\n  language = {english},\n  year = 2018,\n  booktitle = {Proc. VIII Latin American Workshop on Cliques in Graphs (LAWCG '18)},\n  address = {Rio de Janeiro},\n  pages = {31},\n  url = {http://lawcg2018.icomp.ufam.edu.br/images/LAWCG2018-annals2018.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n Edge-colouring of triangle-free graphs with no proper majors.\n \n \n \n \n\n\n \n\n\n\n In Proc. 37th Congress of the Brazilian Computer Society (CSBC '17/II ETC), pages 71–74, São Paulo, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Edge-colouringPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{etc17,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {Edge-colouring of triangle-free graphs with no proper majors},\n  language = {english},\n  year = 2017,\n  booktitle = {Proc. 37th Congress of the Brazilian Computer Society (CSBC '17/II ETC)},\n  address = {São Paulo},\n  issn = {2175--2761},\n  pages = {71--74},\n  url = {http://csbc2017.mackenzie.br/public/files/2-etc/artigos/13.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n Zatesko, L. M.; Carmo, R.; and Guedes, A. L. P.\n\n\n \n \n \n \n \n On a conjecture on edge-colouring join graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. 2nd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '17), pages 69–72, Ponta Grossa, Brazil, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{wpccg17,\n  author = {L. M. Zatesko and R. Carmo and A. L. P. Guedes},\n  title = {On a conjecture on edge-colouring join graphs},\n  language = {english},\n  year = 2017,\n  booktitle = {Proc. 2nd Workshop de Pesquisa em Computação dos Campos Gerais (WPCCG '17)},\n  address = {Ponta Grossa, Brazil},\n  issn = {2526-1371},\n  url = {http://www.wpccg.pro.br/wpccg2017/papers/paper\\_16},\n  pages = {69--72}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Cunha Lima, A. R.; Garcia, G.; Zatesko, L. M.; and Almeida, S. M.\n\n\n \n \n \n \n \n On the chromatic index of cographs and join graphs.\n \n \n \n \n\n\n \n\n\n\n In Proc. VIII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS '15), volume 50, of Electron. Notes Discrete Math., pages 433–438, Beberibe, Brazil, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{zatesko:almeida:etal:15,\n  author = {A. R. {Cunha Lima} and G. Garcia and L. M. Zatesko and S. M. Almeida},\n  language = {english},\n  title = {On the chromatic index of cographs and join graphs},\n  booktitle = {Proc. VIII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS '15)},\n  address = {Beberibe, Brazil},\n  volume = {50},\n  series = {Electron. Notes Discrete Math.},\n  year = 2015,\n  pages = {433--438},\n  url = {http://dx.doi.org/10.1016/j.endm.2015.07.072}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zatesko, L. M.; and Donadelli Jr., J.\n\n\n \n \n \n \n \n Deterministic and efficient minimal perfect hashing schemes.\n \n \n \n \n\n\n \n\n\n\n Revista de Informática Teórica e Aplicada, 20(2): 56–72. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"DeterministicPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{rita13,\n  author = {L. M. Zatesko and J. {Donadelli Jr.}},\n  title = {Deterministic and efficient minimal perfect hashing schemes},\n  journal = {Revista de Informática Teórica e Aplicada},\n  volume = 20,\n  number = 2,\n  year = 2013,\n  language = {english},\n  url = {https://doi.org/10.22456/2175-2745.26905},\n  pages = {56--72}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);