83 citations · 108 across the 9 of their papers we have counts for
13 papers
Going in Circles: Collaborative Multi-Robot Treasure Hunting
Bogumil Kaminski, Pawel Pralat, Maria Sadza
This paper investigates a multi-robot search-and-visit problem involving robots starting at the origin and unknown treasures hidden on the unit circle . The ro…
Modularity Based Community Detection in Hypergraphs
Bogumił Kamiński, Paweł Misiorek, Paweł Prałat +1
In this paper, we propose a scalable community detection algorithm using hypergraph modularity function, h-Louvain. It is an adaptation of the classical Louvain algorithm in the co…
Self-similarity of Communities of the ABCD Model
Jordan Barrett, Bogumil Kaminski, Pawel Pralat +1
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The…
Predicting Properties of Nodes via Community-Aware Features
Bogumił Kamiński, Paweł Prałat, François Théberge +1
This paper shows how information about the network's community structure can be used to define node features with high predictive power for classification tasks. To do so, we defin…
Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs
Ashkan Dehghan, Kinga Siuta, Agata Skorupka +4
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, no…
Modularity of the ABCD Random Graph Model with Community Structure
Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat +1
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The…