Parameterized complexity of candidate control in elections and related digraph problems von Betzler, Nadja, Uhlmann, Johannes

Volltext

Cluster editing with locally bounded modifications von Komusiewicz, Christian, Uhlmann, Johannes

Volltext

On the Computation of Fully Proportional Representation von Betzler, N., Slinko, A., Uhlmann, J.

Volltext

Two-Layer Planarization parameterized by feedback edge set von Uhlmann, Johannes, Weller, Mathias

Volltext

Exploiting bounded signal flow for graph orientation based on cause-effect pairs von Dorn, Britta, Hüffner, Falk, Krüger, Dominikus, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

A Cubic-Vertex Kernel for Flip Consensus Tree von Komusiewicz, Christian, Uhlmann, Johannes

Volltext

On Bounded-Degree Vertex Deletion parameterized by treewidth von Betzler, Nadja, Bredereck, Robert, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

Tree decompositions of graphs: Saving memory in dynamic programming von Betzler, Nadja, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

On tractable cases of Target Set Selection von Nichterlein, André, Niedermeier, Rolf, Uhlmann, Johannes, Weller, Mathias

Volltext

Graph-based data clustering with overlaps von Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

On making directed graphs transitive von Weller, Mathias, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring von Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

A More Relaxed Model for Graph-Based Data Clustering: s -Plex Cluster Editing von Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

Kernelization and complexity results for connectivity augmentation problems von Guo, Jiong, Uhlmann, Johannes

Volltext

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion von Betzler, Nadja, Bodlaender, Hans L., Bredereck, Robert, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs von Guo, Jiong, Hüffner, Falk, Kenar, Erhan, Niedermeier, Rolf, Uhlmann, Johannes

Volltext

Editing Graphs into Disjoint Unions of Dense Clusters von Guo, Jiong, Kanj, Iyad A., Komusiewicz, Christian, Uhlmann, Johannes

Volltext

Two-Layer Planarization Parameterized by Feedback Edge Set von Uhlmann, Johannes, Weller, Mathias

Volltext

A MORE RELAXED MODEL FOR GRAPH-BASED DATA CLUSTERING: s-PLEX CLUSTER EDITING von JIONG GUO, KOMUSIEWICZ, Christian, NIEDEPMEIER, Rolf, UHLMANN, Johannes

Volltext

Alternative Parameterizations for Cluster Editing von Komusiewicz, Christian, Uhlmann, Johannes

Volltext