7 citations · 17 across the 15 of their papers we have counts for
5 papers · 1 filter
Enumeration of Bases in Matroid with Exponentially Large Ground Set
Yuki Nishimura, Kazuya Haraguchi
When we deal with a matroid , we usually assume that it is implicitly given by means of the independence (IND) oracle. Time complexity of many existi…
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs
Takumi Tada, Kazuya Haraguchi
For a set system , we call a subset a component. A nonempty subset is a minimal removable set (MRS) of if $C\se…
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
Let c denote a non-negative constant. Suppose that we are given an edge-weighted bipartite graph G=(V,E) with its 2-layered drawing and a family X of intersecting edge pairs. We co…
An Efficient Local Search for the Minimum Independent Dominating Set Problem
Kazuya Haraguchi
In the present paper, we propose an efficient local search for the minimum independent dominating set problem. We consider a local search that uses -swap as the neighborhood ope…
An Efficient Local Search for Partial Latin Square Extension Problem
Kazuya Haraguchi
A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin squa…