IEICE Trans

Ryuhei UEHARA

Complexity of the Maximum k-Path Vertex Cover Problem Eiji MIYANO Toshiki SAITOH Ryuhei UEHARA Tsuyoshi YAGITA Tom C. van der ZANDEN
Publication: Publication Date: 2020/10/01 Vol. E103-A No. 10 pp. 1193-1201 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: complexity theory Keyword: Maximum k-path vertex cover, NP-hardness, polynomial time algorithm, split graphs, bounded treewidth,
	Summary \| Full Text:PDF(1.9MB)

On Computational Complexity of Pipe Puzzles Takumu SHIRAYAMA Takuto SHIGEMURA Yota OTACHI Shuichi MIYAZAKI Ryuhei UEHARA
Publication: Publication Date: 2019/09/01 Vol. E102-A No. 9 pp. 1134-1141 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Puzzles Keyword: pipe puzzle, NP-completeness, polynomial-time algorithm,
	Summary \| Full Text:PDF(7MB)

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns Koji OUCHI Ryuhei UEHARA
Publication: Publication Date: 2019/03/01 Vol. E102-D No. 3 pp. 416-422 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — Algorithm, Theory of Computation, and their Applications —) Category: Keyword: computational origami, enumeration algorithm, flat foldability, Kawasaki theorem, Maekawa theorem,
	Summary \| Full Text:PDF(528.9KB)

Rep-Cubes: Dissection of a Cube into Nets Dawei XU Jinfeng HUANG Yuta NAKANE Tomoo YOKOYAMA Takashi HORIYAMA Ryuhei UEHARA
Publication: Publication Date: 2018/09/01 Vol. E101-A No. 9 pp. 1420-1430 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cube, net, polyomino, pythagorean triple, rep-cube, rep-tile,
	Summary \| Full Text:PDF(1.8MB)

The Convex Configurations of “Sei Shonagon Chie no Ita,” Tangram, and Other Silhouette Puzzles with Seven Pieces Eli FOX-EPSTEIN Kazuho KATSUMATA Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/06/01 Vol. E99-A No. 6 pp. 1084-1089 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: dissection puzzle, enumeration, Sei Shonagon Chie no Ita, silhouette puzzle, tangram,
	Summary \| Full Text:PDF(1.2MB)

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds Kazuyuki AMANO Kyaw May OO Yota OTACHI Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2015/03/01 Vol. E98-D No. 3 pp. 486-489 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---) Category: Keyword: secure set, defensive alliance, fixed-parameter tractability, hypercube,
	Summary \| Full Text:PDF(267.1KB)

Computational Complexity and an Integer Programming Model of Shakashaka Erik D. DEMAINE Yoshio OKAMOTO Ryuhei UEHARA Yushi UNO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/06/01 Vol. E97-A No. 6 pp. 1213-1219 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: integer programming, NP-completeness, pencil-and-paper puzzle, Shakashaka,
	Summary \| Full Text:PDF(1.5MB)

Computational Complexity of Piano-Hinged Dissections Zachary ABEL Erik D. DEMAINE Martin L. DEMAINE Takashi HORIYAMA Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/06/01 Vol. E97-A No. 6 pp. 1206-1212 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: GeoLoop, hinged dissection, Ivan's Hinge, NP-hardness, paper folding,
	Summary \| Full Text:PDF(2.3MB)

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs Masashi KIYOMI Toshiki SAITOH Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 pp. 426-432 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: the graph reconstruction conjecture, permutation graphs, polynomial time algorithm,
	Summary \| Full Text:PDF(540.1KB)

Voronoi Game on a Path Masashi KIYOMI Toshiki SAITOH Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/06/01 Vol. E94-D No. 6 pp. 1185-1189 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: Discrete Voronoi game, combinatorial game theory,
	Summary \| Full Text:PDF(210.5KB)

Random Generation and Enumeration of Proper Interval Graphs Toshiki SAITOH Katsuhisa YAMANAKA Masashi KIYOMI Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/07/01 Vol. E93-D No. 7 pp. 1816-1823 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: counting, enumeration, proper interval graphs, random generation, unit interval graphs,
	Summary \| Full Text:PDF(282.6KB)

FOREWORD Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/09/01 Vol. E91-A No. 9 pp. 2283-2283 Type of Manuscript: FOREWORD Category: Keyword:
	Summary \| Full Text:PDF(52.6KB)

Longest Path Problems on Ptolemaic Graphs Yoshihiro TAKAHARA Sachio TERAMOTO Ryuhei UEHARA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/02/01 Vol. E91-D No. 2 pp. 170-177 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Graph Algorithms Keyword: dynamic programming, Hamiltonian path/cycle problem, longest path/cycle problem, Ptolemaic graphs,
	Summary \| Full Text:PDF(252.6KB)

Parallel Algorithms for Maximal Linear Forests Ryuhei UEHARA Zhi-Zhong CHEN
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/04/25 Vol. E80-A No. 4 pp. 627-634 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: parallel algorithms, randomized parallel algorithms, graph algorithms, linear forests, maximal matchings, maximal independent sets,
	Summary \| Full Text:PDF(720KB)

Generalized Hi-Q is NP-Complete Ryuhei UEHARA Shigeki IWATA
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1990/02/25 Vol. E73-E No. 2 pp. 270-273 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword:
	Summary \| Full Text:PDF(278.5KB)