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

Connected domination in grid graphs.

Masahisa Goto, Koji M. Kobayashi

CoRR, 2021

2019

An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead.

Koji M. Kobayashi

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Improved lower bounds for online scheduling to minimize total stretch.

Koji M. Kobayashi

Theor. Comput. Sci., 2018

Online Interval Scheduling to Maximize Total Satisfaction.

Koji M. Kobayashi

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

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

2014

Tight Analysis of Priority Queuing for Egress Traffic.

Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Optimal Buffer Management for 2-Frame Throughput Maximization.

Jun Kawahara, Koji M. Kobayashi

Proceedings of the Structural Information and Communication Complexity, 2013

Better Bounds for Online k-Frame Throughput Maximization in Network Switches.

Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints.

Hiroshi Fujiwara, Koji M. Kobayashi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Tight Analysis of Priority Queuing Policy for Egress Traffic

Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda

CoRR, 2012

2009

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

Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

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

2007

A tight bound on online buffer management for two-port shared-memory switches.

Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

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

Koji M. Kobayashi, Kazuya Okamoto

Proceedings of the Algorithms, 2007