Publicações

Confira a seguir uma lista de publicações que são consequências de colaborações iniciadas em algum WoPOCA.  

1. Lucas de Oliveira Silva, Vítor Gomes Chagas, Samuel Plaça de Paula, Greis Yvet Oropeza Quesquén, and Uéverton dos Santos Souza. Realizing Graphs with Cut Constraints, 2025 [ arXiv ] 

2. Marcelo Campos, Maurício Collares, and Guilherme Oliveira Mota. Counting orientations of random graphs with no directed k-cycles, 2023. [ arXiv ]

3. Lucas Aragão, Maurício Collares, João Pedro Marciano, Taísa Martins, and Robert Morris. A lower bound for set-colouring Ramsey numbers. Random Structures & Algorithms. 64, 157–169, 2024. [ DOI ]

4. Fábio Botler, Lucas Colucci, and Yoshiharu Kohayakawa.The mod chromatic index of random graphs, Journal of Graph Theory, 103, 4, (767-779), 2023. [ DOI ]

5. Maurício Collares, Yoshiharu Kohayakawa, Táısa Martins, Roberto Parente, and Victor Souza. Hitting times for arc-disjoint arborescences in random digraph processes. Procedia Computer Science, Volume 195, 376-384, 2021. [ DOI ]

6. Pedro Araújo, Fábio Botler, and Guilherme Oliveira Mota. Counting graph orientations with no directed triangles, 2020. [ arXiv ]

7. Fábio Botler, Lucas Colucci, and Yoshiharu Kohayakawa. The odd chromatic index of almost all graphs. In Anais do V Encontro de Teoria da Computação, pages 49--52. SBC, 2020. [ DOI ]

8. Cristina G. Fernandes and Carla N. Lintzmayer. Leafy spanning arborescences in DAGs. Discrete Applied Mathematics, 323:217--227, 2022. [ DOI ] 

9. Lucas Colucci and Ervin Győri. On L(2,1)-labelings of oriented graphs. Discussiones Mathematicae Graph Theory, 1(ahead-of-print), 2019. [ DOI ]

10. Lucas Colucci. Coloring results in some extremal problems. PhD thesis, Central European University Budapest, Hungary, 2019. [ link ]

11. Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, and Uéverton S. Souza. Computing the Largest Bond of a Graph. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019. [ arXiv | DOI ]

12. Márcia Cerioli, Cristina Gomes Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, and Cândida Nunes Da Silva. On Edge-magic Labelings of Forests. In The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 299--307. 2019. arXiv:1708.04488. [ DOI ]

13. Félix Carvalho Rodrigues, Eduardo C. Xavier, and Guido Schäfer. On Fair Cost Facility Location Games with Non-singleton Players. Electronic Notes in Theoretical Computer Science, 342:21--38, 2019. [ DOI ]

14. Carla Negri Lintzmayer, Guilherme Oliveira Mota, and Maycon Sambinelli. Decomposing Split Graphs into Locally Irregular Graphs. In The proceedings of LAGOS 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 603--612. Elsevier, 2019. [ DOI ]