| 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 | 2022-10-26 14:30 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.)  COMP2022-17 |
In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] | COMP2022-17 pp.21-28 |
| COMP, IPSJ-AL | 2022-05-19 15:40 |
Online | Online | On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5 |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] | COMP2022-5 pp.33-38 |
| COMP | 2019-09-02 14:15 |
Okayama | Tsushima Campus, Okayama University | Space efficient separator algorithms for planar graphs Osamu Watanabe (Tokyo Inst. of Tech.) COMP2019-13 |
The Separator Theorem states that any planar graph G with n vertices has a separator of size O(n^{1/2}), that is, a set ... [more] | COMP2019-13 pp.17-24 |
| COMP, IPSJ-AL | 2017-05-13 10:00 |
Nagasaki | Acute Constrains in Straight-Line Drawings of Planar Graphs Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.) COMP2017-5 |
Recent research on graph drawing focuses on Right-Angle-Crossing (RAC) drawings of 1-plane graphs, where each edge is dr... [more] | COMP2017-5 pp.31-38 |
|
| 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 |
|
| COMP | 2013-03-18 14:10 |
Gifu | Gifu University | A note on lower bounds of the girth of planar C_7-colorable graphs Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-57 |
This report considers the $C_{2k+1}$-coloring problem, which is a subproblem for the $n/k$-coloring problem, where $n,... [more] |
COMP2012-57 pp.31-38 |
| COMP, IPSJ-AL | 2010-05-19 16:30 |
Ishikawa | Japan Advanced Institute of Science and Technology | Spanning tree congestion of k-outerplanar graphs Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) COMP2010-14 |
In 1987, Simonson [Math. Syst. Theory 20 (1987) 235-252] conjectured that every k-outerplanar graph of the maximum degre... [more] | COMP2010-14 pp.43-46 |
| COMP | 2010-04-22 10:00 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | A tight upper bound on the (2,1)-total labeling number of outerplanar graphs Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.) COMP2010-1 |
A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to t... [more] |
COMP2010-1 pp.1-8 |
| COMP | 2009-10-16 10:35 |
Miyagi | Tohoku University | Small Grid Drawings of Planar Graphs with Balanced Bipartition Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33 |
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] | COMP2009-33 pp.9-15 |
| COMP | 2008-05-13 13:55 |
Fukuoka | Kyushu Sangyo University | NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11 |
This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] | COMP2008-11 pp.25-32 |
| COMP | 2008-03-10 15:55 |
Kanagawa | Security number for outerplanar graphs Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2007-64 |
Let $G=(V,E)$ be a graph and $S = \{s_1,s_2,\ldots,s_k\}$ be a subset of $V$. An \textit{attack} on $S$ is any $k$ m... [more] |
COMP2007-64 pp.63-65 |
|
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs (Extended Abstract) Takuya Oshima, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2007-143 SIP2007-218 CS2007-108 |
It has been known that every series-parallel 6-graph has a 2-bend 3-D orthogonal drawing, while it has been open whether... [more] | CAS2007-143 SIP2007-218 CS2007-108 pp.93-94 |
| CAS | 2008-01-31 13:50 |
Okinawa | The constitution method of planar graphs existing between hierarchy structure for n/k-colorings Yuya Iguchi, Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) CAS2007-86 |
The typical vertex n-colorings have trivial inclusion relations of classes of n-colorable graphs for the escalating numb... [more] | CAS2007-86 pp.13-18 |
|
| 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 | 2007-06-29 14:40 |
Hokkaido | Hokkaido University | On the complexity of planar n/k-coloring problems Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25 |
This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a subproblem of the $H$-color... [more] |
COMP2007-25 pp.55-62 |
| COMP | 2005-03-18 14:10 |
Tokyo | Tokyo Institute of Technology | Algorithms for Finding Distance-Edge-Colorings of Graphs Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
For a given bounded nonnegative integer $\ell$, we wish to color all edges of a graph $G$ so that any two edges within d... [more] | COMP2004-79 pp.49-55 |
[Return to Top Page]