
Essentially Tight Kernels for (Weakly) Closed Graphs
We study kernelization of classic hard graph problems when the input gra...
read it

A Refined Complexity Analysis of Fair Districting over Graphs
We study the NPhard Fair Connected Districting problem: Partition a ver...
read it

The Complexity of Gerrymandering Over Graphs: Paths and Trees
Roughly speaking, gerrymandering is the systematic manipulation of the b...
read it

Detecting and Enumerating Small Induced Subgraphs in cClosed Graphs
Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called cclo...
read it

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
A graph G is weakly γclosed if every induced subgraph of G contains one...
read it

Parameterized Complexity of MinPower Asymmetric Connectivity
We investigate parameterized algorithms for the NPhard problem MinPowe...
read it

Exploiting 𝐜Closure in Kernelization Algorithms for Graph Problems
A graph is cclosed if every pair of vertices with at least c common nei...
read it

Complexity of Combinatorial Matrix Completion With Diameter Constraints
We thoroughly study a novel and still basic combinatorial matrix complet...
read it

Parameterized Algorithms for Matrix Completion With Radius Constraints
Considering matrices with missing entries, we study NPhard matrix compl...
read it

Parameterized Complexity of Geodetic Set
A vertex set S of a graph G is geodetic if every vertex of G lies on a s...
read it
Tomohiro Koana
is this you? claim profile