Christian Komusiewicz

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 117

Top Venues

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Christian Komusiewicz, Jannik Schestag
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study. CoRR (2024)
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28 (1) (2024)
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
On the Complexity of Community-Aware Network Sparsification. MFCS (2024)
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
On the Complexity of Community-aware Network Sparsification. CoRR (2024)
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation. CoRR (2023)
Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. ICML (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85 (7) (2023)
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. CoRR (2023)
Christian Komusiewicz, Jannis Schramek, Frank Sommer
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA (2023)
Christian Komusiewicz, Jannik Schestag
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem. CoRR (2023)
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023)
Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS (2023)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory Comput. Syst. 67 (5) (2023)
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation. SDM (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85 (6) (2023)
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
On computing exact means of time series using the move-split-merge metric. Data Min. Knowl. Discov. 37 (2) (2023)
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Max c-Cut. IJCAI (2023)
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Exact Algorithms for Group Closeness Centrality. ACDA (2023)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR (2022)
Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC (2022)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36 (4) (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR (2022)
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR (2022)
Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. J. Artif. Intell. Res. 74 (2022)
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA (2022)
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. IWOCA (2022)
Christian Komusiewicz, Nils Morawietz
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. MFCS (2022)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123 (2022)
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
On Computing Exact Means of Time Series Using the Move-Split-Merge Metric. CoRR (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored cut games. Theor. Comput. Sci. 936 (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66 (5) (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small $\mathbf {(s, t)}$-Cuts by Protecting Edges. WG (2021)
Christian Komusiewicz, Frank Sommer
Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discret. Appl. Math. 303 (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. IJCAI (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC (2021)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR (2021)
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR (2021)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS (2021)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120 (2021)
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
Sorting by Multi-Cut Rearrangements. Algorithms 14 (6) (2021)
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
Sorting by Multi-cut Rearrangements. SOFSEM (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. CoRR (2021)
Christian Komusiewicz, Nils Morawietz
Can Local Optimality Be Used for Efficient Data Reduction? CIAC (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI (2021)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
Destroying Bicolored $P_3$s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
Parameterized String Equations. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. CoRR (2020)
Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. CoRR (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA (2020)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT (2020)
Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. IJCAI (2020)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82 (4) (2020)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
String Factorizations Under Various Collision Constraints. CPM (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored Cut Games. FSTTCS (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR (2020)
Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theor. Comput. Sci. 847 (2020)
Frank Sommer, Christian Komusiewicz
Parameterized algorithms for Module Map problems. Discret. Appl. Math. 283 (2020)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34 (1) (2020)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1 (4) (2020)
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. 283 (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR (2020)
Christian Komusiewicz, Frank Sommer
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX (2020)
Guillaume Fertin, Christian Komusiewicz
Graph Motif Problems Parameterized by Dual. J. Graph Algorithms Appl. 24 (3) (2020)
Guillaume Fertin, Christian Komusiewicz
Graph Motif Problems Parameterized by Dual. CoRR (2019)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CiE (2019)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7 (2) (2019)
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. 275 (3) (2019)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CoRR (2019)
Christian Komusiewicz, Frank Sommer
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM (2019)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81 (5) (2019)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC (2019)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA (2018)
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR (2018)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. CoRR (2018)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62 (3) (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92 (2018)
Guillaume Fertin, Julien Fradin, Christian Komusiewicz
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. CPM (2018)
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC (2018)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. WG (2018)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR (2018)
Christian Komusiewicz
Tight Running Time Lower Bounds for Vertex Deletion Problems. ACM Trans. Comput. Theory 10 (2) (2018)
Frank Sommer, Christian Komusiewicz
Parameterized Algorithms for Module Map Problems. ISCO (2018)
Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74 (2018)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When can Graph Hyperbolicity be computed in Linear Time? CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS (2017)
Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM (2017)
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM (2017)
Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC (2017)
Maximilian Katzmann, Christian Komusiewicz
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. AAAI (2017)
Guillaume Fertin, Julien Fradin, Christian Komusiewicz
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. CoRR (2017)
René van Bevern, Christian Komusiewicz, Manuel Sorge
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70 (3) (2017)

Christian Komusiewicz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Komusiewicz