| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2024-05-09 13:30 |
Kyoto | Kyoto University (Rakuyu-kaikan) | [Fellow Memorial Lecture]
Un chat pensant Hiro Ito (UEC) |
[more] | |
| COMP | 2024-03-14 11:30 |
Tokyo | The University of Electro-Communications | Masyu is Constant-Time Testable Kotaro Kabutoishi, Hiro Ito (UEC)  COMP2023-30 |
In this presentation, we provide a constant-time tester, or a tester for short, for a board puzzle “Masyu.” This puzzle... [more] |
COMP2023-30 pp.14-21 |
| COMP | 2021-10-23 11:10 |
Online | Online | Multifold tiles of polyominoes and convex lattice polygons Kota Chida (UEC), Erik Demaine, Martin Demaine (MIT), David Eppstein (UCI), Adam Hesterberg (Harvard Univ.), Takashi Horiyama (Hokkaido Univ.), John Iacono (ULB), Hiro Ito (UEC), Stefan Langerman (ULB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) COMP2021-15 |
A family of plane shapes $¥mathcal{T}$ is called a tiling if they (rotating and reflecting are allowed) cover the whole ... [more] | COMP2021-15 pp.11-18 |
| COMP | 2021-03-08 15:45 |
Online | Online | A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| COMP | 2018-10-26 11:15 |
Kyoto | Kyoto University | Atsuki Nagao (Ochanomizu Univ.), Sora Matsuzaki, Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2018-23 |
We enhance MCT (an algorithm for the maximum clique problem; presented by authors in FAW 2016, LNCS 9711, pp.215-226, 20... [more] | COMP2018-23 pp.17-24 |
| COMP | 2018-10-26 13:15 |
Kyoto | Kyoto University | Hyperfiniteness of hieralchical models for complex networks Kazuki Higashizono, Hiro Ito (UEC) COMP2018-24 |
Big networks such as the WWW and the protein-protein interaction network (PIN) are called complex networks. Some common... [more] | COMP2018-24 pp.25-31 |
| COMP, IPSJ-AL | 2018-05-26 13:30 |
Aichi | Nagoya Institute of Technology | Strip flat folding with parallel oblique mountain-valley-assigned creases Hiro Ito (UEC), Chie Nara (Meiji Univ.), Izumi Shirahama (ECBEING), Mizuho Tomura (UEC) COMP2018-4 |
The flat foldability problem is a typical problem of origami mathematics, which asks whether or not a given paper with c... [more] | COMP2018-4 pp.63-70 |
| COMP | 2018-03-05 15:55 |
Osaka | Osaka Prefecture Univ. | Implementation of global partition algorithm and verification of hyperfiniteness for property testing of real-world networks Yutaro Honda (Osaka Pref. Univ.), Hiro Ito (UEC), Munehiko Sasajima (Univ. of Hyogo), Yushi Uno (Osaka Pref. Univ.) COMP2017-52 |
In recent years, the necessity of analyzing big data is increasing to utilize them. In such cases, sublinear-time algori... [more] | COMP2017-52 pp.43-50 |
| ISEC, COMP | 2017-12-22 15:05 |
Kochi | Eikokuji Campus, Kochi University of Technology | Physical Bucket Sort with Restricted take Operations Atsuki Nagao, Wei Wu (Seikei Univ.), Hiro Ito (UEC) ISEC2017-90 COMP2017-44 |
[more] | ISEC2017-90 COMP2017-44 pp.119-122 |
| COMP | 2017-08-18 16:30 |
Aomori | K_3 edge cover problem in a wide sense Kyohei Chiba, Remy Belmonte, Hiro Ito (UEC), Atsuki Nagao (Seikei Univ.) COMP2017-19 |
[more] | COMP2017-19 pp.47-55 |
|
| COMP | 2016-10-21 13:30 |
Miyagi | Tohoku University | Physical Bucket Sort with Two Kinds of Items Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC) COMP2016-26 |
Bucket sort is one of the most famous sorting algorithms, and it runs in time $O(k+n)$, where $k$ is the number of bucke... [more] | COMP2016-26 pp.23-27 |
| COMP | 2016-04-22 14:30 |
Nara | Physical Bucket Sort John Iacono (NY Univ.), Hiro Ito, Atsuki Nagao, Junji Nishino (UEC), David Rappaport (Queen's Univ.) COMP2016-5 |
Bucket sort is one of the most famous sorting algorithm, which runs in O(k + n)-time where k is the number of buckets an... [more] | COMP2016-5 pp.29-34 |
|
| COMP | 2013-12-21 11:00 |
Okinawa | Okinawa Industry Support Center | Sublinear-time cake-cutting algorithms Takahiro Ueda (Kyoto Univ.), Hiro Ito (Univ. of Electro-Comm.) COMP2013-51 |
In this research, we show sub-linear time algorithms for the cake-cutting problem. The cake-cutting problem is a problem... [more] | COMP2013-51 pp.73-79 |
| COMP | 2011-04-22 17:10 |
Kyoto | Kyoto University | An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST) COMP2011-11 |
[more] | COMP2011-11 pp.77-82 |
| COMP | 2011-03-09 14:10 |
Tokyo | Chuo Univ. | Constant-time approximation algorithms for the knapsack problem Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida (Kyoto Univ.) COMP2010-51 |
In this paper, we give constant-time approximation algorithms for the knapsack problem. A randomized algorithm is cal... [more] |
COMP2010-51 pp.29-36 |
| COMP | 2010-01-25 15:00 |
Fukuoka | Nishijin Plaza, Kyushu University | An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) COMP2009-45 |
We investigate the following sorting puzzle: We are given $n$ bins with two balls in each bin. Balls in the $i$th bin ... [more] |
COMP2009-45 pp.45-49 |
| COMP | 2008-06-16 16:10 |
Ishikawa | JAIST | Property Testing on k-Vertex-Connectivity of Graphs Yuichi Yoshida, Hiro Ito (Kyoto Univ.) COMP2008-22 |
We present an algorithm for testing $k$-vertex-connectivity of graphs with given maximum degree. The time complexity of ... [more] | COMP2008-22 pp.49-55 |
| COMP | 2007-10-16 14:40 |
Miyagi | Tohoku Univ. | A winning strategy for Snaky with one handicap Hiro Ito, Hiromitsu Miyagawa (Kyoto Univ.) COMP2007-45 |
[more] | COMP2007-45 pp.25-32 |
| COMP | 2007-06-29 09:25 |
Hokkaido | Hokkaido University | Linear Time Enumeration of Isolated Bicliques with Part Size Proportion Bounded by Constants Hiromitsu Miyagawa, Hiro Ito, Kazuo Iwama (Kyoto Univ.) COMP2007-19 |
Problems for finding a maximum bipartite clique and enumerating maximal bipartite cliques for graphs are difficult. Alth... [more] | COMP2007-19 pp.9-16 |
| COMP | 2007-06-29 09:50 |
Hokkaido | Hokkaido University | Testing k-Edge-Connectivity of Digraphs Yuichi Yoshida, Hiro Ito (Kyoto Univ.) COMP2007-20 |
In this paper, we show constant time algorithm for testing whether a given degree-bounded digraph is $k$-edge-connected ... [more] | COMP2007-20 pp.17-23 |
[Return to Top Page]