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

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.

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

Philipp Eichmeir is a Researcher at the Research Center Wels within the Upper Austria University of Applied Sciences . His work focuses on optimal control , multibody dynamics , and adjoint methods applied to robotics and automotive systems. Expertise in adjoint gradient computation for extremal value optimization Active in automotive/mobility and smart production domains Philipp's research spans computational mathematics , robotics , and mechanical engineering , utilizing advanced numerical methods and simulation modeling for complex dynamic systems. His recent publications focus on multibody dynamics , adjoint optimization , and inequality constraint handling in control systems. Collaborative projects include IOMMS (Innovative Optimization Methods for Multibody Systems) and JR-Centre for Thermal NDE of Composites . Scientific Awards Best Paper Award (2020) Automatisierte Körperschallauswertung (2015)

• Mechanical Engineering
• Robotics
• Optimal Control
• +۴ مورد دیگر

Stefan Woltran is a Full Professor in the Databases and Artificial Intelligence department at TU Wien. He serves as Vice Dean of Academic Affairs for the Informatics Master program and leads the Research Unit for Databases and Artificial Intelligence. His research focuses on logic-based AI, including Propositional Logic, Nonmonotonic Reasoning, Argumentation frameworks, Knowledge Representation, and Logic Programming. He coordinates the Double-Degree Program Logic and Computation. His research projects include analyzing formal properties of logic-based AI approaches, complexity analysis, and developing algorithms via logic and dynamic programming. Notable projects include the HYPAR and REVEAL-AI initiatives exploring abstract argumentation and AI problem-solving. He has contributed to over 150 publications since 2001, focusing on argumentation frameworks, computational complexity, and formal methods. Woltran teaches courses such as Abstract Argumentation, Formal Methods in Computer Science, and Theoretical Computer Science. His work integrates theoretical advancements with practical solver development, such as the ASPARTIX system for argumentation tasks. He actively participates in international conferences and competitions in computational argumentation, emphasizing the application of formal methods to real-world problems.

• Artificial Intelligence
• Nonmonotonic Reasoning
• Argumentation Frameworks
• +۴ مورد دیگر

Craig Gotsman is a Professor and Dean at the Ying Wu College of Computing, New Jersey Institute of Technology. He previously held roles at Cornell Tech, Technion, ETH Zurich, and MIT. His research focuses on computational geometry, computer graphics, and 3D animation. Ph.D. in Computer Science, Hebrew University of Jerusalem (1991) His work spans geometric modeling, mesh processing, and applications in animation and visualization. Recent research trends include gaze correction in video conferencing, mesh parameterization, and spectral compression techniques. Notable awards include Fellowships in the US National Academy of Inventors and the Academy of Europe, multiple best paper awards, and the Technion's Hewlett Packard Chair in Computer Engineering. Gotsman has mentored over 50 postgraduate students and holds ten US patents. He co-founded three companies: Virtue 3D Inc. (acquired by NVIDIA), Estimotion Inc. (now ITIS Israel Ltd.), and CatchEye.

• Computer Graphics
• Computational Geometry
• 3D Animation
• +۵ مورد دیگر

Ulrich Schmid is a Full Professor and Head of the Research Unit for Embedded Computing Systems at TU Wien. He holds a position in the Faculty of Informatics and leads the department of Embedded Computing Systems (E191-02). His roles include Curriculum Coordinator for the Bachelor and Master programs in Computer Engineering, as well as the Excellence Program Bachelor with Honors. He is also the Chair of the Curriculum Commission for Computer Engineering and a Substitute Member of the Informatics Commission. His research focuses on fault-tolerant distributed algorithms, digital integrated circuits, and topology-based approaches to distributed systems. He coordinates major projects such as the FWF-funded DMAC (2019–2024) and ByzDEL (2020–2025), which integrate topological semantics and hybrid delay models for robust hardware design and distributed system analysis. Schmid has contributed to groundbreaking work in Byzantine fault tolerance, epistemic logic for system recovery, and real-time scheduling through collaborations with researchers like Chatterjee, Függer, and Rajsbaum. Notable awards include the 2018 Edsger W. Dijkstra Prize and the 2021 Principles of Distributed Computing Doctoral Dissertation Award. His research also bridges formal verification techniques with physical hardware implementations, exemplified by projects like HEX (a Byzantine-tolerant clock distribution system) and the Involution tool for timing analysis. Schmid actively contributes to academic governance, advancing rigorous education and research standards in computer engineering. His advising and grant work involve mentoring on fault-tolerant architectures and securing funding from agencies like FWF and the European Commission. Labs and teams under his leadership include the Embedded Computing Systems group, specializing in hardware-software co-design for dependable systems-on-chip, and collaborations with institutions like GSI Helmholtzzentrum and the University of Amsterdam.

