Research Output 1979 2019

Filter
Conference contribution
2019

Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

Huang, C. C. & Kakimura, N., 2019 Jan 1, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Salavatipour, M. R. & Sack, J-R. (eds.). Springer Verlag, p. 438-451 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11646 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Submodular Function
Knapsack
Monotone Function
Approximation algorithms
Streaming

Non-zero-sum stackelberg budget allocation game for computational advertising

Hatano, D., Kuroki, Y., Kawase, Y., Sumita, H., Kakimura, N. & Kawarabayashi, K. I., 2019 Jan 1, PRICAI 2019: Trends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Proceedings. Nayak, A. C. & Sharma, A. (eds.). Springer Verlag, p. 568-582 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11670 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Marketing
Customers
Game
Stackelberg Game
Stackelberg Equilibrium

Shortest reconfiguration of perfect matchings via alternating cycles

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2019 Sep, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computational complexity
Polynomials

Spectral aspects of symmetric matrix signings

Carlson, C., Chandrasekaran, K., Chang, H. C., Kakimura, N. & Kolla, A., 2019 Aug 1, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 81. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Social sciences
Graph theory
Control theory
2018
1 Citation (Scopus)

Boosting PageRank Scores by Optimizing Internal Link Structure

Ohsaka, N., Sonobe, T., Kakimura, N., Fukunaga, T., Fujita, S. & Kawarabayashi, K. I., 2018 Jan 1, Database and Expert Systems Applications - 29th International Conference, DEXA 2018, Proceedings. Ma, H., Wagner, R. R., Hartmann, S., Pernul, G. & Hameurlain, A. (eds.). Springer Verlag, p. 424-439 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11029 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

PageRank
Boosting
Internal
Target
Hardness

Causal bandits with propagating inference

Yabe, A., Hatano, D., Sumita, H., Ito, S., Kakimura, N., Fukunaga, T. & Kawarabayashi, K. I., 2018 Jan 1, 35th International Conference on Machine Learning, ICML 2018. Dy, J. & Krause, A. (eds.). International Machine Learning Society (IMLS), Vol. 12. p. 8761-8781 21 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Experiments
Polynomials

Efficient allocation mechanism with endowments and distributional constraints

Suzuki, T., Tamura, A. & Yokoo, M., 2018 Jan 1, 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), Vol. 1. p. 50-67 18 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seats
1 Citation (Scopus)

Finding a dense subgraph with sparse cut

Miyauchi, A. & Kakimura, N., 2018 Oct 17, CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Paton, N., Candan, S., Wang, H., Allan, J., Agrawal, R., Labrinidis, A., Cuzzocrea, A., Zaki, M., Srivastava, D., Broder, A. & Schuster, A. (eds.). Association for Computing Machinery, p. 547-556 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Graph
Experiment
Graph mining
World Wide Web
Polynomials

The B-branching problem in digraphs

Kakimura, N., Kamiyama, N. & Takazawa, K., 2018 Aug 1, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 117. 12

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polynomials
Decomposition

Tight approximability of the server allocation problem for real-time applications

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. & Shiitada, T., 2018 Jan 1, Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. Springer Verlag, p. 41-55 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10739 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximability
Servers
Server
Real-time
Approximation algorithms
2017

An improved approximation algorithm for the subpath planning problem and its generalization

Sumita, H., Yonebayashi, Y., Kakimura, N. & Kawarabayashi, K. I., 2017, 26th International Joint Conference on Artificial Intelligence, IJCAI 2017. International Joint Conferences on Artificial Intelligence, p. 4412-4418 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
Planning
Traveling salesman problem
Artificial intelligence
Robotics
1 Citation (Scopus)

Complexity of the multi-service center problem

Ito, T., Kakimura, N. & Kobayashi, Y., 2017 Dec 1, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 92.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polynomials
Trees (mathematics)
Stars
Costs
Computational complexity
3 Citations (Scopus)

Reconfiguration of maximum-weight b-matchings in a graph

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2017, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Springer Verlag, Vol. 10392 LNCS. p. 287-296 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Reconfiguration
Polynomials
Graph in graph theory
Bipartite Graph
Integer
4 Citations (Scopus)

Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

Huang, C. C., Kakimura, N. & Yoshida, Y., 2017 Aug 1, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 81. 11

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
Data storage equipment
2016

A note on Lanczos algorithm for computing pagerank

Teramoto, K. & Nodera, T., 2016, Springer Proceedings in Mathematics and Statistics. Springer New York LLC, Vol. 124. p. 25-33 9 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lanczos Algorithm
PageRank
Computing
Arnoldi Method
Nonsymmetric Matrix
1 Citation (Scopus)

