Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2009] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [Japanese] / [English]
COMP2012-12
Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems
Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.)
pp. 1 - 7
COMP2012-13
Rich Operations for Manipulating Sequence Binary Decision Diagrams
Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato (Hokkaido Univ.)
pp. 9 - 16
COMP2012-14
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ)
pp. 17 - 24
COMP2012-15
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII)
pp. 25 - 31
COMP2012-16
Recursive and non recursive formulas in finitism
Eiichi Tanaka (Kobe Univ.)
pp. 33 - 40
COMP2012-17
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
Kazuhisa Seto, Suguru Tamaki (Kyoto Univ.)
pp. 41 - 48
COMP2012-18
Candidate Boolean Functions towards Super-Quadratic Formula Size
Kenya Ueno (Kyoto Univ.)
pp. 49 - 55
COMP2012-19
Complexity results of distance-d independent set problems
Hiroshi Eto, Fengrui Guo, Eiji Miyano (Kyutech)
pp. 57 - 63
COMP2012-20
An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs
Cong Zhang, Hiroshi Nagamochi (Kyoto Univ.)
pp. 65 - 70
COMP2012-21
Efficient Atomic Block for Faster Elliptic Curve Scalar Multiplication
Chitchanok Chuengsatiansup (Univ. of Tokyo)
pp. 71 - 78
COMP2012-22
Optimal Average Joint Hamming Weight for Asymmetric Representation
Vorapong Suppakitpaisarn (Univ. of Tokyo), Masato Edahiro (Nagoya Univ.), Hiroshi Imai (Univ. of Tokyo)
pp. 79 - 86
COMP2012-23
A method for computing a sequence of circumscribing polygons
Kensuke Onishi (Tokai Univ.), Mamoru Hoshi (UEC)
pp. 87 - 93
COMP2012-24
Approximation for the Geometric Unique Coverage Problem on Unit Squares
Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.)
pp. 95 - 101
COMP2012-25
Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics --
Toshihiro Tanuma, Hiroshi Imai (Univ. of Tokyo)
pp. 103 - 109
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.