• Fault-Tolerant Distributed Algorithms
• Digital Integrated Circuits
• Topology
• +۷ مورد دیگر

Reinhard Pichler is a Full Professor at the Vienna University of Technology (TU Wien), affiliated with the Faculty of Informatics and the Department of Databases and Artificial Intelligence . His research focuses on Database Theory , Computational Logic , and Parameterized Complexity . He leads multiple research projects like DeConquer (2023–2027) and HyperTrac (2018–2022), addressing challenges in query optimization and hypergraph decompositions. He holds the prestigious START Prize (2014–2022) for young researchers. His work spans theoretical foundations (e.g., hypertree decompositions) and practical applications (e.g., SPARQL query processing systems like SparqLog). He contributes to academic governance, serving on faculty councils and curriculum commissions. His research innovations bridge algorithmic theory and real-world database systems, emphasizing efficient query evaluation and tractability analysis. Key contributions include advancing fractional hypertree decompositions , SPARQL query optimization , and consistent query answering . His projects often involve collaborations with industry and international funders like the Austrian Science Fund (FWF) and Vienna Science and Technology Fund (WWTF). He actively publishes in top venues like Journal of the ACM , ACM Transactions on Database Systems , and Proceedings of the VLDB Endowment . His academic leadership extends to course design, teaching advanced topics like Complexity Theory and Theoretical Computer Science . He mentors doctoral students and oversees research teams exploring cutting-edge areas like uncertain databases and cloud-based computational social choice .

• Database Theory
• Computational Logic
• Parameterized Complexity
• +۴ مورد دیگر

Anders Lindquist is Zhiyuan Chair Professor at Shanghai Jiao Tong University and Emeritus Professor at KTH Royal Institute of Technology. He earned his PhD from KTH in 1972 and began his career as a postdoctoral fellow at the University of Florida under R.E. Kalman. His academic journey includes positions as Assistant Professor (University of Florida), Associate Professor (University of Kentucky and Brown University), and Full Professor (University of Kentucky and KTH). At KTH, he served as Head of Mathematics Department (2000-2009) and Director of the Center for Industrial and Applied Mathematics (2006-2016). His research focuses on: Mathematical systems theory and control theory Stochastic realization and estimation Spectral estimation methods Moment problems with complexity constraints Applications of operator theory His publications demonstrate consistent focus on mathematical foundations of control systems, stochastic processes, and optimization techniques, with recent work expanding into multidimensional applications and image processing. Major scientific honors include: IEEE Control Systems Award (2020) Reid Prize in Mathematics (2009) Axelby Outstanding Paper Award (2003) Fellowships: IEEE, SIAM, IFAC Memberships: Royal Swedish Academy of Engineering Sciences, Chinese Academy of Sciences He holds four U.S. patents and has served on editorial boards of leading journals including Philosophical Transactions of the Royal Society and SIAM Review.

• Mathematical systems theory
• Control theory
• Stochastic realization theory
• +۳ مورد دیگر

Robert F. Tichy is a Professor at the Institute of Analysis and Number Theory , Graz University of Technology, Austria. His career spans over four decades with significant contributions to Diophantine equations , uniform distribution , and quasi-Monte Carlo methods . He has held multiple editorial board positions and administrative roles , including Dean of the Faculty of Mathematics, Physics and Geodesy (2018-2019). Research Interests : Uniform distribution, Diophantine equations, algorithmic number theory, fractal structures, quasi-Monte Carlo methods, and mathematics in finance/insurance. Awards : Austrian Mathematical Society award (1985), Honorary Doctorate (University of Debrecen, 2017), Jean-Morlet Chair (2020), and memberships in prestigious societies. Publications : Over 200 papers with recent works (2024) focusing on Diophantine problems , pseudorandom sequences , and Carlitz coefficients . Teaching : Regular courses for engineering and mathematics students, including annual lectures on insurance mathematics .

• Uniform Distribution and Discrepancy
• Diophantine Equations
• Analytic Combinatorics
• +۶ مورد دیگر

