Christian Komusiewicz

227 papers A* 11A 10B 53C 13Misc 6Journal 120Unranked 12
YearRankTypeTitle / Venue / Authors
2026 B conf
A Complexity Analysis of the c-Closed Vertex Deletion Problem.
WALCOM
Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus
2026 A conf
A Parameterized-Complexity Framework for Finding Local Optima.
ITCS
Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026 J jnl
A Parameterized-Complexity Framework for Finding Local Optima.
CoRR
Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026 J jnl
A multivariate complexity analysis of the Generalized Noah's Ark Problem.
Discret. Appl. Math.
Christian Komusiewicz, Jannik Schestag
2026 B conf
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree.
SOFSEM
Christian Komusiewicz, Diptapriyo Majumdar
2026 J jnl
The Descriptive Complexity of Relation Modification Problems.
CoRR
Florian Chudigiewitsch, Marlene Gründel, Christian Komusiewicz, Nils Morawietz, Till Tantau
2026 J jnl
When can Cluster Deletion with bounded weights be solved efficiently?
Discret. Appl. Math.
Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz
2025 J jnl
A Complexity Analysis of the c-Closed Vertex Deletion Problem.
CoRR
Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus
2025 J jnl
Can Local Optimality Be Used for Efficient Data Reduction?
Theory Comput. Syst.
Christian Komusiewicz, Nils Morawietz
2025 J jnl
Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard.
ACM Trans. Comput. Theory
Christian Komusiewicz, Nils Morawietz
2025 — conf
Heuristic Graph Colouring using Hypergraph Representations.
ACDA
H. Martin Bücker, Christian Komusiewicz, Jurek Rostalsky
2025 A* conf
Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms.
ICML
Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus
2025 B conf
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration.
WG
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025 J jnl
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration.
CoRR
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
2025 — conf
Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions.
SAND
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025 J jnl
The Parameter Report: An Orientation Guide for Data-Driven Parameterization.
CoRR
Christian Komusiewicz, Nils Morawietz, Frank Sommer, Luca Pascal Staus
2025 B conf
Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set.
IPEC
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025 J jnl
Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set.
CoRR
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025 A* conf
Witty: An Efficient Solver for Computing Minimum-Size Decision Trees.
AAAI
Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2024 J jnl
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs.
J. Comb. Optim.
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
2024 — conf
Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study.
FSTTCS
Christian Komusiewicz, Jannik Schestag
2024 J jnl
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study.
CoRR
Christian Komusiewicz, Jannik Schestag
2024 B conf
Modularity Clustering Parameterized by Max Leaf Number.
IPEC
Jaroslav Garvardt, Christian Komusiewicz
2024 J jnl
On Critical Node Problems with Vulnerable Vertices.
J. Graph Algorithms Appl.
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2024 B conf
On the Complexity of Community-Aware Network Sparsification.
MFCS
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024 J jnl
On the Complexity of Community-aware Network Sparsification.
CoRR
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024 J jnl
Parameterized Local Search for Max
CoRR
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2024 — conf
Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis.
ADT
Jaroslav Garvardt, Christian Komusiewicz, Berthold Blatt Lorke, Jannik Schestag
2024 A conf
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints.
ESA
Henning Martin Woydt, Christian Komusiewicz, Frank Sommer
2024 J jnl
The role of twins in computing planar supports of hypergraphs.
J. Graph Algorithms Appl.
René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2024 B conf
When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?
ISAAC
Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz
2024 J jnl
Witty: An Efficient Solver for Computing Minimum-Size Decision Trees.
CoRR
Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2023 B conf
A Graph-Theoretic Formulation of Exploratory Blockmodeling.
SEA
Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2023 J jnl
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.
CoRR
Christian Komusiewicz, Jannik Schestag
2023 J jnl
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
Algorithmica
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023 J jnl
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
Discret. Math. Theor. Comput. Sci.
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2023 J jnl
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree.
CoRR
Christian Komusiewicz, Diptapriyo Majumdar
2023 J jnl
Essentially Tight Kernels for (Weakly) Closed Graphs.
Algorithmica
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023 — conf
Exact Algorithms for Group Closeness Centrality.
ACDA
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2023 A conf
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation.
SDM
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
2023 J jnl
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation.
CoRR
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
2023 A* conf
On Computing Optimal Tree Ensembles.
ICML
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023 J jnl
On Computing Optimal Tree Ensembles.
CoRR
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023 J jnl
On computing exact means of time series using the move-split-merge metric.
Data Min. Knowl. Discov.
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
2023 B conf
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric.
MFCS
Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger
2023 B conf
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem.
CPM
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
2023 — conf
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics.
ACDA
Christian Komusiewicz, Jannis Schramek, Frank Sommer
2023 A* conf
Parameterized Local Search for Max c-Cut.
IJCAI
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2023 J jnl
The Parameterized Complexity of s-Club with Triangle and Seed Constraints.
Theory Comput. Syst.
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2022 J jnl
Colored cut games.
Theor. Comput. Sci.
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022 A conf
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.
STACS
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022 J jnl
Covering Many (or Few) Edges with k Vertices in Sparse Graphs.
CoRR
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022 J jnl
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.
CoRR
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2022 J jnl
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs.
CoRR
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
2022 J jnl
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.
SIAM J. Discret. Math.
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2022 B conf
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard.
MFCS
Christian Komusiewicz, Nils Morawietz
2022 J jnl
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.
J. Artif. Intell. Res.
Niels Grüttemeier, Christian Komusiewicz
2022 J jnl
On Computing Exact Means of Time Series Using the Move-Split-Merge Metric.
CoRR
Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger
2022 C conf
On Critical Node Problems with Vulnerable Vertices.
IWOCA
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022 B conf
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial.
IPEC
Christian Komusiewicz, Nils Morawietz
2022 J jnl
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.
Theory Comput. Syst.
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022 J jnl
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration.
J. Comput. Syst. Sci.
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2022 C conf
The Parameterized Complexity of s-Club with Triangle and Seed Constraints.
IWOCA
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2022 J jnl
The Parameterized Complexity of s-Club with Triangle and Seed Constraints.
CoRR
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
2021 C conf
Can Local Optimality Be Used for Efficient Data Reduction?
CIAC
Christian Komusiewicz, Nils Morawietz
2021 J jnl
Destroying Bicolored P
Discret. Math. Theor. Comput. Sci.
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2021 J jnl
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
CoRR
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2021 A* conf
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.
AAAI
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021 J jnl
Enumerating connected induced subgraphs: Improved delay and experimental comparison.
Discret. Appl. Math.
Christian Komusiewicz, Frank Sommer
2021 B conf
Essentially Tight Kernels For (Weakly) Closed Graphs.
ISAAC
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021 J jnl
Essentially Tight Kernels for (Weakly) Closed Graphs.
CoRR
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021 A* conf
On the Parameterized Complexity of Polytree Learning.
IJCAI
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021 J jnl
On the Parameterized Complexity of Polytree Learning.
CoRR
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021 J jnl
Parameterized String Equations.
CoRR
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
2021 J jnl
Preventing Small (s, t)-Cuts by Protecting Edges.
CoRR
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2021 B conf
Preventing Small (s,t)Cuts by Protecting Edges.
WG
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2021 A conf
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration.
STACS
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021 J jnl
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration.
CoRR
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021 J jnl
Sorting by Multi-Cut Rearrangements.
Algorithms
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021 B conf
Sorting by Multi-cut Rearrangements.
SOFSEM
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021 J jnl
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.
J. Comput. Syst. Sci.
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2020 — conf
Colored Cut Games.
FSTTCS
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020 B conf
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
ISAAC
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020 J jnl
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
CoRR
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020 J jnl
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems.
CoRR
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020 A conf
Exploiting c-Closure in Kernelization Algorithms for Graph Problems.
ESA
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020 A conf
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems.
ALENEX
Christian Komusiewicz, Frank Sommer
2020 J jnl
Graph Motif Problems Parameterized by Dual.
J. Graph Algorithms Appl.
Guillaume Fertin, Christian Komusiewicz
2020 A* conf
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.
IJCAI
Niels Grüttemeier, Christian Komusiewicz
2020 J jnl
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.
CoRR
Niels Grüttemeier, Christian Komusiewicz
2020 J jnl
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms.
Discret. Appl. Math.
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2020 — conf
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.
SWAT
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2020 J jnl
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.
CoRR
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2020 J jnl
On the Relation of Strong Triadic Closure and Cluster Deletion.
Algorithmica
Niels Grüttemeier, Christian Komusiewicz
2020 J jnl
Parameterized algorithms for Module Map problems.
Discret. Appl. Math.
Frank Sommer, Christian Komusiewicz
2020 B conf
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.
SOFSEM
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020 J jnl
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping.
Theor. Comput. Sci.
Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
2020 J jnl
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
SIAM J. Discret. Math.
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2020 B conf
String Factorizations Under Various Collision Constraints.
CPM
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2020 J jnl
h-Index manipulation by undoing merges.
Quant. Sci. Stud.
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2019 J jnl
Assessing the computational complexity of multilayer subgraph detection.
Netw. Sci.
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2019 C conf
Destroying Bicolored P
CiE
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019 J jnl
Destroying Bicolored P
CoRR
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019 B conf
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison.
SOFSEM
Christian Komusiewicz, Frank Sommer
2019 J jnl
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments.
Eur. J. Oper. Res.
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2019 J jnl
Graph Motif Problems Parameterized by Dual.
CoRR
Guillaume Fertin, Christian Komusiewicz
2019 J jnl
When Can Graph Hyperbolicity be Computed in Linear Time?
Algorithmica
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2019 C conf
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors.
CIAC
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2018 J jnl
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments.
CoRR
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2018 B conf
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms.
IPEC
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2018 J jnl
Matching algorithms for assigning orthologs after genome duplication events.
Comput. Biol. Chem.
Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge
2018 B conf
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.
CPM
Guillaume Fertin, Julien Fradin, Christian Komusiewicz
2018 B conf
On the Relation of Strong Triadic Closure and Cluster Deletion.
WG
Niels Grüttemeier, Christian Komusiewicz
2018 J jnl
On the Relation of Strong Triadic Closure and Cluster Deletion.
CoRR
Niels Grüttemeier, Christian Komusiewicz
2018 C conf
Parameterized Algorithms for Module Map Problems.
ISCO
Frank Sommer, Christian Komusiewicz
2018 J jnl
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
J. Comput. Syst. Sci.
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018 J jnl
Parameterizing Edge Modification Problems Above Lower Bounds.
Theory Comput. Syst.
René van Bevern, Vincent Froese, Christian Komusiewicz
2018 A conf
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
ESA
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018 J jnl
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
CoRR
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018 J jnl
Tight Running Time Lower Bounds for Vertex Deletion Problems.
ACM Trans. Comput. Theory
Christian Komusiewicz
2018 J jnl
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors.
CoRR
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2017 J jnl
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.
Networks
René van Bevern, Christian Komusiewicz, Manuel Sorge
2017 C conf
Assessing the Computational Complexity of Multi-layer Subgraph Detection.
CIAC
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017 B conf
Beyond Adjacency Maximization: Scaffold Filling for New String Distances.
CPM
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2017 J jnl
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
CoRR
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2017 B conf
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.
CPM
Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
2017 A* conf
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.
AAAI
Maximilian Katzmann, Christian Komusiewicz
2017 J jnl
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.
CoRR
Guillaume Fertin, Julien Fradin, Christian Komusiewicz
2017 B conf
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.
IPEC
Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller
2017 B conf
When Can Graph Hyperbolicity Be Computed in Linear Time?
WADS
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017 J jnl
When can Graph Hyperbolicity be computed in Linear Time?
CoRR
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2016 J jnl
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets.
J. Discrete Algorithms
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2016 J jnl
Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
CoRR
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016 B conf
Graph Motif Problems Parameterized by Dual.
CPM
Guillaume Fertin, Christian Komusiewicz
2016 J jnl
H-index manipulation by merging articles: Models, theory, and experiments.
Artif. Intell.
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016 — ch.
Kernelization, Partially Polynomial Kernels.
Encyclopedia of Algorithms
Christian Komusiewicz
2016 J jnl
Multivariate Algorithmics for Finding Cohesive Subnetworks.
Algorithms
Christian Komusiewicz
2016 J jnl
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.
CoRR
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016 — conf
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
SWAT
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2016 J jnl
Parameterized complexity of critical node cuts.
Theor. Comput. Sci.
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2016 Misc conf
Parameterizing Edge Modification Problems Above Lower Bounds.
CSR
René van Bevern, Vincent Froese, Christian Komusiewicz
2016 — conf
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.
DOOR
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016 J jnl
Precedence-constrained scheduling problems parameterized by partial order width.
CoRR
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016 B conf
The First Parameterized Algorithms and Computational Experiments Challenge.
IPEC
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
2016 A conf
Twins in Subdivision Drawings of Hypergraphs.
GD
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2016 A conf
h-Index Manipulation by Undoing Merges.
ECAI
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016 J jnl
h-Index Manipulation by Undoing Merges.
CoRR
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015 J jnl
A graph modification approach for finding core-periphery structures in protein interaction networks.
Algorithms Mol. Biol.
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz
2015 J jnl
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems.
Discret. Appl. Math.
Christian Komusiewicz, Manuel Sorge
2015 C conf
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.
ATMOS
René van Bevern, Christian Komusiewicz, Manuel Sorge
2015 J jnl
Approximation algorithms for mixed, windy, and capacitated arc routing problems.
CoRR
René van Bevern, Christian Komusiewicz, Manuel Sorge
2015 B conf
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes.
WADS
Falk Hüffner, Christian Komusiewicz, André Nichterlein
2015 B conf
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.
SEA
Christian Komusiewicz, Manuel Sorge, Kolja Stahl
2015 B conf
Finding Highly Connected Subgraphs.
SOFSEM
Falk Hüffner, Christian Komusiewicz, Manuel Sorge
2015 J jnl
Finding Supported Paths in Heterogeneous Networks.
Algorithms
Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu
2015 A* conf
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
IJCAI
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015 J jnl
On explaining integer vectors by few homogeneous segments.
J. Comput. Syst. Sci.
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2015 J jnl
On structural parameterizations for the 2-club problem.
Discret. Appl. Math.
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2015 Misc conf
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs.
FAW
Christian Komusiewicz, Andreea Radulescu
2015 J jnl
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
J. Graph Algorithms Appl.
Sepp Hartung, Christian Komusiewicz, André Nichterlein
2015 B conf
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.
WG
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2015 B conf
Parameterized Complexity of Critical Node Cuts.
IPEC
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2015 J jnl
Parameterized Complexity of Critical Node Cuts.
CoRR
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon
2015 J jnl
Parameterizing edge modification problems above lower bounds.
CoRR
René van Bevern, Vincent Froese, Christian Komusiewicz
2015 J jnl
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discret. Math.
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2015 J jnl
The Parameterized Complexity of the Rainbow Subgraph Problem.
Algorithms
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
2015 J jnl
Tight Running Time Lower Bounds for Vertex Deletion Problems.
CoRR
Christian Komusiewicz
2015 J jnl
Towards an algorithmic guide to Spiral Galaxies.
Theor. Comput. Sci.
Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz
2015 J jnl
Twins in Subdivision Drawings of Hypergraphs.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015 J jnl
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2014 J jnl
A Cubic-Vertex Kernel for Flip Consensus Tree.
Algorithmica
Christian Komusiewicz, Johannes Uhlmann
2014 C conf
A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks.
WABI
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz
2014 J jnl
Local search for string problems: Brute-force is essentially optimal.
Theor. Comput. Sci.
Jiong Guo, Danny Hermelin, Christian Komusiewicz
2014 A* conf
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable.
SODA
Laurent Bulteau, Christian Komusiewicz
2014 J jnl
Multivariate Algorithmics for NP-Hard String Problems.
Bull. EATCS
Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
2014 J jnl
On Google Scholar H-Index Manipulation by Merging Articles.
CoRR
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2014 J jnl
On the parameterized complexity of consensus clustering.
Theor. Comput. Sci.
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
2014 J jnl
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
IEEE ACM Trans. Comput. Biol. Bioinform.
Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier
2014 B conf
Reversal Distances for Strings with Few Blocks or Small Alphabets.
CPM
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2014 B conf
The Parameterized Complexity of the Rainbow Subgraph Problem.
WG
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
2014 Misc conf
Towards an Algorithmic Guide to Spiral Galaxies.
FUN
Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz
2013 C conf
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.
WABI
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013 J jnl
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.
CoRR
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013 B conf
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
ISAAC
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2013 B conf
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.
SEA
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
2013 B conf
Local Search for String Problems: Brute Force Is Essentially Optimal.
CPM
Jiong Guo, Danny Hermelin, Christian Komusiewicz
2013 J jnl
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable
CoRR
Laurent Bulteau, Christian Komusiewicz
2013 B conf
On Explaining Integer Vectors by Few Homogenous Segments.
WADS
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2013 J jnl
On Structural Parameterizations for the 2-Club Problem
CoRR
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2013 B conf
On Structural Parameterizations for the 2-Club Problem.
SOFSEM
Sepp Hartung, Christian Komusiewicz, André Nichterlein
2013 — conf
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
ISBRA
Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier
2012 J jnl
An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels.
Comput. Math. Methods Medicine
Christoph Schmidt, Thomas Weiss, Christian Komusiewicz, Herbert Witte, Lutz Leistritz
2012 J jnl
Cluster editing with locally bounded modifications.
Discret. Appl. Math.
Christian Komusiewicz, Johannes Uhlmann
2012 B conf
Finding Dense Subgraphs of Sparse Graphs.
IPEC
Christian Komusiewicz, Manuel Sorge
2012 B conf
New Races in Parameterized Algorithmics.
MFCS
Christian Komusiewicz, Rolf Niedermeier
2012 J jnl
On making directed graphs transitive.
J. Comput. Syst. Sci.
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2012 B conf
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
IPEC
Sepp Hartung, Christian Komusiewicz, André Nichterlein
2012 J jnl
Parameterized computational complexity of finding small-diameter subgraphs.
Optim. Lett.
Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2012 B conf
Partitioning into Colorful Components by Minimum Edge Deletions.
CPM
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
2012 Misc conf
Train Marshalling Is Fixed Parameter Tractable.
FUN
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
2011 B conf
Alternative Parameterizations for Cluster Editing.
SOFSEM
Christian Komusiewicz, Johannes Uhlmann
2011 J jnl
Average parameterization and partial kernelization for computing medians.
J. Comput. Syst. Sci.
Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
2011 J jnl
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring.
J. Discrete Algorithms
Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2011 J jnl
Editing Graphs into Disjoint Unions of Dense Clusters.
Algorithmica
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
2011 J jnl
Graph-based data clustering with overlaps.
Discret. Optim.
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2011 B conf
On the Parameterized Complexity of Consensus Clustering.
ISAAC
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
2011 J jnl
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE ACM Trans. Comput. Biol. Bioinform.
Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2011 — —
Parameterized Algorithmics for Network Analysis: Clustering & Querying.
Christian Komusiewicz
2010 J jnl
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.
SIAM J. Discret. Math.
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2010 B conf
Average Parameterization and Partial Kernelization for Computing Medians.
LATIN
Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
2010 A* conf
Exact Algorithms and Experiments for Hierarchical Tree Clustering.
AAAI
Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2010 J jnl
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Theory Comput. Syst.
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2010 B conf
Measuring Indifference: Unit Interval Vertex Deletion.
WG
René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2009 C conf
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.
AAIM
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009 B conf
Deconstructing Intractability: A Case Study for Interval Constrained Coloring.
CPM
Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009 B conf
Editing Graphs into Disjoint Unions of Dense Clusters.
ISAAC
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
2009 Misc conf
Graph-Based Data Clustering with Overlaps.
COCOON
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009 J jnl
Isolation concepts for clique enumeration: Comparison and computational experiments.
Theor. Comput. Sci.
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2009 J jnl
Isolation concepts for efficiently enumerating dense subgraphs.
Theor. Comput. Sci.
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
2009 J jnl
On Generating Triangle-Free Graphs.
Electron. Notes Discret. Math.
Daniel Brügmann, Christian Komusiewicz, Hannes Moser
2009 B conf
On Making Directed Graphs Transitive.
WADS
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2008 — conf
A Cubic-Vertex Kernel for Flip Consensus Tree.
FSTTCS
Christian Komusiewicz, Johannes Uhlmann
2008 C conf
Enumerating Isolated Cliques in Synthetic and Financial Networks.
COCOA
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2008 B conf
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
LATIN
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2008 C conf
Improved Algorithms for Bicluster Editing.
TAMC
Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang
2008 B conf
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
CPM
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2007 Misc conf
Isolation Concepts for Enumerating Dense Subgraphs.
COCOON
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier