Publicações
Periódicos
  • HANCOCK, R.; KABELA, A.; KRAL, D.; MARTINS, T.; PARENTE, R.; SKERMAN, F. & VOLEC, J. No additional tournaments are quasirandom-forcing. Subimitted (arXiv:1912.04243)
  • SOUZA, M. & MOREIRA, A.Belief base change as priority change: A study based on dynamic epistemic logic. JLAMP v. 122, 2021.
  • SOUZA, M.; VIEIRA, R & MOREIRA, A. Dynamic Preference Logic meets iterated belief change: Representation results and postulates characterization TCS 872, pp. 15-40, 2021.
  • HOPPEN, C.; PARENTE, R. & SATO, C. Packing Arborescences in Random Digraphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 33, p. 438-453, 2019.
  • COREGLIANO, L.; PARENTE, R. & SATO, C. On the Maximum Density of Fixed Strongly Connected Subtournaments. ELECTRONIC JOURNAL OF COMBINATORICS, v. 26, p. 44, 2019.
  • ALLEN, P.; Kohayakawa, Y.; Mota, G. & Parente, R. On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, p. 52, 2014.
Conferências
  • COLLARES, M.; KOHAYAKAWA, Y.; MARTINS, T.; PARENTE, R. & SOUZA, V.. Hitting times for arc-disjoint arborescences in random digraph processes. PROCEDIA COMPUTER SCIENCE, v. 195, p. 376-384, 2021.
  • SOUZA, M. Towards a Theory of Hyperintensional Belief Change 9th Brazilian Conference on Intelligent Systems, 2021.
  • SOUZA, M. & VIEIRA, R. & MOREIRA, A.Generalized iterated belief change in dynamic epistemic logic. 8th Brazilian Conference on Intelligent Systems, 2020.
  • HOPPEN, C.; PARENTE, R.; SATO, C.. Packing arborescences in random digraphs. In: EUROCOMB - European Conference on Combinatorics, Graph Theory and Applications, 2017, Viena. Electronic Notes in Discrete Mathematics, 2017. v. 61. p. 615-621.