default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Wehmuth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i21]Caroline de Oliveira Costa Souza Rosa, Márcia Ito, Alex Borges Vieira, Klaus Wehmuth, Antônio Tadeu Azevedo Gomes:
Framework based on complex networks to model and mine patient pathways. CoRR abs/2309.14208 (2023)- 2021
- [j10]Ana Cludia, M. de Souza, Alex Borges Vieira, Klaus Wehmuth, Artur Ziviani:
Connectivity-based time centrality in time-varying graphs. J. Complex Networks 9(5) (2021) - [j9]Felipe S. Abrahão
, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks. Entropy 23(7): 835 (2021) - [j8]Klaus Wehmuth, Artur Ziviani, Leonardo Chinelate Costa, Ana Paula Couto da Silva, Alex Borges Vieira:
You Shall Not Pass: Avoiding Spurious Paths in Shortest-Path Based Centralities in Multidimensional Complex Networks. IEEE Trans. Netw. Sci. Eng. 8(1): 138-148 (2021) - [i20]Felipe S. Abrahão, Hector Zenil, Fábio Porto, Klaus Wehmuth:
Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine Learning. CoRR abs/2112.12275 (2021) - 2020
- [j7]Juliana Zanelatto Gavião Mascarenhas, Artur Ziviani, Klaus Wehmuth, Alex Borges Vieira:
On the transaction dynamics of the Ethereum-based cryptocurrency. J. Complex Networks 8(4) (2020) - [c8]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. COMPLEX NETWORKS (2) 2020: 520-531 - [i19]Klaus Wehmuth, Artur Ziviani, Leonardo Chinelate Costa, Ana Paula Couto da Silva, Alex Borges Vieira:
You Shall not Pass: Avoiding Spurious Paths in Shortest-Path Based Centralities in Multidimensional Complex Networks. CoRR abs/2006.15401 (2020) - [i18]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
On the existence of hidden machines in computational time hierarchies. CoRR abs/2009.01145 (2020) - [i17]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. CoRR abs/2009.05879 (2020) - [i16]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergence of complex data from simple local rules in a network game. CoRR abs/2009.12210 (2020)
2010 – 2019
- 2019
- [j6]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Algorithmic networks: Central time to trigger expected emergent open-endedness. Theor. Comput. Sci. 785: 83-116 (2019) - [c7]Daniel Nascimento Ramos da Silva, Adolfo Simões, Carlos Cardoso, Douglas E. M. de Oliveira, João N. Rittmeyer, Klaus Wehmuth, Hermano Lustosa, Rafael S. Pereira, Yania Molina Souto, Luciana E. G. Vignoli, Rebecca Salles, Heleno de S. C. Jr, Artur Ziviani, Eduardo S. Ogasawara, Flávia Coimbra Delicato, Paulo de Figueiredo Pires, Hardy Leonardo da Cunha Pereira Pinto, Luciano Maia, Fábio Porto:
A Conceptual Vision Toward the Management of Machine Learning Models. ER Forum/Posters/Demos 2019: 15-27 - [i15]Felipe S. Abrahão, Itala M. Loffredo D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani:
Learning the undecidable from networked systems. CoRR abs/1904.07027 (2019) - [i14]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Transtemporal edges and crosslayer edges in incompressible high-order networks. CoRR abs/1905.05276 (2019) - 2018
- [j5]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergent Open-Endedness from Contagion of the Fittest. Complex Syst. 27(4) (2018) - [c6]Klaus Wehmuth, Artur Ziviani:
Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks. LADC 2018: 19-26 - [c5]Klaus Wehmuth, Bernardo Costa, João Victor Bechara, Artur Ziviani:
A Multilayer and Time-Varying Structural Analysis of the Brazilian Air Transportation Network. LADaS@VLDB 2018: 57-64 - [i13]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergent Open-Endedness from Contagion of the Fittest. CoRR abs/1806.07254 (2018) - [i12]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
An algorithmically random family of MultiAspect Graphs and its topological properties. CoRR abs/1810.11719 (2018) - [i11]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
On incompressible high order networks. CoRR abs/1812.01170 (2018) - [i10]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. CoRR abs/1812.05912 (2018) - 2017
- [j4]Klaus Wehmuth, Eric Fleury, Artur Ziviani:
MultiAspect Graphs: Algebraic Representation and Algorithms. Algorithms 10(1): 1 (2017) - [i9]Carlos Sarraute, Jorge Brea, Javier Burroni, Klaus Wehmuth, Artur Ziviani, J. Ignacio Alvarez-Hamelin:
Social Events in a Time-Varying Mobile Phone Graph. CoRR abs/1706.06253 (2017) - [i8]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Algorithmic Networks: central time to trigger expected emergent open-endedness. CoRR abs/1708.09149 (2017) - [i7]Bernardo Costa, João Victor Bechara, Klaus Wehmuth, Artur Ziviani:
A Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network. CoRR abs/1709.03360 (2017) - 2016
- [j3]Klaus Wehmuth, Eric Fleury, Artur Ziviani:
On MultiAspect graphs. Theor. Comput. Sci. 651: 50-61 (2016) - [c4]Daniel Nascimento Ramos da Silva, Klaus Wehmuth, Carla Osthoff, Ana Paula Appel, Artur Ziviani:
Análise de Desempenho de Plataformas de Processamento de Grafos. SBBD 2016: 16-27 - 2015
- [j2]Eduardo Chinelate Costa, Alex Borges Vieira, Klaus Wehmuth, Artur Ziviani, Ana Paula Couto da Silva:
Time Centrality in Dynamic Complex Networks. Adv. Complex Syst. 18(7-8): 1550023:1-1550023:14 (2015) - [c3]Klaus Wehmuth, Artur Ziviani, Eric Fleury:
A unifying model for representing time-varying graphs. DSAA 2015: 1-10 - [i6]Eduardo Chinelate Costa, Alex Borges Vieira, Klaus Wehmuth, Artur Ziviani, Ana Paula Couto da Silva:
Time Centrality in Dynamic Complex Networks. CoRR abs/1504.00241 (2015) - [i5]Klaus Wehmuth, Eric Fleury, Artur Ziviani:
MultiAspect Graphs: Algebraic representation and algorithms. CoRR abs/1504.07893 (2015) - 2014
- [i4]Klaus Wehmuth, Artur Ziviani, Eric Fleury:
A Unifying Model for Representing Time-Varying Graphs. CoRR abs/1402.3488 (2014) - [i3]Klaus Wehmuth, Eric Fleury, Artur Ziviani:
On MultiAspect Graphs. CoRR abs/1408.0943 (2014) - 2013
- [j1]Klaus Wehmuth, Artur Ziviani:
DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks. Comput. Networks 57(13): 2536-2548 (2013) - 2012
- [c2]Klaus Wehmuth, Artur Ziviani:
Distributed Assessment of Network Centralities in Complex Social Networks. ASONAM 2012: 1046-1049 - 2011
- [c1]Klaus Wehmuth, Artur Ziviani:
Distributed location of the critical nodes to network robustness based on spectral analysis. LANOMS 2011: 1-8 - [i2]Klaus Wehmuth, Artur Ziviani:
Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis. CoRR abs/1101.5019 (2011) - [i1]Klaus Wehmuth, Artur Ziviani:
Distributed Assessment of Network Centrality. CoRR abs/1108.1067 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
