IEICE Technical Committee Submission System
Advance Program
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


Technical Committee on Theoretical Foundations of Computing (COMP) [schedule] [select]
Chair Hiroyuki Uno (Osaka Metropolitan Univ.)
Vice Chair Shuji Kijima (Shiga Univ.)
Secretary Kunihiro Wasa (Hosei Univ.), Yu Yokoi (NII)
Assistant Ei Ando (Senshu Univ.)

Special Interest Group on Algorithms (IPSJ-AL) [schedule] [select]

Conference Date Wed, May 10, 2023 13:30 - 16:30
Thu, May 11, 2023 10:00 - 16:10
Topics Theoretical Computer Science, etc 
Conference Place Academic Lounge 1, 2F, B2-Building, Faculty of Engineering, Hokkaido University 
Transportation Guide https://drive.google.com/file/d/1sjFOHpX-bfq_BL-on1vHBqKlThFik94G/view?usp=share_link
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)
Registration Fee This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP.

Wed, May 10 PM 
13:30 - 16:30
(1) 13:30-13:55 [AL] 変更制約付き最大独立集合問題
朝廣 雄一(九州産業大学),江藤 宏,是永 華奈(九州工業大学),Guohui Lin (University of Alberta), ○宮野 英次,野々上 礼央(九州工業大学)
(2) 13:55-14:15 [AL ショートトーク] 歩行者ナビゲーションに向けた経路計画問題
○大滝 啓介,前田 智祐,吉村 貴克,堺 浩之(株式会社豊田中央研究所)
  14:15-14:30 Break ( 15 min. )
(3)
COMP
14:30-15:30 [Invited Talk]
Reallocation Problems with Minimum Completion Time COMP2023-1
Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.)
  15:30-15:45 Break ( 15 min. )
(4) 15:45-16:10 [AL] 直方体の格子展開図の重なり
○塩田 拓海(九州工業大学),鎌田 斗南,上原 隆平(北陸先端科学技術大学院大学)
(5) 16:10-16:30 [AL ショートトーク] 六角形パズルフォント
○谷口 智子,上原 隆平(北陸先端科学技術大学院大学)
Thu, May 11 AM 
10:00 - 11:55
(6)
COMP
10:00-10:25 A computational complexity assumption necessary for pseudorandom quantum states generators COMP2023-2 Yuki Shirakawa (Kyoto Univ.)
(7)
COMP
10:25-10:50 On the Solvability of Gathering Problems by Autonomous Mobile Robots with Defected View COMP2023-3 Yonghwan Kim (NITech), Masahiro Shibata (Kyutech), Yuichi Sudo (Hosei Univ.), Junya Nakamura (TUT), Yoshiaki Katayama (NITech), Toshimitsu Masuzawa (Osaka Univ.)
  10:50-11:05 Break ( 15 min. )
(8)
COMP
11:05-11:30 Improved approximation algorithm for TTP-2 COMP2023-4 Yuga Kanaya, Kenjiro Takazawa (Hosei Univ)
(9) 11:30-11:55 [AL] 最長ラン部分文字列問題に対する近似アルゴリズム
朝廣 雄一(九州産業大学),江藤 宏(九州工業大学),Mingyang Gong (University of Alberta), Jesper Jansson(京都大学),Guohui Lin (University of Alberta), 宮野 英次(九州工業大学),小野 廣隆(名古屋大学),○田中 駿一(九州工業大学)
  11:55-13:30 Lunch Break ( 95 min. )
Thu, May 11 PM 
13:30 - 16:10
(10) 13:30-13:55 [AL] A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs
○Tada Takumi, Haraguchi Kazuya (Kyoto University)
(11) 13:55-14:20 [AL] Enumeration of Non-isomorphic Unordered Trees with Degree Sequence Constraints
Shuhei Denzumi (NTT Communication Science Laboratories, NTT Corporation), Takashi Horiyama (Hokkaido University), ○Kazuhiro Kurita (Nagoya University), Atsuki Nagao (Ochanomizu University), Kazuhisa Seto (Hokkaido University), Kunihiro Wasa (Hosei University)
(12)
COMP
14:20-14:45 Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph COMP2023-5 Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.)
  14:45-15:00 Break ( 15 min. )
(13) 15:00-15:25 [AL] Optimal solution for the fold-and-cut problem on simple folding model
○Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
(14)
COMP
15:25-15:50 Parameterized Complexity of Shortest Path Most Vital Edges Problem COMP2023-6 Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
(15) 15:50-16:10 [AL ショートトーク] Algorithm for Computing Representation of Bivariate Multi-Unit Assignment Valuations
Takafumi Otsuka, ○Akiyoshi Shioura (Tokyo Institute of Technology)

Announcement for Speakers
General TalkEach speech will have 20 minutes for presentation and 5 minutes for discussion.

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address COMP Secretaries
E--mail: comp-n 
IPSJ-AL Special Interest Group on Algorithms (IPSJ-AL)   [Latest Schedule]
Contact Address  


Last modified: 2023-05-01 15:21:43


Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.
 
[Cover and Index of IEICE Technical Report by Issue]
 

[Presentation and Participation FAQ] (in Japanese)
 

[Return to COMP Schedule Page]   /   [Return to IPSJ-AL Schedule Page]   /  
 
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


[Return to Top Page]

[Return to IEICE Web Page]


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