|
|
| Chair |
|
Keio Imai (Chuo Univ.) |
| Vice Chair |
|
Hiroo Ito (Univ. of Electro-Comm.) |
| Secretary |
|
Jinhee Jon (Tohoku Univ.), Akitoshi Kawamura (Univ. of Tokyo) |
|
| Conference Date |
Mon, Dec 10, 2012 09:30 - 17:50 |
| Topics |
|
| Conference Place |
|
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Mon, Dec 10 AM
09:30 - 10:40 |
| (1) |
09:30-10:05 |
Analysis of Alternative Rumor Spreading on Scale-Free Networks
-- For Simple Two Type Degree Networks --  COMP2012-43 |
Hiroki Yamaguchi, Osamu Watanabe (Tokyo Tech) |
| (2) |
10:05-10:40 |
Constructing Position Heaps for Various Pattern Matching COMP2012-44 |
Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) |
| |
10:40-10:55 |
Break ( 15 min. ) |
Mon, Dec 10 AM
10:55 - 12:05 |
| (3) |
10:55-11:30 |
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design COMP2012-45 |
Takuro Fukunaga (Kyoto Univ.) |
| (4) |
11:30-12:05 |
Hamiltonicity of 4-connected projective-planar graphs COMP2012-46 |
Ken-ichi Kawarabayashi, Kenta Ozeki (NII) |
| |
12:05-13:30 |
Lunch Break ( 85 min. ) |
Mon, Dec 10 PM
13:30 - 15:00 |
| (5) |
13:30-15:00 |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (1): Basics and Average-Case Computational Complexity COMP2012-47 |
Osamu Watanabe (Tokyo Tech) |
| |
15:00-15:15 |
Break ( 15 min. ) |
Mon, Dec 10 PM
15:15 - 17:50 |
| (6) |
15:15-15:50 |
A Lower Bound of Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks COMP2012-48 |
Youhei Kouchi, Akira Matsubayashi (Kanazawa Univ.) |
| (7) |
15:50-16:25 |
Reconfiguration of List L(2,1)-Labelings in a Graph COMP2012-49 |
Takehiro Ito, Kazuto Kawamura (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Xiao Zhou (Tohoku Univ.) |
| |
16:25-16:40 |
Break ( 15 min. ) |
| (8) |
16:40-17:15 |
Enumeration of PLCP-orientations on the 4-cube COMP2012-50 |
Komei Fukuda, Lorenz Klaus (ETH Zurich), Hiroyuki Miyata (Tohoku Univ.) |
| (9) |
17:15-17:50 |
Comparison of Worst-case Polytopes for the Simplex Method
-- Klee-Minty Cubes Are Also Goldfarb Cubes -- COMP2012-51 |
Bernd G aertner, Christian Helbling (ETH Zurich), Yoshiki Ota, Takeru Takahashi (Tohoku Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Tutorial Lecture | Each speech will have 80 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Jinhee Chun
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-3-09, Aoba-ku Sendai
980-8579, Japan
Email:  n e  is is    |
Last modified: 2012-10-19 14:39:59
|