Search
Add filters:
Use filters to refine the search results.
Results 1-4 of 4 (Search time: 0.005 seconds).
- previous
- 1
- next
Item hits:
| Bibliography | Contents |
|---|---|
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2008) Lecture Notes in Computer Science: 64-76 |  |
| The Online Graph Exploration Problem on Restricted Graphs MIYAZAKI, Shuichi; MORIMOTO, Naoyuki; OKABE, Yasuo (2009-09-01) IEICE Transactions on Information and Systems, E92-D(9): 1620-1627 | |
| An improved approximation lower bound for finding almost stable maximum matchings Hamada, Koki; Iwama, Kazuo; Miyazaki, Shuichi (2009-08-31) Information Processing Letters, 109(18): 1036-1040 | |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem Miyazaki, Shuichi; Okamoto, Kazuya (2009-07-17) Algorithms, 2(3): 953-972 | |
Discover
Subject
Document type