معرفی
Prof. Pascal Schweitzer is a faculty member in the Department of Computer Science at TU Darmstadt, leading the working group focused on Algorithms and Symmetry. Previously affiliated with TU Kaiserslautern, he holds a PhD thesis titled 'Problems of Unknown Complexity: Graph Isomorphism and Ramsey Theoretic Numbers.'
His research interests include symmetry detection, algorithmic and structural graph/group theory, computational complexity, graph isomorphism problem, and computer algebra. He has collaborated on projects related to Weisfeiler-Leman algorithms and isomorphism tests for graphs with bounded parameters.
Pascal's work is supported by contributions to conferences like LICS, STOC, and FOCS. He has co-advised master's students such as Jean-Paul Weber and Anton Catalin on topics like attack-defense trees and antivius engine scanners. He leads teams including EngageS and contributes to teaching areas like algorithmics, deduction, and distributed systems.
He maintains an office at TU Darmstadt and can be reached via email at schweitzer@cs.uni-kl.de. His research explores theoretical computer science and practical applications in graph canonization and security models.
