| 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 | 2023-05-11 14:20 |
Hokkaido | Hokkaido University | Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.)  COMP2023-5 |
Given a graph $G = (V, E)$ with a terminal set $W subseteq V$, a vertex subset $S subseteq V$ is an emph{induced Stein... [more] |
COMP2023-5 pp.22-28 |
| COMP, IPSJ-AL | 2022-09-15 11:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2022-11 |
Given a graph ???? = (????, ????) with a terminal set ???? ⊆ ????, a vertex subset ???? ⊆ ???? is an induced Steiner sub... [more] | COMP2022-11 pp.3-9 |
| ISEC, IT, WBS | 2020-03-11 11:45 |
Hyogo | University of Hyogo (Cancelled but technical report was issued) |
Aggregate MAC schemes for generating orders by series-parallel graphs Yuta Ishii, Mitsuru Tada (Chiba Univ.) IT2019-113 ISEC2019-109 WBS2019-62 |
(To be available after the conference date) [more] | IT2019-113 ISEC2019-109 WBS2019-62 pp.159-166 |
| 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 | 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 | 2009-09-14 11:15 |
Tottori | Tottori University of Environmental Studies | Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] | COMP2009-26 pp.9-12 |
| COMP | 2006-10-17 10:25 |
Miyagi | Tohoku University | Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] | COMP2006-33 pp.17-23 |
| COMP | 2005-01-28 13:30 |
Aichi | Nagoya University | Partitioning Graphs of Supply and Demand Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Assume that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive integer, ... [more] | COMP2004-66 pp.47-56 |
[Return to Top Page]