The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search
Search the dblp DataBase
Title:
Author:
Kohei Okada
: [
Publications
] [
Author Rank by year
] [
Co-authors
] [
Prefers
] [
Cites
] [
Cited by
]
Publications of Author
Hiroshi Nagamochi
,
Kohei Okada
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
[
Citation Graph
(0, 0)][
DBLP
]
ISAAC, 2003, pp:138-147 [
Conf
]
Hiroshi Nagamochi
,
Kohei Okada
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
[
Citation Graph
(0, 0)][
DBLP
]
Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:103-114 [
Journal
]
Hiroshi Nagamochi
,
Kohei Okada
Approximating the minmax rooted-tree cover in a tree.
[
Citation Graph
(0, 0)][
DBLP
]
Inf. Process. Lett., 2007, v:104, n:5, pp:173-178 [
Journal
]
New Optical VPN Configuration using Wavelength Routers in a WDM-Passive Optical Network.
[
Citation Graph
(, )][
DBLP
]
Search in 0.001secs,
Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search
System created by
asidirop@csd.auth.gr
[
http://users.auth.gr/~asidirop/
] © 2002
for
Data Engineering Laboratory
, Department of Informatics, Aristotle University © 2002