IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2013)

Search Results: Keywords 'from:2013-04-24 to:2013-04-24'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2013-04-24
10:00		 Hyogo Kobe University Answering Reachability Queries by Extending Pruned BFSs to Paths
Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-1		 The graph reachability is a fundamental problem, both theoretically and practically. However, it is still a challenging ... [more] COMP2013-1
pp.1-8
COMP 2013-04-24
10:35		 Hyogo Kobe University Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data
Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-2		 A multi-track data is a multi-set of sequences.
The permuted pattern matching problem is, given a multi-track text and ... [more]		 COMP2013-2
pp.9-16
COMP 2013-04-24
11:10		 Hyogo Kobe University Analysis of the Maximum Sum of Exponents of Runs in Strings
Kazuhiko Kusano, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-3		 A run in a string is a periodic substring which can not be extendable neither to the left nor right with the same period... [more] COMP2013-3
pp.17-24
COMP 2013-04-24
13:30		 Hyogo Kobe University [Invited Talk] Introduction on JST ERATO Kawarabayashi Large Graph Project
Ken-ichi Kawarabayashi (NII) COMP2013-4		  [more] COMP2013-4
p.25
COMP 2013-04-24
14:45		 Hyogo Kobe University Space-efficient Polygon Reconstruction from Angle Information
Jinhee Chun, Ricardo Garcia, Takeshi Tokuyama (Tohoku Univ.) COMP2013-5		  [more] COMP2013-5
pp.27-31
COMP 2013-04-24
15:20		 Hyogo Kobe University Notes on Parametric Analysis of k-Route Flow
Hiroshi Imai, Jean-Francois Baffier, Hidefumi Hiraishi (Univ. of Tokyo) COMP2013-6		  [more] COMP2013-6
pp.33-34
COMP 2013-04-24
16:10		 Hyogo Kobe University An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph
Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.) COMP2013-7		 In this article, we show an algorithm for finding an orthogonal drawing of a hierarchical graph. In an orthogonal drawin... [more] COMP2013-7
pp.35-42
COMP 2013-04-24
16:45		 Hyogo Kobe University Computational complexity and an integer programming model of Shakashaka
Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2013-8		 The puzzle Shakashaka is popularized by Japanese publisher Nikoli, along with its more famous sibling Sudoku, and severa... [more] COMP2013-8
pp.43-48
 Results 1 - 8 of 8  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan