Prof. Stephen Kobourov is a Professor in the TUM School of Computation, Information and Technology at Technische Universität München (TUM). Previously, he held positions at the University of Arizona from 2000 to 2024, progressing from Assistant Professor to Full Professor, and served as Deputy Director of the Data Science Institute. His expertise lies in algorithm design, computational geometry, and graph visualization, with over 250 publications and significant funding from NSF, ONR, and USDA grants. Education: BS in Computer Science and Mathematics from Dartmouth College (1995), PhD in Computer Science from Johns Hopkins University (2000). Research focuses on efficient algorithms for graph drawing, visualization techniques for networks, and geometric algorithms. Notable contributions include work on stress metrics in graph layouts, hypergraph representations, and non-Euclidean visualization frameworks. He has co-chaired committees for ALENEX, IEEE PacificVis, and GD, and serves as an editor for JGAA, CGTA, and IEEE TVCG. Awards include the Fulbright Distinguished Chair (2015–2016), Humboldt Research Fellowship (2011–2014), and NSF Career Award (2006–2011). His recent work explores multi-layer network visualization, AI-driven graph analysis (e.g., MLLMs perception), and graph embeddings in non-Euclidean spaces. Advising and grants: Extensive grants from NSF and other agencies support his research. He has advised numerous students and collaborates internationally, contributing to labs like the Data Science Institute and initiatives such as the Institutional Knowledge Map (KMAP). Visualization projects include MetroSets (metro map-style set visualization), Wooly Graphs (knitting pattern frameworks), and tools for interactive network analysis. His work bridges theoretical algorithms with practical applications in science and technology.










