جستجوی استاد راهنمای دانشگاهی

Jan Dreierمشاهده پروفایل

پژوهشگر ارشد

• Structural Graph Theory
• Algorithmic Meta-theorems
• Computational Complexity
• +۱ مورد دیگر

Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.

• Algorithms
• Graph Theory
• Computational Complexity
• +۲ مورد دیگر

Manuel Sorge is a Research Fellow in the Faculty of Informatics at Vienna University of Technology, affiliated with the Algorithms and Complexity group (E192-01). His research focuses on parameterized algorithms, graph theory, and computational complexity, with particular emphasis on graph modification problems, clustering algorithms, and combinatorial optimization. His work spans several areas including graph drawing, algorithmic game theory, and machine learning. Research interests include: Parameterized complexity and kernelization Graph algorithms and combinatorial optimization Algorithmic graph theory and discrete mathematics Computational geometry and graph drawing Supervises master's students in algorithm design and complexity theory. Current projects include Parameterized Graph Drawing (2023–2027).

• Algorithmics
• Computational Complexity
• Graph Theory
• +۳ مورد دیگر

Jan Niclas Dreier is a PostDoc Researcher at TU Wien's Department of Algorithms and Complexity. His research focuses on theoretical computer science, particularly algorithmic meta-theorems, structural graph theory, and computational complexity. He is affiliated with projects such as REVEAL-AI and SLIM. His work addresses topics like monadic stability, SAT solving, and model checking on sparse graph classes. Research Interests : Dreier's primary areas include algorithm design, parameterized complexity, and logic in computer science. His contributions span model checking for graph classes, backdoor analysis in SAT solving, and combinatorial properties of monadic dependence. Recent work explores the interplay between structural graph theory and algorithmic efficiency, with applications to finite model theory and pseudorandom models. Teaching : He teaches courses such as Algorithmic Meta-Theorems , Algorithmics , and Bachelor Thesis in Computer Science . His courses emphasize theoretical foundations and practical algorithmic techniques. Projects : Active involvement in the REVEAL-AI project (2020–2024) and SLIM (2019–2024), focusing on algorithmic advancements in AI and structural graph analysis.