Naoyuki Kamiyama

Learn More
In SODA’10, Huang introduced the laminar classified stable matching problem (LCSM for short) that is motivated by academic hiring. This problem is an extension of the wellknown hospitals/residents problem in which a hospital has laminar classes of residents and it sets lower and upper bounds on the number of residents that it would hire in that class.(More)
Given a directed graph <i>D = (V, A)</i> and a set of specified vertices S = {s<sub>1</sub>,&#8230;,s<sub>d</sub>} &#8838; <i>V</i> with |S| = <i>d</i> and a function <i>f</i>: S &#8594; N where N denotes the set of natural numbers, we present a necessary and sufficient condition that there exist &#931;s<sub>i</sub> &#949; arc-disjoint in-trees denoted by(More)
In two-sided matching markets, the concept of stability proposed by Gale and Shapley (1962) is one of the most important solution concepts. In this paper, we consider a problem related to the stability of a matching in a two-sided matching market with indifferences (i.e., ties). The introduction of ties into preference lists dramatically changes the(More)
We show the existence of a polynomial-size extended formulation for the base polytope of a (k, l)-sparsity matroid. For an undirected graph G = (V,E), the size of the formulation is O(|V ||E|) when k ≥ l and O(|V ||E|) when k ≤ l. To this end, we employ the technique developed by Faenza et al. recently that uses a randomized communication protocol.