EDBT 2026 Demo / reviewers in the wild / expert
Naoyuki Kamiyama
dblp:69/2057
· DBLP profile ↗
7ranked-venue papers in the field
5as first author
3since 2021 · last 2025
0000-0002-7712-2730ORCID · corroborated
Domains — venue-derived; a paper can count in several
Other / Interdisciplinary · 7 (5 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Modifying an instance of the super-stable matching problem
Naoyuki Kamiyama |
Inf. Process. Lett. | 1 |
| 2023 | On optimization problems in acyclic hypergraphs
Naoyuki Kamiyama |
Inf. Process. Lett. | 1 |
| 2021 | The envy-free matching problem with pairwise preferences
Naoyuki Kamiyama |
Inf. Process. Lett. | 1 |
| 2019 | A note on balanced flows in equality networks
Naoyuki Kamiyama |
Inf. Process. Lett. | 1 |
| 2015 | On packing arborescences in temporal networks
Naoyuki Kamiyama, Yasushi Kawase |
Inf. Process. Lett. | 1 |
| 2011 | An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai |
Inf. Process. Lett. | 2 |
| 2009 | A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama |
Inf. Process. Lett. | 3 |