Complexity and Exact Algorithms for Multicut. - Jiong Guo; Falk Hüffner; Erhan Kenar; Rolf Niedermeier; Johannes Uhlmann (SOFSEM, 2006)

Tree decompositions of graphs: Saving memory in dynamic programming. - Nadja Betzler; Rolf Niedermeier; Johannes Uhlmann (Discret. Optim., 2006)

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. - Jiong Guo; Falk Hüffner; Erhan Kenar; Rolf Niedermeier; Johannes Uhlmann (Eur. J. Oper. Res., 2008)

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. - Jiong Guo; Rolf Niedermeier; Johannes Uhlmann (Inf. Process. Lett., 2008)

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

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

Parameterized complexity of candidate control in elections and related digraph problems. - Nadja Betzler; Johannes Uhlmann (Theor. Comput. Sci., 2009)

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

Extended Islands of Tractability for Parsimony Haplotyping. - Rudolf Fleischer; Jiong Guo; Rolf Niedermeier; Johannes Uhlmann; Yihui Wang; Mathias Weller; Xi Wu 001 (CPM, 2010)

Kernelization and complexity results for connectivity augmentation problems. - Jiong Guo; Johannes Uhlmann (Networks, 2010)

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

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (SOFSEM, 2011)

Alternative Parameterizations for Cluster Editing. - Christian Komusiewicz; Johannes Uhlmann (SOFSEM, 2011)

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

Exploiting bounded signal flow for graph orientation based on cause-effect pairs. - Britta Dorn; Falk Hüffner; Dominikus Krüger; Rolf Niedermeier; Johannes Uhlmann (Algorithms Mol. Biol., 2011)

Graph-based data clustering with overlaps. - Michael R. Fellows; Jiong Guo; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann (Discret. Optim., 2011)

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

Multivariate Algorithmics in Biological Data Analysis. - Johannes Uhlmann (2011)

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

On Bounded-Degree Vertex Deletion parameterized by treewidth. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Discret. Appl. Math., 2012)

Cluster editing with locally bounded modifications. - Christian Komusiewicz; Johannes Uhlmann (Discret. Appl. Math., 2012)

On making directed graphs transitive. - Mathias Weller; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann (J. Comput. Syst. Sci., 2012)

On the Computation of Fully Proportional Representation. - Nadja Betzler; Arkadii Slinko; Johannes Uhlmann (J. Artif. Intell. Res., 2013)

On tractable cases of Target Set Selection. - André Nichterlein; Rolf Niedermeier; Johannes Uhlmann; Mathias Weller (Soc. Netw. Anal. Min., 2013)

Two-Layer Planarization parameterized by feedback edge set. - Johannes Uhlmann; Mathias Weller (Theor. Comput. Sci., 2013)

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. - Nadja Betzler; Hans L. Bodlaender; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Algorithmica, 2014)

A Cubic-Vertex Kernel for Flip Consensus Tree. - Christian Komusiewicz; Johannes Uhlmann (Algorithmica, 2014)