Shuichi MIYAZAKI

Identifying Link Layer Home Network Topologies Using HTIP
Yoshiyuki MIHARA Shuichi MIYAZAKI Yasuo OKABE Tetsuya YAMAGUCHI Manabu OKAMOTO 
Publication:   
Publication Date: 2020/03/01
Vol. E103-D  No. 3  pp. 566-577
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
home networks, home automation, network topology, graph algorithms, MAC address forwarding tables, HTIP, 
 Summary | Full Text:PDF(1MB)
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)
FOREWORD
Shuichi MIYAZAKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D  No. 2  pp. 181-181
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(50.8KB)
The Online Graph Exploration Problem on Restricted Graphs
Shuichi MIYAZAKI Naoyuki MORIMOTO Yasuo OKABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/09/01
Vol. E92-D  No. 9  pp. 1620-1627
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
the graph exploration problem, online algorithm, competitive analysis, 
 Summary | Full Text:PDF(347.7KB)
Computational Complexities of University Interview Timetabling
Naoyuki KAMIYAMA Yuuki KIYONARI Eiji MIYANO Shuichi MIYAZAKI Katsuhisa YAMANAKA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 130-140
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
timetable, scheduling, optimization, computational complexity, 
 Summary | Full Text:PDF(602.5KB)
A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers
Koji KOBAYASHI Shuichi MIYAZAKI Yasuo OKABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/12/01
Vol. E91-D  No. 12  pp. 2757-2769
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
competitive analysis, multi-queue switches, buffer management, 
 Summary | Full Text:PDF(499.2KB)
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
Koji KOBAYASHI Shuichi MIYAZAKI Yasuo OKABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/08/01
Vol. E91-D  No. 8  pp. 2105-2114
Type of Manuscript:  PAPER
Category: Computation and Computational Models
Keyword: 
competitive analysis, shared memory switches, buffer management, 
 Summary | Full Text:PDF(258.9KB)
A -Approximation Algorithm for the Stable Marriage Problem
Kazuo IWAMA Shuichi MIYAZAKI Kazuya OKAMOTO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Vol. E89-D  No. 8  pp. 2380-2387
Type of Manuscript:  INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
stable marriage problem, incomplete lists, ties, approximation algorithms, local search, 
 Summary | Full Text:PDF(225.3KB)