معرفی
Prof. André Schulz is a Professor at the Faculty MI, Department of Theoretical Computer Science, Distance University. His research focuses on graph theory, computational geometry, and algorithm design, with a strong emphasis on geometric graphs, graph drawing algorithms, and topological representations. He has published extensively in top-tier journals and conferences such as Discrete & Computational Geometry, Journal of Graph Algorithms and Applications, and Graph Drawing and Network Visualization.
His work spans topics like adjacency graphs of polyhedral surfaces, Lombardi drawings of knots, and experimental analysis of graph visualization techniques. He collaborates internationally, co-authoring over 30 peer-reviewed articles since 2015. His research addresses challenges in geometric algorithms, graph embeddings, and combinatorial optimization, with applications in social network analysis and geometric topology.
Key contributions include minimizing geometric primitives in planar graph drawings and developing efficient algorithms for 1-planar and cubic graphs. His recent work (2023–2024) explores orthogonal circle arrangements and schematic hypergraph layouts. Despite no explicit mention of awards or grants, his prolific publication record underscores his academic influence.
