IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
    [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)
 18件中 1~18件目  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-12-13
Gunma Ikaho Seminar House, Gunma University COMP2019-42  [more] COMP2019-42
COMP, IPSJ-AL 2019-05-11
Kumamoto Kumamoto University Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.) COMP2019-9
 [more] COMP2019-9
COMP, IPSJ-AL 2016-06-25
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
COMP 2014-04-24
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
COMP 2013-04-24
Hyogo Kobe University Computational complexity and an integer programming model of Shakashaka
Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2013-8
The puzzle Shakashaka is popularized by Japanese publisher Nikoli, along with its more famous sibling Sudoku, and severa... [more] COMP2013-8
COMP 2012-10-31
Miyagi Tohoku University On computing the nucleolus and the Shapley value of facility location games
Takanori Namikawa (JAIST), Yoshio Okamoto (UEC), Yota Otachi (JAIST) COMP2012-38
 [more] COMP2012-38
COMP 2012-06-21
Hokkaido Hokkaido University Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ) COMP2012-14
 [more] COMP2012-14
COMP 2012-06-21
Hokkaido Hokkaido University Approximation for the Geometric Unique Coverage Problem on Unit Squares
Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.) COMP2012-24
 [more] COMP2012-24
IT 2012-05-25
Fukuoka   Rational Secret Sharing for Non-Simultaneous Channels
Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Keisuke Tanaka (Tokyo Inst. of Tech.), Kenji Yasunaga (ISIT) IT2012-8
 [more] IT2012-8
COMP 2011-10-21
Miyagi Tohoku Univ. Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings
Walter Didimo (Univ. of Perugia), Michael Kaufmann (Univ. of Tuebingen), Giuseppe Liotta (Univ. of Perugia), Yoshio Okamoto (JAIST), Andreas Spillner (Univ. of Greifswald) COMP2011-33
 [more] COMP2011-33
COMP 2010-12-03
Fukuoka Kyutech Plaza, Kyushu Institute of Technology Constant-round reconstruction for rational secret sharing
Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (JAIST), Keisuke Tanaka, Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2010-41
 [more] COMP2010-41
COMP 2010-10-15
Miyagi Tohoku Univ. Bipartite powers of interval bigraphs
Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2010-36
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a... [more] COMP2010-36
COMP, IPSJ-AL 2010-05-19
Ishikawa Japan Advanced Institute of Science and Technology On the t-pebbling number of weighted graphs
Michael Hoffmann (Inst. of Theoretical Computer Sci, ETH Zurich), Jiri Matousek (Charles Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (Inst. of Theoretical Computer Sci, ETH Zurich) COMP2010-13
 [more] COMP2010-13
COMP 2010-04-22
Shiga Ritusmeikan University, Biwako-Kusatsu Campus Counting the number of dominating sets in graph classes
Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII) COMP2010-2
 [more] COMP2010-2
COMP 2010-03-12
Tokyo National Institute of Informatics On the Geodesic Diameter of Polygonal Domains
Sang Won Bae (POSTECH), Matias Korman (Universite Libre de Broxelles, Belgium), Yoshio Okamoto (Tokyo Inst. of Tech.) COMP2009-53
 [more] COMP2009-53
COMP 2010-01-25
Fukuoka Nishijin Plaza, Kyushu University Minimum and maximum against k lies
Michael Hoffmann (ETH Zurich), Jiri Matousek (Charles U/ETH Zurich), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (ETH Zurich) COMP2009-46
 [more] COMP2009-46
COMP 2009-06-29
Hokkaido Hokkaido University Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2009-24
 [more] COMP2009-24
COMP 2008-03-10
Kanagawa   Analysis of the quick sort in terms of inversions
Kazuya Shirahata (Toyohashi Univ Tech), Yoshio Okamoto (Tokyo Tech) COMP2007-67
 [more] COMP2007-67
 18件中 1~18件目  /   
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. (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