| You Shall Not Pass: Avoiding Spurious Paths in Shortest-Path Based Centralities in Multidimensional Complex Networks | 0 | 0.34 | 2021 |
| Connectivity-based time centrality in time-varying graphs | 0 | 0.34 | 2021 |
| On The Transaction Dynamics Of The Ethereum-Based Cryptocurrency | 0 | 0.34 | 2020 |
| Transtemporal edges and crosslayer edges in incompressible high-order networks. | 0 | 0.34 | 2019 |
| A Conceptual Vision Toward the Management of Machine Learning Models. | 0 | 0.34 | 2019 |
| Learning the undecidable from networked systems. | 0 | 0.34 | 2019 |
| On incompressible high order networks. | 0 | 0.34 | 2018 |
| Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks | 0 | 0.34 | 2018 |
| An algorithmically random family of MultiAspect Graphs and its topological properties. | 0 | 0.34 | 2018 |
| Emergent Open-Endedness From Contagion Of The Fittest | 0 | 0.34 | 2018 |
| Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. | 0 | 0.34 | 2018 |
| A Multilayer and Time-Varying Structural Analysis of the Brazilian Air Transportation Network. | 0 | 0.34 | 2018 |
| Social Events in a Time-Varying Mobile Phone Graph. | 0 | 0.34 | 2017 |
| A Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network. | 0 | 0.34 | 2017 |
| Algorithmic networks: Central time to trigger expected emergent open-endedness | 0 | 0.34 | 2017 |
| Análise de Desempenho de Plataformas de Processamento de Grafos. | 0 | 0.34 | 2016 |
| On MultiAspect Graphs. | 1 | 0.35 | 2016 |
| A unifying model for representing time-varying graphs | 16 | 0.79 | 2015 |
| Time Centrality in Dynamic Complex Networks. | 7 | 0.53 | 2015 |
| MultiAspect Graphs: Algebraic representation and algorithms. | 13 | 0.53 | 2015 |
| DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks | 24 | 0.91 | 2013 |
| Distributed Assessment of Network Centralities in Complex Social Networks | 0 | 0.34 | 2012 |
| Distributed location of the critical nodes to network robustness based on spectral analysis. | 6 | 0.48 | 2011 |
| Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis | 1 | 0.36 | 2011 |
| Distributed Assessment of Network Centrality | 2 | 0.47 | 2011 |
