Koji M. Kobayashi

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An improved upper bound for the online graph exploration problem on unicyclic graphs Journal of Combinatorial Optimization	2024-10-21	Paper
Online Interval Scheduling to Maximize Total Satisfaction Lecture Notes in Computer Science	2023-04-26	Paper
An optimal algorithm for 2-bounded delay buffer management with lookahead Theoretical Computer Science	2021-11-18	Paper
Connected domination in grid graphs	2021-09-28	Paper
Improved bounds for online dominating sets of trees (available as arXiv preprint)	2020-11-25	Paper
An optimal algorithm for 2-bounded delay buffer management with lookahead Lecture Notes in Computer Science	2020-02-24	Paper
Online interval scheduling to maximize total satisfaction Theoretical Computer Science	2020-01-16	Paper
Improved lower bounds for online scheduling to minimize total stretch Theoretical Computer Science	2017-11-16	Paper
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms Theoretical Computer Science	2017-05-12	Paper
Better bounds for online \(k\)-frame throughput maximization in network switches Theoretical Computer Science	2016-12-05	Paper
An improved lower bound for one-dimensional online unit clustering Theoretical Computer Science	2015-09-16	Paper
Tight Analysis of Priority Queuing for Egress Traffic Combinatorial Optimization and Applications	2015-09-11	Paper
Improved lower bounds for the online bin packing problem with cardinality constraints Journal of Combinatorial Optimization	2015-07-10	Paper
Better bounds for online \(k\)-frame throughput maximization in network switches Algorithms and Computation	2014-01-14	Paper
Optimal buffer management for 2-frame throughput maximization Structural Information and Communication Complexity	2013-12-17	Paper
Improved lower bounds for the online bin packing problem with cardinality constraints Lecture Notes in Computer Science	2013-06-11	Paper
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling Algorithms – ESA 2007	2008-09-25	Paper

Research outcomes over time

This page was built for person: Koji M. Kobayashi