— We present a receding horizon optimal control approach for the one-dimensional linear wave equation. In order to prove stability and suboptimality of this approach we use a wei...
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
—This paper shows how the relative size of components can be used to increase matching performance – saving orders of magnitude in component area. The relative size information...
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...