Curriculum Vitae Ruben Hoeksma EN webcopy

Surname: | Hoeksma |

Names: | Ruben Pieter |

E-mail: | rphoeksma@gmail.com |

2017- | Postdoctoral researcher, Universität Bremen, Germany. I am currently working as a postdoctoral researcher at the University of Bremen, with the group of Prof. Nicole Megow. My research interests include combinatorial optimization, algorithmic game theory, approximation algorithms, scheduling and related topics. |

2016-2017 | Postdoctoral researcher, Center for Mathematical Modelling, Universidad de Chile, Santiago. |

2015-2016 | Postdoctoral researcher, Departamento Ingeniero Industrial, Universidad de Chile, Santiago. As a postdoctoral researcher at the Department of Industrial Engineering (DII) I was part of the “Millennium Nucleus Information and Coordination in Networks”. |

2014-2015 | Lecturer mathematics, University of Twente, Enschede. |

2010-2014 | PhD student, University of Twente, Enschede. Discrete Mathematics and Mathematical Programming group. |

2008-2010 | Student assistant mathematics, University of Twente, Enschede. |

2010 | Consultancy for the Dutch Ministry of Agriculture, Nature and Food Quality (Ministerie van Landbouw, Natuurbeheer en Voedselkwaliteit; LNV). |

2008-2009 | Internship, Reggefiber, Deventer (part of MSc Applied Mathematics). Title of internship report: Een beslissingsmodel voor grootte en plaatsing van Area-PoP's in een FttH-netwerk. |

2005-2008 | Public relations for Applied Mathematics. |

2006-2007 | Tutor in mathematics for high school students. |

2010-2014 | PhD student, University of Twente, Enschede. Discrete Mathematics and Mathematical Programming group. |

2010-2012 | Courses of the LNMB (Dutch Network on the Mathematics of Operations Research). Diploma 2012. |

2008-2010 | MSc Applied Mathematics, University of Twente, Enschede. Diploma 2010. |

2003-2008 | BSc Applied Mathematics, University of Twente, Enschede. Diploma 2008. |

2005-2006 | Minor Computer Science. |

1997-2003 | VWO atheneum, R.S.G Pantarijn, Wageningen. Diploma 2003. |

2014 - | Tafel van 7, member. |

2013 | Organizing Committee of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), 21-23 May 2013, Enschede. |

2011 | Organizing Committee Dutch Mathematical Congress 2011 (NMC 2011). |

2009 | Finalist in the AIMMS-CPLEX/MOPTA Optimization Modeling Competition MOPTA 2009. |

2006-2009 | Board council, student korfball association Vakgericht, Enschede. |

2005-2006 | President, student korfball association Vakgericht, Enschede. |

2005 | Treasurer, student korfball association Vakgericht, Enschede. |

2004-2005 | Introduction committee Applied Mathematics. |

Languages: | Dutch | native |

English | fluent | |

Spanish German | Basic Basic |

Computer: | Microsoft Windows, Linux, Mac OS. |

Korfball, basketball, board and card games, computers and electronics, cycling, sports, photography. |

## Journal papersK. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, C.S. Rahul, and M. Waanders. Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory of Computing. R. Hoeksma and M. Uetz. Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Private Data. Operations Research, 64(6):1438-1450, 2016. R. Hoeksma, B. Manthey, and M. Uetz. Efficient Implementation of Caratheodory’s Theorem for a Simple Scheduling Polytope. Discrete Applied Mathematics, 215: 136-145, 2016. ## Peer-reviewed conference proceedingsJ. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld. Posted price mechanisms for a random stream of customers. The 2017 ACM conference on Economics and Computation, EC’17, Cambridge, Massachusetts, USA, June 26-30, 2017. Proceedings, pp. 169-186. ACM, 2017. A. Antoniadis, R. Hoeksma, J. Meissner, J. Verschae, and A. Wiese. A QPTAS for the general scheduling problem with identical release dates. The 44rd International Colloquium on Automata, Languages and Programming, ICALP 2017, vol. 80 LIPIcs, pp. 31:1-31:14. Dagstuhl, Germany, 2017. R. Hoeksma, B. Manthey, and M. Uetz. Decomposition algorithm for the single machine scheduling polytope. In: Combinatorial Optimization Third International Symposium, ISCO 2014, March 5-7, 2014, Lisbon, Portugal. pp. 280-291. Lecture Notes in Computer Science 8596. Springer International Publishing, 2014. K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, and C.S. Rahul. Approximability of Connected Factors. In: Proceedings of the 11th Workshop on Approximation and Online Algorithms (WAOA 2013), 5-6 Sep 2013, Sophia Antipolis, France. pp. 120-131. Lecture Notes in Computer Science 8447. Springer International Publishing, 2014. R. Hoeksma and M. Uetz. Two dimensional optimal mechanism design for a sequencing problem. In: Proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, 18-20 Mar 2013, Valparaíso, Chile. pp. 242-253. Lecture Notes in Computer Science 7801. Springer Verlag, 2013. R. Hoeksma and M. Uetz. The price of anarchy for minsum related machine scheduling. In: 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, 8-9 Sep 2011, Saarbrücken, Germany. pp. 261-273. Lecture Notes in Computer Science 7164. Springer Verlag, 2012. |

R. Hoeksma (2015) Mechanisms for scheduling games with selfish players. (PhD thesis) R. Hoeksma (2010) Price of anarchy for machine scheduling games with sum of completion times objective. (Master thesis) |