For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...