| 2026 | MFCS | The Descriptive Complexity of Relation Modification Problems. | Florian Chudigiewitsch, Marlene Grndel, Christian Komusiewicz, Nils Morawietz, Till Tantau |
| 2026 | SOFSEM | Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. | Christian Komusiewicz, Diptapriyo Majumdar |
| 2026 | WALCOM | A Complexity Analysis of the c-Closed Vertex Deletion Problem. | Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus |
| 2026 | WG | Clustering with Locally Bounded Ignorance. | Jaroslav Garvardt, Christian Komusiewicz |
| 2026 | WG | Preventing Small Global Cuts by Protecting Edges. | Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, Frank Sommer |
| 2025 | AAAI | Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. | Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge |
| 2025 | ICML | Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. | Christian Komusiewicz, Andr Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus |
| 2025 | WG | Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. | Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer |
| 2024 | ESA | SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. | Henning Martin Woydt, Christian Komusiewicz, Frank Sommer |
| 2024 | ISAAC | When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? | Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz |
| 2024 | MFCS | On the Complexity of Community-Aware Network Sparsification. | Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2023 | CPM | On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. | Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag |
| 2023 | ICML | On Computing Optimal Tree Ensembles. | Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge |
| 2023 | IJCAI | Parameterized Local Search for Max c-Cut. | Jaroslav Garvardt, Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2023 | MFCS | On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. | Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger |
| 2023 | SDM | Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation. | Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger |
| 2022 | IWOCA | The Parameterized Complexity of s-Club with Triangle and Seed Constraints. | Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer |
| 2022 | IWOCA | On Critical Node Problems with Vulnerable Vertices. | Jannik Schestag, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |
| 2022 | MFCS | Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. | Christian Komusiewicz, Nils Morawietz |
| 2022 | STACS | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. | Tomohiro Koana, Christian Komusiewicz, Andr Nichterlein, Frank Sommer |
| 2021 | AAAI | Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2021 | CIAC | Can Local Optimality Be Used for Efficient Data Reduction? | Christian Komusiewicz, Nils Morawietz |
| 2021 | IJCAI | On the Parameterized Complexity of Polytree Learning. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2021 | ISAAC | Essentially Tight Kernels For (Weakly) Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2021 | STACS | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2021 | SOFSEM | Sorting by Multi-cut Rearrangements. | Laurent Bulteau, Guillaume Fertin, Graldine Jean, Christian Komusiewicz |
| 2021 | WG | Preventing Small (s,t)Cuts by Protecting Edges. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | ALENEX | FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. | Christian Komusiewicz, Frank Sommer |
| 2020 | CPM | String Factorizations Under Various Collision Constraints. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | ESA | Exploiting c-Closure in Kernelization Algorithms for Graph Problems. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | IJCAI | Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. | Niels Grttemeier, Christian Komusiewicz |
| 2020 | ISAAC | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | SOFSEM | Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. | Nils Morawietz, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |
| 2019 | CIAC | Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. | Laurent Bulteau, Niels Grttemeier, Christian Komusiewicz, Manuel Sorge |
| 2019 | CiE | Destroying Bicolored P | Niels Grttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer |
| 2019 | SOFSEM | Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. | Christian Komusiewicz, Frank Sommer |
| 2018 | CPM | On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. | Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
| 2018 | ESA | Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
| 2018 | WG | On the Relation of Strong Triadic Closure and Cluster Deletion. | Niels Grttemeier, Christian Komusiewicz |
| 2017 | AAAI | Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. | Maximilian Katzmann, Christian Komusiewicz |
| 2017 | CIAC | Assessing the Computational Complexity of Multi-layer Subgraph Detection. | Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge |
| 2017 | CPM | Beyond Adjacency Maximization: Scaffold Filling for New String Distances. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2017 | CPM | Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. | Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi |
| 2017 | WADS | When Can Graph Hyperbolicity Be Computed in Linear Time? | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2016 | CPM | Graph Motif Problems Parameterized by Dual. | Guillaume Fertin, Christian Komusiewicz |
| 2016 | CSR | Parameterizing Edge Modification Problems Above Lower Bounds. | Ren van Bevern, Vincent Froese, Christian Komusiewicz |
| 2016 | ECAI | h-Index Manipulation by Undoing Merges. | Ren van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2016 | GD | Twins in Subdivision Drawings of Hypergraphs. | Ren van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge |
| 2015 | ATMOS | Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. | Ren van Bevern, Christian Komusiewicz, Manuel Sorge |
| 2015 | FAW | On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. | Christian Komusiewicz, Andreea Radulescu |
| 2015 | IJCAI | H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. | Ren van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2015 | SOFSEM | Finding Highly Connected Subgraphs. | Falk Hffner, Christian Komusiewicz, Manuel Sorge |
| 2015 | WADS | Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. | Falk Hffner, Christian Komusiewicz, Andr Nichterlein |
| 2015 | WG | Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. | Christian Komusiewicz, Andr Nichterlein, Rolf Niedermeier |
| 2014 | CPM | Reversal Distances for Strings with Few Blocks or Small Alphabets. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2014 | FUN | Towards an Algorithmic Guide to Spiral Galaxies. | Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz |
| 2014 | SODA | Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. | Laurent Bulteau, Christian Komusiewicz |
| 2014 | WABI | A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. | Sharon Bruckner, Falk Hffner, Christian Komusiewicz |
| 2014 | WG | The Parameterized Complexity of the Rainbow Subgraph Problem. | Falk Hffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rtzschke |
| 2013 | CPM | Local Search for String Problems: Brute Force Is Essentially Optimal. | Jiong Guo, Danny Hermelin, Christian Komusiewicz |
| 2013 | ISAAC | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Such, Mathias Weller |
| 2013 | SOFSEM | On Structural Parameterizations for the 2-Club Problem. | Sepp Hartung, Christian Komusiewicz, Andr Nichterlein |
| 2013 | WABI | A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu |
| 2013 | WADS | On Explaining Integer Vectors by Few Homogenous Segments. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Such |
| 2012 | CPM | Partitioning into Colorful Components by Minimum Edge Deletions. | Sharon Bruckner, Falk Hffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann |
| 2012 | FUN | Train Marshalling Is Fixed Parameter Tractable. | Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond |
| 2012 | MFCS | New Races in Parameterized Algorithmics. | Christian Komusiewicz, Rolf Niedermeier |
| 2011 | ISAAC | On the Parameterized Complexity of Consensus Clustering. | Martin Drnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller |
| 2011 | SOFSEM | Alternative Parameterizations for Cluster Editing. | Christian Komusiewicz, Johannes Uhlmann |
| 2010 | AAAI | Exact Algorithms and Experiments for Hierarchical Tree Clustering. | Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2010 | LATIN | Average Parameterization and Partial Kernelization for Computing Medians. | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
| 2010 | WG | Measuring Indifference: Unit Interval Vertex Deletion. | Ren van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2009 | AAIM | A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. | Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | COCOON | Graph-Based Data Clustering with Overlaps. | Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | CPM | Deconstructing Intractability: A Case Study for Interval Constrained Coloring. | Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | ISAAC | Editing Graphs into Disjoint Unions of Dense Clusters. | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann |
| 2009 | WADS | On Making Directed Graphs Transitive. | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2008 | COCOA | Enumerating Isolated Cliques in Synthetic and Financial Networks. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2008 | CPM | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
| 2008 | LATIN | Fixed-Parameter Algorithms for Cluster Vertex Deletion. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2008 | TAMC | Improved Algorithms for Bicluster Editing. | Jiong Guo, Falk Hffner, Christian Komusiewicz, Yong Zhang |
| 2007 | COCOON | Isolation Concepts for Enumerating Dense Subgraphs. | Christian Komusiewicz, Falk Hffner, Hannes Moser, Rolf Niedermeier |