The study of algorithmic fairness received growing attention recently. T...
In the 1970s, Győri and Lovász showed that for a k-connected
n-vertex gr...
We combine ideas from distance sensitivity oracles (DSOs) and fixed-para...
We consider the problem of partitioning a graph into a non-fixed number ...
A connected partition is a partition of the vertices of a graph into set...
A regular path query (RPQ) is a regular expression q that returns all no...
We study the problem of counting the number of homomorphisms from an inp...
We introduce the balanced crown decomposition that captures the structur...
We investigate the single source shortest distance (SSSD) and all pairs
...
Several important optimization problems in the area of vehicle routing c...
We generalize the tree doubling and Christofides algorithm, the two most...
We present fully polynomial approximation schemes for general classes of...
We investigate the locality number, a recently introduced structural
par...
We consider extension variants of the classical graph problems Vertex Co...
The question if a given partial solution to a problem can be extended
re...
Unit square (grid) visibility graphs (USV and USGV, resp.) are described...