Nfpc

On Strict (Outer-)Confluent Graphs

Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints

The Complexity of Bayesian Network Learning: Revisiting the Superstructure

The Complexity of Object Association in Multiple Object Tracking

The Parameterized Complexity of Clustering Incomplete Data

Eduard Eiben, Robert Ganian, Iyad Kanj and Sebastian Ordyniak, Stefan Szeider

The Parameterized Complexity of Connected Fair Division

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

Towards a Polynomial Kernel for Directed Feedback Vertex Set

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Eiben, Eduard, Robert Ganian, Hamm, Thekla, Klute, Fabian, Martin Nöllenburg