Kobayashi Kouji 小林浩二

… Alternative Names

Kobayashi Koji 小林浩二

Less

Researcher Number	00547391
Other IDs
Affiliation (Current)	2026: 明治大学, 理工学部, 専任准教授 2026: 国立情報学研究所, 大学共同利用機関等の部局等, 研究員
Affiliation (based on the past Project Information) *help	2026: 明治大学, 理工学部, 専任准教授 2022 – 2024: 明治大学, 理工学部, 専任准教授 2019 – 2021: 東京大学, 大学院総合文化研究科, 講師 2017: 国立情報学研究所, 大学共同利用機関等の部局等, 研究員 2017: 国立情報学研究所, 情報学プリンシプル研究系, 研究員 2015 – 2016: 国立情報学研究所, 情報学プリンシプル研究系, 外来研究員 2014: 国立情報学研究所, 情報学プリンシプル研究系, 研究員
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Theory of informatics
Keywords	Principal Investigator アルゴリズム / オンライン問題 / スケジューリング / ルータ / スイッチ / 競合比解析 / インターネット / バッファ管理

先読みを導入したオンライン・バッファ管理問題に対する高性能アルゴリズムの開発Principal Investigator
- Principal Investigator
  
  小林浩二
- Project Period (FY)
  2026 – 2028
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Meiji University
Research on the online scheduling problem with respect for respective tasksPrincipal Investigator
- Principal Investigator
  
  Kobayashi Koji
- Project Period (FY)
  2019 – 2024
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Meiji University
  The University of Tokyo
Research on the online buffer management problems using competitive analysisPrincipal Investigator
- Principal Investigator
  
  Kobayashi Koji
- Project Period (FY)
  2014 – 2017
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Theory of informatics
- Research Institution
  National Institute of Informatics

All 2024 2021 2020 2019 2018 2017 2016 2015 Other

All Journal Article Presentation Book

[Book] Encyclopedia of Algorithms 20152015
- Author(s)
  Hiroshi Fujiwara, Koji M. Kobayashi et al.
- Publisher
  Springer
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] An improved upper bound for the online graph exploration problem on unicyclic graphs2024
- Author(s)
  Kobayashi Koji M.、Li Ying
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 48 Issue: 1
- DOI
  10.1007/s10878-024-01192-0
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11819
[Journal Article] Online Interval Scheduling to Maximize Total Satisfaction, Theoretical Computer Science2020
- Author(s)
  Koji M. Kobayashi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 806 Pages: 673-688
- DOI
  10.1016/j.tcs.2019.10.046
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11819
[Journal Article] An Optimal Algorithm for 2-bounded Delay Buffer Management with Lookahead2019
- Author(s)
  Koji M. Kobayashi
- Journal Title
  
  Lecture Notes in Computer Science (Proceedings of the 25th Annual International Computing and Combinatorics Conference)
  
  Volume: 11653 Pages: 350-362
- DOI
  10.1007/978-3-030-26176-4_29
- ISBN
  9783030261757, 9783030261764
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11819
[Journal Article] Online Interval Scheduling to Maximize Total Satisfaction2018
- Author(s)
  Koji M. Kobayashi
- Journal Title
  
  Proc. of the 24th Annual International Computing and Combinatorics Conference (COCOON 2018)
  
  Volume: 印刷中
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Improved Lower Bounds for Online Scheduling to Minimize Total Stretch2018
- Author(s)
  Koji M. Kobayashi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 705 Pages: 84-98
- DOI
  10.1016/j.tcs.2017.09.032
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Better Bounds for Online k-Frame Throughput Maximization in Network Switches2017
- Author(s)
  Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 657 Pages: 173-190
- DOI
  10.1016/j.tcs.2016.10.009
- NAID
  120006338061
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Online Unit Clustering with Capacity Constraints2017
- Author(s)
  Tetsuya Araki, Koji M. Kobayashi
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E100.A Issue: 1 Pages: 301-303
- DOI
  10.1587/transfun.E100.A.301
