We consider the degree-preserving spanning tree (DPST) problem: Given a connected graph G, find a spanning tree T of G such that as many vertices of T as possible have the same degree in T as in G.â€¦ (More)

It is proven that if G is a 3-connected claw-free graph which is also Z3-free (where Z3 is a triangle with a path of length 3 attached), P6-free (where P6 is a path with 6 vertices) or H1-free (whereâ€¦ (More)

We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation that is also used for publicâ€¦ (More)

A LTHOUGH deformities of the aortic or pulmonary valves are among the comimonest congenital cardiac malformations. lesions involving both valves have not been frequently reported. Five isolatedâ€¦ (More)