Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20190902 14:15 
Okayama 
Tsushima Campus, Okayama University 
Space efficient separator algorithms for planar graphs Osamu Watanabe (Tokyo Inst. of Tech.) COMP201913 
The Separator Theorem states that any planar graph G with n vertices has a separator of size O(n^{1/2}), that is, a set ... [more] 
COMP201913 pp.1724 
COMP 
20181212 10:50 
Miyagi 
Tohoku University 
Minimization of an Mconvex Function under L1distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) COMP201833 
In this paper we consider a new problem of minimizing an Mconvex function under L1distance constraint (MML1); the cons... [more] 
COMP201833 pp.1520 
COMP, IPSJAL 
20160625 13:15 
Ishikawa 

An algorithm for 3SAT problems Hiroshi Tsukimoto (Tokyo Denki Univ.) COMP201610 
This paper presents an algorithm for 3SAT problems. First, logical formulas are transformed into elementary algebraic f... [more] 
COMP201610 pp.8996 
COMP, IPSJAL 
20160625 15:05 
Ishikawa 

Computational Complexity of Sequential Token Swapping Problem Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shinichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP201613 
We consider a puzzle consisting of colored tokens on an $n$vertex graph, where each token has a distinct starting verte... [more] 
COMP201613 pp.115121 
NS, IN (Joint) 
20150302 09:30 
Okinawa 
Okinawa Convention Center 
Polynomialtime Algorithm for Traffic Engineering by Link Metric Update Shinya Kurimoto, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2014185 
In general, a route determined by an internet routing protocol such as OSPF and BGP is the shortest path that the sum of... [more] 
NS2014185 pp.5358 
NS, IN (Joint) 
20140307 09:50 
Miyazaki 
Miyazaki Seagia 
Server Access Traffic Control by Link Metric Update Takahiro Munechika, Akira Noguchi, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013228 
Recently, with the spread of broadband Internet access and video contents provide services, large contents in the Intern... [more] 
NS2013228 pp.301306 
NS, IN (Joint) 
20140307 08:50 
Miyazaki 
Miyazaki Seagia 
Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013243 
Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may d... [more] 
NS2013243 pp.385390 
NS, IN (Joint) 
20130308 13:40 
Okinawa 
Okinawa Zanpamisaki Royal Hotel 
Method for Finding Links Protected for Keeping the Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012251 
Recently, largevolume contents distributed by a content delivery network~(CDN) on the Internet increase load of content... [more] 
NS2012251 pp.499504 
NS, IN (Joint) 
20130308 14:00 
Okinawa 
Okinawa Zanpamisaki Royal Hotel 
Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012252 
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] 
NS2012252 pp.505510 
NS, IN (Joint) 
20130308 13:00 
Okinawa 
Okinawa Zanpamisaki Royal Hotel 
Method for Finding Links Protected against Increase of Path Length during Failures Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012265 
A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual ... [more] 
NS2012265 pp.583588 
MSS 
20130122 14:25 
Osaka 
Osaka Int. Convention Center 
On Polynomial Time Checking on Reachability in Sound Extended FreeChoice Workflow Nets Daiki Kano, Shingo Yamaguchi (Yamaguchi Univ.) MSS201248 
There are two aspects of a workflow: definition and instance.
In this paper, we tackle verification of correctness of w... [more] 
MSS201248 pp.1721 
CAS, MSS 
20111118 11:15 
Yamaguchi 
Univ. of Yamaguchi 
On Reachability Verification for Acyclic WellStructured Work Shinji Hamano, Shingo Yamaguchi (Yamaguchi Univ.) CAS201178 MSS201147 
Workflow nets are making great contributions for modeling and analysis of workflows.
In this paper, we tackle verificat... [more] 
CAS201178 MSS201147 pp.8387 
IN, NS (Joint) 
20110303 08:40 
Okinawa 
Okinawa Convention Center 
Method for Finding Links Protected for Network Load Balancing during Failures Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010173 
The internet reliability is needed as the Internet becomes an important social infrastructure. However, we face the ris... [more] 
NS2010173 pp.5762 
IN, NS (Joint) 
20110303 09:20 
Okinawa 
Okinawa Convention Center 
Method for Finding Links Protected to Keep Reachability to Server during Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010175 
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] 
NS2010175 pp.6974 
IN, NS (Joint) 
20110304 14:10 
Okinawa 
Okinawa Convention Center 
Control Method of Autonomously Formed Unstructured P2P Network Based on Usage History Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2010206 
P2P(PeertoPeer) network systems in contrast to client/server systems is expected in many fields such as not only file ... [more] 
IN2010206 pp.371376 
IBISML 
20101104 15:00 
Tokyo 
IIS, Univ. of Tokyo 
[Poster Presentation]
Efficient Implementation of Greedy Cover Learning by HyperRectangles and Its Classification Performance Evaluation Using Real Data Koji Ouchi, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) IBISML201072 
Blumer et al. showed that
the class of concepts represented by finite unions
of hyperrectangles
in $d$dimensional ... [more] 
IBISML201072 pp.99104 
NS, IN (Joint) 
20100305 10:20 
Miyazaki 
Miyazaki Phoenix Seagaia Resort (Miyazaki) 
Traffic Engineering by Polynomially Solvable Link Metric Optimization Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2009229 
Open Shortest Path First (OSPF) is the most commonly used intradomain internet routing protocol. As the routes of paths... [more] 
NS2009229 pp.375380 
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 
MSS 
20090806 15:20 
Tokyo 
JAIST Tokyo Campus 
Polynomialtime Algorithm for Controllability Test of Boolean Networks Koichi Kobayashi (JAIST), Junichi Imura (Tokyo Inst. of Tech.), Kunihiko Hiraishi (JAIST) CST200914 
This paper proposes a polynomialtime algorithm to determine if a Boolean network with control nodes and controlled node... [more] 
CST200914 pp.1318 
CAS, CS, SIP 
20090303 13:10 
Gifu 
Nagaragawa Convention Center 
[Poster Presentation]
A Note on Two Problems of NanoPLA Design Anish Man Singh Shrestha, Tomoki Yamada, Satoshi Tayu, Shuichi Ueno (Tokyo Inst of Tech) CAS2008133 SIP2008196 CS2008107 
This paper shows that the subgraph isomorphism problem is NPhard even for bipartite permutation graphs, while the balan... [more] 
CAS2008133 SIP2008196 CS2008107 pp.183184 