数理科学科

研究成果

年別の研究成果 1979 2012 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025

• 462 Article
• 51 Conference contribution
• 11 Conference article
• 4 Chapter
• 10 その他
  • 4 Comment/debate
  • 4 Editorial
  • 1 Paper
  • 1 Review article

年別の研究成果

年別の研究成果

検索結果

• 2024

  Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays

  Kakimura, N. & Nakayoshi, T., 2024, Computing and Combinatorics - 29th International Conference, COCOON 2023, Proceedings. Wu, W. & Tong, G. (eds.). Springer Science and Business Media Deutschland GmbH, p. 238-249 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14423 LNCS).

  研究成果: Conference contribution

  • Primal-Dual 100%
  • Competitive Ratio 100%
  • on-line algorithm 60%
  • Metric Space 60%
  • Perfect Matchings 20%
  3 被引用数 (Scopus)

• New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem

  Ichikawa, K., Ito, S., Hatano, D., Sumita, H., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2024 3月 25, Technical Tracks 14. Wooldridge, M., Dy, J. & Natarajan, S. (eds.). 11 ed. Association for the Advancement of Artificial Intelligence, p. 12708-12716 9 p. (Proceedings of the AAAI Conference on Artificial Intelligence; vol. 38, no. 11).

  研究成果: Conference contribution

  Open Access

  • Greedy Algorithm 100%
  • Selection Policy 100%
  • Sparsity 100%
  • Gaussian Mixture 100%
  • Class Distribution 100%

• Parameterized Complexity of Submodular Minimization Under Uncertainty

  Kakimura, N. & Schlotter, I., 2024 6月, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 294).

  研究成果: Conference contribution

  • Submodular Minimization 100%
  • Polynomial Time 100%
  • Cut Function 50%
  • Computational Maps 50%
  • Hardness Results 50%

• Reconfiguration of Labeled Matchings in Triangular Grid Graphs

  Kakimura, N. & Mishima, Y., 2024 12月 4, 35th International Symposium on Algorithms and Computation, ISAAC 2024. Mestre, J. & Wirth, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 322).

  研究成果: Conference contribution

  • Edge 100%
  • Sufficient Condition 100%
  • Solvability 100%
  • Triangular Grid Graph 100%
  • Triangular Grid 100%

• Towards Optimal Subsidy Bounds for Envy-Freeable Allocations

  Kawase, Y., Makino, K., Sumita, H., Tamura, A. & Yokoo, M., 2024 3月 25, Technical Tracks 14. Wooldridge, M., Dy, J. & Natarajan, S. (eds.). 9 ed. Association for the Advancement of Artificial Intelligence, p. 9824-9831 8 p. (Proceedings of the AAAI Conference on Artificial Intelligence; vol. 38, no. 9).

  研究成果: Conference contribution

  Open Access

  • Polynomial Time 100%
  • Marginals 100%
  • Fair Division 20%
  • Indivisible Items 20%
  2 被引用数 (Scopus)
• 2023

  Algorithmic Theory of Qubit Routing

  Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2023, Algorithms and Data Structures - 18th International Symposium, WADS 2023, Proceedings. Morin, P. & Suri, S. (eds.). Springer Science and Business Media Deutschland GmbH, p. 533-546 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14079 LNCS).

  研究成果: Conference contribution

  • Qubit 100%
  • Qubit Routing 100%
  • Qubit Gate 50%
  • Topology Graph 33%
  • Nearest Neighbor 25%
  3 被引用数 (Scopus)

• Double Layer Solutions of the Vlasov–Poisson System

  Suzuki, M. & Takayama, M., 2023, Gas Dynamics with Applications in Industry and Life Sciences - On Gas Kinetic/Dynamics and Life Science Seminar. Asadzadeh, M., Beilina, L. & Takata, S. (eds.). Springer, p. 41-52 12 p. (Springer Proceedings in Mathematics and Statistics; vol. 429).

  研究成果: Conference contribution

  • Double Layer 100%
  • Layer Solutions 100%
  • Electrostatic Potential 66%
  • Boundary Value Problem 33%
  • Monotone 33%

• Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

  Ito, T., Kamiyama, N., Maezawa, S. I., Okamoto, Y., Kakimura, N., Kobayashi, Y. & Nozaki, Y., 2023 7月, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 82. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

  研究成果: Conference contribution

  • Graph Associahedra 100%
  • Associahedron 60%
  • Binary Tree 33%
  • Vertex of a Graph 33%
  • Base Polytope 20%
  2 被引用数 (Scopus)

• On Reachable Assignments Under Dichotomous Preferences

  Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Nozaki, Y., Okamoto, Y. & Ozeki, K., 2023, PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. Aydoğan, R., Criado, N., Sanchez-Anguix, V., Lang, J. & Serramia, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 650-658 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13753 LNAI).

  研究成果: Conference contribution

  • Communication Graph 100%
  • PSPACE-complete 50%
  • Target Item 50%

• Rerouting Planar Curves and Disjoint Paths

  Ito, T., Kakimura, N., Maezawa, S. I., Okamoto, Y., Iwamasa, Y., Kobayashi, Y., Nozaki, Y. & Ozeki, K., 2023 7月, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 81. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

  研究成果: Conference contribution

  • Polynomial Time 100%
  • Reconfiguration Path 100%
  • Path Reconfiguration 57%
  • Planar Graph 50%
  • Intersection Number 50%
  2 被引用数 (Scopus)
• 2022

  A Chip-Firing and a Riemann-Roch Theorem on an Ultrametric Space

  Atsuji, A. & Kaneko, H., 2022, Dirichlet Forms and Related Topics - In Honor of Masatoshi Fukushima’s Beiju, IWDFRT 2022. Chen, Z.-Q., Takeda, M. & Uemura, T. (eds.). Springer, p. 23-43 21 p. (Springer Proceedings in Mathematics and Statistics; vol. 394).

  研究成果: Conference contribution

  • Ultrametric Space 100%
  • Chip-firing 100%
  • Spectral Gap 100%
  • Local Finiteness 33%
  • Positive Edges 33%

• Fair and Truthful Mechanism with Limited Subsidy

  Goko, H., Igarashi, A., Kawase, Y., Makino, K., Sumita, H., Tamura, A., Yokoi, Y. & Yokoo, M., 2022, International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 534-542 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; vol. 1).

  研究成果: Conference contribution

  • Subsidies 100%
  • Envy-freeness 100%
  • Truthful Mechanism 100%
  • Indivisible Goods 100%
  • Resource Allocation 100%
  8 被引用数 (Scopus)

• Infinite Particle Systems with Hard-Core and Long-Range Interaction

  Tanemura, H., 2022, Dirichlet Forms and Related Topics - In Honor of Masatoshi Fukushima’s Beiju, IWDFRT 2022. Chen, Z.-Q., Takeda, M. & Uemura, T. (eds.). Springer, p. 511-533 23 p. (Springer Proceedings in Mathematics and Statistics; vol. 394).

  研究成果: Conference contribution

  • Range Interaction 100%
  • Brownian Motion 100%
  • Particle System 100%
  • Infinite Number 100%
  • Type Equation 100%

• Monotone edge ips to an orientation of maximum edge-connectivity a la Nash-Williams

  Ito, T., Iwamasa, Y., Kakimura, N., Kamiyama, N., Kobayashi, Y., Maezawa, S. I., Nozaki, Y., Okamoto, Y. & Ozeki, K., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1342-1355 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

  研究成果: Conference contribution

  • Edge 100%
  • Edge-Connectivity 100%
  • Directed Graphs 100%
  • Connected Graph 33%
  • Nash-Williams Theorem 16%
  2 被引用数 (Scopus)

