Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit a power-lawâ€¦ (More)

In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the standard quantifiersâ€¦ (More)

The use of the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a nonnegative integer k, has been thoroughly studied in various kindsâ€¦ (More)

The model checking problem for open systems has been widely studied in the literature, for both finiteâ€“state (module checking) and infiniteâ€“state (pushdown module checking) systems, with respect toâ€¦ (More)

Recently, complexity issues related to the decidability of the Î¼-calculus, when the universal and existential quantifiers are augmented with graded modalities, have been investigated by Kupfermann,â€¦ (More)

In the algorithmic area, in the last decades the graph problems have become of wide interest, mainly derived from two aspects: the wide number of real-life situations that can be treated using graphsâ€¦ (More)

The model checking problem for open systems (called module checking) has been intensively studied in the literature, both for finiteâ€“state and infiniteâ€“state systems. In this paper, we focus onâ€¦ (More)

Consider a complete graph G with the edge weights satisfying the Î²-sharpened triangle inequality: weight(u, v) â‰¤ Î²(weight(u, x)+ weight(x, v)), for 1/2 â‰¤ Î² < 1. We study the NP-hard problem ofâ€¦ (More)

In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [ICALP 2004]. Our goal is to allocate load among the agents, provided that theâ€¦ (More)