IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 11件中 1~11件目  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-09-02
11:25
Okayama Tsushima Campus, Okayama University Speeding-up of Construction Algorithms for the Graph Coloring Problem
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] COMP2019-11
pp.7-14
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
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 2010-12-03
14:30
Fukuoka Kyutech Plaza, Kyushu Institute of Technology An improved result on polynomial-time solvability of the maximum clique problem
Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP2010-43
This report presents an improved result for polynomial-time solvability of the maximum clique problem which is a typical... [more] COMP2010-43
pp.29-36
COMP 2007-10-16
15:30
Miyagi Tohoku Univ. An O(2^0.24945n)-time and Polynomial-space Algorithm
Hiroaki Nakanishi, Etsuji Tomita (Univ. of Electro-Comun.) COMP2007-46
The maximum clique problem is an NP-hard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more]
COMP2007-46
pp.33-40
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
COMP 2007-06-29
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) COMP2007-18
The maximum clique problem is an NP-hard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more]
COMP2007-18
pp.1-7
COMP 2005-10-19
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 Electro-Comm.)
It is unknown that polynomial time learnability of simple deterministic languages from membership
queries and counterex... [more]
COMP2005-48
pp.25-30
 11件中 1~11件目  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan