Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |

COMP |
2006-04-26 09:20 |
Kyoto |
Kyoto University |
Optimality of Balanced Semi-Matchings Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
We consider the problem of finding a semi-matching for a bipartite graph $G = (U \cup V,E)$. A semi-matching is defined ... [more] |
COMP2006-1 pp.1-8 |

COMP |
2006-04-26 09:55 |
Kyoto |
Kyoto University |
Reducing L versus P to Reversal versus Access Kenya Ueno (Univ. of Tokyo) |
Reversal complexity has been studied as a fundamental computational resource along with time and space. In this study, w... [more] |
COMP2006-2 pp.9-16 |

COMP |
2006-04-26 10:50 |
Kyoto |
Kyoto University |
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths Shin-ichi Tanigawa, Naoki Katoh (Kyoto Univ.) |
For a given $x$-monotone polygonal curve each of whose edge lengths is between $\underline{l}$ and $2\underline{l}$,
we... [more] |
COMP2006-3 pp.17-24 |

COMP |
2006-04-26 11:25 |
Kyoto |
Kyoto University |
Efficient Broadcasting and Gathering Algorithms on Dynamic Sensor Networks Naoki Inaba, Jiro Uchida, Yoshiaki Katayama (Nagoya Inst. of Tech.), Wei Chen (Tennessee State Univ.), Koichi Wada (Nagoya Inst. of Tech.) |
In [11], we have proposed a novel clustering on a flat sensor $n$-node-network $G$ and provides fast communication betw... [more] |
COMP2006-4 pp.25-32 |

COMP |
2006-04-26 13:40 |
Kyoto |
Kyoto University |
Searching Scale-Free Networks with Local Information Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
We consider the problem of exploring networks as few steps as possible using small amount of memory. There exist many wo... [more] |
COMP2006-5 pp.33-39 |

COMP |
2006-04-26 14:15 |
Kyoto |
Kyoto University |
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa (Kyoto Univ.) |
In this paper, we consider the quickest flow problem in a network which
consists of a directed graph with capacities a... [more] |
COMP2006-6 pp.41-48 |

COMP |
2006-04-26 14:50 |
Kyoto |
Kyoto University |
An Efficient Alignability Decision Algorithm for Unordered Trees Tetsuji Kuboyama, Kilho Shin (Univ. of Tokyo) |
[more] |
COMP2006-7 pp.49-56 |

COMP |
2006-04-26 15:45 |
Kyoto |
Kyoto University |
A simple algorithm for testing isomorphism of chordal graphs Seinosuke Toda (Nihon Univ.) |
(To be available after the conference date) [more] |
COMP2006-8 pp.57-62 |

COMP |
2006-04-26 16:20 |
Kyoto |
Kyoto University |
An exact algorithm for the label placement problem Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given sites on a map and their labels with specified size, the label placement problem is to find an appropriate placeme... [more] |
COMP2006-9 pp.63-67 |