Information and Systems-Theoretical Foundations of Computing(Date:2011/10/14)

Presentation
表紙

,  

[Date]2011/10/14
[Paper #]
目次

,  

[Date]2011/10/14
[Paper #]
Memory-Constrained Algorithms for Shortest Path Problem

Tetsuo ASANO,  Benjamin DOERR,  

[Date]2011/10/14
[Paper #]COMP2011-28
Fast Algorithm for Finding a Graph Node with High Closeness Centrality

Koji TABATA,  Atsuyoshi NAKAMURA,  Mineichi KUDO,  

[Date]2011/10/14
[Paper #]COMP2011-29
An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem

Hiroaki NAKANISHI,  Etsuji TOMITA,  Mitsuo WAKATSUKI,  Tetsuro NISHINO,  

[Date]2011/10/14
[Paper #]COMP2011-30
Personal View on Research in Computational Complexity Theory

Osamu WATANABE,  

[Date]2011/10/14
[Paper #]COMP2011-31
Complexity Theory for Operators in Analysis

Akitoshi KAWAMURA,  Stephen COOK,  

[Date]2011/10/14
[Paper #]COMP2011-32
Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings

Walter DIDIMO,  Michael KAUFMANN,  Giuseppe LIOTTA,  Yoshio OKAMOTO,  Andreas SPILLNER,  

[Date]2011/10/14
[Paper #]COMP2011-33
Memory Compression

Wing-Kin SUNG,  Kunihiko SADAKANE,  Jesper JANSSON,  

[Date]2011/10/14
[Paper #]COMP2011-34
Maximization of Gross Substitutes Utility Function under Budget Constraints

Akiyoshi SHIOURA,  

[Date]2011/10/14
[Paper #]COMP2011-35
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2011/10/14
[Paper #]
複写される方へ

,  

[Date]2011/10/14
[Paper #]
Notice for Photocopying

,  

[Date]2011/10/14
[Paper #]
奥付

,  

[Date]2011/10/14
[Paper #]
裏表紙

,  

[Date]2011/10/14
[Paper #]