We study algorithmic aspects of optimal containment problems in this thesis. We consider 1-and
k-containment problems under homothety, with the special case of the k-center problem, …

In this study, a fault detection and diagnosis strategy is proposed for the supervision of linearly
parametrisable, time-invariant systems subject to abrupt parameter variations, relying on …

We introduce a new technique to model check reachability properties on Interval Discrete-Time
Markov Chains (IDTMC). We compute a sound over-approximation of the probabilities of …

This volume contains the proceedings of the 22nd International Conference on Computer-Aided
Veri'cation (CAV) held in Edinburgh, UK, July 15-19 2010. CAV is dedicated to the …

A minimal spanning tree for a finite subset M of a metric space is a shortest connected graph
with the vertex set M. Minimal spanning trees are used in applications as solutions to the …

This thesis is about robust optimization, a class of mathematical optimization problems
which arise frequently in engineering applications, where unknown process parameters and …

The three-dimensional model of more-dimensional cubes can be constructed on a rotational
axis and on the joining central point in symmetrical form, based on a regular polygon. An …

A disszertáció elso két fejezetének eredményeit szegedi tanulmányaim alatt bizonyıtottam,
mıg a 3. fejezet 2010 tavaszán született. 2006 és 2009 között a University College London …

We present a simple bijection between Baxter permutations of size n and plane bipolar
orientations with n edges. This bijection translates several classical parameters of permutations …

We disprove Holtz and Ron's conjecture that the power ideal C_{A,-2} of a hyperplane
arrangement A (also called the "internal zonotopal space") is generated by A-monomials. We also …