2026W

• Bachelor Thesis in Computer Science / 186.819 / PR
• Beyond Exact Algorithms / 192.163 / VU
• Projektarbeit QIST / 194.203 / PR
• Quantum Computing, Complexity Theory, and Algorithmics / 192.043 / VU
• Quantum Information Science and Technology Seminar / 194.204 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for Master Students in Logic and Artificial Intelligence / 180.773 / SE
• Seminar for Master Students in Software Engineering (Foundations, Logic, and Security) Areas: Algorithms and Complexity; Verification and Automated Reasoning; Logic and Knowledge Representation; Security and Privacy / 180.010 / SE
• Supplementary Course Algorithms and Data Structures / 192.219 / VU

2027S

• Project in Computer Science 1 / 192.021 / PR
• Seminar for PhD candidates / 186.199 / SE

• Structural and Algorithmic Aspects of Preference-based Problems in Social Choice
  2019 – 2027 / Vienna Science and Technology Fund (WWTF)
  Publications: 193327 / 193323 / 225332 / 225285

2026

• Stable marriage with multi-modal preferences / Chen, J., Niedermeier, R., & Skowron, P. (2026). Stable marriage with multi-modal preferences. Journal of Computer and System Sciences, 160, Article 103778. https://doi.org/10.1016/j.jcss.2026.103778
• Optimal seat arrangement: What are the hard and easy cases? / Ceylan, E., Chen, J., & Roy, S. (2026). Optimal seat arrangement: What are the hard and easy cases? Journal of Computer and System Sciences, 160, Article 103779. https://doi.org/10.1016/j.jcss.2026.103779
• Control in Hedonic Games / Chen, J., Guttmann, J., Mustajbašić, M., & Simola, S. (2026). Control in Hedonic Games. In AAMAS ’26 : Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems (pp. 920–928). International Foundation for Autonomous Agents and Multiagent Systems. https://doi.org/10.65109/WVYI7850
• How Hard Is It to Explain Preferences Using Few Boolean Attributes? / Anzinger, C., Chen, J., Hatschka, C., Sorge, M., & Temper, A. (2026). How Hard Is It to Explain Preferences Using Few Boolean Attributes? In Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (pp. 16639–16646). AAAI Press. https://doi.org/10.1609/aaai.v40i20.38705
• Adapting stable matchings to evolving preferences / Bredereck, R., Chen, J., Knop, D., Luo, J., & Niedermeier, R. (2026). Adapting stable matchings to evolving preferences. Games and Economic Behavior, 157, 322–350. https://doi.org/10.1016/j.geb.2026.02.006
• Multidimensional Manhattan preferences / Chen, J., Nöllenburg, M., Simola, S. H. E., Villedieu, A., & Wallinger, M. (2026). Multidimensional Manhattan preferences. Discrete Applied Mathematics, 395, 172–202. https://doi.org/10.1016/j.dam.2026.05.030
• Computational Social Choice: Parameterized complexity and challenges / Chen, J., Hatschka, C., & Simola, S. (2026). Computational Social Choice: Parameterized complexity and challenges. Computer Science Review, 61, 1–18. https://doi.org/10.1016/j.cosrev.2025.100835

2025

• Control in Computational Social Choice / Chen, J., Kaczmarek, J., Nüsken, P., Rothe, J., Schlotter, I., & Seeger, T. (2025). Control in Computational Social Choice. In J. Kwok (Ed.), Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (pp. 10391–10399). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2025/1154
• Partitioned Combinatorial Optimization Games / Chen, J., Hatschka, C., & Simola, S. (2025). Partitioned Combinatorial Optimization Games. In I. Lynce, N. Murano, M. Vallati, S. Villata, F. Chesani, M. Milano, A. Omicini, & M. Dastani (Eds.), ECAI 2025 : 28th European Conference on Artificial Intelligence : Including 14th Conference on Prestigious Applications of Intelligent Systems (PAIS 2025). IOS Press. https://doi.org/10.3233/FAIA250962
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity / Chen, J., Durand, M., & Hatschka, C. (2025). Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity. In J. Kwok (Ed.), Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (pp. 3780–3787). https://doi.org/10.24963/ijcai.2025/420
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)

