5 citations · 7 across the 5 of their papers we have counts for
5 papers
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes
Naoto Ohsaka, Tatsuya Matsuoka
We consider the product of determinantal point processes (DPPs), a point process whose probability mass is proportional to the product of principal minors of multiple matrices, as…
Reconfiguration Problems on Submodular Functions
Naoto Ohsaka, Tatsuya Matsuoka
Reconfiguration problems require finding a step-by-step transformation between a pair of feasible solutions for a particular problem. The primary concern in Theoretical Computer Sc…
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate
Tatsuya Matsuoka, Naoto Ohsaka
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph and a positive semi-definite matrix indexed by , a spanning-…
On Reachability Mixed Arborescence Packing
Tatsuya Matsuoka, Shin-ichi Tanigawa
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arboresc…
Making Bidirected Graphs Strongly Connected
Tatsuya Matsuoka, Shun Sato
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimu…