Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
SIP, IT, RCS 
20210122 10:40 
Online 
Online 
Construction of Large Cardinality Nonbinary Single Insertion/Deletion Correcting Codes via Maximum Clique Enumeration Akira Mitsutake, Takayuki Nozaki (Yamaguchi Univ.), Etsuji Tomita (UEC) 
[more] 

COMP, IPSJAL 
20200509 15:10 
Online 
Online 
Another timecomplexity analysis for the maximal clique enumeration algorithm CLIQUES Etsuji Tomita (Univ. ElectroComm.), Alessio Conte (Univ. of Pisa) COMP20201 
We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006.
It is... [more] 
COMP20201 pp.18 
COMP 
20190902 11:25 
Okayama 
Tsushima Campus, Okayama University 
Speedingup of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP201911 
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] 
COMP201911 pp.714 
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 
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 
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 
COMP 
20101203 14:30 
Fukuoka 
Kyutech Plaza, Kyushu Institute of Technology 
An improved result on polynomialtime solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP201043 
This report presents an improved result for polynomialtime solvability of the maximum clique problem which is a typical... [more] 
COMP201043 pp.2936 
COMP 
20071016 15:30 
Miyagi 
Tohoku Univ. 
An O(2^0.24945n)time and Polynomialspace Algorithm Hiroaki Nakanishi, Etsuji Tomita (Univ. of ElectroComun.) COMP200746 
The maximum clique problem is an NPhard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more] 
COMP200746 pp.3340 
COMP 
20071016 16:05 
Miyagi 
Tohoku Univ. 
A polynomialtime algorithm for checking the equivalence of realtime strict deterministic restricted onecounter transducers Kazushi Seino (UEC/TSOL), Etsuji Tomita, Mitsuo Wakatsuki (UEC) COMP200747 
[more] 
COMP200747 pp.4148 
COMP 
20070629 09:00 
Hokkaido 
Hokkaido University 
A Computaional Complexity for finding a Maximum Clique in a Graph with Maximum Degree 4 Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP200718 
The maximum clique problem is an NPhard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more] 
COMP200718 pp.17 
COMP 
20051019 11:35 
Miyagi 
Tohoku Univ. 
Some sufficient conditions to solve the learning problem of simple deterministic languages from queries and counterexamples Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri and Tech.), Etsuji Tomita (Univ. of ElectroComm.) 
It is unknown that polynomial time learnability of simple deterministic languages from membership
queries and counterex... [more] 
COMP200548 pp.2530 