Frank Sommer

Address:
Frank Sommer
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HD0409
Phone:	+43(1)58801–192156
Email:	fsommer@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/fsommer/

Research Interests

Parameterized algoritms
Algorithm engineering
Hard problems in Data Science and Machine Learning
Graph algorithms

Brief CV

Since 06.2024	Humboldt fellow (Feodor Lynen stipend for Postdocs) at TU Wien
05.2023 - 05.2024	Postdoc at Friedrich-Schiller-Universität Jena
11.2022 - 05.2023	Postdoc at Philipps-Universität Marburg
11.2017 - 11.2022	PhD- student at Philipps-Universität Marburg
10.2015 - 10.2017	Master in Mathematics at Friedrich-Schiller-Universität Jena
10.2012 - 09.2015	Bachelor in Mathematics at Friedrich-Schiller-Universität Jena

Publications

Most of my publications are listed at DBLP and Google Scholar.

35 results

2024
[35]	On Critical Node Problems with Vulnerable Vertices Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer J. Graph Algorithms Appl., volume 28, number 1, pages 1–26, 2024. [bibtex] [pdf] [doi]
[34]	Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer J. Comb. Optim., 2024. Note: to appear [bibtex]
[33]	SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints Henning Martin Woydt, Christian Komusiewicz, Frank Sommer 32nd Annual European Symposium on Algorithms (ESA 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[32]	On the Complexity of Community-aware Network Sparsification Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
2023
[31]	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Tomohiro Koana, Christian Komusiewicz, Frank Sommer Algorithmica, volume 85, number 7, pages 2156–2187, 2023. [bibtex] [pdf] [doi]
[30]	Essentially Tight Kernels for (Weakly) Closed Graphs Tomohiro Koana, Christian Komusiewicz, Frank Sommer Algorithmica, volume 85, number 6, pages 1706–1735, 2023. [bibtex] [pdf] [doi]
[29]	The Parameterized Complexity of s-Club with Triangle and Seed Constraints Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer Theory Comput. Syst., volume 67, number 5, pages 1050–1081, 2023. [bibtex] [pdf] [doi]
[28]	Destroying Multicolored Paths and Cycles in Edge-Colored Graphs Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer Discret. Math. Theor. Comput. Sci., volume 25, 2023. [bibtex] [pdf] [doi]
[27]	Exact Algorithms for Group Closeness Centrality Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 1–12, 2023, SIAM. [bibtex] [pdf] [doi]
[26]	On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics Christian Komusiewicz, Jannis Schramek, Frank Sommer SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 13–24, 2023, SIAM. [bibtex] [pdf] [doi]
[25]	On Computing Optimal Tree Ensembles Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR. [bibtex] [pdf]
[24]	On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model Matthias Bentert, Jannik Schestag, Frank Sommer 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 4:1–4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[23]	Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings (Leszek Gasieniec, ed.), volume 13878 of Lecture Notes in Computer Science, pages 283–297, 2023, Springer Verlag. [bibtex] [pdf] [doi]
2022
[22]	Colored cut games Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer Theoretical Computer Science, volume 936, pages 13–32, 2022. [bibtex] [pdf] [doi]
[21]	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer Theory Comput. Syst., volume 66, number 5, pages 1019–1045, 2022. [bibtex] [pdf] [doi]
[20]	Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problems Tomohiro Koana, Christian Komusiewicz, Frank Sommer SIAM J. Discrete Math., volume 36, number 4, pages 2798–2821, 2022. [bibtex] [pdf] [doi]
[19]	On Critical Node Problems with Vulnerable Vertices Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 494–508, 2022, Springer Verlag. [bibtex] [pdf] [doi]
[18]	Covering Many (Or Few) Edges with k Vertices in Sparse Graphs Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 42:1–42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	The Parameterized Complexity of s-Club with Triangle and Seed Constraints Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 313–326, 2022, Springer Verlag. [bibtex] [pdf] [doi]
[16]	On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations Frank Sommer 2022, PhD thesis, University of Marburg, Germany. [bibtex] [pdf] [doi]
2021
[15]	Enumerating connected induced subgraphs: Improved delay and experimental comparison Christian Komusiewicz, Frank Sommer Discr. Appl. Math., volume 303, pages 262–282, 2021. [bibtex] [pdf] [doi]
[14]	Destroying Bicolored $P_3$s by Deleting Few Edges Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer Discret. Math. Theor. Comput. Sci., volume 23, number 1, 2021. [bibtex] [pdf] [doi]
[13]	Essentially Tight Kernels For (Weakly) Closed Graphs Tomohiro Koana, Christian Komusiewicz, Frank Sommer 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 35:1–35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Preventing Small (s,t)Cuts by Protecting Edges Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, eds.), volume 12911 of Lecture Notes in Computer Science, pages 143–155, 2021, Springer Verlag. [bibtex] [pdf] [doi]
2020
[11]	Parameterized algorithms for Module Map problems Frank Sommer, Christian Komusiewicz Discr. Appl. Math., volume 283, pages 396–416, 2020. [bibtex] [pdf] [doi]
[10]	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings (Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora, eds.), volume 12011 of Lecture Notes in Computer Science, pages 248–259, 2020, Springer Verlag. [bibtex] [pdf] [doi]
[9]	Colored Cut Games Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 30:1–30:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems Christian Komusiewicz, Frank Sommer Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020 (Guy E. Blelloch, Irene Finocchi, eds.), pages 12–26, 2020, SIAM. [bibtex] [pdf] [doi]
[7]	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Tomohiro Koana, Christian Komusiewicz, Frank Sommer 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao, Siu-Wing Cheng, Minming Li, eds.), volume 181 of LIPIcs, pages 20:1–20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	Exploiting c-Closure in Kernelization Algorithms for Graph Problems Tomohiro Koana, Christian Komusiewicz, Frank Sommer 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference) (Fabrizio Grandoni, Grzegorz Herman, Peter Sanders, eds.), volume 173 of LIPIcs, pages 65:1–65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[5]	String Factorizations Under Various Collision Constraints Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark (Inge Li Gørtz, Oren Weimann, eds.), volume 161 of LIPIcs, pages 17:1–17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
2019
[4]	Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison Christian Komusiewicz, Frank Sommer SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini, eds.), volume 11376 of Lecture Notes in Computer Science, pages 272–284, 2019, Springer Verlag. [bibtex] [pdf] [doi]
[3]	Destroying Bicolored $P_3$s by Deleting Few Edges Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings (Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero, eds.), volume 11558 of Lecture Notes in Computer Science, pages 193–204, 2019, Springer Verlag. [bibtex] [pdf] [doi]
[2]	Approximation Algorithms for BalancedCC Multiwinner Rules Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019 (Edith Elkind, Manuela Veloso, Noa Agmon, Matthew E. Taylor, eds.), pages 494–502, 2019, International Foundation for Autonomous Agents and Multiagent Systems. [bibtex] [pdf]
2018
[1]	Parameterized Algorithms for Module Map Problems Frank Sommer, Christian Komusiewicz Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers (Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub, eds.), volume 10856 of Lecture Notes in Computer Science, pages 376–388, 2018, Springer Verlag. [bibtex] [pdf] [doi]