7 citations · 34 across the 29 of their papers we have counts for
40 papers
Motifs in temporal hypergraphs
Quintino Francesco Lotito, Lorenzo Betti, Federico Battiston +1
Network motifs, recurrent local patterns of interactions in graphs, provide fundamental insights on the interplay between structure and functionality in complex systems. Many real-…
Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
Siwoo Song, Wonseok Shin, Kunsoo Park +3
A hypergraph is a generalization of a graph, in which a hyperedge can connect multiple vertices, modeling complex relationships involving multiple vertices simultaneously. Hypergra…
Graph Traversal via Connected Mobile Agents
Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
This paper considers the Hamiltonian walk problem in the multi-agent coordination framework, referred to as -agents Hamiltonian walk problem (-HWP). In this problem, a set of…
Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar +1
Inferring tie strengths (strong vs. weak) is a core task in network analysis, often guided by the Strong Triadic Closure (STC) principle. In multilayer networks, such as social pla…
Online Drone Scheduling for Last-mile Delivery
Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop +3
Delivering a parcel from the distribution hub to the customer's doorstep is called the \textit{last-mile delivery} step in delivery logistics. In this paper, we study a hybrid {\it…
Black Hole Search in Dynamic Tori
Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
We investigate the black hole search problem by a set of mobile agents in a dynamic torus. Black hole is defined to be a dangerous stationary node which has the capability to destr…