Koji M. Kobayashi

According to our database, Koji M. Kobayashi authored at least 19 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

An improved upper bound for the online graph exploration problem on unicyclic graphs.

Koji M. Kobayashi, Ying Li

J. Comb. Optim., August, 2024

2021

An optimal algorithm for 2-bounded delay buffer management with lookahead.

Koji M. Kobayashi

Theor. Comput. Sci., 2021

Connected domination in grid graphs.

Masahisa Goto, Koji M. Kobayashi

CoRR, 2021

2020

Online interval scheduling to maximize total satisfaction.

Koji M. Kobayashi

Theor. Comput. Sci., 2020

2018

Improved lower bounds for online scheduling to minimize total stretch.

Koji M. Kobayashi

Theor. Comput. Sci., 2018

2017

Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms.

Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe

Theor. Comput. Sci., 2017

Better bounds for online k-frame throughput maximization in network switches.

Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki

Theor. Comput. Sci., 2017

Online Unit Clustering with Capacity Constraints.

Tetsuya Araki, Koji M. Kobayashi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Improved Bounds for Online Dominating Sets of Trees.

Koji M. Kobayashi

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Bin Packing with Cardinality Constraints.

Hiroshi Fujiwara, Koji M. Kobayashi

Encyclopedia of Algorithms, 2016

A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring.

Tetsuya Araki, Koji M. Kobayashi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

2015

An improved lower bound for one-dimensional online unit clustering.

Jun Kawahara, Koji M. Kobayashi

Theor. Comput. Sci., 2015

Improved lower bounds for the online bin packing problem with cardinality constraints.

Hiroshi Fujiwara, Koji M. Kobayashi

J. Comb. Optim., 2015

Tight analysis of priority queuing for egress traffic.

Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda

Comput. Networks, 2015

Optimal buffer management for 2-frame throughput maximization.

Jun Kawahara, Koji M. Kobayashi

Comput. Networks, 2015

2012

Tight Analysis of Priority Queuing Policy for Egress Traffic

Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda

CoRR, 2012

2008

A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers.

Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe

IEICE Trans. Inf. Syst., 2008

A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches.

Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe

IEICE Trans. Inf. Syst., 2008

2007

Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling.

Koji M. Kobayashi, Kazuya Okamoto

Proceedings of the Algorithms, 2007