Dr. Ivana Stiperski is a Full Professor at the Department of Atmospheric and Cryospheric Sciences (ACINN) at the University of Innsbruck. Her research focuses on atmospheric turbulence, boundary layer dynamics in complex terrain, stably stratified flows, and glacier-atmosphere interactions. She leads projects such as the ERC CoG Unicorn initiative, investigating turbulence in complex terrain, and the Hintereisferner Experiment (HEFEX). Her work combines numerical simulations (e.g., large-eddy models) with field observations in mountainous environments. Key research interests include turbulence anisotropy, monin-obukhov similarity theory, and the impact of terrain and ice surfaces on boundary layer processes. She collaborates with international teams on projects like the Seefeld Cold-Air Pool Experiment (SEECAP) and the Innsbruck Box (i-Box) initiative. Her contributions span over 140 peer-reviewed publications and include seminal studies in Quarterly Journal of the Royal Meteorological Society and Boundary-Layer Meteorology . Dr. Stiperski's grants include the ERC Consolidator Grant (Unicorn) and leadership roles in interdisciplinary field campaigns. She is actively involved in teaching and mentoring, though no specific student advisees are listed. Her team (TEAMx-UIBK) develops novel parameterizations for land-atmosphere exchange in Earth System Models.

• Atmospheric Turbulence
• Boundary Layer Dynamics
• Mountain Meteorology
• +۳ مورد دیگر

Jiehua Chen is an Associate Professor in the Department of Algorithms and Complexity at TU Wien (Vienna University of Technology), part of the School of Informatics. Her research focuses on algorithmic social choice, fair division, and computational complexity with applications to multi-agent systems, stable matchings, and parameterized algorithms. She leads the project Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027), funded by the Vienna Science and Technology Fund (WWTF). Her work spans theoretical contributions to voting systems, fair allocation mechanisms, and graph-based problems, with notable publications in venues like AAAI, IJCAI, and ACM Transactions on Economics and Computation. She teaches courses such as Algorithmic Social Choice and Quantum Computing and Complexity Theory , and has supervised research like E. Ceylan's diploma thesis on optimal seat arrangement algorithms. Chen’s research emphasizes practical algorithm design for social choice challenges, including refugee resettlement, participatory budgeting, and hedonic games. She frequently presents at international conferences and collaborates on interdisciplinary projects involving computational complexity and graph theory.

• Algorithmic Social Choice
• Fair Division
• Multi-Winner Elections
• +۴ مورد دیگر

Matthias Paul Lanzinger is an Assistant Professor at the Technische Universität Wien's Faculty of Informatics, Department of Database and Artificial Intelligence. His research focuses on algorithms, graph neural networks, hypergraph decomposition techniques, parameterized complexity, and computational logic. He leads projects like 'DeConquer' (Vienna Science Fund) and 'HyperTrac', exploring efficient query processing and hypergraph-based algorithms. Research interests include theoretical computer science, database systems, and applying logical frameworks to solve complex computational problems. Recent work emphasizes hypertree decompositions, fuzzy Datalog, and graph motif analysis via the Weisfeiler-Leman test. He co-edited the 2024 Datalog-2.0 workshop proceedings and has supervised students on topics like column-store performance and graph query languages. His publications span venues like ACM Transactions on Database Systems, ICLR, and IJCAI, highlighting contributions to algorithmic efficiency, database theory, and logical reasoning systems. Active in academic service, he teaches courses on database systems, scientific research, and advanced topics in informatics.

• Algorithms
• Graph Neural Networks
• Problem decomposition techniques
• +۴ مورد دیگر

Michael Fellows is an Elite Professor of Informatics at the University of Bergen, Norway (2016–present). He has held prominent academic positions at Charles Darwin University, Australia; University of Newcastle, Australia; University of Victoria, Canada; and Victoria University, New Zealand. He is a leading figure in parameterized complexity theory and computer science education. Education : Ph.D. in Computer Science, University of California (1985) M.A. in Mathematics, University of California (1982) Research Interests : Dr. Fellows has pioneered parameterized complexity theory and kernelization algorithms. His work bridges theoretical computer science with interdisciplinary applications in mathematical sciences communication. The Google Scholar articles suggest a secondary focus on sustainability science, life cycle assessment (LCA), and regional energy systems planning. Scientific Awards : 2018 Toppforsk Award (Norwegian Research Council) 2016 Order of Australia, Companion to the Queen (AC) 2014 Honorary Fellow of the Royal Society of New Zealand 2014 Inaugural EATCS Fellow 2014 EATCS–IPEC Nerode Prize 2014 ETH Zurich International Gold Medal of Honor 2007 Alexander von Humboldt Research Prize Advising and Grants : He has supervised notable PhD students including Lars Jaffe (University of Bergen) and Elena Prieto-Rodriguez (Newcastle). Research funding includes U.S. NSF grants, Australian Research Council Discovery Grants, and the 2018 Norwegian Toppforsk Award. His editorial roles span the Journal of Computer and System Sciences and ACM Transactions on Algorithms .

