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: 2023)

Search Results: Keywords 'from:2023-05-10 to:2023-05-10'

[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2023-05-10
14:30
Hokkaido Hokkaido University [Invited Talk] Reallocation Problems with Minimum Completion Time
Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] COMP2023-1
p.1
COMP, IPSJ-AL 2023-05-11
10:00
Hokkaido Hokkaido University A computational complexity assumption necessary for pseudorandom quantum states generators
Yuki Shirakawa (Kyoto Univ.) COMP2023-2
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] COMP2023-2
pp.2-7
COMP, IPSJ-AL 2023-05-11
10:25
Hokkaido Hokkaido University On the Solvability of Gathering Problems by Autonomous Mobile Robots with Defected View
Yonghwan Kim (NITech), Masahiro Shibata (Kyutech), Yuichi Sudo (Hosei Univ.), Junya Nakamura (TUT), Yoshiaki Katayama (NITech), Toshimitsu Masuzawa (Osaka Univ.) COMP2023-3
 [more] COMP2023-3
pp.8-15
COMP, IPSJ-AL 2023-05-11
11:05
Hokkaido Hokkaido University Improved approximation algorithm for TTP-2
Yuga Kanaya, Kenjiro Takazawa (Hosei Univ) COMP2023-4
 [more] COMP2023-4
pp.16-21
COMP, IPSJ-AL 2023-05-11
14:20
Hokkaido Hokkaido University Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph
Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2023-5
Given a graph $G = (V, E)$ with a terminal set $W subseteq V$,
a vertex subset $S subseteq V$ is an emph{induced Stein... [more]
COMP2023-5
pp.22-28
COMP, IPSJ-AL 2023-05-11
15:25
Hokkaido Hokkaido University Parameterized Complexity of Shortest Path Most Vital Edges Problem
Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] COMP2023-6
pp.29-35
 Results 1 - 6 of 6  /   
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