|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
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 |
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, IPSJ-AL |
2019-05-11 16:40 |
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 pp.103-104 |
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-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-04-24 16:45 |
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 pp.43-48 |
COMP |
2012-10-31 14:05 |
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 pp.25-32 |
COMP |
2012-06-21 10:20 |
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 pp.17-24 |
COMP |
2012-06-21 16:45 |
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 pp.95-101 |
IT |
2012-05-25 17:15 |
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 pp.41-46 |
COMP |
2011-10-21 15:00 |
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 pp.33-38 |
COMP |
2010-12-03 13:00 |
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 pp.15-21 |
COMP |
2010-10-15 14:40 |
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 pp.35-39 |
COMP, IPSJ-AL |
2010-05-19 15:55 |
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 pp.39-41 |
COMP |
2010-04-22 10:35 |
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 pp.9-15 |
COMP |
2010-03-12 11:35 |
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 pp.25-32 |
COMP |
2010-01-25 15:35 |
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 pp.51-56 |
COMP |
2009-06-29 15:25 |
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 pp.45-52 |
COMP |
2008-03-10 17: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 pp.83-90 |
|
|
|
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]
|