Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP, IPSJAL 
20230510 14:30 
Hokkaido 
Hokkaido University 
[Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP20231 
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] 
COMP20231 p.1 
COMP 
20201204 10:00 
Online 
Online 
A Fast ZDDBased Method for Enumerating All Solutions of CostBounded Combinatorial Problems Shinichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP202019 
[more] 
COMP202019 pp.815 
COMP 
20200301 16:00 
Tokyo 
The University of ElectroCommunications (Cancelled but technical report was issued) 
Information theoretic lower bound of Hasse diagrams with degree constraint Jumpei Mori, Jun Kawahara, Shinichi Minato (Kyoto Univ.) COMP201953 
[more] 
COMP201953 pp.5156 
NS 
20191010 16:10 
Aichi 
Nagoya Institute of Technology 
[Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019113 
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] 
NS2019113 pp.5962 
COMP 
20190902 10:50 
Okayama 
Tsushima Campus, Okayama University 
Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shinichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP201910 
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] 
COMP201910 pp.15 
COMP 
20190902 16:00 
Okayama 
Tsushima Campus, Okayama University 
Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP201916 
This research proposes algorithms that construct compressed data
structures, called zerosuppressed binary decision dia... [more] 
COMP201916 p.33 
COMP, IPSJAL 
20190511 10:40 
Kumamoto 
Kumamoto University 
Enumerating and Indexing Graph Subdivisions using Zerosuppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shinichi Minato (Kyoto Univ.) COMP20193 
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$.
In this paper, when ... [more] 
COMP20193 pp.5158 
IMQ, IE, MVE, CQ (Joint) [detail] 
20190315 13:50 
Kagoshima 
Kagoshima University 
Network reliability evaluation with arbitrary dependencies on link failures Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST) CQ2018113 
Given a network and the failure ratio of each link of the network, network reliability evaluation is to compute the prob... [more] 
CQ2018113 pp.111116 
ICM 
20190308 09:20 
Okinawa 

Pricing and Resource Allocation on Hadoop Data Centers Using Auction Mechanisms Yu Manabe, Jun Kawahara, Shoji Kasahara (NAIST) ICM201857 
As storage capacity and computing performance grow due to the development of hardware, it is possible for applications t... [more] 
ICM201857 pp.4348 
COMP 
20181026 15:55 
Kyoto 
Kyoto University 
[Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP201829 
Partitioning a graph into balanced components is important for several applications. For multiobjective problems, it is... [more] 
COMP201829 p.57 
ICM 
20180309 09:00 
Okinawa 

Analysis of tasks that continuously generate error events in cloud platforms Koji Mandai, Jun Kawahara, Shoji Kasahara (NAIST) ICM201764 
In this research, we analyze the characteristics of failed jobs in data sets recording the execution status of jobs and ... [more] 
ICM201764 pp.4954 
CS, NS, IN, NV (Joint) 
20170908 10:50 
Miyagi 
Research Institute of Electrical Communication, Tohoku Univ. 
Performance Inference for Cooperative Spectrum Sensing with the koutofN Rule: An MCMCbased Approach Sho Iizuka, Jun Kawahara, Shoji Kasahara (NAIST) NS201782 
In the research of cognitive radio, Cooperative Spectrum Sensing (CSS) is proposed, in which the secondary users (SUs) f... [more] 
NS201782 pp.6772 
NS, IN (Joint) 
20170303 14:50 
Okinawa 
OKINAWA ZANPAMISAKI ROYAL HOTEL 
Coalition formation approach for cooperative spectrum sensing in cognitive radio networks by multiarmed bandit problem Sho Iizuka, Jun Kawahara, Shoji Kasahara (NAIST) NS2016242 
In cognitive radio networks, it is important for secondary users (SUs) to accurately sense wireless channels for primary... [more] 
NS2016242 pp.487492 
COMP, IPSJAL 
20160624 15:45 
Ishikawa 

Enumerating Letter Graphs by Zerosuppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP20168 
A zerosuppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] 
COMP20168 pp.3340 
IE, IMQ, MVE, CQ (Joint) [detail] 
20160307 09:00 
Okinawa 

Design, implementation, and evaluation of an offline evacuation guiding application considering positioning errors of mobile nodes Junki Itoi, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST) CQ2015108 
It is highly desired to achieve speedy evacuation guiding even when part/all of communication infrastructure suffers fro... [more] 
CQ2015108 pp.16 
IE, IMQ, MVE, CQ (Joint) [detail] 
20160307 09:15 
Okinawa 

On Information Sharing Scheme for Automatic Evacuation Guiding System Based on Cooperation between Evacuees and Their Mobile Nodes Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST) CQ2015109 
We have proposed an automatic evacuation guiding scheme based on cooperation between evacuees and their mobile nodes.
I... [more] 
CQ2015109 pp.712 
IE, IMQ, MVE, CQ (Joint) [detail] 
20160307 09:30 
Okinawa 

Evaluation of influence of a mobility model based on person trip data on DTN routing Akio Ishikura, Jun Kawahara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ2015110 
In delay tolerant networking (DTN), data communication is realized even if interruption or disruption occurs. When we ev... [more] 
CQ2015110 pp.1318 
NS, IN (Joint) 
20160304 09:30 
Miyazaki 
Phoenix Seagaia Resort 
Evaluating connectivity on physical networks with switch failures Koki Sonoda, Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST), Osamu Akashi, Ryoichi Kawahara, Hiroshi Saito (NTT) NS2015213 
In a network reliability evaluation, it is a problem to compute the probability that two specified nodes can communicate... [more] 
NS2015213 pp.261266 
CQ 
20150706 13:00 
Nara 
Nara Institute of Science and Technology 
[Poster Presentation]
Path Enumeration Algorithm Using ZeroSuppressed Binary Decision Diagram for Path Selection in Overlay Networks Koki Sonoda, Jun Kawahara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ201529 
For endtoend communication in overlay networks, we need to quickly select an appropriate path from the viewpoints of t... [more] 
CQ201529 pp.5154 
CQ 
20150123 10:30 
Tokyo 

Proposal and Evaluation of Evacuation Guiding Scheme Using Trajectories of Mobile Terminals Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST) CQ2014104 
When largescale disasters occur, evacuees have to evacuate to safe places quickly.
In this paper, we propose an evacu... [more] 
CQ2014104 pp.101106 