• Online Task Assignment Problems with Reusable Resources

  Sumita, H., Ito, S., Takemura, K., Hatano, D., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2022 6月 30, AAAI-22 Technical Tracks 5. Association for the Advancement of Artificial Intelligence, p. 5199-5207 9 p. (Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022; vol. 36).

  研究成果: Conference contribution

  Open Access

  • Reusable Resources 100%
  • Online Task Assignment 100%
  • Task Assignment Problem 100%
  • Competitive Ratio 50%
  • Job Recruitment 33%
  9 被引用数 (Scopus)

• Reforming an Envy-Free Matching

  Ito, T., Iwamasa, Y., Kakimura, N., Kamiyama, N., Kobayashi, Y., Nozaki, Y., Okamoto, Y. & Ozeki, K., 2022 6月 30, AAAI-22 Technical Tracks 5. Association for the Advancement of Artificial Intelligence, p. 5084-5091 8 p. (Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022; vol. 36).

  研究成果: Conference contribution

  Open Access

  • Polynomial Time 100%
  • polynomial-time algorithm 100%
  • Envy-free Matchings 100%
  • Inapproximability 11%
  3 被引用数 (Scopus)
• 2021

  Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions

  Takemura, K., Ito, S., Hatano, D., Sumita, H., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2021, 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Association for the Advancement of Artificial Intelligence, p. 9791-9798 8 p. (35th AAAI Conference on Artificial Intelligence, AAAI 2021; vol. 11A).

  研究成果: Conference contribution

  Open Access

  • Feature Vector 100%
  • Payoff Function 100%
  • Lower and upper bounds 100%
  • Combinatorial Semi-Bandits 100%
  • Decision-Making 50%
  2 被引用数 (Scopus)
• 2020

  Market pricing for matroid rank valuations

  Bérczi, K., Kakimura, N. & Kobayashi, Y., 2020 12月, 31st International Symposium on Algorithms and Computation, ISAAC 2020. Cao, Y., Cheng, S.-W. & Li, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 391-3915 3525 p. 39. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 181).

  研究成果: Conference contribution

  • Matroid 100%
  • Market Pricing 100%
  • Polynomial Time 100%
  • Concave Function 100%
  • Tie Breaking 100%

• Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

  Tsourakakis, C. E., Chen, T., Kakimura, N. & Pachocki, J., 2020, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2019, Proceedings. Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M. & Robardet, C. (eds.). Springer, p. 378-394 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11906 LNAI).

  研究成果: Conference contribution

  • Dense Subgraph Discovery 100%
  • Negative Weight 50%
  • Negative Edges 33%
  • Degree Densities 33%
  • Uncertain Graph 33%
  14 被引用数 (Scopus)
• 2019

  Bézier simplex fitting: Describing pareto fronts of simplicial problems with small samples in multi-objective optimization

  Kobayashi, K., Hamada, N., Sannai, A., Tanaka, A., Bannai, K. & Sugiyama, M., 2019, 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019. AAAI press, p. 2304-2313 10 p. (33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019).

  研究成果: Conference contribution

  • Simplex 100%
  • Multiobjective Optimization 100%
  • Pareto Front 100%
  • Simplicial Problem 100%
  • Tasks 20%
  11 被引用数 (Scopus)

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

  Huang, C. C. & Kakimura, N., 2019, 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).

  研究成果: Conference contribution

  • Approximation Algorithms 100%
  • Streaming Algorithms 100%
  • Monotone Submodular Functions 100%
  • Knapsack Constraint 100%
  • Knapsack 100%
  14 被引用数 (Scopus)

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

  Hatano, D., Kuroki, Y., Kawase, Y., Sumita, H., Kakimura, N. & Kawarabayashi, K. I., 2019, 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).

  研究成果: Conference contribution

  • stackelberg game 100%
  • Nonzero-sum 100%
  • Market Leader 100%
  • Computational Advertising 100%
  • Allocation Games 100%
  1 被引用数 (Scopus)

