|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.) |
|
| Conference Date |
Fri, Oct 21, 2011 10:00 - 17:00 |
| Topics |
|
| Conference Place |
401 Seminar Room, Aoba Memorial Hall, Aobayama Campus, Tohoku University |
| Address |
Aramaki aza Aoba, Aoba-ku, Sendai, 980-8579, Japan |
| Transportation Guide |
Directions to Aobayama Campus ( http://www.eng.tohoku.ac.jp/english/map/?menu=direction_aobayama ), Directions to Aoba Memorial Hall ( http://www.eng.tohoku.ac.jp/english/map/?menu=campus&area=c&build=03 ) |
Contact
Person |
Prof. Akiyoshi Shioura (Tohoku Univ.) |
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) |
Fri, Oct 21
10:00 - 17:00 |
| (1) |
10:00-10:35 |
Memory-Constrained Algorithms for Shortest Path Problem  COMP2011-28 |
Tetsuo Asano (JAIST), Benjamin Doerr (MPI) |
| (2) |
10:35-11:10 |
Fast Algorithm for Finding a Graph Node with High Closeness Centrality COMP2011-29 |
Koji Tabata, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) |
| (3) |
11:10-11:45 |
An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem COMP2011-30 |
Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) |
| |
11:45-13:10 |
Lunch ( 85 min. ) |
| (4) |
13:10-14:10 |
[Fellow Memorial Lecture]
Personal View on Research in Computational Complexity Theory COMP2011-31 |
Osamu Watanabe (Tokyo Tech) |
| |
14:10-14:25 |
Break ( 15 min. ) |
| (5) |
14:25-15:00 |
Complexity Theory for Operators in Analysis COMP2011-32 |
Akitoshi Kawamura (Univ. of Tokyo), Stephen Cook (Univ. of Toronto) |
| (6) |
15:00-15:35 |
Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings COMP2011-33 |
Walter Didimo (Univ. of Perugia), Michael Kaufmann (Univ. of Tuebingen), Giuseppe Liotta (Univ. of Perugia), Yoshio Okamoto (JAIST), Andreas Spillner (Univ. of Greifswald) |
| |
15:35-15:50 |
Break ( 15 min. ) |
| (7) |
15:50-16:25 |
Memory Compression COMP2011-34 |
Wing-Kin Sung (NUS), Kunihiko Sadakane (NII), Jesper Jansson (Ochanomizu U.) |
| (8) |
16:25-17:00 |
Maximization of Gross Substitutes Utility Function under Budget Constraints COMP2011-35 |
Akiyoshi Shioura (Tohoku Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 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 |
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email:      ecei     |
Last modified: 2011-08-22 18:08:18
|