| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2012)
Search Results: Keywords 'from:2012-12-10 to:2012-12-10'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-12-10 09:30 |
Fukuoka | Kyushu University | Analysis of Alternative Rumor Spreading on Scale-Free Networks
-- For Simple Two Type Degree Networks -- Hiroki Yamaguchi, Osamu Watanabe (Tokyo Tech)  COMP2012-43 |
In order to analyze the effect of very rapid rumor spreading on a large scale network, we propose in this paper to in... [more] |
COMP2012-43 pp.1-5 |
| COMP | 2012-12-10 10:05 |
Fukuoka | Kyushu University | Constructing Position Heaps for Various Pattern Matching Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2012-44 |
[more] | COMP2012-44 pp.7-14 |
| COMP | 2012-12-10 10:55 |
Fukuoka | Kyushu University | Iterative rounding approximation algorithms for degree-bounded node-connectivity network design Takuro Fukunaga (Kyoto Univ.) COMP2012-45 |
We consider the problem of finding a minimum edge cost subgraph of an undirected or a directed graph satisfying given co... [more] | COMP2012-45 pp.15-22 |
| COMP | 2012-12-10 11:30 |
Fukuoka | Kyushu University | Hamiltonicity of 4-connected projective-planar graphs Ken-ichi Kawarabayashi, Kenta Ozeki (NII) COMP2012-46 |
A graph $G$ is called \emph{hamiltonian-connected} if for any two vertices $u$ and $v$, there is a hamiltonian path betw... [more] | COMP2012-46 p.23 |
| COMP | 2012-12-10 13:30 |
Fukuoka | Kyushu University | [Tutorial Lecture]
Introduction to Computational Complexity Theory (1): Basics and Average-Case Computational Complexity Osamu Watanabe (Tokyo Tech) COMP2012-47 |
As the first lecture of the lecture series on computational complexity, I would like to explain key basic concepts in ... [more] |
COMP2012-47 p.25 |
| COMP | 2012-12-10 15:15 |
Fukuoka | Kyushu University | A Lower Bound of Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks Youhei Kouchi, Akira Matsubayashi (Kanazawa Univ.) COMP2012-48 |
The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to con... [more] | COMP2012-48 pp.27-31 |
| COMP | 2012-12-10 15:50 |
Fukuoka | Kyushu University | Reconfiguration of List L(2,1)-Labelings in a Graph Takehiro Ito, Kazuto Kawamura (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Xiao Zhou (Tohoku Univ.) COMP2012-49 |
For an integer $k \ge 0$, suppose that each vertex $v$ of a graph $G$ has a set $C(v) \subseteq \{0,1, \ldots, k\}$ of l... [more] | COMP2012-49 pp.33-40 |
| COMP | 2012-12-10 16:40 |
Fukuoka | Kyushu University | Enumeration of PLCP-orientations on the 4-cube Komei Fukuda, Lorenz Klaus (ETH Zurich), Hiroyuki Miyata (Tohoku Univ.) COMP2012-50 |
The linear complementarity problem (LCP) is an important problem, which provides unified approaches to many problems suc... [more] | COMP2012-50 pp.41-48 |
| COMP | 2012-12-10 17:15 |
Fukuoka | Kyushu University | Comparison of Worst-case Polytopes for the Simplex Method
-- Klee-Minty Cubes Are Also Goldfarb Cubes -- Bernd G aertner, Christian Helbling (ETH Zurich), Yoshiki Ota, Takeru Takahashi (Tohoku Univ.) COMP2012-51 |
The $d$-dimensional Goldfarb cube is a polytope with the property that all its $2^d$ vertices appear on some shadow of i... [more] | COMP2012-51 pp.49-53 |
[Return to Top Page]