• Shortest reconfiguration of perfect matchings via alternating cycles

  Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2019 9月, 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).

  研究成果: Conference contribution

  • Perfect Matchings 100%
  • Polytope 25%
  • Combinatorial Shortest Path 16%
  • Outerplanar 16%
  • Polynomial Time 12%
  5 被引用数 (Scopus)

• Spectral aspects of symmetric matrix signings

  Carlson, C., Chandrasekaran, K., Chang, H. C., Kakimura, N. & Kolla, A., 2019 8月, 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).

  研究成果: Conference contribution

  • Spectral Aspect 100%
  • Bounded Eigenvalues 25%
  • Support Graphs 25%
  • NP-completeness 25%
  • Perfect 2-matching 25%
• 2018

  Boosting PageRank Scores by Optimizing Internal Link Structure

  Ohsaka, N., Sonobe, T., Kakimura, N., Fukunaga, T., Fujita, S. & Kawarabayashi, K. I., 2018, 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).

  研究成果: Conference contribution

  • Perform Experiment 100%
  • Heuristic-Based Algorithm 100%
  • Missing Edge 25%
  • Target Vertices 25%
  1 被引用数 (Scopus)

• Causal bandits with propagating inference

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

  研究成果: Conference contribution

  • Causal Bandit 100%
  • Causal Graph 100%
  • Side Information 100%
  • Regret Bounds 50%
  • Sequential Experiment 16%
  8 被引用数 (Scopus)

• Efficient allocation mechanism with endowments and distributional constraints

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

  研究成果: Conference contribution

  • Efficient Allocation 100%
  • Endowment 100%
  • Distributional Constraints 100%
  • Allocation Mechanism 100%
  • Convex Set 100%
  12 被引用数 (Scopus)

• Finding a dense subgraph with sparse cut

  Miyauchi, A. & Kakimura, N., 2018 10月 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. (International Conference on Information and Knowledge Management, Proceedings).

  研究成果: Conference contribution

  Open Access

  • Dense Subgraphs 100%
  • Densest Subgraph Problem 100%
  • Sparsest Cut 100%
  • Subgraphs 100%
  • Quality Function 50%
  16 被引用数 (Scopus)

• The B-branching problem in digraphs

  Kakimura, N., Kamiyama, N. & Takazawa, K., 2018 8月 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, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

  研究成果: Conference contribution

  • Branching Problem 100%
  • Terminal Vertex 100%
  • Terminal Vertices 66%
  • Sparsity Matroid 33%
  • Strongly Polynomial Algorithm 33%
  1 被引用数 (Scopus)

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

  Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. & Shiitada, T., 2018, Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. Delis, A., Pallis, G. & Alistarh, D. (eds.). 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).

  研究成果: Conference contribution

  • Real-Time Application 100%
  • Polynomial Time 100%
  • Approximation Algorithms 100%
  • Allocation Problem 100%
  • Server Allocation Problem 100%
  8 被引用数 (Scopus)
• 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. Sierra, C. (ed.). International Joint Conferences on Artificial Intelligence, p. 4412-4418 7 p. (IJCAI International Joint Conference on Artificial Intelligence; vol. 0).

  研究成果: Conference contribution

  Open Access

  • Planning Problem 100%
  • Improved Approximation 100%
  • Subpath 100%
  • Best Approximation 50%
  • Metric Space 25%
  6 被引用数 (Scopus)

• Complexity of the multi-service center problem

  Ito, T., Kakimura, N. & Kobayashi, Y., 2017 12月 1, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

  研究成果: Conference contribution

  • Center Problem 100%
  • Polynomial Time 100%
  • Maximum Cost 50%
  • Graph Weight 50%
  • Weighted Distance 50%
  2 被引用数 (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. Cao, Y. & Chen, J. (eds.). Springer Verlag, 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).

  研究成果: Conference contribution

  • Reconfiguration Problem 100%
  • Maximum Weight Matching 50%
  • Integer Vector 50%
  • Nonnegative Integer 50%
  • Integer Weights 14%
  4 被引用数 (Scopus)

• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

  Huang, C. C., Kakimura, N. & Yoshida, Y., 2017 8月 1, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Rolim, J. D. P., Jansen, K., Williamson, D. P. & Vempala, S. S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 81).

  研究成果: Conference contribution

  • Approximation Algorithms 100%
  • Streaming Algorithms 100%
  • Monotone Submodular Functions 100%
  • Knapsack Constraint 100%
  • Small Fraction 50%
  16 被引用数 (Scopus)
• 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.

  研究成果: Conference contribution

  • Lanczos Algorithm 100%
  • PageRank 100%
  • Tridiagonal Matrix 100%
  • Nonsymmetric Matrix 100%
  • Largest Eigenvalue 33%
  1 被引用数 (Scopus)

• Scaling and proximity properties of integrally convex functions

  Moriguchi, S., Murota, K., Tamura, A. & Tardella, F., 2016 12月 1, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S.-H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 57.1-57.13 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 64).

  研究成果: Conference contribution

  • Integrally Convex Function 100%
  • Exponential Bound 20%
  • Logarithmic Complexity 20%
  • Complexity Results 20%
  2 被引用数 (Scopus)

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

  Bothe, D. & Soga, K., 2016, Recent Developments of Mathematical Fluid Mechanics. Giga, Y., Kozono, H., Yamazaki, M., Okamoto, H. & Amann, H. (eds.). Springer Verlag, p. 111-134 24 p. (Advances in Mathematical Fluid Mechanics - Dedicated to Giovanni Paolo Galdi on the Occasion of His 60th Birthday; vol. none).

  研究成果: Conference contribution

  • Mathematical Model 100%
  • Vapor Phase 100%
  • Liquid Phase 100%
  • Equations of State 100%
  • Dilute Solution 100%
  4 被引用数 (Scopus)
• 2015

  Designing matching mechanisms under general distributional constraints (extended abstract)

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

  研究成果: Conference contribution

  Open Access
  3 被引用数 (Scopus)
• 2014

  Software packages for holonomic gradient method

  Koyama, T., Nakayama, H., Ohara, K., Sei, T. & Takayama, N., 2014, Mathematical Software, ICMS 2014 - 4th International Congress, Proceedings. Springer Verlag, 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).

  研究成果: Conference contribution

  • Gradient Method 100%
  • Computer Software 100%
  • Web Page 100%
  • Source Codes 25%
  • Computational Time 25%
  2 被引用数 (Scopus)

• The geometry on Hyper-Kähler manifolds of type A_∞

  Hattori, K., 2014 1月 1, Real and Complex Submanifolds. Suh, Y. J., Ohnita, Y., Lee, H., Berndt, J. & Kim, B. H. (eds.). Springer New York LLC, p. 309-317 9 p. (Springer Proceedings in Mathematics and Statistics; vol. 106).

  研究成果: Conference contribution

  • Structure Map 100%
  • Period Map 100%
  • Symplectic Structure 100%
  • Symplectic Periods 100%
  • Complex Dimensions 100%
• 2013

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

  Sasada, M., 2013, Symmetries, Integrable Systems and Representations. Springer New York LLC, p. 543-560 18 p. (Springer Proceedings in Mathematics and Statistics; vol. 40).

  研究成果: Conference contribution

  Open Access

  • Binary Collision 100%
  • Collision Processes 100%
  • Kac Walk 100%
  • Simple Average 100%
  • Dimensional Lattice 100%
  4 被引用数 (Scopus)
