Frank Sommer | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/frank-sommer/Frank SommerHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngFrank Sommerhttps://ac.tuwien.ac.at/team/frank-sommer/Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radiihttps://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networkshttps://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Optimal Decision Tree Pruning Revisited: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubshttps://ac.tuwien.ac.at/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/On Critical Node Problems with Vulnerable Verticeshttps://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices-2/On the Complexity of Community-aware Network~Sparsificationhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-community-aware-network-sparsification/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-community-aware-network-sparsification/SubModST: A Fast Generic Solver for Submodular~Maximization with Size Constraintshttps://ac.tuwien.ac.at/publication/submodst-a-fast-generic-solver-for-submodular-maximization-with-size-constraints/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/submodst-a-fast-generic-solver-for-submodular-maximization-with-size-constraints/Computing Dense and Sparse Subgraphs of Weakly Closed Graphshttps://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/Destroying Multicolored Paths and Cycles in Edge-Colored Graphshttps://ac.tuwien.ac.at/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/Essentially Tight Kernels for (Weakly) Closed Graphshttps://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/Exact Algorithms for Group Closeness Centralityhttps://ac.tuwien.ac.at/publication/exact-algorithms-for-group-closeness-centrality/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-algorithms-for-group-closeness-centrality/Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphshttps://ac.tuwien.ac.at/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/On Computing Optimal Tree Ensembleshttps://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Modelhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model/On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristicshttps://ac.tuwien.ac.at/publication/on-the-group-coverage-centrality-problem-parameterized-complexity-and-heuristics/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-group-coverage-centrality-problem-parameterized-complexity-and-heuristics/The Parameterized Complexity of s-Club with Triangle and Seed Constraintshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints-2/Colored cut gameshttps://ac.tuwien.ac.at/publication/colored-cut-games-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/colored-cut-games-2/Covering Many (Or Few) Edges with k Vertices in Sparse Graphshttps://ac.tuwien.ac.at/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problemshttps://ac.tuwien.ac.at/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/On Critical Node Problems with Vulnerable Verticeshttps://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices/On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementationshttps://ac.tuwien.ac.at/publication/on-hard-subgraph-problems-parameterized-algorithms-and-efficient-implementations/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-hard-subgraph-problems-parameterized-algorithms-and-efficient-implementations/Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphshttps://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/The Parameterized Complexity of s-Club with Triangle and Seed Constraintshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints/Destroying Bicolored $P_3$s by Deleting Few Edgeshttps://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/Enumerating connected induced subgraphs: Improved delay and experimental comparisonhttps://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison-2/Essentially Tight Kernels For (Weakly) Closed Graphshttps://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs/Preventing Small (s,t)Cuts by Protecting Edgeshttps://ac.tuwien.ac.at/publication/preventing-small-s-t-cuts-by-protecting-edges/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/preventing-small-s-t-cuts-by-protecting-edges/Colored Cut Gameshttps://ac.tuwien.ac.at/publication/colored-cut-games/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/colored-cut-games/Computing Dense and Sparse Subgraphs of Weakly Closed Graphshttps://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/Exploiting c-Closure in Kernelization Algorithms for Graph Problemshttps://ac.tuwien.ac.at/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problemshttps://ac.tuwien.ac.at/publication/fixcon-a-generic-solver-for-fixed-cardinality-subgraph-problems/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixcon-a-generic-solver-for-fixed-cardinality-subgraph-problems/Parameterized algorithms for Module Map problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems-2/Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphshttps://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/String Factorizations Under Various Collision Constraintshttps://ac.tuwien.ac.at/publication/string-factorizations-under-various-collision-constraints/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/string-factorizations-under-various-collision-constraints/Approximation Algorithms for BalancedCC Multiwinner Ruleshttps://ac.tuwien.ac.at/publication/approximation-algorithms-for-balancedcc-multiwinner-rules/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximation-algorithms-for-balancedcc-multiwinner-rules/Destroying Bicolored $P_3$s by Deleting Few Edgeshttps://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparisonhttps://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison/Parameterized Algorithms for Module Map Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems/