Koji M. Kobayashi

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