24 citations · 124 across the 75 of their papers we have counts for
5 papers · 1 filter
On the Complexity Landscape of Connected f -Factor Problems
R. Ganian, N. S. Narayanaswamy, S. Ordyniak +2
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a…
The Complexity Landscape of Decompositional Parameters for ILP
Robert Ganian, Sebastian Ordyniak
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved i…
Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
The Group Activity Selection Problem (GASP) models situations where a group of agents needs to be distributed to a set of activities while taking into account preferences of the ag…
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph and a set of terminal pairs and asks whether contains a set…
Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Sebastian Ordyniak +1
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2)…