History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...