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

Dipen Rughwani

dblp:213/9130 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
0009-0000-8893-0576ORCID · reported

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 87% Distributed computing theory · 13%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph connectivity
connected components		 0.312018
Shortcutting Label Propagation for Distributed Connected Components · WSDM 2018
Graph algorithms and graph theory
graph mining		 0.312018
Shortcutting Label Propagation for Distributed Connected Components · WSDM 2018

Methods — techniques the papers use, named apart from their topics

shortcutting · 0.3label propagation · 0.3
YearPublicationVenuePosition
2018 Shortcutting Label Propagation for Distributed Connected Components
abstract
Connected Components is a fundamental graph mining problem that has been studied for the PRAM, MapReduce and BSP models. We present a simple CC algorithm for BSP that does not mutate the graph, converges in O(log n) supersteps and scales to graphs of trillions of edges.
Stergios Stergiou, Dipen Rughwani, Kostas Tsioutsiouliklis
 WSDM2