Marco Bender

According to our database1, Marco Bender authored at least 8 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Towards an Integrative Approach for Automated Literature Reviews Using Machine Learning.
Proceedings of the 53rd Hawaii International Conference on System Sciences, 2020

2018
Real-World Staff Rostering via Branch-and-Price in a Declarative Framework.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Online interval scheduling with a bounded number of failures.
J. Sched., 2017

2015
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths.
J. Comb. Optim., 2015

Packing items into several bins facilitates approximating the separable assignment problem.
Inf. Process. Lett., 2015

2014
Maximum Generalized Assignment with Convex Costs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Online delay management on a single train line: beyond competitive analysis.
Public Transp., 2013

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013


  Loading...