Tor hidden services allow offering and accessing various Internet resources while guaranteeing a high degree of provider and user anonymity. So far, most research work on the Tor network aimed at discovering protocol vulnerabilities to de-anonymize users and services. Other work aimed at estimating the number of available hidden services and classifying them. Something that still remains largely unknown is the structure of the graph defined by the network of Tor services.

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.

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.

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.

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.

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.

Trust and reputation systems are decision support tools used to drive parties' interactions on the basis of parties' reputation. In such systems, parties rate with each other after each interaction.