Theoretical Computer Science

We study the parameterized complexity of the s -Club Cluster Edge Deletion (s -Club Cluster Vertex Deletion) problem: Given a graph G and two integers s ≥ 2 and k ≥ 1, is it possible to remove at most k ...

We analyze the computational complexity of motion planning through local “input/output” gadgets with separate entrances and exits, and a subset of allowed traversals from entrances to exits, each of which changes the state of the ...

In this contribution we consider a variant of the vertex cover problem in temporal graphs that has been recently introduced to summarize timeline activities in social networks. The problem is NP-hard, even when the time domain ...

Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be ...

The cut of two languages is a subset of their concatenation given by the leftmost maximal prefix match. We study the state complexity of the cut operation assuming that both operands belong to some, possibly different, subclasses of ...

In 2011, Danicic et al. introduced an elegant generalization of the notion of control dependence for any directed graph. They also proposed an algorithm computing the weak control-closure of a subset of graph vertices and performed a ...

We are interested in the problem of translating between two representations of closure systems, namely implicational bases and meet-irreducible elements. Albeit its importance, the problem is open. Motivated by this problem, we ...

An iterated uniform finite-state transducer executes the same length-preserving transduction in iterative sweeps. The first sweep occurs on the input string, while any subsequent sweep works on the output of the previous one. All ...

• We study Iterated Uniform Finite-State Transducers (IUFSTs) working on unary languages.