|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2014)
|
|
Search Results: Keywords 'from:2014-04-24 to:2014-04-24'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2014-04-24 10:20 |
Miyagi |
Tohoku University |
Thin strip graphs Yota Otachi (JAIST), Akitoshi Kawamura (Univ. of Tokyo), Hidehiro Shinohara (Tohoku Univ.), Takashi Hayashi, Koichi Yamazaki (Gunma Univ.) COMP2014-1 |
A unit disk graph is a emph{$c$-strip graph} if it has a unit disk representation in which all centers of the unit disks... [more] |
COMP2014-1 pp.1-4 |
COMP |
2014-04-24 10:55 |
Miyagi |
Tohoku University |
Swapping Labeled Tokens on Graphs Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2 |
[more] |
COMP2014-2 pp.5-12 |
COMP |
2014-04-24 13:10 |
Miyagi |
Tohoku University |
A Memory-efficient Self-stabilizing Algorithm for Constructing Chordal Rings Rumi Ito, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2014-3 |
[more] |
COMP2014-3 pp.13-20 |
COMP |
2014-04-24 13:45 |
Miyagi |
Tohoku University |
A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits. Kazuyuki Amano, Atsushi Saito (Gunma Univ.) COMP2014-4 |
[more] |
COMP2014-4 pp.21-28 |
COMP |
2014-04-24 14:20 |
Miyagi |
Tohoku University |
Reconfiguration of Dominating Sets Akira Suzuki (Tohoku Univ.), Amer Mouawad, Naomi Nishimura (Univ. of Waterloo) COMP2014-5 |
We explore a reconfiguration version of the dominating set problem,
where a dominating set in a graph $G$ is a set $S... [more] |
COMP2014-5 pp.29-35 |
COMP |
2014-04-24 15:15 |
Miyagi |
Tohoku University |
Improved Bounds for Online $k$-Frame Throughput Maximization in Network Switches Koji Kobayashi (NII), Jun Kawahara (NAIST), Shuichi Miyazaki (Kyoto Univ.) COMP2014-6 |
We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maxim... [more] |
COMP2014-6 pp.37-44 |
COMP |
2014-04-24 15:50 |
Miyagi |
Tohoku University |
Time Complexity Analysis of Iterative Auctions with Multiple Differentiated Items Kazuo Murota (Univ. of Tokyo), Akiyoshi Shioura (Tohoku Univ.), Zaifu Yang (Univ. of York) COMP2014-7 |
[more] |
COMP2014-7 pp.45-51 |
|
|
|
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]
|