Markus Blumenstock, M.Sc.

21582955
Research Assistant
Johannes Gutenberg University Mainz
Institute of Computer Science
Staudingerweg 9
55128 Mainz
Room: 03-419
E-Mail:
Office phone: +49 6131 39-24624

My CV in pdf format

Research Interests

  • Flow problems and applications
  • Approximation algorithms
  • Steiner trees
  • Linear Programming
  • Graph clustering

 

Employment

Since 11/2014 (on parental leave 03/2018-09/2018)

Research assistant in the Algorithmics Group at Johannes Gutenberg University Mainz.

 

09/2017 - 11/2017

Visiting researcher at the Department of Combinatorics and Optimization, University of Waterloo, Canada. Funded by a DAAD scholarship.

 

3/2014 - 09/2014

Academic visitor at the Department of Computer Science, The University of Waikato, New Zealand.

 

Education

10/2012 - 09/2014    M.Sc. Computer Science in the Natural Sciences (secondary subject Mathematics), JGU

Thesis title: "Graph Clustering and Jaccard Similarity Estimation in Offline and Streaming Settings"

Supervisor: Prof. Dr. Stefan Kramer

External Supervisor: Professor Dr. Bernhard Pfahringer

10/2009 - 09/2012    B.Sc. Computer Science, JGU

Thesis title: "Application-oriented Scheduling with Eligibility Restrictions and Precedence Constraints"

Supervisor: Prof. Dr. Elmar Schömer

Faculty prize for excellent theses

 

Activities

Reviewing for the journal "Mathematical Programming Computation", 2015.

 

Publications

Markus Blumenstock. Fast Algorithms for Pseudoarboricity. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10th, 2016, 113–126, SIAM 2016, ISBN 978-1-61197-431-7. DOI: http://dx.doi.org/10.1137/1.9781611974317.10

Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp. Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem. In Combinatorial Optimization and Applications – 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings, pages 268–282, 2014. DOI: http://dx.doi.org/10.1007/978-3-319-12691-3_21

 

Talks and Tutorials

Talk on "Fast Algorithms for Pseudoarboricity" at the 18th Workshop on Algorithm Engineering and Experiments (ALENEX 2016), January 10th, 2016, Arlington, Virginia, USA. Slides

Conference talk on "Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem" at the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014), Wailea, Maui, Hawaii, USA, December 2014.

Talk on "Algorithms for the Maximum Weight Connected Subgraph and Prize-collecting Steiner Tree Problems" at the 11th DIMACS Implementation Challenge at ICERM, Providence, Rhode Island, USA, December 2014.

 

Awards and Scholarships

09/2017 - 11/2017

Scholarship of the German Academic Exchange Service (DAAD) for a research visit at University of Waterloo, Canada.

 

Teaching

Winter Term 2018/2019:

Organizer of the seminar "The Modern Algorithmic Toolbox".

Winter Term 2017/2018:

Organizer and instructor of the lab course "Advanced Algorithms".

Summer Term 2017:

Lecturing on "(Advanced) Complexity Theory" (under guidance of Prof. Dr. Ernst Althaus), organizer and teaching assistant

Winter Term 2016/2017:

Organizer for the lecture "Data Structures and Efficient Algorithms".

Organizer of the lab course "Data Structures and Efficient Algorithms".

Organizer and instructor of the lab course "Advanced Algorithms".

Summer Term 2016:

Organizer for the lecture "Computability and Formal Languages".

Organizer and instructor of the lab course "Approaching Programming Contests".

Winter Term 2015/2016:

Organizer and teaching assistant for the lecture "Game Theory".

Organizer and instructor of the lab course "Advanced Algorithms".

Summer Term 2015:

Organizer and instructor of the lab course "Approaching Programming Contests".

Winter Term 2014/2015:

Organizer and teaching assistant for the lecture "Game Theory".

Winter Term 2013/2014:

Teaching assistant for the lecture "Data Structures and Efficient Algorithms".

Summer Term 2013:

Teaching assistant for the lecture "Computability and Complexity".

Winter Term 2012/2013:

Teaching assistant for the lecture "Formal Languages and Automata Theory".

Summer Term 2012:

Teaching assistant for the lecture "Computability and Complexity".

Winter Term 2011/2012:

Teaching assistant for the lecture "Data Structures and Efficient Algorithms".

Activities in Competitions

2016, 2017 Judge for the German Collegiate Programming Contest (GCPC).

2015, 2016 Coach for a student team at the Northwestern European Programming Contest (NWERC).

2014          Competitor at the 11th DIMACS Implementation Challenge on Steiner Tree Problems (with Ernst Althaus).