Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Wladston Viana

dblp:131/4070 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Web and social media mining · 50% Graph data management · 50%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph data management › graph algorithms
path finding		 0.212013
FriendRouter: real-time path finder in social networks · SIGMOD Conference 2013
Web and social media mining
social network analysis		 0.212013
FriendRouter: real-time path finder in social networks · SIGMOD Conference 2013
Graph algorithms and graph theory
shortest path		 0.012013
FriendRouter: real-time path finder in social networks · SIGMOD Conference 2013
YearPublicationVenuePosition
2013 FriendRouter: real-time path finder in social networks
abstract
Online social networks have become a platform for running and optimizing classical algorithms. Here, we introduce a tool for finding paths between social network users in real-time, a task that classical solutions are not tailored for.
Wladston Viana, Mirella M. Moro
 SIGMOD Conference1