An α-approximate polynomial Turing kernelization is a polynomial-time
al...
Random forests and, more generally, (decision-)tree ensembles are
widely...
In the Colored Clustering problem, one is asked to cluster edge-colored
...
A temporal graph has an edge set that may change over discrete time step...
We study the network untangling problem introduced by Rozenshtein, Tatti...
Vertex Cover parameterized by the solution size k is the quintessential
...
We consider the algorithmic complexity of recognizing bipartite temporal...
Proximity graphs have been studied for several decades, motivated by
app...
A point visibility graph is a graph induced by a set of points in the pl...