Jiehua Chen

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.