| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2010)
Search Results: Keywords 'from:2010-04-22 to:2010-04-22'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2010-04-22 10:00 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | A tight upper bound on the (2,1)-total labeling number of outerplanar graphs Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.)  COMP2010-1 |
A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to t... [more] |
COMP2010-1 pp.1-8 |
| COMP | 2010-04-22 10:35 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Counting the number of dominating sets in graph classes Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII) COMP2010-2 |
[more] | COMP2010-2 pp.9-15 |
| COMP | 2010-04-22 11:10 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Averaging Techniques for Competitive Auctions Takayuki Ichiba (Nomura Research Institute), Kazuo Iwama (Kyoto Univ.) COMP2010-3 |
[more] | COMP2010-3 pp.17-24 |
| COMP | 2010-04-22 13:15 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Complete classification of small realizable oriented matroids Hiroyuki Miyata, Sonoko Moriyama (Tokyo Univ.), Komei Fukuda (ETH Zurich) COMP2010-4 |
Enumerating combinatorial types of point configurations, hyperplane arrangements and convex polytopes are fundamental pr... [more] | COMP2010-4 pp.25-31 |
| COMP | 2010-04-22 13:50 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux Shinya Anzai, Jinhee Chun, Ryosei Kasai (Tohoku Univ.), Matias Korman (Univ. Libre de Bruxelles), Takeshi Tokuyama (Tohoku Univ.) COMP2010-5 |
We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n*n pixel plane where each ... [more] | COMP2010-5 pp.33-38 |
| COMP | 2010-04-22 14:35 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Transposition Invariant Fully Compressed Pattern Matching Algorithm Wataru Matsubara, Ayumi Shinohara (Tohoku Univ.) COMP2010-6 |
Transposition invariant pattern matching is the problem of matching given text and pattern to find the occurrence in the... [more] | COMP2010-6 pp.39-45 |
| COMP | 2010-04-22 15:10 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Elementary Formal System with Nonterminal Symbols Tomohiko Koide, Ayumi Shinohara (Tohoku Univ.) COMP2010-7 |
Elementary Formal Systems (EFS) are logic programs over strings, and they are useful to describe various language class... [more] |
COMP2010-7 pp.47-54 |
| COMP | 2010-04-22 15:55 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings Takuro Fukunaga (Kyoto Univ.) COMP2010-8 |
Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hype... [more] | COMP2010-8 pp.55-62 |
| COMP | 2010-04-22 16:30 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees Hiroshi Hirai (Kyoto Univ.) COMP2010-9 |
In this paper, we establish a novel duality relationship between node-capacitated multiflows and tree-shaped facility ... [more] |
COMP2010-9 pp.63-70 |
[Return to Top Page]