| 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 | 2024-03-14 16:30 |
Tokyo | The University of Electro-Communications | A consideration on the spannig polytope volume using the recurrence representation and its computation Ei Ando (Senshu Univ.)  COMP2023-35 |
In this paper, we consider the volume of the spanning tree polytope and we can compute its volume exactly in polynomi... [more] |
COMP2023-35 pp.42-49 |
| COMP, IPSJ-AL | 2023-05-11 15:25 |
Hokkaido | Hokkaido University | Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6 |
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] | COMP2023-6 pp.29-35 |
| COMP | 2020-12-04 15:20 |
Online | Online | Fixed Parameter Algorithms for L(p,1)-labeling Kazuma Kawai (Nagoya Univ), Tesshu Hanaka (Chuo Univ), Hirotaka Ono (Nagoya Univ) COMP2020-24 |
Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative inte... [more] | COMP2020-24 pp.30-32 |
| COMP | 2020-03-01 14:00 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
Metric Dimension on Some Classes of Chordal Graphs Ryoga Katoh, Remy Belmonte (UEC) COMP2019-49 |
The METRIC DIMENSION problem asks, given a graph $G$ and integer $k$, whether there exists a set $S$ of vertices of size... [more] | COMP2019-49 pp.25-28 |
| COMP, IPSJ-AL | 2019-05-11 15:50 |
Kumamoto | Kumamoto University | COMP2019-8 |
The {em dimension} of a partially ordered set (poset) is known to be one of the fundamental complexity measures of poset... [more] | COMP2019-8 pp.91-95 |
| COMP | 2017-03-07 11:30 |
Aichi | Nanzan University | Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.) COMP2016-52 |
We consider an extension of the Vertex Cover (VC) problem. For a given graph, its (edge) vertex cover (in short, VC) i... [more] |
COMP2016-52 pp.11-18 |
| COMP | 2015-04-23 13:40 |
Miyagi | Approximability of width parameters Koichi Yamazaki (Gunma Univ.) COMP2015-2 |
Wu et al. showed that for several graph width parameters including treewidth, pathwidth, and cutwidth, there is no polyn... [more] | COMP2015-2 pp.9-13 |
|
| 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 |
|
[Return to Top Page]