
Graphs with at most two moplexes
A moplex is a natural graph structure that arises when lifting Dirac's c...
read it

CrossingOptimal Extension of Simple Drawings
In extension problems of partial graph drawings one is given an incomple...
read it

Integer Programming and Incidence Treedepth
Recently a strong connection has been shown between the tractability of ...
read it

Parameterized Algorithms for Queue Layouts
An hqueue layout of a graph G consists of a linear order of its vertice...
read it

Extending Nearly Complete 1Planar Drawings in Polynomial Time
The problem of extending partial geometric graph representations such as...
read it

Extending Partial 1Planar Drawings
Algorithmic extension problems of partial graph representations such as ...
read it

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
We investigate the following manytoone stable matching problem with di...
read it

SATEncodings for Treecut Width and Treedepth
In this paper we propose, implement, and test the first practical decomp...
read it

On Clustering Incomplete Data
We study fundamental clustering problems for incomplete data. In this se...
read it

Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
We develop a framework for applying treewidthbased dynamic programming ...
read it

Parameterized Algorithms for Book Embedding Problems
A kpage book embedding of a graph G draws the vertices of G on a line a...
read it

On Strict (Outer)Confluent Graphs
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
read it

A JoinBased Hybrid Parameter for Constraint Satisfaction
We propose joinwidth, a new complexity parameter for the Constraint Sati...
read it

The Complexity Landscape of Decompositional Parameters for ILP
Integer Linear Programming (ILP) can be seen as the archetypical problem...
read it

Group Activity Selection with Few Agent Types
The Group Activity Selection Problem (GASP) models situations where a gr...
read it

The Power of CutBased Parameters for Computing Edge Disjoint Paths
This paper revisits the classical Edge Disjoint Paths (EDP) problem, whe...
read it

Parameterized Algorithms for the Matrix Completion Problem
We consider two matrix completion problems, in which we are given a matr...
read it

Small Resolution Proofs for QBF using Dependency Treewidth
In spite of the close connection between the evaluation of quantified Bo...
read it

On Structural Parameterizations of the Edge Disjoint Paths Problem
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem...
read it
Robert Ganian
is this you? claim profile