Research Output per year

## Research Output 2004 2019

2019

### Towards solving neural networks with optimization trajectory search

Parsenadze, L. T., Vargas, D. V. & Fujita, T., Jul 13 2019,*GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion.*Association for Computing Machinery, Inc, p. 75-76 2 p. (GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Trajectory Optimization

Trajectories

Subspace

Neural Networks

Trajectory

2017

3
Citations
(Scopus)

### Approximation algorithm for the distance-3 independent set problem on cubic graphs

Eto, H., Ito, T., Liu, Z. & Miyano, E., Jan 1 2017,*WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings.*Rahman, M. S., Yen, H-C. & Poon, S-H. (eds.). Springer Verlag, p. 228-240 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cubic Graph

Approximation algorithms

Independent Set

Approximation Algorithms

Computational complexity

2016

5
Citations
(Scopus)

### Approximability of the distance independent set problem on regular graphs and planar graphs

Eto, H., Ito, T., Liu, Z. & Miyano, E., Jan 1 2016,*Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings.*Li, M., Wang, L. & Chan, T-H. H. (eds.). Springer Verlag, p. 270-284 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10043 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Approximability

Approximation algorithms

Independent Set

Regular Graph

Planar graph

2014

### Firm size distribution in oblivious equilibrium model with quality ladder

Murao, T., Jan 1 2014,*Distributed Computing and Artificial Intelligence, 11th International Conference, DCAI 2014.*Springer Verlag, p. 99-106 8 p. (Advances in Intelligent Systems and Computing; vol. 290).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ladders

Depreciation

Operations research

Costs

Economics

2011

2
Citations
(Scopus)

### How slow, or fast, are standard random walks? - Analysis of hitting and cover times on trees

Nonaka, Y., Ono, H., Kijima, S. & Yamashita, M., Dec 1 2011,*Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011.*p. 63-68 6 p. (Conferences in Research and Practice in Information Technology Series; vol. 119).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Internet

2009

1
Citation
(Scopus)

### How to design a linear cover time random walk on a finite graph

Nonaka, Y., Ono, H., Sadakane, K. & Yamashita, M., Dec 1 2009,*Stochastic Algorithms: Foundations and Applications - 5th International Symposium, SAGA 2009, Proceedings.*p. 104-116 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5792 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cover Time

Finite Graph

Linear Time

Random walk

Hitting Time

2006

### Development trajectory of energy consumption and carbon emissions in developing countries

Dela Cruz Generosa, A. & Fujita, T., Jan 1 2006,*Air Pollution XIV.*WITPress, Vol. 86. p. 667-675 9 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

carbon emission

developing world

trajectory

energy efficiency

economic activity