Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2024-03-14 11:00 |
Tokyo |
The University of Electro-Communications |
Proof of NP-completeness of Tasukuea Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka) COMP2023-29 |
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] |
COMP2023-29 pp.6-13 |
COMP, IPSJ-AL |
2022-05-19 13:35 |
Online |
Online |
Transportation Problem Allowing Sending and Bringing Back Tetsuo Asano (Kanazawa Univ.) COMP2022-2 |
This paper considers a transportation problem on a weighted graph. The weights specify the amounts of commodities at no... [more] |
COMP2022-2 pp.9-16 |
COMP, IPSJ-AL |
2021-08-25 15:30 |
Online |
Online |
[Invited Talk]
Transportation Problem on a Graph Allowing Sending and Bringing-back Tetsuo Asano (Kanazawa Univ.) COMP2021-10 |
There are a number of problems classified as a transportation problem. In this paper we consider one of allowing sendin... [more] |
COMP2021-10 p.9 |
COMP, IPSJ-AL |
2020-09-02 11:30 |
Online |
Online |
What Restrictions Naturally Allow Well-Known NP-Complete Problems to Yield NL-Completeness and the Linear Space Hypothesis? Tomoyuki Yamakami (U of Fukui) COMP2020-10 |
Many practical combinatorial problems have been shown to be NP-complete or NP-hard. To cope with further real-life situa... [more] |
COMP2020-10 pp.33-40 |
COMP, IPSJ-AL |
2019-05-10 15:40 |
Kumamoto |
Kumamoto University |
On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles.
... [more] |
COMP2019-2 pp.15-22 |
CAS, MSS, IPSJ-AL [detail] |
2017-11-16 11:20 |
Tokyo |
|
[Invited Talk]
On the Recognition of Unit Grid Intersection Graphs Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2017-44 MSS2017-28 |
We show that the recognition problem for unit grid intersection graphs is NP-complete. [more] |
CAS2017-44 MSS2017-28 pp.15-20 |
MSS, CAS, IPSJ-AL [detail] |
2016-11-25 09:25 |
Hyogo |
Kobe Institute of Computing |
A Note on the Spanning Subgraph Isomorphism Problem Satoshi Tayu, Kenji Ichikawa, Shuichi Ueno (Tokyo Tech) CAS2016-69 MSS2016-49 |
We consider the subgraph isomorphism problem of two graphs which is to decide if a pattern graph is isomorphic to a subg... [more] |
CAS2016-69 MSS2016-49 pp.83-88 |
VLD, IPSJ-SLDM |
2015-05-14 10:05 |
Fukuoka |
Kitakyushu International Conference Center |
NP-completeness of Routing Problem with Bend Constraint Toshiyuki Hongo, Atsushi Takahashi (Tokyo Tech) VLD2015-3 |
Self-Aligned Quadruple Patterning (SAQP) in which side-wall process is repeated twice is an important manufacturing tech... [more] |
VLD2015-3 pp.13-18 |
NS, IN (Joint) |
2015-03-02 09:30 |
Okinawa |
Okinawa Convention Center |
Polynomial-time Algorithm for Traffic Engineering by Link Metric Update Shinya Kurimoto, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2014-185 |
In general, a route determined by an internet routing protocol such as OSPF and BGP is the shortest path that the sum of... [more] |
NS2014-185 pp.53-58 |
NS, IN (Joint) |
2015-03-02 09:10 |
Okinawa |
Okinawa Convention Center |
Quick Evacuation Method Considering Delay in Poor Communication Environment Yuki Takayama, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2014-121 |
Quick evacuation in an inner-city area is important to reduce victims at the time of a disaster, because an inner-city a... [more] |
IN2014-121 pp.1-6 |
COMP, IPSJ-AL |
2014-06-14 10:55 |
Ehime |
Matsuyama, Ehime |
A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2014-13 |
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, th... [more] |
COMP2014-13 pp.85-92 |
NS, IN (Joint) |
2014-03-06 09:50 |
Miyazaki |
Miyazaki Seagia |
Effect of Communiction Delay to Evacuation Navigation at the Time of Disaster Yuki Takayama, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2013-145 |
Quick evacuation in an inner-city area is especially important to reduce victims of a disaster, because an inner-city ar... [more] |
IN2013-145 pp.13-18 |
NS, IN (Joint) |
2014-03-07 09:50 |
Miyazaki |
Miyazaki Seagia |
Server Access Traffic Control by Link Metric Update Takahiro Munechika, Akira Noguchi, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-228 |
Recently, with the spread of broadband Internet access and video contents provide services, large contents in the Intern... [more] |
NS2013-228 pp.301-306 |
COMP |
2013-04-24 16:45 |
Hyogo |
Kobe University |
Computational complexity and an integer programming model of Shakashaka Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2013-8 |
The puzzle Shakashaka is popularized by Japanese publisher Nikoli, along with its more famous sibling Sudoku, and severa... [more] |
COMP2013-8 pp.43-48 |
NS, IN (Joint) |
2013-03-08 11:30 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Sensor Network Design Problem for Extending Battery Life Shiro Ono, Hiroyoshi Miwa (Kwansei Gakuin Univ.), Akio Hada, Ryuji Tsuchiya (RTRI) NS2012-216 |
Recently, there are many attempts using wireless sensor networks on various scenes, for example, environmental monitorin... [more] |
NS2012-216 pp.295-300 |
NS, IN (Joint) |
2013-03-08 15:50 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Query Routing Method Using Cache Location with Restricted Capacity Keisuke Do, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-241 |
Recently, it is a big concern that the quality of service is degraded by large load of servers and flooding of large amo... [more] |
NS2012-241 pp.445-450 |
NS, IN (Joint) |
2013-03-08 13:20 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Method for Finding Protected Nodes for Invulnerability against Attack to Network Nodes Tomomi Matsui, Shinya Yamamoto, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-266 |
The high reliability and performance are needed as the Internet becomes an important social infrastruc- ture. However, i... [more] |
NS2012-266 pp.589-594 |
NS, IN (Joint) |
2013-03-08 15:10 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Method of Finding Protected Data Centers to Keep Loads of Servers and Links Low during Server Failures Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-271 |
Recently, cloud computing technology has been developed and cloud
computing services becomes widespread. In a cloud co... [more] |
NS2012-271 pp.617-622 |
NS, IN (Joint) |
2013-03-08 09:00 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Quick Evacuation Problem for Evacuation Navigation System in The Time of Disaster Yuki Takayama, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2012-208 |
The Great East Japan Earthquake in 2011 raised people's awareness of disaster prevention.
Quick evacuation in an inner-... [more] |
IN2012-208 pp.323-328 |
COMP |
2012-09-03 10:50 |
Tokyo |
Hosei University |
An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is:
... [more] |
COMP2012-28 pp.17-24 |