Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20210308 15:45 
Online 
Online 
A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP202035 
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215226, 2016). First, we em... [more] 
COMP202035 pp.3845 
QIT (2nd) 
20201210 13:00 
Online 
Online 
[Poster Presentation]
On runtime errors in quantum annealers Hiroto Yamakawa (UEC), Seiya Okubo (US), Tetsuro Nishino (UEC) 
Quantum annealing is a heuristic solution searching method to search for the optimal solution of an objective function u... [more] 

COMP 
20181026 11:15 
Kyoto 
Kyoto University 
Atsuki Nagao (Ochanomizu Univ.), Sora Matsuzaki, Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201823 
We enhance MCT (an algorithm for the maximum clique problem; presented by authors in FAW 2016, LNCS 9711, pp.215226, 20... [more] 
COMP201823 pp.1724 
KBSE 
20150305 10:05 
Tokyo 
The University of ElectroCommunications 
Practice and Evaluation of EPISODE on developing ICT based course material for children with a developmental disability Takahiro Kaneyama, Takaaki Goto, Tetsuro Nishino (UEC) KBSE201452 
In the education of children with developmental disabilities, attempts have been made to include ICT (Information and Co... [more] 
KBSE201452 pp.16 
COMP, IPSJAL 
20140614 10:55 
Ehime 
Matsuyama, Ehime 
A Further Improved Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201413 
This paper presents a further improved extended result for polynomialtime solvability of the maximum clique problem, th... [more] 
COMP201413 pp.8592 
KBSE 
20140530 14:45 
Kanagawa 
Keio Univ.(Raiousha, Hiyoshi Campus) 
A Methodology for Developing Opensource Software by Small Groups Takaaki Goto, Tetsuro Nishino (UEC), Kensei Tsuchida (Toyo Univ.) KBSE201410 
In software development, a waterfall model is used, especially for largescale software systems. For
smaller software d... [more] 
KBSE201410 pp.5358 
KBSE 
20140307 14:20 
Okinawa 
OkinawakenSeinenkaikan 
SoftwareAided Feature Selection for Open Source Software by Applying Brainstorming Methodology Based on Existing Open Source Software Md. Mahfuzus Salam Khan, Takaaki Goto, Tetsuro Nishino (Univ. of ElectroComm.) KBSE201396 
Teams with small size lacks of expert knowledge while starting a new open source software (OSS) project where there exis... [more] 
KBSE201396 pp.103108 
KBSE 
20131102 09:30 
Ehime 
Ehime University 
Ontology Design Based on Community Knowledge to Enhance Open Source Activity Md. Mahfuzus Salam Khan, Takaaki Goto, Tetsuro Nishino (Univ. of ElectroComm.) KBSE201359 
In the field of open source software development, open source initiators are strongly aware of the project vision and th... [more] 
KBSE201359 pp.3135 
KBSE 
20130912 10:05 
Tokyo 
The University of ElectroCommunications 
A New Technique to Improve Code Readability by Omitting Similar Source Code Patterns Hiroshi Kikuchi, Tetsuro Nishino, Takaaki Goto, Mitsuo Wakatsuki (UEC) KBSE201336 
To understand existing software, we need to read the source code of the software. However, source code reading is time c... [more] 
KBSE201336 pp.16 
COMP 
20120903 10:50 
Tokyo 
Hosei University 
An Improved Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201228 
This paper presents an improved extended result for polynomialtime solvability of the maximum clique problem, that is:
... [more] 
COMP201228 pp.1724 
COMP 
20111021 11:10 
Miyagi 
Tohoku Univ. 
An Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201130 
This report presents a result for polynomialtime solvability of the maximum clique problem, that is:for any pair of ver... [more] 
COMP201130 pp.1522 
COMP 
20110422 13:55 
Kyoto 
Kyoto University 
A further improved result on polynomialtime solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP20116 
This report presents a further improved result for polynomialtime solvability of the maximum clique problem, that is: f... [more] 
COMP20116 pp.4148 
SITE, IPSJEIP 
20100528 13:25 
Tokyo 

UEC Software Repository and Practical Software Development Education Takaaki Goto, Tetsuro Nishino (Univ. of ElectroComm.) SITE20104 
Most of softwares developed in universities are mainly used by developers themselves. In addition, these softwares have ... [more] 
SITE20104 pp.2530 
NC 
20100118 14:15 
Hokkaido 
HyakunenKinen in Hokkaido University 
A study of the timing mechanism in a cerebellar network model implemented on FPGA Kanako Matsuno (UEC), Takeru Honda (UEC/RIKEN), Hideaki Manabe (UEC), Shigeru Tanaka (UEC/RIKEN), Tetsuro Nishino (UEC) NC200972 
A cerebellar network model has been proposed previously,
in which the passage of time can be represented based on the ... [more] 
NC200972 pp.712 
NC 
20080115 16:30 
Hokkaido 
Centennial Hall, Hokkaido Univ. 
A study of timing mechanism and state transition in a spiking network model of the cerebellar granule cell layer Takeru Honda (UEC), Tadashi Yamazaki, Shigeru Tanaka (RIKEN BSI), Tetsuro Nishino (UEC) NC200795 
In this study, we built a spiking network model of the cerebellar granular layer, and analyzed its dynamics.When input s... [more] 
NC200795 pp.4954 
SCE 
20060127 14:55 
Tokyo 
KikaiShinkoKaikan Bldg. 
[Invited Talk]
Current Trends in Quantum Complexity Theory Tetsuro Nishino (UEC) 
[more] 
SCE200527 pp.2529 