Faculty Profiles - ONO Hirotaka

Papers - ONO Hirotaka

Division display 101 - 120 of about 236 ／ All the affair displays >>

(Total) Vector Domination for Graphs with Bounded Branchwidth Reviewed

Ishii Toshimasa, Ono Hirotaka, Uno Yushi

LATIN 2014: THEORETICAL INFORMATICS Vol. 8392 page： 238-249 2014

Fixed-Parameter Tractability of Token Jumping on Planar Graphs Reviewed

Ito Takehiro, Kaminski Marcin, Ono Hirotaka

ALGORITHMS AND COMPUTATION, ISAAC 2014 Vol. 8889 page： 208-219 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees Reviewed

Demaine Erik D., Demaine Martin L., Fox-Epstein Eli, Hoang Duc A., Ito Takehiro, Ono Hirotaka, Otachi Yota, Uehara Ryuhei, Yamada Takeshi

ALGORITHMS AND COMPUTATION, ISAAC 2014 Vol. 8889 page： 389-400 2014

Approximability of Latin Square Completion-Type Puzzles Reviewed

Haraguchi Kazuya, Ono Hirotaka

FUN WITH ALGORITHMS Vol. 8496 page： 218-229 2014

On the Parameterized Complexity for Token Jumping on Graphs Reviewed

Ito Takehiro, Kaminski Marcin, Ono Hirotaka, Suzuki Akira, Uehara Ryuhei, Yamanaka Katsuhisa

THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014) Vol. 8402 page： 341-351 2014

Approximability of graph orientation problems with degree constraints

ASAHIRO Yuichi, JANSSON Jesper, MIYANO Eiji, ONO Hirotaka

IEICE technical report. Theoretical foundations of Computing Vol. 113 ( 371 ) page： 123-130 2013.12

Language：Japanese Publishing type：Research paper (scientific journal)

A degree-constrained graph orientation of an undirected graph is an assignment of a direction to each edge in the graph such that the outdegree of every vertex in the resulting directed graph satisfies a prescribed lower and/or upper bound. Such graph orientations have been studied in many literatures and various characterizations are known. We consider two related optimization problems introduced in [3]: For any fixed non-negative integer W, the problem MAX W-LIGHT (or MIN W-HEAVY) takes as input an undirected graph G and ask for an orientation of G that maximizes (or minimizes) the number of vertices with outdegree at most W (or at least W). The problems' computational complexities vary with W. In this paper we show several results related to their polynomial-time approximability.

グラフの独立点集合遷移問題に対するアルゴリズム

Demaine Erik D., Demaine Martin L., 伊藤健洋, 小野廣隆, 上原隆平

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 Vol. 113 ( 371 ) page： 7-14 2013.12

Language：English Publishing type：Research paper (scientific journal)

グラフGに対し,|I_b|=|I_r|であるような2つの独立点集合I_bとI_rが与えられたとする.また,Gにおいて,I_bに含まれる各点にはトークンが置かれているとする.スライディングトークン問題とは,I_bからI_rへのGの独立点集合の系列が存在するか判定する問題である.ただし,系列に含まれる各独立点集合は,その1つ前の独立点集合から,ただ1つのトークンをGの辺に沿ってスライドさせることで得られなければならない.この問題は,理想グラフに対してPSPACE完全であることが知られている.本論文では,理想グラフのいくつかの部分クラスに対して,この問題がO(n)時間で解けることを示す.ここで,nはグラフの点数である.また,これらのグラフに対しては,実際にI_bからI_rへ遷移させる最短の系列を多項式時間で見つけることができる.

Optimal approximability of bookmark assignments Reviewed

Asahiro Yuichi, Miyano Eiji, Murata Toshihide, Ono Hirotaka

DISCRETE APPLIED MATHEMATICS Vol. 161 ( 16-17 ) page： 2361-2366 2013.11

A Linear Time Algorithm for L(2,1)-Labeling of Trees Reviewed

Hasunuma Toru, Ishii Toshimasa, Ono Hirotaka, Uno Yushi

ALGORITHMICA Vol. 66 ( 3 ) page： 654-681 2013.7

BLOCKSUM is NP-Complete Reviewed

Haraguchi Kazuya, Ono Hirotaka

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS Vol. E96D ( 3 ) page： 481-488 2013.3

Route-Enabling Graph Orientation Problems Reviewed

Ito Takehiro, Miyamoto Yuichiro, Ono Hirotaka, Tamaki Hisao, Uehara Ryuhei

ALGORITHMICA Vol. 65 ( 2 ) page： 317-338 2013.2

太陽熱と非常時対応可能なコージェネレーションによる熱利用システムの導入事例 : 尼崎D.C.グランスクエア (特集集合住宅の省エネルギー) -- (集合住宅における省エネへの取組み)

府川一郎, 中條広隆, 小野建

IBEC Vol. 33 ( 5 ) page： 40-43 2013.1

Measuring Sensitivity of Evolutionary Algorithms to Errors in Asset Means for Mean-Variance Portfolio Optimization.

Rifki Omar

Record of Joint Conference of Electrical and Electronics Engineers in Kyushu Vol. 2013 ( 0 ) page： 181-182 2013

COALESCING RANDOM WALKS AND VOTING ON CONNECTED GRAPHS Reviewed

Cooper Colin, Elsaesser Robert, Ono Hirotaka, Radzik Tomasz

SIAM JOURNAL ON DISCRETE MATHEMATICS Vol. 27 ( 4 ) page： 1748-1758 2013

On space complexity of self-stabilizing leader election in mediated population protocol Reviewed

Mizoguchi Ryu, Ono Hirotaka, Kijima Shuji, Yamashita Masafumi

DISTRIBUTED COMPUTING Vol. 25 ( 6 ) page： 451-460 2012.12

RA-002 Detecting Network Security Incidents Based on String Compression

Eto Kouki, Ono Hirotaka, Yamashita Masafumi, Takeuchi Jun'ichi

Vol. 11 ( 1 ) page： 9-16 2012.9

Deductive Inference for the Interiors and Exteriors of Horn Theories Reviewed

Makino Kazuhisa, Ono Hirotaka

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC Vol. 13 ( 3 ) 2012.8

ランダムグラフ上の多種ランダムウォークの全訪問時間 (アルゴリズムと計算理論の新展開)

穂坂祐輔, 山内由紀子, 来嶋秀治, 小野廣隆, 山下雅史

数理解析研究所講究録 Vol. 1799 page： 130-136 2012.6

On the base-line location problem for the maximum weight region decomposable into base-monotone shapes (アルゴリズムと計算理論の新展開 : RIMS研究集会報告集)

堀山貴史, 伊藤健洋, 小野廣隆, 大舘陽太, 上原隆平, 宇野毅明

数理解析研究所講究録 Vol. 1799 page： 123-129 2012.6

The (p, q)-total labeling problem for trees Reviewed

Hasunuma Toru, Ishii Toshimasa, Ono Hirotaka, Uno Yushi

DISCRETE MATHEMATICS Vol. 312 ( 8 ) page： 1407-1420 2012.4

　 PREV - NEXT 　

<ONO Hirotaka>

Papers - ONO Hirotaka