Klaus Wehmuth
Klaus Wehmuth
Verified email at lncc.br
Title
Cited by
Cited by
Year
A unifying model for representing time-varying graphs
K Wehmuth, A Ziviani, E Fleury
2015 IEEE International Conference on Data Science and Advanced Analytics†…, 2015
652015
Daccer: Distributed assessment of the closeness centrality ranking in complex networks
K Wehmuth, A Ziviani
Computer Networks 57 (13), 2536-2548, 2013
462013
Time centrality in dynamic complex networks
EC Costa, AB Vieira, K Wehmuth, A Ziviani, APC Da Silva
Advances in Complex Systems 18 (07n08), 1550023, 2015
362015
On multiaspect graphs
K Wehmuth, … Fleury, A Ziviani
Theoretical Computer Science, 29, 2016
342016
MultiAspect Graphs: Algebraic representation and algorithms
K Wehmuth, … Fleury, A Ziviani
Algorithms 10 (1), 1, 2017
312017
A unifying model for representing time-varying graphs
K Wehmuth, A Ziviani, E Fleury
arXiv preprint arXiv:1402.3488, 2014
292014
Distributed assessment of the closeness centrality ranking in complex networks
K Wehmuth, A Ziviani
Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks†…, 2012
282012
Distributed location of the critical nodes to network robustness based on spectral analysis
K Wehmuth, A Ziviani
2011 7th Latin American Network Operations and Management Symposium, 1-8, 2011
19*2011
On the joint dynamics of network diameter and spectral gap under node removal
K Wehmuth, ATA Gomes, A Ziviani, APC da Silva
122010
Algorithmic Networks: central time to trigger expected emergent open-endedness
FS Abrah„o, K Wehmuth, A Ziviani
Theoretical Computer Science 785, 83-116, 2019
102019
Social events in a time-varying mobile phone graph
C Sarraute, J Brea, J Burroni, K Wehmuth, A Ziviani, JI Alvarez-Hamelin
arXiv preprint arXiv:1706.06253, 2017
72017
Centralities in high order networks
K Wehmuth, A Ziviani
Anais do III Encontro de Teoria da ComputaÁ„o, 2018
52018
A new model for time-varying graphs
K Wehmuth, E Fleury, A Ziviani
52013
Distributed assessment of network centrality
K Wehmuth, A Ziviani
CoRR, abs/1108.1067, 2011
52011
Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks
K Wehmuth, A Ziviani
2018 Eighth Latin-American Symposium on Dependable Computing (LADC), 19-26, 2018
42018
Expected emergent algorithmic creativity and integration in dynamic complex networks
FS Abrahao, K Wehmuth, A Ziviani
Anais do III Encontro de Teoria da ComputaÁ„o, 2018
42018
Emergent Open-Endedness from Contagion of the Fittest
FS Abrahao, K Wehmuth, A Ziviani
arXiv preprint arXiv:1806.07254, 2018
42018
A Multilayer and Time-Varying Structural Analysis of the Brazilian Air Transportation Network.
K Wehmuth, B Costa, JV Bechara, A Ziviani
LADaS@ VLDB, 57-64, 2018
32018
Distributed assessment of network centralities in complex social networks
K Wehmuth, A Ziviani
2012 IEEE/ACM International Conference on Advances in Social Networks†…, 2012
32012
Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence
FS Abrahao, K Wehmuth, A Ziviani
arXiv preprint arXiv:1812.05912, 2018
22018
The system can't perform the operation now. Try again later.
Articles 1–20