Scaling and proximity properties of integrally convex functions

Moriguchi, S., Murota, K., Tamura, A. & Tardella, F., 2016 Dec 1, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 64. p. 57.1-57.13

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Thermodynamically consistent modeling for dissolution/growth of bubbles in an incompressible solvent

Bothe, D. & Soga, K., 2016, Recent Developments of Mathematical Fluid Mechanics. Springer Verlag, Vol. none. p. 111-134 24 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dissolution
Liquids
Pressure control
Bubbles (in fluids)
Equations of state
2015
3 Citations (Scopus)

Designing matching mechanisms under general distributional constraints (extended abstract)

Goto, M., Kojima, F., Kurata, R., Tamura, A. & Yokoo, M., 2015 Jun 15, EC 2015 - Proceedings of the 2015 ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 259-260 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Strategy-proofness
Market design
Two-sided matching
Matching with contracts
2014
1 Citation (Scopus)

Software packages for holonomic gradient method

Koyama, T., Nakayama, H., Ohara, K., Sei, T. & Takayama, N., 2014, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 8592 LNCS. p. 706-712 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8592 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gradient methods
Gradient Method
Software Package
Software packages
Normalizing Constant

The geometry on Hyper-Kähler manifolds of type A<inf>∞</inf>

Hattori, K., 2014, Springer Proceedings in Mathematics and Statistics. Springer New York LLC, Vol. 106. p. 309-317 9 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Flat Manifold
Symplectic Structure
Asymptotic Behavior
Review
2013
2 Citations (Scopus)

On the spectral gap of the kac walk and other binary collision processes on d-dimensional lattice

Sasada, M., 2013, Springer Proceedings in Mathematics and Statistics. Springer New York LLC, Vol. 40. p. 543-560 18 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Spectral Gap
Walk
Collision
Binary
Complete Graph
2011

Algebraic independence properties related to certain infinite products

Tanaka, T., 2011, AIP Conference Proceedings. Vol. 1385. p. 116-123 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

products
expansion

Exceptional algebraic relations for reciprocal sums of Fibonacci and Lucas numbers

Elsner, C., Shimomura, S. & Shiokawa, I., 2011, AIP Conference Proceedings. Vol. 1385. p. 17-31 15 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fibonacci numbers
2008

Parallel implementation of AISM preconditioner for shifted linear systems of equations

Moriya, K. & Nodera, T., 2008, Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008. p. 382-387 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Linear systems
Costs

Reciprocal sums of Fibonacci numbers

Eisner, C., Shimomura, S. & Shiokawa, I., 2008, AIP Conference Proceedings. Vol. 976. p. 77-89 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fibonacci numbers

Remarkable algebraic independence property of certain series related to continued fractions

Tanaka, T., 2008, AIP Conference Proceedings. Vol. 976. p. 190-204 15 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

theorems
Fibonacci numbers
2 Citations (Scopus)

The number of flips required to obtain non-crossing convex cycles

Oda, Y. & Watanabe, M., 2008, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4535 LNCS. p. 155-165 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4535 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hamiltonians
Hamiltonian circuit
Flip
Cycle
Hamiltonicity
2004
1 Citation (Scopus)

New adaptive GMRES(m) method with choosing suitable restart cycle m

Moriya, K. & Nodera, T., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 3019. p. 1105-1113 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

GMRES
Restart
Cycle
GMRES Method
Distribution of Zeros
2002

Effectiveness of approximate inverse preconditioning by using the MR algorithm on an origin 2400

Tanaka, T. & Nodera, T., 2002, Proceedings of the Third International Conference on Engineering Computational Technology. Topping, B. H. V., Bittnar, Z., Topping, B. H. V. & Bittnar, Z. (eds.). p. 115-116 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Boundary value problems
Partial differential equations
Data storage equipment
Experiments
Convection
1999
1 Citation (Scopus)

Parallelization of ILU decomposition for elliptic boundary value problem of the PDE on AP3000

Moriya, K. & Nodera, T., 1999, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 1615. p. 344-353 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1615).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

LU decomposition
Elliptic Boundary Value Problems
Parallelization
Preconditioner
Boundary value problems
1998
3 Citations (Scopus)

The parallelization of the incomplete LU factorization on AP1000

Nodera, T. & Tsuno, N., 1998, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1470 LNCS. p. 788-792 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1470 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Incomplete LU Factorization
Factorization
Parallelization
Preconditioner
Parallel Machines