2024W

• Algorithms in Graph Theory / 192.018 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Introduction to Quantum Computing, Complexity Theory, and Algorithmics / 192.042 / VU
• Quantum Computing, Complexity Theory, and Algorithmics / 192.043 / VU
• Scientific Research and Writing / 193.052 / SE
• Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory / 192.119 / SE

2025S

• Project in Computer Science 1 / 192.021 / PR

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

• 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)
• 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 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)
• 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).
• 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).
• 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)
• 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
• 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
• 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
• 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
• 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
• 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

• 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)