Van Bang Le

Van Bang Le serves as an Extraordinary Professor in Theoretical Computer Science at the Institute of Computer Science, University of Rostock. His academic profile reflects deep specialization in graph theory and computational complexity, with institutional affiliation clearly established through university contact details and course listings.

His research focuses on fundamental problems in graph algorithms, particularly examining matching cuts, graph coloring, vertex deletion problems, and structural graph properties. Key contributions include complexity analyses of Strong Conflict-Free Vertex-Connection, polynomial kernelization for stable cutsets, and optimal leaf roots computation. His work demonstrates consistent theoretical rigor with publications spanning from 2020-2025.

Teaching responsibilities include advanced courses in Logic and Predictability, Theoretical Computer Science I (Complexity and Formal Languages), Cryptography seminars, Operations Research, and Efficient Graph Algorithms. His course portfolio directly aligns with his research expertise in discrete structures and algorithmic complexity.

Analysis of his 15 most recent publications reveals dominant research trajectories: (1) Matching cut problems across various graph classes (2022-2024), (2) Parameterized complexity in vertex deletion problems (2023-2024), and (3) Structural graph theory with emphasis on chordal graphs and cographs (2023). The publications exhibit strong theoretical consistency despite the anomalous medical-themed papers in the 2025 list which appear unrelated to his core computer science profile.

Professional functions include membership on the Computer Science Examination Board (IN) and the IEF Library Commission, indicating active institutional service beyond research and teaching responsibilities.