matsubayashi akira 松林昭

… Alternative Names

松林昭マツバヤシアキラ

MATSUBAYASHI Akira 松林昭

Less

Researcher Number	10282378
Other IDs
External Links
Affiliation (Current)	2025: 金沢大学, 電子情報通信学系, 准教授
Affiliation (based on the past Project Information) *help	2023: 金沢大学, 電子情報通信学系, 准教授 2018 – 2019: 金沢大学, 電子情報通信学系, 准教授 2014 – 2017: 金沢大学, 電子情報学系, 准教授
Review Section/Research Field	Principal Investigator Theory of informatics / Basic Section 60010:Theory of informatics-related
Keywords	Principal Investigator アルゴリズム / 仕事関数 / ページ移動問題 / オンラインアルゴリズム / ネットワーク / 誘導部分グラフ / ナッシュフロー / Braessパラドックス / オンラインシュタイナー木問題 / ファイル配置問題 / k-外平面グラフ / 競合比

Research Projects
(3 results)
Research Products
(12 results)

経路で誘導される有向グラフのクラス判定アルゴリズムPrincipal Investigator
- Principal Investigator
  
  松林昭
- Project Period (FY)
  2023 – 2026
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Kanazawa University
Design of Optimal Online Algorithms by Analytical Estimation of Work FunctionsPrincipal Investigator
- Principal Investigator
  
  Matsubayashi Akira
- Project Period (FY)
  2017 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Kanazawa University
Settling Page Migration Conjecture by Analytical Estimation of Work FunctionsPrincipal Investigator
- Principal Investigator
  
  MATSUBAYASHI Akira
- Project Period (FY)
  2014 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Kanazawa University

All 2023 2020 2018 2016 2015 Other

All Journal Article Presentation

[Journal Article] A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox2023
- Author(s)
  Akira Matsubayashi and Yushi Saito
- Journal Title
  
  23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), Open Access Series in Informatics (OASIcs)
  
  Volume: 115
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-23K10984
[Journal Article] Better Embedding of k-Outerplanar Graphs into Random Trees2020
- Author(s)
  Akira Matsubayashi
- Journal Title
  
  情報処理学会研究報告
  
  Volume: 2020-AL-177
- Data Source
  KAKENHI-PROJECT-17K00010
[Journal Article] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018
- Author(s)
  Akira Matsubayashi
- Journal Title
  
  情報処理学会研究報告
  
  Volume: 2018-AL-170
- Data Source
  KAKENHI-PROJECT-17K00010
[Journal Article] Uniform Page Migration Problem in Euclidean Space2016
- Author(s)
  Amanj Khorramian and Akira Matsubayashi
- Journal Title
  
  Algorithms
  
  Volume: vol. 9, no. 3 Issue: 3 Pages: 57-57
- DOI
  10.3390/a9030057
- NAID
  120006375098
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-26330008
[Presentation] A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox2023
- Author(s)
  Akira Matsubayashi and Yushi Saito
- Organizer
  23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K10984
[Presentation] Better Embedding of k-Outerplanar Graphs into Random Trees2020
- Author(s)
  Akira Matsubayashi
- Organizer
  情報処理学会第177回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-17K00010
[Presentation] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018
- Author(s)
  松林昭
- Organizer
  情報処理学会第170回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-17K00010
[Presentation] Non-greedy Online Steiner Trees on Outerplanar Graphs2016
- Author(s)
  Akira Matsubayashi
- Organizer
  Proceedings of the 14th Workshop on Approximation and Online Algorithms (WAOA 2016), Lecture Notes in Computer Science, vol. 10138, pp. 129-141, 2017.
- Place of Presentation
  Aarhus (Denmark)
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330008
[Presentation] A 3+Omega(1) Lower Bound for Page Migration2015
- Author(s)
  松林昭
- Organizer
  7th International Workshop on Parallel and Distributed Algorithms and Applications
- Place of Presentation
  札幌市産業振興センター(北海道・札幌市)
- Year and Date
  2015-12-08
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330008
[Presentation] Better Online Steiner Trees on Outerplanar Graphs2015
- Author(s)
  松林昭
- Organizer
  情報処理学会研究報告アルゴリズム研究会
- Place of Presentation
  指宿市民会館(鹿児島県・指宿市)
- Year and Date
  2015-11-20
- Data Source
  KAKENHI-PROJECT-26330008
[Presentation] A 3+Omega(1) Lower Bound for Page Migration
- Author(s)
  松林昭
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  定山渓ビューホテル(北海道・札幌市)
- Year and Date
  2015-06-12 – 2015-06-13
- Data Source
  KAKENHI-PROJECT-26330008
[Presentation] Online Steiner Trees on Outerplanar Graphs
- Author(s)
  松林昭
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  大濱信泉記念館(沖縄県・石垣市)
- Year and Date
  2014-11-20 – 2014-11-21
- Data Source
  KAKENHI-PROJECT-26330008

matsubayashi akira 松林 昭

松林 昭 マツバヤシ アキラ

MATSUBAYASHI Akira 松林 昭

Research Projects

Research Products

経路で誘導される有向グラフのクラス判定アルゴリズムPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Design of Optimal Online Algorithms by Analytical Estimation of Work FunctionsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Settling Page Migration Conjecture by Analytical Estimation of Work FunctionsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox2023

Author(s)

Journal Title

Data Source

[Journal Article] Better Embedding of k-Outerplanar Graphs into Random Trees2020

Author(s)

Journal Title

Data Source

[Journal Article] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018

Author(s)

Journal Title

Data Source

[Journal Article] Uniform Page Migration Problem in Euclidean Space2016

Author(s)

Journal Title

DOI

NAID

Data Source

[Presentation] A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox2023

Author(s)

Organizer

Data Source

[Presentation] Better Embedding of k-Outerplanar Graphs into Random Trees2020

Author(s)

Organizer

Data Source

[Presentation] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018

Author(s)

Organizer

Data Source

[Presentation] Non-greedy Online Steiner Trees on Outerplanar Graphs2016

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] A 3+Omega(1) Lower Bound for Page Migration2015

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] Better Online Steiner Trees on Outerplanar Graphs2015

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] A 3+Omega(1) Lower Bound for Page Migration

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] Online Steiner Trees on Outerplanar Graphs

Author(s)

Organizer

matsubayashi akira 松林昭

松林昭マツバヤシアキラ

MATSUBAYASHI Akira 松林昭