Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IA, IPSJIOT, SITE [detail] 
20150306 10:15 
Fukushima 

Evaluation of Greedy Algorithms for Embedding Multiple VLANs Andrew Lee, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) SITE201473 IA2014105 
Given the same amount of hardware resource and bandwidth limitation, networks with optimal configurations enable Interne... [more] 
SITE201473 IA2014105 pp.143147 
COMP 
20140424 15:15 
Miyagi 
Tohoku University 
Improved Bounds for Online $k$Frame Throughput Maximization in Network Switches Koji Kobayashi (NII), Jun Kawahara (NAIST), Shuichi Miyazaki (Kyoto Univ.) COMP20146 
We consider a variant of the online buffer management problem in network switches, called the $k$frame throughput maxim... [more] 
COMP20146 pp.3744 
IA, IPSJIOT, SITE [detail] 
20140227 16:25 
Ishikawa 
Hotel Rurikoh 
An Efficient Judging Method of a Large Amount of Emails Having the Same Sender and Recipient Addresses Yoshiharu Tsuzaki, Ryosuke Matsumoto, Daisuke Kotani, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) SITE201362 IA201387 
With the wide use of email, it has become commonly expected that emails are delivered to recipients immediately. It is... [more] 
SITE201362 IA201387 pp.6166 
COMP 
20101203 16:00 
Fukuoka 
Kyutech Plaza, Kyushu Institute of Technology 
Improving the Competitive Ratios of the Seat Reservation Problem Kazuya Okamoto, Shuichi Miyazaki (Kyoto Univ.) COMP201045 
In the seat reservation problem, there are $k$ stations, $s_{1}$
through $s_{k}$, and one train with $n$ seats departin... [more] 
COMP201045 pp.4551 
IA 
20101124 15:35 
Yamanashi 
SeisenRyo 
Design of a Certified Email System without a Trusted Third Party Satoshi Ishibashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) IA201054 
These days, as emails become more and more important, the demand for certified email is growing. Methods for certified... [more] 
IA201054 pp.1924 
COMP 
20100125 09:30 
Fukuoka 
Nishijin Plaza, Kyushu University 
Competitive Analysis of the kCanadian Traveller Problem for Graphs with Restricted Edge Weights Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP200939 
The $k$Canadian Traveller Problem ($k$CTP) is one of the online problems.
In this problem, we are given an undirected... [more] 
COMP200939 pp.18 
COMP 
20091016 15:25 
Miyagi 
Tohoku University 
An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP200937 
In the stable marriage problem that allows incomplete preference
lists, all stable matchings for a given instance have ... [more] 
COMP200937 pp.3540 
AI 
20090925 13:00 
Kyoto 
Kyoto Univ. Clock Tower 
[Invited Talk]
Recent Topics on the Stable Matching Problems Shuichi Miyazaki (Kyoto Univ.) AI200912 
In the stable matching problem, we are given a set of men and women, and each person's preference list that orders membe... [more] 
AI200912 pp.1922 
IA 
20081105 14:30 
Toyama 
Tateyama Kokusai Hotel 
Designing a certified mail exchnage protocol using gradual secret exchanging protocols Keita Shimizu, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) IA200842 
These days, we more and more depends on emails and demands on certified email is growing.
However some commercial ser... [more] 
IA200842 pp.712 
COMP 
20080911 16:40 
Aichi 
Nagoya Inst. of Tech. 
Improved Competitive Ratios of Online Buffer Management Algorithms for MultiQueue Switches in QoS Networks Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP200833 
The online buffer management problem formulates the problem of queuing
policies of network switches supporting QoS (Qua... [more] 
COMP200833 pp.7178 
COMP 
20080310 09:30 
Kanagawa 

Approximation Algorithms for the SexEqual Stable Marriage Problem Hiroki Yanagisawa (IBM), Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP200755 
The stable marriage problem is a classical matching problem introduced
by Gale and Shapley. It is known that for any i... [more] 
COMP200755 pp.18 
COMP 
20071016 10:40 
Miyagi 
Tohoku Univ. 
NPCompleteness of the Stable Roommates Problem with Triple Rooms Kazuya Okamoto, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP200741 
[more] 
COMP200741 pp.16 
COMP 
20070920 15:50 
Aichi 

An Optimal Online Algorithm for the Graph Exploration Problem on Cycles Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP200739 
The purpose of the online graph exploration problem is to visit all
the nodes of a given graph and come back to the sta... [more] 
COMP200739 pp.5157 
COMP 
20070629 15:05 
Hokkaido 
Hokkaido University 
A Tight Upper Bound on Online Buffer Management for Twoport SharedMemory Switches Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP200726 
The online buffer management problem formulates the problem of queueing
policies of network switches supporting QoS (Q... [more] 
COMP200726 pp.6370 
COMP 
20061204 10:00 
Aichi 
Nagoya University 
weighted nearest neighbor algorithms for the graph exploration problem on cycles Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.), Takuro Yoshimuta (KIT) 
[more] 
COMP200643 pp.1522 
COMP 
20061204 16:35 
Aichi 
Nagoya University 
1.875approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) 
[more] 
COMP200648 pp.4956 
COMP 
20060623 10:35 
Saitama 
Saitama Univ. 
On the Computational Complexity of Interview Timetabling Problems Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.) 
[more] 
COMP200618 pp.714 
COMP 
20050624 13:15 
Toyama 

Improving competitive ratios of online buffer management for sharedmemory switches Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) 
The buffer management problem is a kind of online problems, which
formulates the problem of queueing policies of networ... [more] 
COMP200521 pp.1722 
COMP 
20050520 15:30 
Fukuoka 
Kyushu Univ. 
Improving a local search approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) 
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] 
COMP200515 pp.4551 