| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Takeshi Tokuyama (Tohoku Univ.) Vice Chair: Satoru Iwata (Kyoto Univ.) Secretary: Yoshio Okamoto (Tokyo Inst. of Tech.), Takashi Horiyama (Saitama Univ.) DATE: Mon, Jan 25, 2010 09:30 - 17:45 PLACE: Nishijin Plaza, Kyushu University(2-16-23, Nishijin, Sawara-ku, Fukuoka, 814-0002, Japan. http://www.kyushu-u.ac.jp/university/institution-use/nishijin/infomap.htm. Prof. Hirotaka Ono) TOPICS: ---------------------------------------- Mon, Jan 25 AM (09:30 - 17:45) ---------------------------------------- (1) 09:30 - 10:05 Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) (2) 10:05 - 10:40 Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) ----- Break ( 15 min. ) ----- (3) 10:55 - 11:30 Distance k-Sectors Exist Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) (4) 11:30 - 12:05 Zone Diagrams in Euclidean Spaces and in Other Normed Spaces Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ./ETH Zurich) ----- Lunch Break ( 90 min. ) ----- (5) 13:35 - 14:10 Enumerating Rooted and Triangulated Planar Graphs Bingbing Zhuang, Hiroshi Nagamochi (Kyoto Univ.) (6) 14:10 - 14:45 Web Structure Mining on Isolated Cliques and Isolated Stars Contracted Webgraph Fumiya Oguri (Osaka Prefecture Univ.), Tatsuya Kiyotani (ASCOT Corp.), Yushi Uno (Osaka Prefecture Univ.) ----- Break ( 15 min. ) ----- (7) 15:00 - 15:35 An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) (8) 15:35 - 16:10 Minimum and maximum against k lies Michael Hoffmann (ETH Zurich), Jiri Matousek (Charles U/ETH Zurich), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (ETH Zurich) (9) 16:10 - 16:45 Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) ----- Break ( 15 min. ) ----- (10) 17:00 - 17:45 [Fellow Memorial Lecture] Invited Talk as a New Fellow Masafumi Yamashita (Kyushu Univ) # Information for speakers General Talk will have 25 minutes for presentation and 10 minutes for discussion. Fellow Memorial Lecture will have 35 minutes for presentation and 10 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Fri, Mar 12, 2010: National Institute of Informatics [Thu, Jan 21] Thu, Apr 22, 2010: Ritusmeikan University, Biwako-Kusatsu Campus [Thu, Feb 18] # SECRETARY: Yoshio Okamoto Graduate School of Information Science and Engineering Tokyo Institute of Technology 2-12-1-W8-88, Ookayama, Meguro-ku, Tokyo Phone: +81-3-5734-3871 Email:     is    Last modified: 2009-11-18 15:25:35 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]