Hirotaka Ono
Hirotaka Ono
Nagoya University, Japan
Email verificata su i.nagoya-u.ac.jp
TitoloCitata daAnno
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
531999
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
522015
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
472013
Graph orientation algorithms to minimize the maximum outdegree
Y Asahiro, E Miyano, H Ono, K Zenmyo
Proceedings of the Twelfth Computing: The Australasian Theory Symposium …, 2006
472006
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
412010
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
36*2009
Reconfiguration of list L (2, 1)-labelings in a graph
T Ito, K Kawamura, H Ono, X Zhou
Theoretical Computer Science 544, 84-97, 2014
322014
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
312011
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
302015
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Y Asahiro, E Miyano, H Ono
Proceedings of the fourteenth symposium on Computing: the Australasian …, 2008
302008
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
282014
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
28*2009
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
262012
Pattern formation through optimum matching by oblivious CORDA robots
N Fujinaga, H Ono, S Kijima, M Yamashita
International Conference On Principles Of Distributed Systems, 1-15, 2010
262010
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
242014
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
232012
Integrating local search and network flow to solve the inventory routing problem
HC Lau, Q Liu, H Ono
AAAI/IAAI, 9-14, 2002
212002
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
162014
DNA sequence design by dynamic neighborhood searches
S Kawashimo, H Ono, K Sadakane, M Yamashita
International Workshop on DNA-Based Computers, 157-171, 2006
162006
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty
Y Asahiro, J Jansson, E Miyano, H Ono
Proceedings of the 18th Computing: The Australasian Theroy Symposium,, 2012
152012
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20