Klaus Wehmuth

According to our database1, Klaus Wehmuth authored at least 25 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Emergence of complex data from simple local rules in a network game.
CoRR, 2020

An Algorithmic Information Distortion in Multidimensional Networks.
CoRR, 2020

On the existence of hidden machines in computational time hierarchies.
CoRR, 2020

You Shall not Pass: Avoiding Spurious Paths in Shortest-Path Based Centralities in Multidimensional Complex Networks.
CoRR, 2020

Algorithmic networks: Central time to trigger expected emergent open-endedness.
Theor. Comput. Sci., 2019

Transtemporal edges and crosslayer edges in incompressible high-order networks.
CoRR, 2019

Learning the undecidable from networked systems.
CoRR, 2019

A Conceptual Vision Toward the Management of Machine Learning Models.
Proceedings of the ER Forum and Poster & Demos Session 2019 on Publishing Papers with CEUR-WS co-located with 38th International Conference on Conceptual Modeling (ER 2019), 2019

Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence.
CoRR, 2018

On incompressible high order networks.
CoRR, 2018

An algorithmically random family of MultiAspect Graphs and its topological properties.
CoRR, 2018

Emergent Open-Endedness from Contagion of the Fittest.
Complex Syst., 2018

A Multilayer and Time-Varying Structural Analysis of the Brazilian Air Transportation Network.
Proceedings of the Latin America Data Science Workshop co-located with 44th International Conference on Very Large Data Bases (VLDB 2018), 2018

Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks.
Proceedings of the 8th Latin-American Symposium on Dependable Computing, 2018

Social Events in a Time-Varying Mobile Phone Graph.
CoRR, 2017

MultiAspect Graphs: Algebraic Representation and Algorithms.
Algorithms, 2017

On MultiAspect graphs.
Theor. Comput. Sci., 2016

Análise de Desempenho de Plataformas de Processamento de Grafos.
Proceedings of the 31º Simpósio Brasileiro de Banco de Dados, 2016

Time Centrality in Dynamic Complex Networks.
Adv. Complex Syst., 2015

A unifying model for representing time-varying graphs.
Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics, 2015

DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks.
Comput. Networks, 2013

Distributed Assessment of Network Centralities in Complex Social Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

Distributed Assessment of Network Centrality
CoRR, 2011

Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis
CoRR, 2011

Distributed location of the critical nodes to network robustness based on spectral analysis.
Proceedings of the 7th Latin American Network Operations and Management Symposium, 2011