- NAID
  130005180849
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Improved Bounds for Online Dominating Sets of Trees2017
- Author(s)
  Koji M. Kobayashi
- Journal Title
  
  Proc. of the 28th International Symposium on Algorithms and Computation (ISAAC 2017)
  
  Volume: -
- DOI
  10.4230/LIPIcs.ISAAC.2017.52
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring2016
- Author(s)
  Tetsuya Araki, Koji M. Kobayashi
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E99.A Issue: 10 Pages: 1885-1887
- DOI
  10.1587/transfun.E99.A.1885
- NAID
  130005598085
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] An Improved Lower Bound for One-Dimensional Online Unit Clustering2015
- Author(s)
  Jun Kawahara, Koji M. Kobayashi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: Vol. 600 Pages: 171-173
- DOI
  10.1016/j.tcs.2015.06.055
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Tight Analysis of Priority Queuing Policy for Egress Traffic2015
- Author(s)
  Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda
- Journal Title
  
  Computer Networks
  
  Volume: Vol. 91 Pages: 614-624
- DOI
  10.1016/j.comnet.2015.09.001
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Journal Article] Optimal Buffer Management for 2-Frame Throughput Maximization2015
- Author(s)
  Jun Kawahara, Koji M. Kobayashi
- Journal Title
  
  Computer Networks
  
  Volume: Vol. 91 Pages: 804-820
- DOI
  10.1016/j.comnet.2015.08.046
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730008
[Presentation] 格子グラフにおける葉最多全域木2021
- Author(s)
  後藤雅久　小林浩二
- Organizer
  冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-19K11819
[Presentation] An Optimal Algorithm for 2-bounded Delay Buffer Management with Lookahead2019
- Author(s)
  Koji M. Kobayashi
- Organizer
  The 25th Annual International Computing and Combinatorics Conference
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K11819
[Presentation] Online Interval Scheduling to Maximize Total Satisfaction2018
- Author(s)
  Koji M. Kobayashi
- Organizer
  The 24th Annual International Computing and Combinatorics Conference (COCOON 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26730008
[Presentation] Improved Bounds for Online Dominating Sets of Trees2017
- Author(s)
  Koji M. Kobayashi
- Organizer
  The 28th International Symposium on Algorithms and Computation (ISAAC 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26730008
[Presentation] Tight Analysis of Priority Queuing Policy for Egress Traffic
- Author(s)
  Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda
- Organizer
  the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA2014)
- Place of Presentation
  Maui, Hawaii, USA
- Year and Date
  2014-12-19 – 2014-12-21
- Data Source
  KAKENHI-PROJECT-26730008

1. Miyazaki Shuichi

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results

Kobayashi Kouji 小林 浩二

Kobayashi Koji 小林 浩二

Research Projects

Research Products

Co-Researchers

先読みを導入したオンライン・バッファ管理問題に対する高性能アルゴリズムの開発Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Research on the online scheduling problem with respect for respective tasksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Research on the online buffer management problems using competitive analysisPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Book] Encyclopedia of Algorithms 20152015

Author(s)

Publisher

Data Source

[Journal Article] An improved upper bound for the online graph exploration problem on unicyclic graphs2024

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Online Interval Scheduling to Maximize Total Satisfaction, Theoretical Computer Science2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] An Optimal Algorithm for 2-bounded Delay Buffer Management with Lookahead2019

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] Online Interval Scheduling to Maximize Total Satisfaction2018

Author(s)

Journal Title

Data Source

[Journal Article] Improved Lower Bounds for Online Scheduling to Minimize Total Stretch2018

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Better Bounds for Online k-Frame Throughput Maximization in Network Switches2017

Author(s)

Journal Title

DOI

NAID

Data Source

[Journal Article] Online Unit Clustering with Capacity Constraints2017

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] Improved Bounds for Online Dominating Sets of Trees2017

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring2016

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] An Improved Lower Bound for One-Dimensional Online Unit Clustering2015

Kobayashi Kouji 小林浩二

Kobayashi Koji 小林浩二