TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Manuel Sorge

Univ.Ass. Dipl.-Inf. Dr.rer.nat.

Role

Contact

2025W

 

2025

  • The complexity of cluster vertex splitting and company / Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu, A., & Monika, M. (2025). The complexity of cluster vertex splitting and company. Discrete Applied Mathematics, 365, 190–207. https://doi.org/10.1016/j.dam.2025.01.012
  • Planarizing graphs and their drawings by vertex splitting / Nöllenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H. Y., & Wulms, J. (2025). Planarizing graphs and their drawings by vertex splitting. Journal of Computational Geometry (JOCG), 16(1), 333–372. https://doi.org/10.20382/jocg.v16i1a10

2024

2023

  • Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation / Hatzel, M., Jaffke, L., LIMA BARBOSA, C. P., Masařík, T., Pilipczuk, M., Sharma, R., & Sorge, M. (2023). Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA23) (pp. 3229–3244). https://doi.org/10.1137/1.9781611977554.ch123
  • On Computing Optimal Tree Ensembles / Komusiewicz, C., Kunz, P., Sommer, F., & Sorge, M. (2023). On Computing Optimal Tree Ensembles. In A. Krause, E. Brunskill, K. Cho, B. Engelhardt, S. Sabato, & J. Scarlett (Eds.), Proceedings of the 40th International Conference on Machine Learning (pp. 17364–17374). http://hdl.handle.net/20.500.12708/192688
  • Planarizing Graphs and Their Drawings by Vertex Splitting / Nöllenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.-Y., & Wulms, J. (2023). Planarizing Graphs and Their Drawings by Vertex Splitting. In P. Angelini & R. von Haxleden (Eds.), Graph Drawing and Network Visualization. GD 2022 (pp. 232–246). Springer. https://doi.org/10.1007/978-3-031-22203-0_17
  • The Influence of Dimensions on the Complexity of Computing Decision Trees / Kobourov, S. G., Löffler, M., Montecchiani, F., Pilipczuk, M., Rutter, I., Seidel, R., Sorge, M., & Wulms, J. (2023). The Influence of Dimensions on the Complexity of Computing Decision Trees. In B. Williams, Y. Chen, & J. Neville (Eds.), Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 8343–8350). AAAI Press. https://doi.org/10.1609/aaai.v37i7.26006
  • 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)

2022

2021

  • Threshold Treewidth and Hypertree Width / Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2021). Threshold Treewidth and Hypertree Width. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI’20: Twenty-Ninth International Joint Conference on Artificial Intelligence, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/263
  • 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
  • Cluster Editing Parameterized Above Modification-Disjoint P3-Packings / Li, S., Pilipczuk, M., & Sorge, M. (2021). Cluster Editing Parameterized Above Modification-Disjoint P3-Packings. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) (pp. 1–16). LIPICS. https://doi.org/10.4230/LIPIcs.STACS.2021.49
  • Optimal Discretization is Fixed-parameter Tractable / Kratsch, S., Masařík, T., Muzi, I., Pilipczuk, M., & Sorge, M. (2021). Optimal Discretization is Fixed-parameter Tractable. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1702–1719). ACM. https://doi.org/10.1137/1.9781611976465.103
  • 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
  • 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
  • Your rugby mates don't need to know your colleagues: Triadic closure with edgecolors / Bulteau, L., Grüttemeier, N., Komusiewicz, C., & Sorge, M. (2021). Your rugby mates don’t need to know your colleagues: Triadic closure with edgecolors. Journal of Computer and System Sciences, 120, 75–96. https://doi.org/10.1016/j.jcss.2021.03.001