79 citations · 541 across the 84 of their papers we have counts for
9 papers · 1 filter
Restless reachability problems in temporal graphs
Suhas Thejaswi, Juho Lauri, Aristides Gionis
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we f…
Mining Dense Subgraphs with Similar Edges
Polina Rozenshtein, Giulia Preti, Aristides Gionis +1
When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and e…
Diverse Rule Sets
Guangyi Zhang, Aristides Gionis
While machine-learning models are flourishing and transforming many aspects of everyday life, the inability of humans to understand complex models poses difficulties for these mode…
Explainable Classification of Brain Networks via Contrast Subgraphs
Tommaso Lanciano, Francesco Bonchi, Aristides Gionis
Mining human-brain networks to discover patterns that can be used to discriminate between healthy individuals and patients affected by some neurological disorder, is a fundamental…
Finding large balanced subgraphs in signed networks
Bruno Ordozgoiti, Antonis Matakos, Aristides Gionis
Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in interactions that are missed by their unsigned…
Improved mixing time for k-subgraph sampling
Ryuta Matsuno, Aristides Gionis
Understanding the local structure of a graph provides valuable insights about the underlying phenomena from which the graph has originated. Sampling and examining k-subgraphs is a…