In a vertex-colored graph G = (V, E), a subset S ⊆ V is said to
be consi...
Given a graph and two vertex sets satisfying a certain feasibility condi...
We study the model checking problem of an extended 𝖬𝖲𝖮 with local
and gl...
For intractable problems on graphs of bounded treewidth, two graph param...
A cactus is a connected graph that does not contain K_4 - e as a minor.
...