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->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 37  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-12-06
09:55
Ehime Ehime Univ. Media Hall COMP2022-22 組合せ遷移,グラフアルゴリズム,点素パス [more] COMP2022-22
pp.9-13
COMP 2022-03-06
13:30
Online Online [Invited Talk] Monotone edge flips to an orientation of maximum edge-connectivity `a la Nash-Williams
Takehiro Ito (Tohoku Univ.), Yuni Iwamasa (Kyoto Univ.), Naonori Kakimura (Keio Univ.), Naoyuki Kamiyama (Kyushu Univ.), Yusuke Kobayashi (Kyoto Univ.), Shun-ichi Maezawa (UEC), Yuta Nozaki (Hiroshima Univ.), Yoshio Okamoto (UEC), Kenta Ozeki (YNU) COMP2021-34
 [more] COMP2021-34
p.24
COMP 2021-12-03
10:30
Ishikawa Kanazawa Chamber of Commerce and Industry
(Primary: On-site, Secondary: Online)
Complexity of reconfiguration of regular induced subgraphs
Hiroshi Eto, Takehiro Ito (Tohoku Univ), Yasuaki Kobayashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-22
 [more] COMP2021-22
pp.9-10
COMP 2021-12-03
11:10
Ishikawa Kanazawa Chamber of Commerce and Industry
(Primary: On-site, Secondary: Online)
Token Sliding on Directed Graphs
Takehiro Ito (Tohoku Univ), Yuni Iwamasa, Yasuaki Kobayashi (Kyoto Univ), Yu Nakahata (NAIST), Masahiro Takahashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-23
given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by... [more] COMP2021-23
pp.11-18
COMP 2019-12-13
17:00
Gunma Ikaho Seminar House, Gunma University COMP2019-42 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] COMP2019-42
pp.93-100
COMP 2019-09-02
10:50
Okayama Tsushima Campus, Okayama University Shortest Universal Sequences of Adjacent Transpositions
Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] COMP2019-10
pp.1-5
MSS, SS 2019-01-16
10:50
Okinawa   Design of distribution ratio on a multi-stage parallel production line based on an optimal velocity traffic model
Toru Sano, Keiji Konishi (Osaka Pref. Univ.), Takehiro Itou, Hisaya Wakayama (NEC) MSS2018-70 SS2018-41
Recently, there is a need to implement production systems which can adapt to changing demand. This report proposes a mul... [more] MSS2018-70 SS2018-41
pp.85-90
COMP 2018-12-12
10:25
Miyagi Tohoku University Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2018-32
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] COMP2018-32
pp.7-14
NLP, CCS 2018-06-08
15:15
Kyoto Kyoto Terrsa AGVs Dsipatch Timing Control for Self-synchronized Production in a Cellular Manufacturing System
Takehiro Itou (NEC), Keiji Konishi (Osaka Prefecture University), Hisaya Wakayama, Kumiko Tadano, Yoshiharu Maeno (NEC) NLP2018-38 CCS2018-11
In cellular manufacturing factories composed of many processes, synchronized production is desirable in order to keep hi... [more] NLP2018-38 CCS2018-11
pp.57-62
MSS, NLP
(Joint)
2018-03-14
11:10
Osaka   AGV Congestion Avoidance using Threshold-modulation Oscillator
Takehiro Itou (NEC), Keiji Konishi (Osaka Prefecture Univ.), Hisaya Wakayama, Kumiko Tadano, Yoshiharu Maeno (NEC) NLP2017-110
 [more] NLP2017-110
pp.47-50
MSS, NLP
(Joint)
2018-03-14
13:50
Osaka   Adaptive transfer control for unstable production system
Kumiko Tadano, Yoshinaru Maeno, Takehiro Itou, Hisaya Wakayama, Masatsugu Ogawa (NEC) MSS2017-93
 [more] MSS2017-93
pp.83-88
MSS, NLP
(Joint)
2018-03-14
14:15
Osaka   Design of distribution ratio on a branched production line based on an optimal velocity traffic model
Toru Sano, Keiji Konishi (Osaka Pref. Univ.), Takehiro Itou, Hisaya Wakayama (NEC) MSS2017-94
 [more] MSS2017-94
pp.89-94
COMP, IPSJ-AL 2017-05-13
11:00
Nagasaki   Approximability of the distance independent set problem on cubic graphs
Hiroshi Eto (Kyushu Univ), Takehiro Ito (Tohoku Univ), Zhilong Liu, Eiji Miyano (Kyutech) COMP2017-7
 [more] COMP2017-7
pp.47-54
COMP 2015-04-23
13:10
Miyagi   Algorithms for Dominating Set Reconfiguration Problem
Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo) COMP2015-1
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$
whose cardinalities are at most a given th... [more]
COMP2015-1
pp.1-7
COMP 2014-10-08
11:20
Tokyo Chuo University Algorithms for the Minimum Vulnerability Problem
Yusuke Aoki (Tohoku Univ.), Bjarni V. Halldorsson, Magnus M. Halldorsson (Reykjavik Univ.), Takehiro Ito (Tohoku Univ.), Christian Konrad (Reykjavik Univ.), Xiao Zhou (Tohoku Univ.) COMP2014-27
 [more] COMP2014-27
pp.9-15
COMP 2014-10-08
14:45
Tokyo Chuo University Reconfiguration of List Colorings in a Graph
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] COMP2014-29
pp.19-24
COMP, IPSJ-AL 2014-06-13
13:55
Ehime Matsuyama, Ehime The Independent Feedback Vertex Set Problem
Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-8
 [more] COMP2014-8
pp.13-18
COMP 2014-04-24
10:55
Miyagi Tohoku University Swapping Labeled Tokens on Graphs
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2
 [more] COMP2014-2
pp.5-12
COMP 2013-12-20
09:55
Okinawa Okinawa Industry Support Center Algorithms for Independent Set Reconfiguration Problem on Graphs
Erik D. Demaine, Martin L. Demaine (Massachusetts Inst. of Tech.), Takehiro Ito (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Ryuhei Uehara (JAIST) COMP2013-39
Suppose that we are given two independent sets Ib and Ir of a graph such that |Ibj| = |Ir|, and imagine that a token is ... [more] COMP2013-39
pp.7-14
COMP 2013-09-03
15:35
Tottori   Finding Maximum Regular Induced Subgraphs with Prescribed Degree
Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-31
We study the problem of finding a maximum vertex-subset $S$ of a given graph $G$ such that the subgraph $G[S]$ induced b... [more] COMP2013-31
pp.43-50
 Results 1 - 20 of 37  /  [Next]  
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