Obserwuj
Hirotaka Ono
Hirotaka Ono
Inne imiona/nazwiska小野　廣隆
Nagoya University, Japan
Zweryfikowany adres z i.nagoya-u.ac.jp
Tytuł
Cytowane przez
Cytowane przez
Rok
Pattern formation by oblivious asynchronous mobile robots
N Fujinaga, Y Yamauchi, H Ono, S Kijima, M Yamashita
SIAM Journal on Computing 44 (3), 740-785, 2015
1182015
Coalescing random walks and voting on connected graphs
C Cooper, R Elsasser, H Ono, T Radzik
SIAM Journal on Discrete Mathematics 27 (4), 1748-1758, 2013
882013
Linear-time algorithm for sliding tokens on trees
ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ...
Theoretical Computer Science 600, 132-142, 2015
682015
Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks
T Hanaka, S Kagawa, H Ono, K Kanemoto
Energy Economics 68, 44-52, 2017
662017
The complexity of dominating set reconfiguration
A Haddadan, T Ito, AE Mouawad, N Nishimura, H Ono, A Suzuki, ...
Theoretical Computer Science 651, 37-49, 2016
632016
Graph orientation algorithms to minimize the maximum outdegree
Y Asahiro, E Miyano, H Ono, K Zenmyo
International Journal of Foundations of Computer Science 18 (02), 197-215, 2007
632007
Data analysis by positive decision trees
K Makino, T Suda, H Ono, T Ibaraki
IEICE Transactions on Information and Systems 82 (1), 76-88, 1999
621999
The hitting and cover times of metropolis walks
Y Nonaka, H Ono, K Sadakane, M Yamashita
Theoretical Computer Science 411 (16-18), 1889-1894, 2010
612010
Depth-first search using bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
International Symposium on Algorithms and Computation, 553-564, 2014
562014
On the parameterized complexity for token jumping on graphs
T Ito, M Kamiński, H Ono, A Suzuki, R Uehara, K Yamanaka
International Conference on Theory and Applications of Models of Computation …, 2014
482014
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Y Asahiro, J Jansson, E Miyano, H Ono, K Zenmyo
Journal of combinatorial optimization 22 (1), 78-96, 2011
392011
A Linear Time Algorithm for L(2,1)-Labeling of Trees
T Hasunuma, T Ishii, H Ono, Y Uno
Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark …, 2009
39*2009
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Y Asahiro, E Miyano, H Ono
Discrete applied mathematics 159 (7), 498-508, 2011
382011
Pattern formation through optimum matching by oblivious CORDA robots
N Fujinaga, H Ono, S Kijima, M Yamashita
Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010
382010
Coalescing random walks and voting on graphs
C Cooper, R Elsässer, H Ono, T Radzik
Proceedings of the 2012 ACM symposium on Principles of Distributed Computing …, 2012
362012
Reconfiguration of cliques in a graph
T Ito, H Ono, Y Otachi
Theory and Applications of Models of Computation: 12th Annual Conference …, 2015
312015
Fixed-parameter tractability of token jumping on planar graphs
T Ito, M Kamiński, H Ono
International Symposium on Algorithms and Computation, 208-219, 2014
302014
A Linear Time Algorithm for L(2,1)-Labeling of Trees
T Hasunuma, T Ishii, H Ono, Y Uno
European Symposium on Algorithms ESA 2009: Algorithms - ESA 2009, 35-46, 2009
302009
On space complexity of self-stabilizing leader election in mediated population protocol
R Mizoguchi, H Ono, S Kijima, M Yamashita
Distributed Computing 25 (6), 451-460, 2012
292012
Integrating local search and network flow to solve the inventory routing problem
HC Lau, Q Liu, H Ono
AAAI/IAAI, 9-14, 2002
282002
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20