default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoji M. Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Koji M. Kobayashi, Ying Li:
An improved upper bound for the online graph exploration problem on unicyclic graphs. J. Comb. Optim. 48(1): 4 (2024)- 2021
- [j13]Koji M. Kobayashi:
An optimal algorithm for 2-bounded delay buffer management with lookahead. Theor. Comput. Sci. 896: 65-78 (2021) - [i8]Masahisa Goto, Koji M. Kobayashi:
Connected domination in grid graphs. CoRR abs/2109.14108 (2021) - 2020
- [j12]Koji M. Kobayashi:
Online interval scheduling to maximize total satisfaction. Theor. Comput. Sci. 806: 673-688 (2020)
2010 – 2019
- 2019
- [c10]Koji M. Kobayashi:
An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead. COCOON 2019: 350-362 - 2018
- [j11]Koji M. Kobayashi:
Improved lower bounds for online scheduling to minimize total stretch. Theor. Comput. Sci. 705: 84-98 (2018) - [c9]Koji M. Kobayashi:
Online Interval Scheduling to Maximize Total Satisfaction. COCOON 2018: 108-119 - [i7]Koji M. Kobayashi:
Online interval scheduling to maximize total satisfaction. CoRR abs/1805.05436 (2018) - [i6]Koji M. Kobayashi:
An optimal algorithm for 2-bounded delay buffer management with lookahead. CoRR abs/1807.00121 (2018) - 2017
- [j10]Tetsuya Araki, Koji M. Kobayashi:
Online Unit Clustering with Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(1): 301-303 (2017) - [j9]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better bounds for online k-frame throughput maximization in network switches. Theor. Comput. Sci. 657: 173-190 (2017) - [j8]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms. Theor. Comput. Sci. 675: 27-42 (2017) - [c8]Koji M. Kobayashi:
Improved Bounds for Online Dominating Sets of Trees. ISAAC 2017: 52:1-52:13 - [i5]Koji M. Kobayashi:
Improved Bounds for Online Dominating Sets of Trees. CoRR abs/1710.11414 (2017) - 2016
- [j7]Tetsuya Araki, Koji M. Kobayashi:
A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(10): 1885-1887 (2016) - [r1]Hiroshi Fujiwara, Koji M. Kobayashi:
Bin Packing with Cardinality Constraints. Encyclopedia of Algorithms 2016: 211-214 - [i4]Tetsuya Araki, Koji M. Kobayashi:
A tight analysis of Kierstead-Trotter algorithm for online unit interval coloring. CoRR abs/1609.09031 (2016) - 2015
- [j6]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight analysis of priority queuing for egress traffic. Comput. Networks 91: 614-624 (2015) - [j5]Jun Kawahara, Koji M. Kobayashi:
Optimal buffer management for 2-frame throughput maximization. Comput. Networks 91: 804-820 (2015) - [j4]Hiroshi Fujiwara, Koji M. Kobayashi:
Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29(1): 67-87 (2015) - [j3]Jun Kawahara, Koji M. Kobayashi:
An improved lower bound for one-dimensional online unit clustering. Theor. Comput. Sci. 600: 171-173 (2015) - [i3]Jun Kawahara, Koji M. Kobayashi:
An improved lower bound for one-dimensional online unit clustering. CoRR abs/1502.02422 (2015) - 2014
- [c7]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight Analysis of Priority Queuing for Egress Traffic. COCOA 2014: 459-473 - 2013
- [c6]Hiroshi Fujiwara, Koji M. Kobayashi:
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints. COCOON 2013: 518-530 - [c5]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. ISAAC 2013: 218-228 - [c4]Jun Kawahara, Koji M. Kobayashi:
Optimal Buffer Management for 2-Frame Throughput Maximization. SIROCCO 2013: 274-285 - [i2]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches. CoRR abs/1309.4919 (2013) - 2012
- [i1]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight Analysis of Priority Queuing Policy for Egress Traffic. CoRR abs/1207.5959 (2012)
2000 – 2009
- 2009
- [c3]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. SPAA 2009: 328-336 - 2008
- [j2]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches. IEICE Trans. Inf. Syst. 91-D(8): 2105-2114 (2008) - [j1]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers. IEICE Trans. Inf. Syst. 91-D(12): 2757-2769 (2008) - 2007
- [c2]Koji M. Kobayashi, Kazuya Okamoto:
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling. ESA 2007: 463-474 - [c1]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A tight bound on online buffer management for two-port shared-memory switches. SPAA 2007: 358-364
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 22:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
