Abstract: Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency.

We discuss algorithms for the private analysis of network data. Such algorithms work on data sets that contain sensitive relationship information (for example, romantic ties).

Abstract: We consider three different parameters measuring (non-)convexity of  subsets of the plane or, more generally, of an Euclidean space. In particular, we are interested in mutual relations of these parameters.

Abstract: In recent years, an online adaptation of the classical primal-dual paradigm has been successfully used to obtain new online algorithms for node-weighted network design problems, and simplify existing ones fo