Research Output per year

## Fingerprint Dive into the research topics where Naoyuki Kamiyama is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

- 1 Similar Profiles

Polynomials
Engineering & Materials Science

Directed graphs
Engineering & Materials Science

Approximation algorithms
Engineering & Materials Science

Matroid
Mathematics

Arc of a curve
Mathematics

Directed Graph
Mathematics

Evacuation
Mathematics

Matching Problem
Mathematics

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2006 2019

### An improved algorithm for testing substitutability of weak preferences

Kawanaka, S. & Kamiyama, N., May 1 2019, In : Mathematical Social Sciences. 99, p. 1-4 4 p.Research output: Contribution to journal › Article

Testing

Substitutability

time

Generalization

Class

1
Citation
(Scopus)

### A note on balanced flows in equality networks

Kamiyama, N., May 1 2019, In : Information Processing Letters. 145, p. 74-76 3 p.Research output: Contribution to journal › Article

Equality

Market

### Exact and approximation algorithms for weighted matroid intersection

Huang, C. C., Kakimura, N. & Kamiyama, N., Sep 1 2019, In : Mathematical Programming. 177, 1-2, p. 85-112 28 p.Research output: Contribution to journal › Article

Matroid Intersection

Approximation algorithms

Exact Algorithms

Approximation Algorithms

Decomposition Techniques

### Lexicographically optimal earliest arrival flows

Kamiyama, N., Jan 1 2019, In : Networks.Research output: Contribution to journal › Article

Polynomials

Directed graphs

### Minimum-Cost b-Edge Dominating Sets on Trees

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Jan 15 2019, In : Algorithmica. 81, 1, p. 343-366 24 p.Research output: Contribution to journal › Article

Dominating Set

Polynomials

Costs

Polynomial-time Algorithm

Linear programming