Université franco-allemande

most citedDegrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

5 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

Moritz Weber2 profiles2 · h 17
D. Marx1 · h 49
Govind S. Sankar1 · h 6
Guillaume C'ebron1 · h 3
Guillaume Cébron1
Isabelle Baraquin1 · h 2
Laura Maassen1 · h 3
Laura Maaßen1
Philipp Schepper1 · h 5
U. Franz1 · h 22
Uwe Franz1

collaborating institutions

Helmholtz Center for Information SecurityDE1 paper
Indian Institute of Technology MadrasIN1 paper
Institut de Mathématiques de ToulouseFR1 paper
Institut National des Sciences Appliquées de ToulouseFR1 paper
Laboratoire de Mathématiques Blaise PascalFR1 paper
Laboratoire de Mathématiques de BesançonFR1 paper
Max Planck Institute for InformaticsDE1 paper
RWTH Aachen UniversityDE1 paper
Saarland UniversityDE1 paper
Université Bourgogne Franche-ComtéFR1 paper
Université de Franche-ComtéFR1 paper
Université de ToulouseFR1 paper

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2021★ 5 cited

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

Dániel Marx, Govind S. Sankar, Philipp Schepper

For the General Factor problem we are given an undirected graph $G$ and for each vertex $v \in V (G)$ a finite set $B_{v}$ of non-negative integers. The task is to decide if there is a…