معرفی
Jens M. Schmidt is a Professor at the Institute of Computer Science, University of Rostock. His research focuses on Algorithm Engineering, Graph Theory, and Connectivity, particularly in planarity, Hamiltonicity, and Schnyder woods. He teaches courses such as Introduction to Theoretical Computer Science, Efficient Algorithms, and Algorithmic Graph Theory.
- Current Affiliation: University of Rostock (Chair of Algorithms and Complexity)
- Research Themes: Algorithm design, planar graph analysis, and Schnyder woods applications.
His recent work emphasizes graph structures, edge-connectivity, and predictive modeling in mechanical and electrical systems. Key collaborations include studies on polyhedral graphs and Grünbaum's conjecture.
Scientific Contributions: He has authored numerous publications on graph algorithms, including proofs for 3-connected planar graphs and advancements in cut-tree representations. His interdisciplinary projects address efficiency in low-voltage motors and plasma jet analysis.
