Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Ono, Hirotaka"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Depth-first search using
O(n)
bits
Tetsuo Asano
,
Taisuke Izumi
,
Masashi Kiyomi
,
Matsuo Konagaya
,
Hirotaka Ono
,
Yota Otachi
,
Pascal Schweitzer
,
Jun Tarui
,
Ryuhei Uehara
Lecture Notes in Computer Science
8889
, 2014, pp. 553-564
Polynomial-time algorithm for sliding tokens on trees
Erik D. Demaine
,
Martin L. Demaine
,
Eli Fox-Epstein
,
Duc A. Hoang
,
Takehiro Ito
,
Hirotaka Ono
,
Yota Otachi
,
Ryuhei Uehara
,
Takeshi Yamada
Lecture Notes in Computer Science
8889
, 2014, pp. 389-400
Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances''
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
562
, 2014, pp. 660-661
Fixed-parameter tractability of token jumping on planar graphs
Takehiro Ito
,
Marcin Kamiński
,
Hirotaka Ono
Lecture Notes in Computer Science
8889
, 2014, pp. 208-219
Reconfiguration of list
L(2,1)
-labelings in a graph
Takehiro Ito
,
Kazuto Kawamura
,
Hirotaka Ono
,
Xiao Zhou
Theoretical Computer Science
544
, 2014, pp. 84-97
Coalescing random walks and voting on connected graphs
Colin Cooper
,
Robert Elsässer
,
Hirotaka Ono
,
Tomasz Radzik
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1748-1758
A linear time algorithm for
L(2,1)
-labeling of trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Algorithmica
66
(3), 2013, pp. 654-681
Route-enabling graph orientation problems
Takehiro Ito
,
Yuichiro Miyamoto
,
Hirotaka Ono
,
Hisao Tamaki
,
Ryuhei Uehara
Algorithmica
65
(2), 2013, pp. 317-338
On the approximability and hardness of minimum topic connected overlay and its special instances
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
429
, 2012, pp. 144-154
Reconfiguration of list
L(2,1)
-labelings in a graph
Takehiro Ito
,
Kazuto Kawamura
,
Hirotaka Ono
,
Xiao Zhou
Lecture Notes in Computer Science
7676
, 2012, pp. 34-43
Finding longest common segments in protein structures in nearly linear time
Yen Kaow Ng
,
Hirotaka Ono
,
Ling Ge
,
Shuai Cheng Li
Lecture Notes in Computer Science
7354
, 2012, pp. 334-348
Graph orientation to maximize the minimum weighted outdegree
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 583-601
On the approximability of minimum topic connected overlay and its special instances
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Lecture Notes in Computer Science
6907
, 2011, pp. 376-387
Broadcastings and digit tilings on three-dimensional torus networks
Ryotaro Okazaki
,
Hirotaka Ono
,
Taizo Sadahiro
,
Masafumi Yamashita
Theoretical Computer Science
412
(4-5), 2011, pp. 307-319
Approximability of the path-distance-width for AT-free graphs
Yota Otachi
,
Toshiki Saitoh
,
Katsuhisa Yamanaka
,
Shuji Kijima
,
Yoshio Okamoto
,
Hirotaka Ono
,
Yushi Uno
,
Koichi Yamazaki
Lecture Notes in Computer Science
6986
, 2011, pp. 271-282
The space complexity of leader election in anonymous networks
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 427-440
The
(p, q)
-total labeling problem for trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Lecture Notes in Computer Science
6507
, 2010, pp. 49-60
Approximability and inapproximability of the minimum certificate dispersal problem
Tomoko Izumi
,
Taisuke Izumi
,
Hirotaka Ono
,
Koichi Wada
Theoretical Computer Science
411
(31-33), 2010, pp. 2773-2783
The hitting and cover times of Metropolis walks
Yoshiaki Nonaka
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
Theoretical Computer Science
411
(16-18), 2010, pp. 1889-1894
A linear time algorithm for
L(2,1)
-labeling of trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Lecture Notes in Computer Science
5757
, 2009, pp. 35-46
An
O(n^{1.75})
algorithm for
L(2,1)
-labeling of trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Theoretical Computer Science
410
(38-40), 2009, pp. 3702-3710
Route-enabling graph orientation problems
Takehiro Ito
,
Yuichiro Miyamoto
,
Hirotaka Ono
,
Hisao Tamaki
,
Ryuhei Uehara
Lecture Notes in Computer Science
5878
, 2009, pp. 403-412
Drawing borders efficiently
Kazuo Iwama
,
Eiji Myano
,
Hirotaka Ono
Theory of Computing Systems
44
(2), 2009, pp. 230-244
Relationship between approximability and request structures in the minimum certificate dispersal problem
Tomoko Izumi
,
Taisuke Izumi
,
Hirotaka Ono
,
Koichi Wada
Lecture Notes in Computer Science
5609
, 2009, pp. 56-65
The balanced edge cover problem
Yuta Harada
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
Lecture Notes in Computer Science
5369
, 2008, pp. 246-257
Seiten 1
2
3
4
5
>