Frank Stephan

Frank Stephan is a Professor at the National University of Singapore, jointly affiliated with the Department of Mathematics and the School of Computing. His primary office is located in Block S17 (Mathematics), and he maintains a secondary office in Block COM2 (Computing). He teaches advanced courses including Computational Complexity, Logic and Foundations of Mathematics, and Advanced Automata Theory. Stephan co-organizes the departmental Logic Seminar and maintains an extensive publication record in theoretical computer science.

His research spans:

• Recursion Theory & Kolmogorov Complexity: Foundational computability and information theory.
• Learning Theory: Inductive inference and algorithmic learning models.
• Computational Complexity: Hardness, parameterization, and structural graph algorithms.
• Automata & Formal Languages: Automatic structures and language recognition complexity.

Recent publications focus on combinatorial optimization in graphs, including dominating sets, geodetic monitoring, identifying codes, and parameterized complexity. His work frequently appears in top venues (e.g., STACS, ICALP, ISAAC) and journals (e.g., Discrete Mathematics, Theoretical Computer Science).

Stephan holds memberships in the European Association for Theoretical Computer Science, Deutsche Mathematiker-Vereinigung, and other academic societies. No awards or student advisees are documented.