: It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the...
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...