IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2011-10-21 / Issue Date : 2011-10-14

COMP2011-28
Memory-Constrained Algorithms for Shortest Path Problem
Tetsuo Asano (JAIST), Benjamin Doerr (MPI)
pp. 1 - 5

COMP2011-29
Fast Algorithm for Finding a Graph Node with High Closeness Centrality
Koji Tabata, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.)
pp. 7 - 14

COMP2011-30
An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
pp. 15 - 22

COMP2011-31
[Fellow Memorial Lecture] Personal View on Research in Computational Complexity Theory
Osamu Watanabe (Tokyo Tech)
p. 23

COMP2011-32
Complexity Theory for Operators in Analysis
Akitoshi Kawamura (Univ. of Tokyo), Stephen Cook (Univ. of Toronto)
pp. 25 - 32

COMP2011-33
Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings
Walter Didimo (Univ. of Perugia), Michael Kaufmann (Univ. of Tuebingen), Giuseppe Liotta (Univ. of Perugia), Yoshio Okamoto (JAIST), Andreas Spillner (Univ. of Greifswald)
pp. 33 - 38

COMP2011-34
Memory Compression
Wing-Kin Sung (NUS), Kunihiko Sadakane (NII), Jesper Jansson (Ochanomizu U.)
pp. 39 - 46

COMP2011-35
Maximization of Gross Substitutes Utility Function under Budget Constraints
Akiyoshi Shioura (Tohoku Univ.)
pp. 47 - 54

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

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