| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2021-03-08 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)  COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| COMP | 2018-10-26 11:15 |
Kyoto | Kyoto University | Atsuki Nagao (Ochanomizu Univ.), Sora Matsuzaki, Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2018-23 |
We enhance MCT (an algorithm for the maximum clique problem; presented by authors in FAW 2016, LNCS 9711, pp.215-226, 20... [more] | COMP2018-23 pp.17-24 |
| 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 |
| KBSE | 2013-09-12 10:05 |
Tokyo | The University of Electro-Communications | A New Technique to Improve Code Readability by Omitting Similar Source Code Patterns Hiroshi Kikuchi, Tetsuro Nishino, Takaaki Goto, Mitsuo Wakatsuki (UEC) KBSE2013-36 |
To understand existing software, we need to read the source code of the software. However, source code reading is time c... [more] | KBSE2013-36 pp.1-6 |
| 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 |
| COMP | 2011-10-21 11:10 |
Miyagi | Tohoku Univ. | An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] | COMP2011-30 pp.15-22 |
| COMP | 2011-04-22 13:55 |
Kyoto | Kyoto University | A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] | COMP2011-6 pp.41-48 |
| COMP | 2007-10-16 16:05 |
Miyagi | Tohoku Univ. | A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers Kazushi Seino (UEC/TSOL), Etsuji Tomita, Mitsuo Wakatsuki (UEC) COMP2007-47 |
[more] | COMP2007-47 pp.41-48 |
[Return to Top Page]