Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [Japanese] / [English]
COMP2013-38
Reflections on a CFL decision problem "L(G)=Σ* ?"
Eiiichi Tanaka
pp. 1 - 6
COMP2013-39
Algorithms for Independent Set Reconfiguration Problem on Graphs
Erik D. Demaine, Martin L. Demaine (Massachusetts Inst. of Tech.), Takehiro Ito (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Ryuhei Uehara (JAIST)
pp. 7 - 14
COMP2013-40
On Enumerating All Maximal Cliques in Unit Disk Graphs
Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.)
pp. 15 - 20
COMP2013-41
Localization of eigenvector centrality on single-defect networks
Hiroki Yamaguchi (Tokyo Inst. of Tech.)
pp. 21 - 26
COMP2013-42
An empirical study for independent distance dominating sets in large-scale graphs
Hiroshi Kadowaki, Liang Zhao (Kyoto Univ.), Dorothea Wagner (Karlsruhe Inst. of Tech.)
pp. 27 - 31
COMP2013-43
On the Extension of the Serial Dictatorship with Project Closures
Naoyuki Kamiyama (Kyushu Univ.)
pp. 33 - 37
COMP2013-44
A Power Allocation Management System Using an Algorithm for the Knapsack Problem
Naoyuki Morimoto, Yuu Fujita, Masaaki Yoshida, Hiroyuki Yoshimizu, Masafumi Takiyamada, Terukazu Akehi, Masami Tanaka (Enegate)
pp. 39 - 43
COMP2013-45
The Hidden K-matrix Linear Complementarity Problem is at Least as Hard as Linear Programming over Cubes
Jan Foniok (Univ. of Warwick), Komei Fukuda (ETH Zurich), Lorenz Klaus (NII/JST)
pp. 45 - 52
COMP2013-46
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
Hiroki Morizumi (Shimane Univ.)
pp. 53 - 55
COMP2013-47
[Tutorial Lecture]
Introduction to Computational Complexity Theory (5): Approaches to P vs. NP via Circuits
Kazuhisa Seto (Seikei Univ.)
p. 57
COMP2013-48
An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon
Matsuo Konagaya, Tetsuo Asano (JAIST), Otfried Cheong (KAIST), Sang Won Bae (Kyonggi Univ.)
pp. 59 - 62
COMP2013-49
An Algorithm for Finding the Point Minimizing the Distance Error to Given Points
Shigeki Nakamura, Tetsuo Asano (JAIST), Siu-Wing Cheng (HKUST)
pp. 63 - 68
COMP2013-50
Adjustable Work Space Algorithm of Arrangement of Lines
Takahiro Seii, Tetsuo Asano (JAIST)
pp. 69 - 72
COMP2013-51
Sublinear-time cake-cutting algorithms
Takahiro Ueda (Kyoto Univ.), Hiro Ito (Univ. of Electro-Comm.)
pp. 73 - 79
COMP2013-52
Efficient Algorithms for Sorting $k$-Sets in Bins
Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.)
pp. 81 - 85
COMP2013-53
k-Edge-Rigid Body-Hinge Graphs
Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi (Kyoto Univ.), Adnan Sljoka (York Univ.)
pp. 87 - 91
COMP2013-54
k-Sink Location Problem in Dynamic Path Networks
Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.)
pp. 93 - 97
COMP2013-55
A New Automaton Construction using Prefixes and Suffixes of Regular Expressions
Hiroaki Yamamoto (Shinshu Univ.)
pp. 99 - 106
COMP2013-56
On alternation-bounded alternating context-free grammars and languages
Etsuro Moriya (Waseda Univ.)
pp. 107 - 114
COMP2013-57
On the minimum consistent DFA problem for prefix samples
Kaori Ueno (Tohokui Univ.), Shinichi Shimozono (Kyushu Inst. of Tech.), Kazuyuki Narisawa, Ayumi Shinohara (Tohokui Univ.)
pp. 115 - 122
COMP2013-58
Approximability of graph orientation problems with degree constraints
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Kyoto Univ.), Eiji Miyano (Kyushu Institute of Technology), Hirotaka Ono (Kyushu Univ.)
pp. 123 - 130
COMP2013-59
Label Size Maximization for Square Labels on Rotating Maps
Yusuke Yokosuka, Keiko Imai (Chuo Univ.)
pp. 131 - 135
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.