
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
We study the computational complexity of two hard problems on determinan...
read it

On Reconfigurability of Target Sets
We study the problem of deciding reconfigurability of target sets of a g...
read it

A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph
We consider the problem of counting the number of vertices reachable fro...
read it

Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate
We consider determinantal point processes (DPPs) constrained by spanning...
read it

Predictive Optimization with ZeroShot Domain Adaptation
Prediction in a new domain without any training sample, called zeroshot...
read it

The Solution Distribution of Influence Maximization: A Highlevel Experimental Study on Three Algorithmic Approaches
Influence maximization is among the most fundamental algorithmic problem...
read it

On the Power of TreeDepth for Fully Polynomial FPT Algorithms
There are many classical problems in P whose time complexities have not ...
read it
Naoto Ohsaka
is this you? claim profile