Koji M. Kobayashi

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 21

Top Topics

Buffer Management

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Publications

Koji M. Kobayashi, Ying Li
An improved upper bound for the online graph exploration problem on unicyclic graphs. J. Comb. Optim. 48 (1) (2024)
Masahisa Goto, Koji M. Kobayashi
Connected domination in grid graphs. CoRR (2021)
Koji M. Kobayashi
An optimal algorithm for 2-bounded delay buffer management with lookahead. Theor. Comput. Sci. 896 (2021)
Koji M. Kobayashi
Online interval scheduling to maximize total satisfaction. Theor. Comput. Sci. 806 (2020)
Koji M. Kobayashi
An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead. COCOON (2019)
Koji M. Kobayashi
Online interval scheduling to maximize total satisfaction. CoRR (2018)
Koji M. Kobayashi
Online Interval Scheduling to Maximize Total Satisfaction. COCOON (2018)
Koji M. Kobayashi
Improved lower bounds for online scheduling to minimize total stretch. Theor. Comput. Sci. 705 (2018)
Koji M. Kobayashi
An optimal algorithm for 2-bounded delay buffer management with lookahead. CoRR (2018)
Koji M. Kobayashi
Improved Bounds for Online Dominating Sets of Trees. ISAAC (2017)
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
Better bounds for online k-frame throughput maximization in network switches. Theor. Comput. Sci. 657 (2017)
Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms. Theor. Comput. Sci. 675 (2017)
Tetsuya Araki, Koji M. Kobayashi
Online Unit Clustering with Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2017)
Koji M. Kobayashi
Improved Bounds for Online Dominating Sets of Trees. CoRR (2017)
Tetsuya Araki, Koji M. Kobayashi
A tight analysis of Kierstead-Trotter algorithm for online unit interval coloring. CoRR (2016)
Tetsuya Araki, Koji M. Kobayashi
A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2016)
Hiroshi Fujiwara, Koji M. Kobayashi
Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29 (1) (2015)
Jun Kawahara, Koji M. Kobayashi
Optimal buffer management for 2-frame throughput maximization. Comput. Networks 91 (2015)
Jun Kawahara, Koji M. Kobayashi
An improved lower bound for one-dimensional online unit clustering. Theor. Comput. Sci. 600 (2015)
Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda
Tight analysis of priority queuing for egress traffic. Comput. Networks 91 (2015)
Jun Kawahara, Koji M. Kobayashi
An improved lower bound for one-dimensional online unit clustering. CoRR (2015)
Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda
Tight Analysis of Priority Queuing for Egress Traffic. COCOA (2014)
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. ISAAC (2013)
Hiroshi Fujiwara, Koji M. Kobayashi
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints. COCOON (2013)
Jun Kawahara, Koji M. Kobayashi
Optimal Buffer Management for 2-Frame Throughput Maximization. SIROCCO (2013)
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches. CoRR (2013)
Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda
Tight Analysis of Priority Queuing Policy for Egress Traffic CoRR (2012)
Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. SPAA (2009)
Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches. IEICE Trans. Inf. Syst. (8) (2008)
Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe
A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers. IEICE Trans. Inf. Syst. (12) (2008)
Koji M. Kobayashi, Kazuya Okamoto
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling. ESA (2007)
Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe
A tight bound on online buffer management for two-port shared-memory switches. SPAA (2007)