In recent years we are witnessing a continuous growth in the amount of data that both public and private organizations collect and profit by. Search engines are the most common tools used to retrieve information, and more recently, clustering techniques showed to be an effective tool in helping users to skim query results.

The integral representation of some biological phenomena consists in Volterra equations whose kernels involve a convolution term plus a non convolution one. Some significative applications arise in linearised models of cell migration and collective motion, as described in Di Costanzo et al. (Discrete Contin. Dyn. Syst. Ser. B 25 (2020) 443-472), Etchegaray et al. (Integral Methods in Science and Engineering (2015)), Grec et al. (J. Theor. Biol. 452 (2018) 35-46) where the asymptotic behaviour of the analytical solution has been extensively investigated.

In transportation networks with limited capacities and travel times on the arcs, a class of problems attracting a growing scientific interest is represented by the optimal routing and scheduling of given amounts of flow to be transshipped from the origin points to the specific destinations in minimum time. Such problems are of particular concern to emergency transportation where evacuation plans seek to minimize the time evacuees need to clear the affected area and reach the safe zones.

The relevant role of freight lorry parking facilities as a tool to reduce nuisances and impact of economic activities in densely populated urban areas is widely recognised in the literature. Nevertheless, the literature currently lacks specific contributions addressing the use of a complex Multiple Criteria Decision Analysis (MCDA) approach for coping with an optimal location of freight lorry parking facilities in the urban context.

Network-based ranking methods (e.g. centrality analysis) have found extensive use in systems medicine for the prediction of essential proteins, for the prioritization of drug targets candidates in the treatment of several pathologies and in biomarker discovery, and for human disease genes identification. Here we propose to use critical nodes as defined by the Critical Node Problem for the analysis of key physiological and pathophysiological signaling pathways, as target candidates for treatment and management of several cancer types, neurologic and inflammatory dysfunctions, among others.

This paper considers a hub location problem where several carriers operate on a shared network to satisfy a given demand represented by a set of commodities. Possible cooperative strategies are studied where carriers can share resources or swap their respective commodities to produce tangible cost savings while fully satisfying the existing demand. Three different collaborative policies are introduced and discussed, and mixed integer programming formulations are provided for each of them.

In the literature on Network Optimization, k-splittable flows were introduced to enhance modeling accuracy in cases where an upper bound on the number of supporting paths for each commodity needs to be imposed, thus extending the suitability of network flow tools for an increased number of practical applications. Such modeling feature has recently been extended to dynamic flows with the introduction of the novel strongly NP-hard Quickest Multicommodity k-splittable Flow Problem (QMCkFP).

Reputation systems are nowadays widely used to support decision making in networked systems. Parties in such systems rate each other and use shared ratings to compute reputation scores that drive their interactions. The existence of reputation systems with remarkable differences calls for formal approaches to their analysis. We present a verification methodology for reputation systems that is based on the use of the coordination language Klaim and related analysis tools.

The exploration and analysis of Web graphs has flourished in the recent past, producing a large number of relevant and interesting research results. However, the unique characteristics of the Tor network demand for specific algorithms to explore and analyze it. Tor is an anonymity network that allows offering and accessing various Internet resources while guaranteeing a high degree of provider and user anonymity. So far the attention of the research community has focused on assessing the security of the Tor infrastructure.