We deal with directed hypergraphs as a tool to model and solve some classes of problems
arising in operations research and in computer science. Concepts such as connectivity …

Just as ordinary hypergraphs are a generalization of graphs, directed hypergraphs (DH) are
a natural generalization of digraphs. A DH consists of a set of vertices V and a set of …

In this paper the problem of minimal representations for particular classes of directed
hypergraphs is analyzed. Various concepts of minimal representations of directed …

In many scheduling applications it is required that the processing of some job be postponed
until some other job, which can be chosen from a pregiven set of alternatives, has been …

Around 1980, recursions for aggregate claims distributions started receiving attention in the
actuarial literature. Two common ways of modelling such distributions are as compound …

The purpose of this paper is twofold. First, we review several basic combinatorial problems
that have been stated in terms of directed hypergraphs and have been studied in the …

As several mature implementations of data warehousing systems are fully operational, a
crucial role in preserving their up-to-dateness is played by the ability to manage the changes …

We present HYPPO, a novel system to optimize pipelines encountered in exploratory
machine learning. HYPPO exploits alternative computational paths of artifacts from past …

We introduce a notion of hyperconnection (formally called L-hyperpath) between vertices in
a directed hypergraph and relate this notion to existing notions of hyperpaths in directed …

We consider the capacitated minimum cost flow problem on directed hypergraphs. We
define spanning hypertrees so generalizing the spanning tree of a standard graph, and …