• 2011

  Algebraic independence properties related to certain infinite products

  Tanaka, T. A., 2011, Diophantine Analysis and Related Fields 2011, DARF - 2011. p. 116-123 8 p. (AIP Conference Proceedings; vol. 1385).

  研究成果: Conference contribution

  • Independence Property 100%
  • Infinite Product 100%
  • Algebraic Independence 100%
  • Logarithmic Derivative 25%
  • Mahler Functions 25%
  3 被引用数 (Scopus)

• Exceptional algebraic relations for reciprocal sums of Fibonacci and Lucas numbers

  Elsner, C., Shimomura, S. & Shiokawa, I., 2011, Diophantine Analysis and Related Fields 2011, DARF - 2011. p. 17-31 15 p. (AIP Conference Proceedings; vol. 1385).

  研究成果: Conference contribution

  • Fibonacci numbers 100%
  • Lucas numbers 100%
  • Reciprocal Sum 100%
  • Algebraic Relations 100%
  • Triplet 33%
  1 被引用数 (Scopus)
• 2008

  Parallel implementation of AISM preconditioner for shifted linear systems of equations

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

  研究成果: Conference contribution

  • Systems of Linear Equation 100%
  • Shifted Linear Systems 100%
  • Numerical Example 50%
  • Approximates 50%
  • Preconditioning Technique 50%

• Reciprocal sums of Fibonacci numbers

  Eisner, C., Shimomura, S. & Shiokawa, I., 2008, Diophantine Analysis and Related Fields, DARF 2007/2008. p. 77-89 13 p. (AIP Conference Proceedings; vol. 976).

  研究成果: Conference contribution

  • Fibonacci numbers 100%
  • Reciprocal Sum 100%
  • Algebraic Relations 50%
  • Algebraic Independence 50%
  • Independence Relations 50%

• Remarkable algebraic independence property of certain series related to continued fractions

  Tanaka, T. A., 2008, Diophantine Analysis and Related Fields, DARF 2007/2008. p. 190-204 15 p. (AIP Conference Proceedings; vol. 976).

  研究成果: Conference contribution

  • Independence Property 100%
  • Algebraic Independence 100%
  • Continued Fractions 100%
  • Algebraic numbers 100%
  • Fibonacci numbers 50%

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

  Oda, Y. & Watanabe, M., 2008, Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers. Springer Verlag, 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).

  研究成果: Conference contribution

  • Crossing Edges 100%
  • Convex Cycles 100%
  • Edge 100%
  • Hamiltonian Cycle 100%
  • Convex Position 50%
  6 被引用数 (Scopus)
• 2004

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

  Moriya, K. & Nodera, T., 2004 1月 1, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Wyrzykowski, R., Dongarra, J., Paprzycki, M. & Wasniewski, J. (eds.). Springer Verlag, p. 1105-1113 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3019).

  研究成果: Conference contribution

  • GMRES Algorithm 100%
  • M Method 100%
  • GMRES(m) 100%
  • Residuals 100%
  • Numerical Example 50%
  1 被引用数 (Scopus)
• 2002

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

  Tanaka, T. & Nodera, T., 2002 12月 1, 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. (Proceedings of the Third International Conference on Engineering Computational Technology).

  研究成果: Conference contribution

  • Minimal Residual 100%
  • Residual Algorithms 100%
  • Approximate Inverse 100%
  • Partial Differential Equation 100%
  • Boundary Value 100%
• 1999

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

  Moriya, K. & Nodera, T., 1999, High Performance Computing - 2nd International Symposium, ISHPC 1999, Proceedings. Joe, K., Fukuda, A., Polychronopoulos, C. & Tomita, S. (eds.). Springer Verlag, p. 344-353 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1615).

  研究成果: Conference contribution

  • Partial Differential Equation 100%
  • Boundary Value 100%
  • Parallel Computer 100%
  • Incomplete LU Preconditioner 100%
  • Incomplete LU Decomposition 100%
  1 被引用数 (Scopus)