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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 22  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2020-12-04
10:00
Online Online A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems
Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19
 [more] COMP2020-19
pp.8-15
COMP 2020-12-04
10:40
Online Online Efficient Construction of Cryptarithm Catalogues over DFA
Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] COMP2020-20
pp.16-23
COMP, IPSJ-AL 2019-05-11
10:40
Kumamoto Kumamoto University Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams
Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$.
In this paper, when ... [more]
COMP2019-3
pp.51-58
COMP 2018-12-12
10:00
Miyagi Tohoku University Max-Min Dispersion Problems
Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII) COMP2018-31
 [more] COMP2018-31
pp.1-6
COMP 2018-09-18
15:20
Fukuoka Kyusyu Institute of Technology Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs
Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST) COMP2018-17
A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) ... [more] COMP2018-17
pp.55-62
COMP, IPSJ-AL 2016-06-25
15:05
Ishikawa   Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] COMP2016-13
pp.115-121
COMP 2014-12-05
16:10
Kumamoto Sojo University Optimally Bracing Frameworks of Union of Space-filling Convex Polyhedra
Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jin-ichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.) COMP2014-39
(To be available after the conference date) [more] COMP2014-39
pp.45-51
COMP, IPSJ-AL 2014-06-14
13:55
Ehime Matsuyama, Ehime Enumeration of Polyominoes for pmg Tiling
Jun Nishioka, Takashi Horiyama (Saitama Univ.) COMP2014-14
Polyominoes are the two dimensional shapes made by connecting n equal-sized squares, joined along their edges. In this p... [more] COMP2014-14
pp.107-114
COMP 2012-10-31
15:35
Miyagi Tohoku University On the Complexity of Packing Trominoes
Takashi Horiyama (Saitama Univ.), Takehiro Ito (Tohoku Univ.), Keita Nakatsuka (Saitama Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2012-40
 [more] COMP2012-40
pp.37-43
COMP 2012-04-27
14:45
Osaka Osaka Prefecture University On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2012-6
 [more] COMP2012-6
pp.37-43
COMP, IPSJ-AL 2011-09-06
16:45
Hokkaido Hakodate City Central Library Unfoldings of Platonic Solids with Minimum/Maximum Diameter, Width, and Enclosing-Rectangle
Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-27
A tetrahedron has 2 edge unfoldings. A cube and an octahedron
have 11 unfoldings, respectively. A dodecahedron and
an ... [more]
COMP2011-27
pp.83-89
COMP 2011-05-11
14:30
Nagano Shinshu Univ. Edge-Unfoldings of Platonic Solids Never Overlap
Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-14
We solve an open problem for hundreds of years:
Is every edge-unfolding of Platonic solids nonoverlapping?
The answer ... [more]
COMP2011-14
pp.17-23
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM
(Joint) [detail]
2010-12-01
15:30
Fukuoka Kyushu University Sharing of Clock Gating Modules under Multi-Stage Clock Gating Control
Xin Man (Waseda Univ.), Takashi Horiyama (Saitama Univ.), Tomoo Kimura, Koji Kai (Panasonic), Shinji Kimura (Waseda Univ.) VLD2010-83 DC2010-50
Clock gating is an effective technique to reduce dynamic power consumption for sequential circuits. This paper shows a s... [more] VLD2010-83 DC2010-50
pp.185-190
COMP 2010-10-15
13:20
Miyagi Tohoku Univ. Secure Vickrey Auction Based on Secret Sharing
Takuma Sugimoto, Takashi Horiyama (Saitama Univ.) COMP2010-34
Vickrey auction, in which the highest bidder wins at the second highest price, is a well-known incentive compatible auct... [more] COMP2010-34
pp.19-25
COMP 2009-06-29
11:10
Hokkaido Hokkaido University The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas
Takashi Horiyama, Kosuke Higuchi (Saitama Univ.) COMP2009-20
 [more] COMP2009-20
pp.17-21
COMP 2009-05-26
16:15
Saitama Saitama Univ. Enumeration of Polyominoes for p4 Tiling
Takashi Horiyama, Masato Samejima (Saitama Univ.) COMP2009-17
Polyominoes are the two dimensional shapes
made by connecting n unit squares, joined along their edges.
In this paper,... [more]
COMP2009-17
pp.51-55
COMP 2008-12-03
16:00
Gunma Gunma Univ. [Invited Talk] FOCS 2008 Report
Takashi Horiyama (Saitama Univ.) COMP2008-53
 [more] COMP2008-53
p.49
VLD, IPSJ-SLDM 2008-05-09
13:30
Hyogo Kobe Univ. Fine-Grained Power Gating Based on the Controlling Value of Logic Gates
Lei Chen (Waseda Univ.), Takashi Horiyama (Saitama Univ.), Yuichi Nakamura (NEC), Shinji Kimura (Waseda Univ.) VLD2008-10
Leakage power dissipation of logic gates has become an increasingly important problem. A novel fine-grained power gating... [more] VLD2008-10
pp.19-24
COMP 2007-09-20
15:15
Aichi   The Complexity of the Hajos Calculus on Planar Graphs
Yoichi Hanatani (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Kazuo Iwama, Suguru Tamaki (Kyoto Univ.) COMP2007-38
The planar Haj\'os calculus is the Haj\'os calculus with the restriction
that all the graphs that appear in the constr... [more]
COMP2007-38
pp.43-50
COMP 2005-10-19
09:35
Miyagi Tohoku Univ. Automated Competitive Analysis of Online Problems
Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.)
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK)
which is an extension of the 2-Bin Removab... [more]
COMP2005-45
pp.7-12
 Results 1 - 20 of 22  /  [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