- ORCID iD
- 0000-0001-7820-6883
Show
Sort by
-
- Conference Paper
- P1
- open access
Block-approximated exponential random graphs
-
- PhD Thesis
- open access
Mining and modeling graphs using patterns and priors
(2020) -
- Journal Article
- A1
- open access
Relaxing the strong triadic closure problem for edge strength inference
-
- Conference Paper
- C1
- open access
Discovering interesting cycles in graphs
-
Discovering interesting cycles in directed graphs
-
- Journal Article
- A1
- open access
Subjectively interesting connecting trees and forests
-
- Conference Paper
- C1
- open access
From acquaintance to best friend forever : robust and fine-grained inference of social-tie strengths
-
- Conference Paper
- P1
- open access
Subjectively interesting connecting trees