
	Chemical structure search How to Search	Import MOLfile format is only available (V3000 format is not available) Exact match Substructure search Superstructure search Substructure or superstructure search Similarity search

Co-authoring Researcher

Co-inventing Researcher

Researcher similar to the Researcher

Article similar to the Researcher

Patent similar to the Researcher

Research Project similar to the Researcher

Article(J-GLOBAL estimation)

Patent(J-GLOBAL estimation)

Rchr

J-GLOBAL ID：201101068339688427 Update date: Sep. 02, 2024

Kobayashi Koji M

Research field (2)： Information theory , Information theory

Research theme for competitive and other funds (2)：

2019 - 2023 Research on the online scheduling problem with respect for respective tasks
2014 - 2018 Research on the online buffer management problems using competitive analysis

Papers (30)：

Koji M. Kobayashi, Ying Li. An improved upper bound for the online graph exploration problem on unicyclic graphs. Journal of Combinatorial Optimization. 2024. 48. 1. 67-87
Koji M. Kobayashi. An optimal algorithm for 2-bounded delay buffer management with lookahead. Theoretical Computer Science. 2021. 896. 65-78
Koji M. Kobayashi. Online interval scheduling to maximize total satisfaction. Theoretical Computer Science. 2020. 806. 673-688
Koji M. Kobayashi. An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead. Lecture Notes in Computer Science (Proc. of the 25th Annual International Computing and Combinatorics Conference (COCOON2019)). 2019. 11653. 350-362
Koji M. Kobayashi. Online Interval Scheduling to Maximize Total Satisfaction. Lecture Notes in Computer Science (Proc. of the 24th Annual International Computing and Combinatorics Conference (COCOON2018)). 2018. 10976. 108-119

MISC (5)：

KOBAYASHI Koji M., KAWAHARA Jun, MIYAZAKI Shuichi. Improved bounds for online k-frame throughput maximization in network switches. IEICE technical report. Theoretical foundations of Computing. 2014. 114. 19. 37-44
KOBAYASHI Koji, KAWAHARA Jun. An Optimal Bound for the 2-Frame Throughput Maximization Problem. IEICE technical report. 2011. 111. 20. 69-76
KOBAYASHI Koji, MIYAZAKI Shuichi, OKABE Yasuo. Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks. IEICE technical report. 2008. 108. 206. 71-78
小林浩二, 宮崎修一, 岡部寿男. マルチキュースイッチにおけるオンラインバッファ管理アルゴリズムの競合比の改良(計算理論とアルゴリズムの新展開). 数理解析研究所講究録. 2006. 1489. 91-97
KOBAYASHI Koji, MIYAZAKI Shuichi, OKABE Yasuo. Improving Competitive Ratios of Online Buffer Management for Shared-Memory Switches. IEICE technical report. Theoretical foundations of Computing. 2005. 105. 144. 17-22

Education (3)：

2006 - 2009 京都大学大学院情報学研究科知能情報学専攻博士後期課程
2004 - 2006 京都大学大学院情報学研究科知能情報学専攻博士前期課程
2000 - 2004 Kyoto University Faculty of Engineering School of Informatics & Mathematical Science

Professional career (1)：

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.


	Free word	※Add the following synonyms, you can increase the number of hits.




		～