In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
Service oriented computing, with its aim of unhindered interoperability, is an appropriate paradigm for ad hoc networks, which are characterized by physical mobility of heterogeno...
Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Gr...
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such documentcentric XML collections require a query language that can gracefully...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...