2024

• Fairness in Assignments with Congestion-Averse Agents: Concepts, Algorithms, and Complexity / Chen, J. (2024, December 11). Fairness in Assignments with Congestion-Averse Agents: Concepts, Algorithms, and Complexity [Presentation]. Algorithmics of Fair Division and Social Choice Workshop on Voting, Matching, and Preference Aggregation, Singapore. http://hdl.handle.net/20.500.12708/210387
• Multi-Winner Reconfiguration / Chen, J., Hatschka, C., & Simola, S. H. E. (2024, December 11). Multi-Winner Reconfiguration [Poster Presentation]. 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada. http://hdl.handle.net/20.500.12708/210385
• Cluster Editing for Multi-Layer and Temporal Graphs / Chen, J., Molter, H., Sorge, M., & Ondra Suchý. (2024). Cluster Editing for Multi-Layer and Temporal Graphs. Theory of Computing Systems, 68(5), 1239–1290. https://doi.org/10.1007/s00224-024-10174-y
• Cutsets and EF1 Fair Division of Graphs / Chen, J., & Zwicker, W. (2024). Cutsets and EF1 Fair Division of Graphs. In AAMAS ’24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (pp. 2192–2194). https://doi.org/10.5555/3635637
  Download: PDF (912 KB)
• Parameterized Algorithms for Optimal Refugee Resettlement / Chen, J., Schlotter, I., & Simola, S. (2024). Parameterized Algorithms for Optimal Refugee Resettlement. In U. Endriss, F. S. Melo, K. Bach, A. Bugarín-Diz, J. M. Alonso-Moral, S. Barro, & F. Heintz (Eds.), ECAI 2024 (pp. 3413–3420). IOS Press. https://doi.org/10.3233/FAIA240892
  Download: PDF (336 KB)
• A note on clustering aggregation for binary clusterings / Chen, J., Hermelin, D., & Sorge, M. (2024). A note on clustering aggregation for binary clusterings. Operations Research Letters, 52, Article 107052. https://doi.org/10.1016/j.orl.2023.11.005

2023

• Advancing Stability in Matching Markets: Multi-Modal Preferences and Beyond / Chen, J. (2023, November 6). Advancing Stability in Matching Markets: Multi-Modal Preferences and Beyond [Presentation]. Algorithms, Approximation, and Learning in Market and Mechanism Design, Oakland, United States of America (the).
• Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences / Chen, J., Hatschka, C., & Simola, S. (2023). Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. In ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 397–404). IOS Press. https://doi.org/10.3233/FAIA230296
  Download: PDF (337 KB)
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity / Chen, J., Csáji, G., Roy, S., & Simola, S. H. E. (2023). Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 251–259). http://hdl.handle.net/20.500.12708/193324
• Optimal Seat Arrangement: What Are the Hard and Easy Cases? / Ceylan, E., Chen, J., & Roy, S. (2023). Optimal Seat Arrangement: What Are the Hard and Easy Cases? In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 2563–2571). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/285
  Download: PDF (209 KB)
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Game Implementation: What Are the Obstructions? / Chen, J., Layegh Khavidaki, S. N., Haydn, S. V., Simola, S., & Sorge, M. (2023). Game Implementation: What Are the Obstructions? In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 5557–5564). AAAI Press. https://doi.org/10.34726/5365
  Download: PDF (178 KB)
• Optimal Capacity Modification for Many-To-One Matching Problems / Chen, J., & Csáji, G. (2023). Optimal Capacity Modification for Many-To-One Matching Problems. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 2880–2882).

2022

