| On the chromatic index of complementary prisms LM Zatesko, R Carmo, ALP Guedes, A Zorzi, RCS Machado, ... Acta Mathematica Universitatis Comenianae 88 (3), 1071-1077, 2019 | 13 | 2019 |
| Compositions, decompositions, and conformability for total coloring on power of cycle graphs A Zorzi, CMH Figueiredo, RCS Machado, LM Zatesko, US Souza Discrete Applied Mathematics 323, 349-363, 2022 | 8 | 2022 |
| On the chromatic index of join graphs and triangle-free graphs with large maximum degree A Zorzi, LM Zatesko Discrete Applied Mathematics 245, 183-189, 2018 | 6 | 2018 |
| On the chromatic index of cographs and join graphs ARC Lima, G Garcia, LM Zatesko, SM de Almeida Electronic Notes in Discrete Mathematics 50, 433-438, 2015 | 6 | 2015 |
| Novel procedures for graph edge-colouring LM Zatesko Universidade Federal do Paraná, 2018 | 3 | 2018 |
| Edge-colouring graphs with bounded local degree sums LM Zatesko, A Zorzi, R Carmo, ALP Guedes Discrete Applied Mathematics 281, 268-283, 2020 | 2 | 2020 |
| The Rainbow Connection Number of Triangular Snake Graphs A Rocha, SM Almeida, LM Zatesko Anais do V Encontro de Teoria da Computação, 65-68, 2020 | 2 | 2020 |
| Edge-colouring of triangle-free graphs with no proper majors LM Zatesko, R Carmo, ALP Guedes Anais do II Encontro de Teoria da Computação, 2017 | 2 | 2017 |
| On total and edge-colouring of proper circular-arc graphs JPW Bernardi, SM de Almeida, LM Zatesko Anais do III Encontro de Teoria da Computação, 2018 | 1 | 2018 |
| The hardness of recognising poorly matchable graphs and the hunting of the d-snark LM Zatesko, R Carmo, ALP Guedes, RCS Machado, CMH Figueiredo RAIRO-Operations Research 58 (3), 2055-2073, 2024 | | 2024 |
| The Hidden Subgroup Problem and Non-interactive Perfect Zero-Knowledge Proofs AFB Costa, H Hepp, MVG da Silva, LM Zatesko Anais do VIII Encontro de Teoria da Computação, 99-103, 2023 | | 2023 |
| Rainbow connectivity and rainbow criticality on graph classes A Rocha, SM Almeida, LM Zatesko Discrete Applied Mathematics 323, 311-323, 2022 | | 2022 |
| Um Algoritmo Quântico para um Problema de Distância Estatística H Hepp, MVG da Silva, LM Zatesko Anais do VI Encontro de Teoria da Computação, 1-4, 2021 | | 2021 |
| Sobre Rotulaçoes L (h, k) de Caterpillars JPK Castilho, CN Campos, LM Zatesko Anais do VI Encontro de Teoria da Computação, 62-65, 2021 | | 2021 |
| The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal JPW Bernardi, MVG da Silva, ALP Guedes, LM Zatesko Electronic Notes in Theoretical Computer Science 346, 125-133, 2019 | | 2019 |
| A Connectivity-based Decomposition for Graph Edge-colouring LM Zatesko, JPW Bernardi, SM de Almeida, R Carmo, ALP Guedes Matemática Contemporânea 46, 156-164, 2019 | | 2019 |
| Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs. LM Zatesko, R Carmo, ALP Guedes ICORES, 247-253, 2018 | | 2018 |
| Deterministic and efficient minimal perfect hashing schemes LM Zatesko, J Donadelli Jr Revista de Informática Teórica e Aplicada 20 (2), 56-72, 2013 | | 2013 |
| Esquemas de hashing perfeitos, mínimos, práticos, determinísticos e eficientes em tempo e em espaço LM Zatesko | | |
| A Near-tight Bound for the Rainbow Connection Number of Snake Graphs A Rocha, SM Almeida, LM Zatesko | | |
André GuedesDepartamento de Informática, Universidade Federal do ParanáVerified email at inf.ufpr.br
