Given a graph G and two independent sets S, T of G, the independent set
...
Directed Token Sliding asks, given a directed graph and two sets of
pair...
In this paper, we investigate the computational complexity of subgraph
r...
In this note, we give an algorithm that computes the linearwidth of inpu...
Given n points in the plane, we propose algorithms to compile connected
...
Given graphs G and H, we propose a method to implicitly enumerate
topolo...
Clique-width is a well-studied graph parameter. For graphs of bounded
cl...
Unigraphs are graphs uniquely determined by their own degree sequence up...
Partitioning a graph into balanced components is important for several
a...