• Multidimensional Manhattan Preferences / Chen, J., Nöllenburg, M., Simola, S., Villedieu, A., & Wallinger, M. (2022). Multidimensional Manhattan Preferences. In LATIN 2022: Theoretical Informatics (pp. 273–289). https://doi.org/10.1007/978-3-031-20624-5_17
• Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space / Chen, J., & Roy, S. (2022). Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.36
  Download: PDF (740 KB)
• Participatory Budgeting with Donations and Diversity Constraints / Chen, J., Lackner, M., & Maly, J. (2022). Participatory Budgeting with Donations and Diversity Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 9323–9330). AAAI Press. https://doi.org/10.1609/aaai.v36i9.21163
  Project: SuDeMa (2019–2025)

2021

• On (Coalitional) Exchange-Stable Matching / Chen, J., Chmurovic, A., Jogl, F., & Sorge, M. (2021). On (Coalitional) Exchange-Stable Matching. In Algorithmic Game Theory (pp. 205–220). LNCS / Springer. https://doi.org/10.1007/978-3-030-85947-3_14
• Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP / Chen, J., Ganian, R., & Hamm, T. (2021). Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (pp. 1–7). http://hdl.handle.net/20.500.12708/55573
• Computational aspects of multiwinner approval voting via p-norm Hamming distance vectors / Chen, J., Hermelin, D., & Sorge, M. (2021). Computational aspects of multiwinner approval voting via p-norm Hamming distance vectors. Aggregation across disciplines: connections and frameworks, Paris, France. http://hdl.handle.net/20.500.12708/87316
• Efficient fully dynamic elimination forests with applications to detecting long paths and cycles / Chen, J., Czerwinski, W., Disser, Y., Feldmann, A. E., Hermelin, D., Nadara, W., Pilipczuk, M., Pilipczuk, M., Sorge, M., Wróblewski, B., & Zych-Pawlewicz, A. (2021). Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 796–809). Siam. https://doi.org/10.1137/1.9781611976465.50
• Fractional Matchings under Preferences: Stability and Optimality / Chen, J. (2021). Fractional Matchings under Preferences: Stability and Optimality. COMSOC Video Seminar, International Seminar Series on Social Choice, online, Unknown. http://hdl.handle.net/20.500.12708/87317
• Matchings under Preferences: Strength of Stability and Tradeoffs / Chen, J., Skowron, P., & Sorge, M. (2021). Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Transactions on Economics and Computation, 9(4), 1–55. https://doi.org/10.1145/3485000
• Fractional Matchings under Preferences: Stability and Optimality / Chen, J., Roy, S., & Sorge, M. (2021). Fractional Matchings under Preferences: Stability and Optimality. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/13
• Small one‑dimensional Euclidean preference profiles / Chen, J., & Grottke, S. (2021). Small one‑dimensional Euclidean preference profiles. Social Choice and Welfare, 57(1), 117–144. https://doi.org/10.1007/s00355-020-01301-y

2020

• Adapting Stable Matchings to Evolving Preferences / Bredereck, R., Chen, J., Knop, D., Luo, J., & Niedermeier, R. (2020). Adapting Stable Matchings to Evolving Preferences. In Proceedings of AAAI2020 (pp. 1830–1837). http://hdl.handle.net/20.500.12708/58335
• Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences / Bredereck, R., Chen, J., Finnendahl, U. P., & Niedermeier, R. (2020). Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences. Autonomous Agents and Multi-Agent Systems, 34(53). https://doi.org/10.1007/s10458-020-09470-x

• Reconfiguration of resource allocation / Eyjólfsson, L. (2026). Reconfiguration of resource allocation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.129205
  Download: PDF (798 KB)
• Algorithmic Complexity of Matching and Games / Simola, S. H. E. (2026). Algorithmic Complexity of Matching and Games [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.138201
  Download: PDF (4.87 MB)
• Optimal Seat arrangement: Structure, algorithms, and complexity / Ceylan, E. (2022). Optimal Seat arrangement: Structure, algorithms, and complexity [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98801
  Download: PDF (1.67 MB)