2 citations · 4 across the 7 of their papers we have counts for
7 papers
Productivity profile of CNPq scholarship researchers in computer science from 2017 to 2021
Marcelo Keese Albertini, André Ricardo Backes
Productivity in Research (PQ) is a scholarship granted by CNPq (Brazilian National Council for Scientific and Technological Development). This scholarship aims to recognize a few s…
Dynamic Compact Data Structure for Temporal Reachability with Unsorted Contact Insertions
Luiz Fernando Afra Brito, Marcelo Keese Albertini, Bruno Augusto Nassif Travençolo +1
Temporal graphs represent interactions between entities over time. Deciding whether entities can reach each other through temporal paths is useful for various applications such as…
A Dynamic Data Structure for Representing Timed Transitive Closures on Disk
Luiz F. Afra Brito, Marcelo Keese Albertini, Bruno A. N. Travençolo
Temporal graphs represent interactions between entities over time. These interactions may be direct, a contact between two vertices at some time instant, or indirect, through seque…
A Review of In-Memory Space-Efficient Data Structures for Temporal Graphs
Luiz F. A. Brito, Bruno A. N. Travençolo, Marcelo K. Albertini
Temporal graphs model relationships among entities over time. Recent studies applied temporal graphs to abstract complex systems such as continuous communication among participants…
VisGraphNet: a complex network interpretation of convolutional neural features
Joao B. Florindo, Young-Sup Lee, Kyungkoo Jun +2
Here we propose and investigate the use of visibility graphs to model the feature map of a neural network. The model, initially devised for studies on complex networks, is employed…
Practical evaluation of Lyndon factors via alphabet reordering
Marcelo K. Albertini, Felipe A. Louza
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza & Chili datasets show that for most alphabet reorderings,…
A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions
Luiz F. Afra Brito, Marcelo Albertini, Arnaud Casteigts +1
Temporal graphs represent interactions between entities over the time. These interactions may be direct (a contact between two nodes at some time instant), or indirect, through seq…