Martin Gronemann

Martin Gronemann is a researcher at the Institute for Computer Science, University of Cologne, Germany. His work focuses on graph algorithms, graph drawing, and network visualization, with projects like the Open Graph Drawing Framework (OGDF) and GEODUAL (Geometric Duality). He has taught courses including Computer Science II and Efficient Algorithms, and led seminars on research-oriented programming in C++.

• Research Interests:
  • Graph Algorithms
  • Graph Drawing
  • Network Visualization
  • Computational Geometry
  • Book Embeddings
  • Queue Layouts

Publications highlight his expertise in structural graph theory, geometric representations, and algorithm engineering. Recent work includes advancements in map graphs of bounded treewidth, strictly-convex planar drawings, and NP-completeness of DAG page-number recognition.

• Projects:
  • OGDF - Open Graph Drawing Framework
  • GEODUAL - Geometric Duality
• Teaching:
  • Lecture on Computer Science II (WS 18/19)
  • Exercises for Efficient Algorithms (SS 17, WS 11/12, WS 10/11, WS 13/14, WS 16/17)