| 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 # | |
| PRMU, IBISML, IPSJ-CVIM (Joint) [detail] |
2012-09-02 10:30 |
Tokyo | Detecting Changes of Graph Partitioning Structures using Stochastic Decision Trees Shoichi Sato, Kenji Yamanishi (Univ. of Tokyo)  PRMU2012-31 IBISML2012-14 |
We are concerned with the issue of estimating graph partitioning structures from time series and tracking their changes... [more] |
PRMU2012-31 IBISML2012-14 pp.9-16 |
|
| IBISML | 2012-06-19 - 2012-06-20 |
Kyoto | Campus plaza Kyoto | Detecting changes of graph partitioning structures Shoichi Sato, Kenji Yamanishi (Univ. of Tokyo) |
We are concerned with the issue of estimating graph partitioning structures from time series and tracking their changes... [more] |
|
| COMP | 2011-12-16 11:15 |
Aichi | Nagoya Univ. | Reconfiguration of Vertex Covers in Trees and Cacti Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-39 |
We study the problem of reconfiguring a vertex cover of a graph $G$ into another vertex cover via vertex covers of $G$, ... [more] |
COMP2011-39 pp.25-32 |
| COMP | 2010-10-15 10:05 |
Miyagi | Tohoku Univ. | Constant-Work-Space Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-32 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] | COMP2010-32 pp.9-15 |
| 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 15:55 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings Takuro Fukunaga (Kyoto Univ.) COMP2010-8 |
Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hype... [more] | COMP2010-8 pp.55-62 |
| COMP | 2010-01-25 10:05 |
Fukuoka | Nishijin Plaza, Kyushu University | Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40 |
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] | COMP2009-40 pp.9-16 |
| CAS, NLP | 2009-09-24 10:05 |
Hiroshima | Hiroshima Univ. Higashi Senda Campus | Vertex-Deletion-based Enhancement of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2009-24 NLP2009-60 |
The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality among t... [more] | CAS2009-24 NLP2009-60 pp.1-6 |
| 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 | 2009-03-02 11:10 |
Tokyo | Tokyo Institute of Technology | Factorization of Generalized de Bruijn and Kautz Digraphs using Loop-Rooted Trees Takahiro Tsuno, Yukio Shibata (Gunma Univ.) COMP2008-57 |
In this research, we present several factorizations of generalized de Bruijn digraphs and generalized Kautz digraphs bas... [more] | COMP2008-57 pp.25-32 |
| COMP | 2008-12-03 09:30 |
Gunma | Gunma Univ. | A lower bound for tree-width of Cartesian product graphs Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2008-46 |
In this paper, we give a lower bound for tree-width of Cartesian product graphs. To be more precise, we show that ... [more] |
COMP2008-46 pp.1-5 |
| CAS, MSS | 2008-11-07 13:25 |
Osaka | Osaka University | Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-58 CST2008-36 |
The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality among ... [more] |
CAS2008-58 CST2008-36 pp.77-82 |
| COMP | 2008-10-10 14:30 |
Miyagi | Tohoku Univ. | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41 |
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] | COMP2008-41 pp.55-61 |
| COMP | 2007-05-25 14:30 |
Fukuoka | Kyushu University | Fixed-Parameter Tractability for Non-Crossing Spanning Trees Magnus Halldorsson (Univ. of Iceland), Christian Knauer (Freie U.), Andreas Spillner (U. East Anglia), Takeshi Tokuyama (Tohoku U) COMP2007-15 |
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-... [more] |
COMP2007-15 pp.25-30 |
| COMP | 2007-04-26 16:25 |
Kyoto | Katsura Campus, Kyoto University | Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |
| 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 | 2006-09-26 10:30 |
Ishikawa | JAIST | Bipancyclicity and edge-bipancyclicity of Cayley graphs generated by transpositions Yuuki Tanaka (Gunma Univ.), Yosuke Kikuchi (Tsuyama National College of Tech.), Toru Araki (Iwate Univ.), Yukio Shibata (Gunma Univ.) |
Cycle is the most fundamental graph class. For a given graph, it is interest to find cycles of various length as subgr... [more] |
COMP2006-25 pp.1-8 |
| COMP | 2006-03-22 16:00 |
Tokyo | The University of Electro-Communications | Canonical Tree Representation of Distance Hereditary Graphs with Applications Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
The class of distance hereditary graphs consists of the isometric graphs. That is, for each pair of vertices, its d... [more] |
COMP2005-61 pp.31-36 |
| COMP | 2005-12-22 16:25 |
Tokushima | The University of Tokushima | Max-Stretch Reduction for Tree Spanners Kazuo Iwama (Kyoto Univ.), Andrzej Lingas (Lund Univ.), Masaki Okita (Kyoto Univ.) |
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ whose max-stretch is $t$, i.e., the distance between ... [more] |
COMP2005-56 pp.49-55 |
| COMP | 2005-04-18 15:50 |
Hyogo | Kwansei Gakuin Univ. | Lowering Eccentricity of a Tree by Node-Upgrading Toshihide Ibaraki (Kwansei Gakuin Univ.), Xiao-Guang Yang (CAS) |
The eccentricity lowering is to reduce the eccentricity of a network by upgrading some nodes (i.e., shrinking the lengt... [more] | COMP2005-8 pp.57-65 |
[Return to Top Page]