# 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.

- Sort by
- Weight
- Alphabetically

### Mathematics

Matroid

Arc of a curve

Directed Graph

Evacuation

Stable Matching

Matching Problem

Dynamic Networks

Approximation Algorithms

Polynomial time

Dominating Set

Function Minimization

Path Length

Submodular Function

Disjoint

Polynomial-time Algorithm

Matroid Intersection

Vertex of a graph

Set Covering

Covering Graph

Graph in graph theory

Efficient Algorithms

Tie

Pareto

Simple Graph

Directed Acyclic Graph

Costs

Adjacency Matrix

Exact Algorithms

Reconfiguration

Covering

Condensation

Rigid Body

Packing

Necessary Conditions

Bipartite Graph

Sufficient Conditions

Extended Formulations

Minimization Problem

Game

Many to many

Robustness

Network Flow

Nucleolus

Precedence Constraints

Covering Problem

Japan

Denote

NP-complete problem

Approximability

Vertex Cover

### Engineering & Materials Science

Polynomials

Directed graphs

Approximation algorithms

Computational complexity

Hinges

Costs

Condensation

Stabilization

Coloring

Hardness

Newton-Raphson method

Airports

Cost functions

Combinatorial optimization