• Parameterized Complexity
• Kernelization
• Multivariate Algorithmics
• +۲ مورد دیگر

Saurabh Saket is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway (since 2013), and concurrently a Professor at the Institute of Mathematical Sciences, India (since 2009). Previously, he was a Postdoctoral Fellow at the Department of Informatics, University of Bergen (2007–2009). His research focuses on parameterized algorithms, kernelization, exact algorithms, matroid algorithms, algorithmic graph minors, treewidth, and approximation algorithms. He has made breakthrough contributions to complexity theory, kernelization preprocessing, and exact exponential-time algorithms, with key results published in top venues like Journal of the ACM, SODA, FOCS, and STOC. Awards and Grants 2020: Fellow of Indian Academy of Sciences 2019: Outstanding Young Researcher Meltzer Award (Norway) 2017–2018: Swarnajayanti Fellowship (India) 2019–2024: ERC Consolidator Grant 'LOPRE' 2013–2017: ERC Starting Grant 'PARAPPROX' His work bridges parameterized complexity with approximation algorithms and has led to foundational results in algorithmic lower bounds, combinatorial optimization, and logic applications.

• Parameterized Algorithms
• Kernelization
• Exact Algorithms
• +۶ مورد دیگر

Sebastian Ordyniak is an Associate Professor in the Department of Algorithms and Complexity at TU Wien. His research focuses on parameterized complexity, algorithms, computational complexity, and applications in artificial intelligence and graph theory. He holds a PhD and the prestigious START Prize (2014–2022), a renowned Austrian award for outstanding researchers. Key projects include the ERC-funded 'Parameterized Complexity of Local Search' (2010–2014) and ongoing initiatives like 'Parameterized Analysis in Artificial Intelligence' (2021–2026). His work bridges theoretical foundations with practical applications, such as algorithmic fairness, machine learning interpretability, and graph drawing. Research highlights include contributions to SAT solving, backdoor analysis, and clustering algorithms. He has advised at least one student, Hossein Maleki, on practical algorithms for deletion to small components. His interdisciplinary approach integrates logic, computational geometry, and multi-agent systems.

• Parameterized Complexity
• Algorithms
• Computational Complexity
• +۳ مورد دیگر

Phuc Hung Hoang is a postdoctoral researcher in the Algorithms and Complexity Group at Technische Universität Wien (TU Wien) since November 2023, mentored by Robert Ganian. Prior to this, he worked as an Applied Scientist at Amazon EU (2021–2022) and earned his doctorate at ETH Zurich in 2022 under Bernd Gärtner and Emo Welzl. He holds a Master’s in Operational Research from the London School of Economics (2018) and a Chartered Accountant background from the National University of Singapore. His research bridges algorithmic design, discrete structures, and interdisciplinary applications. Key areas include graph algorithms, combinatorial optimization, computational complexity, reconfiguration problems, and efficient enumeration. His work often explores how structural properties of problems enable faster algorithms, with a focus on parameterized complexity, combinatorial games, and computational geometry. Recent publications highlight trends in reconfiguration problems , graph theory , and combinatorial optimization , including analyses of k-opt for TSP, degree-constrained spanning trees, and flip-based enumeration techniques. He secured the FWF ESPRIT Grant (2025–2028) as Principal Investigator for the project Structural Analysis of Combinatorial Reconfiguration . At TU Wien, he teaches courses like Efficient Algorithms and Hypercube Structures . He has supervised over 12 theses, including works on signotopes, lattice congruences, and graph safety. Beyond academia, he integrates humanistic and artistic perspectives through initiatives like Letter Earthlings and the Intercultural Science-Art Project .

• Algorithms
• Computational Complexity
• Discrete Mathematics
• +۶ مورد دیگر