The research group will present two papers at ESA! The first one, Approximating maximum-size properly colored forests deals with the problem of finding a maximum sized properly colored forest in edge colored graphs. The second, Hypergraph Connectivity Augmentation in Strongly Polynomial Time considers hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements.