For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
Fine-grained and expressive access control policies on application resources need to be enforced in applicationlevel code. Uniformly enforcing a single policy (referred to as the ...
Tine Verhanneman, Frank Piessens, Bart De Win, Wou...
— In this paper, we investigate the almost sure uniform exponential stabilization problem of Markovian jump linear systems (MJLSs) with logarithmically quantized state feedbacks....