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

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2022)

Search Results: Keywords 'from:2022-10-26 to:2022-10-26'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-10-26
10:00		 Fukuoka Kyusyu Univ. Nishijin Plaza [Invited Talk] Graph Search Parallelization and Applications
Kazuki Yoshizoe (Kyushu Univ.) COMP2022-13		  [more] COMP2022-13
p.1
COMP 2022-10-26
11:15		 Fukuoka Kyusyu Univ. Nishijin Plaza A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
Tomu Makita (Seikei Univ.), Atsuki Nagao (Ochanomizu Univ.), Tatsuki Okada (Seikei Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2022-14		  [more] COMP2022-14
pp.2-6
COMP 2022-10-26
11:45		 Fukuoka Kyusyu Univ. Nishijin Plaza Evacuation problems on grid networks with uniform transit time and uniform capacity
Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP2022-15		 We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] COMP2022-15
pp.7-13
COMP 2022-10-26
14:00		 Fukuoka Kyusyu Univ. Nishijin Plaza Enumeration of Transversal Edge-Partitions
Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.) COMP2022-16		 In this paper, we consider the problem of enumerating transversal edge-partition of an irreducible triangulation. We pro... [more] COMP2022-16
pp.14-20
COMP 2022-10-26
14:30		 Fukuoka Kyusyu Univ. Nishijin Plaza Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17		 In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] COMP2022-17
pp.21-28
COMP 2022-10-26
15:15		 Fukuoka Kyusyu Univ. Nishijin Plaza [Invited Talk] Hedonic Games and Treewidth Revisited
Tesshu Hanaka (Kyushu Univ.), Michael Lampis (LAMSADE) COMP2022-18		  [more] COMP2022-18
p.29
COMP 2022-10-26
16:30		 Fukuoka Kyusyu Univ. Nishijin Plaza COMP2022-19 The sum approximation (from below) of an irrational number $alpha$ is the function that, given a nonnegative number $n$,... [more] COMP2022-19
pp.30-31
COMP 2022-10-26
17:00		 Fukuoka Kyusyu Univ. Nishijin Plaza Computational Complexity of List Constructing
Takashi Harada (Kochi Univ. of Tech.), Takashi Fuchino, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (MIT) COMP2022-20		 Packet classification is to classify packets arriving to or leaving from a network device according to the security polic... [more] COMP2022-20
pp.32-37
 Results 1 - 8 of 8  /   
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. (License 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