Learn More
We apply network flow techniques to find good exit selections for evacuees in an emergency evacuation. More precisely, we present two algorithms for computing exit distributions using both classical flows and flows over time which are well known from combinatorial optimization. The performance of these new proposals is compared to a simple shortest path(More)
High resolution pollen and dinoflagellate analyses were performed on a continuous 98-cm-long core from Tortonian deposits of Lake Pannon in the Styrian Basin in Austria. The sample distance of 1-cm corresponds to a resolution of roughly one decade, allowing insights into environmental and climatic changes over a millennium of Late Miocene time. Shifts in(More)
In Miocene times a vast wetland existed in Western Amazonia. Whereas the general development of this amazing ecosystem is well established, many questions remain open on sedimentary environments, stratigraphical correlations as well as its palaeogeographical configuration. Several outcrops located in a barely studied region around Eirunepé (SW Amazonas(More)
Cenozoic decapod crustaceans housed in the collections of the Universalmuseum Joanneum (Graz, Austria) are reviewed. Previous descriptions, geographic and stratigraphic provenance and collection history are discussed. Altogether 72 specimens are figured, including five holotypes. Taxonomic affinity of previously unpublished material is addressed.(More)
A huge wetland (the 'Pebas system') covered western Amazonia during the Miocene, hosting a highly diverse and endemic aquatic fauna. One of the most contentious issues concerns the existence, potential pathways and effects of marine incursions on this ecosystem. Palaeontological evidences (body fossils) are rare. The finding of a new, presumably marine(More)
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A ˙ ∪P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P. We seek a maximum weight many-to-one matching satisfying two sets of constraints: vertices in A are incident to at most one(More)