Christian Komusiewicz

Jiong Guo, Danny Hermelin, Christian Komusiewicz: Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141

Sepp Hartung, Christian Komusiewicz, André Nichterlein: On Structural Parameterizations for the 2-Club Problem. SOFSEM 2013: 233-243

Christoph Schmidt, Thomas Weiss, Christian Komusiewicz, Herbert Witte, Lutz Leistritz: An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels. Comp. Math. Methods in Medicine 2012 (2012)

Christian Komusiewicz, Johannes Uhlmann: Cluster editing with locally bounded modifications. Discrete Applied Mathematics 160(15): 2259-2270 (2012)

Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012)

Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters 6(5): 883-891 (2012)

Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann: Partitioning into Colorful Components by Minimum Edge Deletions. CPM 2012: 56-69

Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond: Train Marshalling Is Fixed Parameter Tractable. FUN 2012: 51-56

Sepp Hartung, Christian Komusiewicz, André Nichterlein: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC 2012: 231-241

Christian Komusiewicz, Manuel Sorge: Finding Dense Subgraphs of Sparse Graphs. IPEC 2012: 242-251

Christian Komusiewicz, Rolf Niedermeier: New Races in Parameterized Algorithmics. MFCS 2012: 19-30

Christian Komusiewicz: Parameterized Algorithmics for Network Analysis: Clustering & Querying. Berlin Institute of Technology 2011, isbn 978-3-7983-2379-7

Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011)

Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-based data clustering with overlaps. Discrete Optimization 8(1): 2-17 (2011)

Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011)

Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011)

Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1296-1308 (2011)

Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller: On the Parameterized Complexity of Consensus Clustering. ISAAC 2011: 624-633

Christian Komusiewicz, Johannes Uhlmann: Alternative Parameterizations for Cluster Editing. SOFSEM 2011: 344-355

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010)

Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discrete Math. 24(4): 1662-1683 (2010)

Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010

Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71

René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243

Daniel Brügmann, Christian Komusiewicz, Hannes Moser: On Generating Triangle-Free Graphs. Electronic Notes in Discrete Mathematics 32: 51-58 (2009)

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009)

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410(52): 5384-5397 (2009)

Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239

Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526

Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM 2009: 207-220

Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593

Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: On Making Directed Graphs Transitive. WADS 2009: 542-553

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416

Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43

Christian Komusiewicz, Johannes Uhlmann: A Cubic-Vertex Kernel for Flip Consensus Tree. FSTTCS 2008: 280-291

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722

Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang: Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150