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...
The WWW contains a huge amount of documents. Some of them share the subject, but are generated by different people or even organizations. To guarantee the interchange of such docu...
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
The estimation of linear causal models (also known as structural equation models) from data is a well-known problem which has received much attention in the past. Most previous wo...
Patrik O. Hoyer, Shohei Shimizu, Antti J. Kerminen
While the study of terrorism has expanded dramatically since the 1970s, most analyses are limited to qualitative case studies or quantitative analyses of international incidents on...