Koji M. Kobayashi

Available identifiers

Publication	Date of Publication	Type
An improved upper bound for the online graph exploration problem on unicyclic graphs	2024-10-21	Paper
Online Interval Scheduling to Maximize Total Satisfaction	2023-04-26	Paper
An optimal algorithm for 2-bounded delay buffer management with lookahead	2021-11-18	Paper
Connected domination in grid graphs	2021-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5136272	2020-11-25	Paper
An optimal algorithm for 2-bounded delay buffer management with lookahead	2020-02-24	Paper
Online interval scheduling to maximize total satisfaction	2020-01-16	Paper
Improved lower bounds for online scheduling to minimize total stretch	2017-11-16	Paper
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms	2017-05-12	Paper
Better bounds for online \(k\)-frame throughput maximization in network switches	2016-12-05	Paper
An improved lower bound for one-dimensional online unit clustering	2015-09-16	Paper
Tight Analysis of Priority Queuing for Egress Traffic	2015-09-11	Paper
Improved lower bounds for the online bin packing problem with cardinality constraints	2015-07-10	Paper
Better Bounds for Online k-Frame Throughput Maximization in Network Switches	2014-01-14	Paper
Optimal Buffer Management for 2-Frame Throughput Maximization	2013-12-17	Paper
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints	2013-06-11	Paper
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling	2008-09-25	Paper

This page was built for person: Koji M. Kobayashi