A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. - Marco Bender; Clemens Thielen; Stephan Westphal (MFCS, 2013)

Online delay management on a single train line: beyond competitive analysis. - Marco Bender; Sabine Büttner; Sven O. Krumke (Public Transp., 2013)

Maximum Generalized Assignment with Convex Costs. - Marco Bender; Stephan Westphal (ISCO, 2014)

Packing items into several bins facilitates approximating the separable assignment problem. - Marco Bender; Clemens Thielen; Stephan Westphal (Inf. Process. Lett., 2015)

An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. - Marco Bender; Stephan Westphal (J. Comb. Optim., 2015)

Online interval scheduling with a bounded number of failures. - Marco Bender; Clemens Thielen; Stephan Westphal (J. Sched., 2017)

Real-World Staff Rostering via Branch-and-Price in a Declarative Framework. - Marco Bender; Sebastian Berckey; Michael Elberfeld; Jörg Herbers (OR, 2018)

Towards an Integrative Approach for Automated Literature Reviews Using Machine Learning. - Christoph Tauchert; Marco Bender; Neda Mesbah; Peter Buxmann (HICSS, 2020)