4 citations · 4 across the 1 of their papers we have counts for
2 papers
cs.DS2016
On Satisfiability Problems with a Linear Structure
Serge Gaspers, Christos Papadimitriou, Sigve Hortemo Saether +1
It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite gra…
cs.DS2015★ 4 cited
Maximum matching width: new characterizations and a fast algorithm for dominating set
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
We give alternative definitions for maximum matching width, e.g. a graph has if and only if it is a subgraph of a chordal graph and for every…