|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2023)
|
|
Search Results: Keywords 'from:2023-10-24 to:2023-10-24'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2023-10-24 13:30 |
Aichi |
Nagoya Univ. Venture Business Lab. |
An algorithm for the secure total domination problem in proper interval graphs Toru Araki, Yasufumi Aita (Gunma Univ.) COMP2023-11 |
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] |
COMP2023-11 pp.1-8 |
COMP |
2023-10-24 14:05 |
Aichi |
Nagoya Univ. Venture Business Lab. |
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono, Kosuke Sugiyama (Nagoya Univ.) COMP2023-12 |
For an undirected graph $G=(V,E)$ and a $k$-nonnegative integer vector $bp=(p_1,ldots,p_k)$, a mapping $lcolon Vto mathb... [more] |
COMP2023-12 pp.9-11 |
COMP |
2023-10-24 15:00 |
Aichi |
Nagoya Univ. Venture Business Lab. |
[Invited Talk]
Recent advances in algorithmic randomness Takayuki Kihara (Nagoya Univ.) COMP2023-13 |
[more] |
COMP2023-13 p.12 |
COMP |
2023-10-24 16:20 |
Aichi |
Nagoya Univ. Venture Business Lab. |
Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] |
COMP2023-14 pp.13-20 |
COMP |
2023-10-24 16:55 |
Aichi |
Nagoya Univ. Venture Business Lab. |
On Space Complexity of Generating a Tent Code Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) COMP2023-15 |
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it po... [more] |
COMP2023-15 pp.21-23 |
|
|
|
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]
|