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) [schedule] [select]
Chair Keio Imai (Chuo Univ.)
Vice Chair Hiroo Ito (Univ. of Electro-Comm.)
Secretary Akitoshi Kawamura (Univ. of Tokyo), Jinhee Jon (Tohoku Univ.)

Conference Date Fri, Dec 20, 2013 09:30 - 16:50
Sat, Dec 21, 2013 09:30 - 16:55
Conference Place  
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, Dec 20   Day 1
09:25 -
Fri, Dec 20 AM 
09:30 - 11:50
(1) 09:30-09:55 Reflections on a CFL decision problem "L(G)=Σ* ?" COMP2013-38 Eiiichi Tanaka
(2) 09:55-10:20 Algorithms for Independent Set Reconfiguration Problem on Graphs COMP2013-39 Erik D. Demaine, Martin L. Demaine (Massachusetts Inst. of Tech.), Takehiro Ito (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Ryuhei Uehara (JAIST)
(3) 10:20-10:45 On Enumerating All Maximal Cliques in Unit Disk Graphs COMP2013-40 Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.)
  10:45-11:00 Break ( 15 min. )
(4) 11:00-11:25 Localization of eigenvector centrality on single-defect networks COMP2013-41 Hiroki Yamaguchi (Tokyo Inst. of Tech.)
(5) 11:25-11:50 An empirical study for independent distance dominating sets in large-scale graphs COMP2013-42 Hiroshi Kadowaki, Liang Zhao (Kyoto Univ.), Dorothea Wagner (Karlsruhe Inst. of Tech.)
  11:50-13:20 Break ( 90 min. )
Fri, Dec 20 PM 
13:20 - 16:50
(6) 13:20-13:45 On the Extension of the Serial Dictatorship with Project Closures COMP2013-43 Naoyuki Kamiyama (Kyushu Univ.)
(7) 13:45-14:10 A Power Allocation Management System Using an Algorithm for the Knapsack Problem COMP2013-44 Naoyuki Morimoto, Yuu Fujita, Masaaki Yoshida, Hiroyuki Yoshimizu, Masafumi Takiyamada, Terukazu Akehi, Masami Tanaka (Enegate)
  14:10-14:25 Break ( 15 min. )
(8) 14:25-14:50 The Hidden K-matrix Linear Complementarity Problem is at Least as Hard as Linear Programming over Cubes COMP2013-45 Jan Foniok (Univ. of Warwick), Komei Fukuda (ETH Zurich), Lorenz Klaus (NII/JST)
(9) 14:50-15:15 Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions COMP2013-46 Hiroki Morizumi (Shimane Univ.)
  15:15-15:30 Break ( 15 min. )
(10) 15:30-16:50 [Tutorial Lecture]
Introduction to Computational Complexity Theory (5): Approaches to P vs. NP via Circuits COMP2013-47
Kazuhisa Seto (Seikei Univ.)
Sat, Dec 21   Day 2
09:25 - 16:50
Sat, Dec 21 AM 
09:30 - 11:50
(11) 09:30-09:55 An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon COMP2013-48 Matsuo Konagaya, Tetsuo Asano (JAIST), Otfried Cheong (KAIST), Sang Won Bae (Kyonggi Univ.)
(12) 09:55-10:20 An Algorithm for Finding the Point Minimizing the Distance Error to Given Points COMP2013-49 Shigeki Nakamura, Tetsuo Asano (JAIST), Siu-Wing Cheng (HKUST)
(13) 10:20-10:40 Adjustable Work Space Algorithm of Arrangement of Lines COMP2013-50 Takahiro Seii, Tetsuo Asano (JAIST)
  10:40-11:00 Break ( 20 min. )
(14) 11:00-11:25 Sublinear-time cake-cutting algorithms COMP2013-51 Takahiro Ueda (Kyoto Univ.), Hiro Ito (Univ. of Electro-Comm.)
(15) 11:25-11:50 Efficient Algorithms for Sorting $k$-Sets in Bins COMP2013-52 Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.)
  11:50-13:20 Break ( 90 min. )
Sat, Dec 21 PM 
13:20 - 16:55
(16) 13:20-13:45 k-Edge-Rigid Body-Hinge Graphs COMP2013-53 Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi (Kyoto Univ.), Adnan Sljoka (York Univ.)
(17) 13:45-14:10 k-Sink Location Problem in Dynamic Path Networks COMP2013-54 Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.)
  14:10-14:30 Break ( 20 min. )
(18) 14:30-14:55 A New Automaton Construction using Prefixes and Suffixes of Regular Expressions COMP2013-55 Hiroaki Yamamoto (Shinshu Univ.)
(19) 14:55-15:20 On alternation-bounded alternating context-free grammars and languages COMP2013-56 Etsuro Moriya (Waseda Univ.)
(20) 15:20-15:45 On the minimum consistent DFA problem for prefix samples COMP2013-57 Kaori Ueno (Tohokui Univ.), Shinichi Shimozono (Kyushu Inst. of Tech.), Kazuyuki Narisawa, Ayumi Shinohara (Tohokui Univ.)
  15:45-16:05 Break ( 20 min. )
(21) 16:05-16:30 Approximability of graph orientation problems with degree constraints COMP2013-58 Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Kyoto Univ.), Eiji Miyano (Kyushu Institute of Technology), Hirotaka Ono (Kyushu Univ.)
(22) 16:30-16:55 Label Size Maximization for Square Labels on Rotating Maps COMP2013-59 Yusuke Yokosuka, Keiko Imai (Chuo Univ.)

Announcement for Speakers
General TalkEach speech will have 20 minutes for presentation and 5 minutes for discussion.
General Talk (ショート)Each speech will have 15 minutes for presentation and 5 minutes for discussion.

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Akitoshi Kawamura
Department of Computer Science,
University of Tokyo,
7-3-1 Hongo, Bunkyo-ku,
Tokyo, Japan 113-8656
E--mail: issu- 

Last modified: 2013-10-10 08:54:24

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]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan